Multidimensional constellations. II. Voronoi constellations

For pt.I see ibid., vol.7, no.6, p.877-92 (1989). Voronoi constellations, also called Voronoi codes are implementable N-dimensional constellations based on partitions of N-dimensional lattices ( Lambda ) that can achieve good shape gains and that are inherently suited for use with coded modulation. Two methods are given for specifying Voronoi constellations on the basis of arbitrary lattice partitions Lambda / Lambda /sub s/, where Lambda /sub s/, the shaping lattice, is an N-dimensional sublattice of Lambda . One of the methods is conjectured to be optimum, and the other has desirable symmetries and naturally supports opportunistic secondary channels. When Lambda and Lambda /sub s/ are 2-D-symmetric, the constituent 2-D constellation is itself a Voronoi constellation. The shaping constellation expansion ratio and peak-to-average-power ratio are determined in general and for various Lambda /sub s/. Methods for labeling Voronoi constellations are given. Their complexity is shown to be dominated by that of decoding Lambda /sub s/. It is also shown that coding and shaping are separable and dual. Bounds on the shape gain of Voronoi constellations are given that depend on the depth and normalized informativity of Lambda /sub s/. These bounds suggest the use of lattices Lambda with depth 2 and normalized informativity less than 1, which can achieve near-optimal shape gains with reduced constellation expansion and implementation complexity. >

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

[2]  N. J. A. Sloane,et al.  Fast quantizing and decoding and algorithms for lattice quantizers and codes , 1982, IEEE Trans. Inf. Theory.

[3]  N. Sloane,et al.  On the Voronoi Regions of Certain Lattices , 1984 .

[4]  N. J. A. Sloane,et al.  Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice , 1986, IEEE Trans. Inf. Theory.

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

[6]  Gordon R. Lang,et al.  A Leech lattice modem , 1989, IEEE J. Sel. Areas Commun..

[7]  Allen Gersho,et al.  Multidimensional Signal Constellations for Voiceband Data Transmission , 1984, IEEE J. Sel. Areas Commun..

[8]  G. David Forney,et al.  Coset codes-I: Introduction and geometrical classification , 1988, IEEE Trans. Inf. Theory.

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

[10]  G. David Forney,et al.  Coset codes-II: Binary lattices and related codes , 1988, IEEE Trans. Inf. Theory.

[11]  Lee-Fang Wei,et al.  Trellis-coded modulation with multidimensional constellations , 1987, IEEE Trans. Inf. Theory.

[12]  A. Robert Calderbank,et al.  Coset codes for partial response channels; or, coset codes with spectral nulls , 1989, IEEE Trans. Inf. Theory.

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

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

[15]  Yair Be'ery,et al.  Fast decoding of the Leech lattice , 1989, IEEE J. Sel. Areas Commun..

[16]  N. J. A. Sloane,et al.  A lower bound on the average error of vector quantizers , 1985, IEEE Trans. Inf. Theory.

[17]  N. J. A. Sloane,et al.  Voronoi regions of lattices, second moments of polytopes, and quantization , 1982, IEEE Trans. Inf. Theory.