Name
Abstract | ||
|---|---|---|
For Pt. I, see ibid., pp. 1799-1808, Nov. 1993. 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 (CERs ) and the peak-to-average-power ratio (PAR). The authors describe some practical means for selecting the boundary so as to achieve a point with low addressing complexity near the knee of the corresponding tradeoff curves (shaping gain versus CERs or PAR). One class of addressing schemes is based on using a lookup table. A method to facilitate the realization of the addressing lookup table is introduced. This method is based on the decomposition of addressing into a hierarchy of addressing steps, each of a low complexity. This avoids exponential growth of the complexity. Using this addressing decomposition and a memory of a practical size, one 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 |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1109/18.265493 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
signal processing,Voronoi constellation,addressing decomposition,addressing steps hierarchy,average energy,constellation-expansion ratio,data transmission,lookup table,low addressing complexity,memory,multidimensional signal constellation,multidimensional signal spaces shaping,peak-to-average-power ratio,shaping gain,tradeoff curves | Information theory,Signal processing,Discrete mathematics,Lookup table,Mathematical optimization,Data transmission,Computer science,Algorithm,Curse of dimensionality,Constellation,Constellation diagram,Voronoi diagram | Journal |
Volume | Issue | ISSN |
39 | 6 | 0018-9448 |
Citations | PageRank | References |
14 | 1.72 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amir K. Khandani | 1 | 1139 | 92.60 |
| P. Kabal | 2 | 374 | 47.49 |