Nonequiprobable signaling on the Gaussian channel

Signaling schemes for the Gaussian channel based on finite-dimensional lattices are considered. The signal constellation consists of all lattice points within a region R, and the shape of this region determines the average signal power. Spherical signal constellations minimize average signal power, and in the limit as N to infinity , the shape gain of the N-sphere over the N-cube approaches pi e/6 approximately=1.53 dB. A nonequiprobable signaling scheme is described that approaches this full asymptotic shape gain in any fixed dimension. A signal constellation, Omega is partitioned into T subconstellations Omega /sub 0/, . . ., Omega /sub tau -1/ of equal size by scaling a basic region R. Signal points in the same subconstellation are used equiprobably, and a shaping code selects the subconstellation Omega /sub i/ with frequency f/sub i/. Shaping codes make it possible to achieve any desired fractional bit rate. The schemes presented are compared with equiprobable signaling schemes based on Voronoi regions of multidimensional lattices. For comparable shape gain and constellation expansion ratio, the peak to average power ratio of the schemes presented is superior. Furthermore, a simple table lookup is all that is required to address points in the constellations. It is also shown that it is possible to integrate coding and nonequiprobable signaling within a common multilevel framework. >

[1]  G. David Forney,et al.  Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellations , 1989, IEEE J. Sel. Areas Commun..

[2]  G. David Forney,et al.  Efficient Modulation for Band-Limited Channels , 1984, IEEE J. Sel. Areas Commun..

[3]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[4]  Allen Gersho,et al.  Asymptotically optimal block quantization , 1979, IEEE Trans. Inf. Theory.

[5]  N. J. A. Sloane,et al.  New trellis codes based on lattices and cosets , 1987, IEEE Trans. Inf. Theory.

[6]  Gregory J. Pottie,et al.  Multilevel codes based on partitioning , 1989, IEEE Trans. Inf. Theory.

[7]  J. Leech Some Sphere Packings in Higher Space , 1964, Canadian Journal of Mathematics.

[8]  Hideki Imai,et al.  A new multilevel coding method using error-correcting codes , 1977, IEEE Trans. Inf. Theory.

[9]  N. J. A. Sloane,et al.  A fast encoding method for lattice codes and quantizers , 1983, IEEE Trans. Inf. Theory.

[10]  Ezio Biglieri,et al.  Multidimensional modulation and coding for band-limited digital channels , 1988, IEEE Trans. Inf. Theory.

[11]  Soheil I. Sayegh,et al.  A Class of Optimum Block Codes in Signal Space , 1986, IEEE Trans. Commun..

[12]  N. Sloane,et al.  Sphere Packings and Error-Correcting Codes , 1971, Canadian Journal of Mathematics.