Constellation design for the noncoherent MIMO Rayleigh-fading channel at general SNR

被引:12
作者
Srinivasan, Shivratna Giri [1 ]
Varanasi, Mahesh K. [1 ]
机构
[1] Univ Colorado, Elect & Comp Engn Dept, Boulder, CO 80309 USA
基金
美国国家科学基金会;
关键词
capacity; constellation design; cutoff rate; difference of convex programming; global optimization; low signal-to-noise ratio (SNR); multiple-antenna systems; noncoherent channels; Rayleigh fading; unitary constellations; wideband channels;
D O I
10.1109/TIT.2007.892783
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Constellation design for the noncoherent multiple-input-multiple-output (MIMO) block Rayleigh-fading channel is considered. For general signal-to-noise ratios (SNRs), starting from a given base unitary constellation of finite cardinality, and using the cutoff rate expression as the design criterion, input probabilities and per-antenna amplitudes for the constellation points are obtained via a difference of convex programming formulation. Using the mutual information as a performance metric, it is shown that the optimized constellations significantly outperform the base unitary designs from which they are obtained in the low-medium SNR regime, and indeed they also similarly outperform the mutual information achieved by isotropically distributed unitary inputs for the continuous input channel [i.e., the so-called unitary space-time capacity (USTC)]. At sufficiently high SNRs, the resulting mutual information coincides with that of the base unitary designs. Thus the optimum constellation design technique works over the entire range of SNRs. The bit energy/spectral efficiency tradeoff of the optimized constellations are also obtained, and these provide valuable insights on modulation and coding, which are especially useful for wideband channels where the SNR per degree of freedom is low.
引用
收藏
页码:1572 / 1584
页数:13
相关论文
共 30 条
[1]   The capacity of discrete-time memoryless Rayleigh-Fading channels [J].
Abou-Faycal, IC ;
Trott, MD ;
Shamai, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) :1290-1301
[2]  
[Anonymous], 1993, MATRIX ANAL
[3]  
ASHIKHMIN A, 2005, P IEEE INT S INF THE
[4]   SEPARABLE CONCAVE MINIMIZATION VIA PARTIAL OUTER APPROXIMATION AND BRANCH AND BOUND [J].
BENSON, HP .
OPERATIONS RESEARCH LETTERS, 1990, 9 (06) :389-394
[5]   On design criteria and construction of noncoherent space-time constellations [J].
Borran, MJ ;
Sabharwal, A ;
Aazhang, B .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) :2332-2351
[6]  
Boyd S., 2004, Convex Optimization, DOI [10.1017/CBO9780511804441, DOI 10.1017/CBO9780511804441]
[7]   Capacity-achieving probability measure for conditionally Gaussian channels with bounded inputs. [J].
Chan, TH ;
Hranilovic, S ;
Kschischang, FR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (06) :2073-2088
[8]  
DAYAL P, 2004, IEEE T INF THEOR SEP, P2058
[9]  
Floudas C.A, 2000, NONCON OPTIM ITS APP
[10]   The noncoherent Rician fading channel -: Part I:: Structure of the capacity-achieving input [J].
Gursoy, MC ;
Poor, HV ;
Verdú, S .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2005, 4 (05) :2193-2206