SHAPING MULTIDIMENSIONAL SIGNAL SPACES .2. SHELL-ADDRESSED CONSTELLATIONS

被引:22
作者
KHANDANI, AK
KABAL, P
机构
[1] UNIV QUEBEC,INRS TELECOMMUN,VERDUN H3E 1H6,PQ,CANADA
[2] MCGILL UNIV,DEPT ELECT ENGN,MONTREAL H3A 2A7,QUEBEC,CANADA
基金
加拿大自然科学与工程研究理事会;
关键词
SHELL ADDRESSING; SHELL INDEX; HALF INTEGER GRID; TRUNCATED CUBE; ADDRESSING LOOKUP TABLE; ADDRESSING DECOMPOSITION; SHELL-ADDRESSED VORONOI CONSTELLATION;
D O I
10.1109/18.265493
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
By appropriately selecting the boundary of a multidimensional signal constellation used for data transmission, the average energy of the constellation can be reduced. Reduction in the average energy (shaping gain) is obtained at the price of increasing the constellation-expansion ratio (CER(s)) and the peak-to-average-power ratio (PAR). In this paper, we describe some practical means to select the boundary so as to achieve a point with low addressing complexity near the knee of the corresponding tradeoff curves (shaping gain versus CER(s) or PAR). One class of addressing schemes is based on using a lookup table. We introduce a method to facilitate the realization of the addressing lookup table. This method is based on the decomposition of the addressing into a hierarchy of addressing steps, each of a low complexity. This avoids the exponential growth of the complexity. Based on this addressing decomposition, by using a memory of a practical size, we can move along a tradeoff curve which has negligible suboptimality. Another class of addressing schemes is based on using a Voronoi constellation in a space of half the original dimensionality. We also introduce hybrid multilevel addressing schemes which combine the two classes. These schemes provide single points with moderate addressing complexity near the knee of the optimum tradeoff curves.
引用
收藏
页码:1809 / 1819
页数:11
相关论文
共 16 条
[1]   NONEQUIPROBABLE SIGNALING ON THE GAUSSIAN-CHANNEL [J].
CALDERBANK, AR ;
OZAROW, LH .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (04) :726-740
[2]  
Conway J.H., 1988, SPHERE PACKINGS LATT
[3]   A FAST ENCODING METHOD FOR LATTICE CODES AND QUANTIZERS [J].
CONWAY, JH ;
SLOANE, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (06) :820-824
[4]  
Forney G. D. Jr., 1984, IEEE Journal on Selected Areas in Communications, VSAC-2, P632, DOI 10.1109/JSAC.1984.1146101
[5]   COSET CODES .1. INTRODUCTION AND GEOMETRICAL CLASSIFICATION [J].
FORNEY, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) :1123-1151
[7]   COSET CODES .2. BINARY LATTICES AND RELATED CODES [J].
FORNEY, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) :1152-1187
[8]   MULTIDIMENSIONAL CONSTELLATIONS .1. INTRODUCTION, FIGURES OF MERIT, AND GENERALIZED CROSS CONSTELLATIONS [J].
FORNEY, GD ;
WEI, LF .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1989, 7 (06) :877-892
[9]   TRELLIS SHAPING [J].
FORNEY, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (02) :281-300
[10]   SHAPING MULTIDIMENSIONAL SIGNAL SPACES .1. OPTIMUM SHAPING, SHELL MAPPING [J].
KHANDANI, AK ;
KABAL, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (06) :1799-1808