Skip to main content
Log in

Performance of lattice codes over the Gaussian channel

Performances des codes en treillis sur le canal gaussien

  • Published:
Annales Des Télécommunications Aims and scope Submit manuscript

Abstract

We derive an upper bound on the error probability of lattice codes combined with Quadrature Amplitude Modulation (qam) over the additive white Gaussian noise channel. This bound depends on a lattice figure of merit and is readily put in exponential form by using Chernoff bound. An interesting lower bound is derived by a similar reasoning. We also examine the estimation of the average information rate based upon the continuous approximation of the average power normalized to two dimensions, and suggest to improve it by using the sphere packing idea. Examples of performance evaluation are given for a few lattices. Finally, we present upper and lower bounds on the best fundamental coding gains per dimension (due to both density and thickness) for an arbitrarily large number of dimensions. It is shown in the Appendix that, as the Ungerboeck codes, the lattice codes do not shape the signal power spectrum.

Résumé

On établit une borne supérieure de la probabilité ďerreur ďun code défini par un treillis de points combiné à la modulation ďamplitude en quadrature, sur le canal à bruit additif gaussien et blanc. Cette borne dépend ďun facteur de mérite du treillis et peut être facilement mise sous la forme exponentielle de Chernoff. Une intéressante borne inférieure est obtenue par un raisonnement similaire. On examine aussi ľestimation du débit ďinformation basée sur ľapproximation continue de la puissance moyenne normalisée è deux dimensions. On suggère de ľaméliorer en utilisant ľidée ďempilement de sphères. Des exemples ďévaluation des performances sont donnés pour quelques treillis. On présente finalement des bornes inférieure et supérieure des meilleurs gains de codage fondamentaux par dimension (déduits de la densité et de ľépaisseur) pour un nombre de dimensions arbitraitement grand. On montre dans ľannexe que les codes en treillis, comme ceux ďUngerboeck, n’ont pas ďeffet sur la forme du spectre de puissance des signaux.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Leech (J.). Notes on sphere packing.Canad. J. Math. (1967),19, pp. 251–267.

    MATH  MathSciNet  Google Scholar 

  2. Leech (J.), Sloane (N. J. A.). Sphere packing and error-correcting codes.Canad. J. Math. (1971),22, n° 4, pp. 718–745.

    MathSciNet  Google Scholar 

  3. Blake (I. R). The Leech lattice as a code for the Gaussian channel.Info. Cont. (1971),19, pp. 66–74.

    Article  MATH  MathSciNet  Google Scholar 

  4. Sloane (N. J. A.). A note on the Leech lattice as a code for the Gaussian channel.Info. Contr. (1980),46, pp. 270–272.

    Article  MATH  MathSciNet  Google Scholar 

  5. Sloane (N. J. A.). Tables of sphere packings and spherical codes.IEEE Trans. IT (May 1981),27, pp. 327–338.

    Article  MATH  MathSciNet  Google Scholar 

  6. Calderbank (A. R.), Sloane (N. J. A.). New trellis codes based on lattice and cosets.IEEE Trans. IT (March 1987),33, pp. 177–195.

    Article  MATH  MathSciNet  Google Scholar 

  7. Forney (G. D.Jr.). Coset codes — part I: Introduction and geometrical classification.IEEE Trans. IT (sep. 1988),34, pp. 1123–1151.

    Article  MathSciNet  Google Scholar 

  8. De Buda (R.). Some optimal codes have structure.IEEE J. SAC (Aug. 1989),7, n° 6, pp. 893–899.

    Google Scholar 

  9. Magalhães de Oliveira (H.), Battail (G.). A capacity theorem for lattice codes on Gaussian channels.Proc. IEEE/SBT Int. Symp. Telecomm. (Sep. 1990), Rio de Janeiro, Brazil, pp. 1.2.1–1.2.5

    Google Scholar 

  10. Biglieri (E.). Ungerboeck codes do not shape the signal power spectrum.IEEE Trans. IT (July 1986),32, pp. 595–596.

    Article  Google Scholar 

  11. Magalhães de Oliveira (H.), Battail (G.). On generalized cross constellations and the opportunistic secondary channel.Ann. Télécommunic. (May–June 1992),47, n° 5-6, pp. 202–213.

    MATH  Google Scholar 

  12. Abramowitz (M.),Stegun (I.). Eds., Handbook of mathematical functions. Washington, DC :NBS (1970).

  13. Forney (G. D.Jr.),Wei (L.-F.). Multidimensional constellations. Part I: Introduction, figures of merit, and generalized cross constellations.J. Select. Areas Commun. (Aug. 1989),7, pp. 877–892.

    Article  Google Scholar 

  14. Blahut (R. E.). Principles and practice of information theory. Reading, Massachusetts, Addison-Wesley (1987).

  15. Conway (J. H.), Sloane (N. J. A.). Voronoi regions of lattices, second moments of polytopes and quantization.IEEE Trans. IT (mars 1982),28, pp. 211–226.

    Article  MATH  MathSciNet  Google Scholar 

  16. Shannon (C. E.). Communication in the presence of noise,in: Key papers in the development of info. Theory, D. Slepian (Ed.), reprinted fromProc. IRE (Jan. 1949),37, pp. 10–21.

    Article  MathSciNet  Google Scholar 

  17. Proakis (J. G.). Digital communications.McGraw-Hill (1989), 2nd ed, New York.

    Google Scholar 

  18. Conway (J. H.), Sloane (N. J. A.). Sphere packings, lattices and groups. Springer-Verlag (1988), New York.

    MATH  Google Scholar 

  19. Lang (G. R.), Longstaff (F. M.). A Leech lattice modem.IEEE J. SAC (Aug. 1988),7, pp. 968–973.

    Google Scholar 

  20. Wei (L.-F.). Trellis-coded modulation with multidimensional constellations.IEEE Trans. IT (July 1987),33, n° 4, pp. 483–501.

    Article  Google Scholar 

  21. Tanaka (Y.), Unagami (S.), Kinoshita (T), Kaku (T), Arai (Y.). A 19.2 kb/s high-speed voiceband data modem based on eight-dimensional trellis coding.Globecom ’87 (nov. 1987),2, Tokyo, Japan, pp. 36.1.1–36.1.5.

    Google Scholar 

  22. Baudoin (G.),Mitrani (M. S.). Modem à 19.200 bit/s sur circuit téléphonique.Commutation Transmission (1989), n° 2, pp. 73–84.

  23. Forney (G. D.Jr.),Gallager (R. G.), Lang (G. R.), Longstaff (F. M.), Qureshi (S. U.). Efficient modulation for band-limited channels.IEEE J. SAC (1984),2, pp. 632–647.

    Google Scholar 

  24. Sloane (N. J. A.). The packing of spheres.Scientific American (Jan. 1984),28, pp. 92–101.

    Google Scholar 

  25. Magalhães de Oliveira (H.), Battail (G.). Random coded modulation: performance and Euclidean distance spectrum evaluation.1991 IEEE Int. Symp. Info. Theory (June 1991), ISIT’91, Budapest, Hungary. The random coded modulation. Performance and Euclidean spectrum evaluation.Ann. Télécomm. mars-avr. 1992),47, n° 3–4, pp. 107–124.

    MATH  Google Scholar 

  26. Battail (G.). Construction explicite de bons codes longs.Ann. Télécomm. (1989),44, pp. 392–404.

    MATH  Google Scholar 

  27. De Buda (R.). The upper error bound of a new near-optimal code.IEEE Trans. IT (July 1975),21, pp. 441–445.

    Article  MATH  Google Scholar 

  28. Gardner (W. A.), Franks (L. E.). Characterization of cyclo-stationary random processes.IEEE Trans. IT (Jan. 1975),21, pp. 4–15.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This paper is based on a section of the Doctoral dissertation of the first author, upheld on Feb. 14, 1992, at Telecom Parìs. Parts of this work will be presented at ISSSE’92, Paris, France, September 1–4, 1992 and Eurocode ’92, Udine, Italy, October 26–30, 1992.

Rights and permissions

Reprints and permissions

About this article

Cite this article

MagalhÃes De Oliveira, H., Battail, G. Performance of lattice codes over the Gaussian channel. Ann. Télécommun. 47, 293–305 (1992). https://doi.org/10.1007/BF03004043

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03004043

Key words

Mots clés

Navigation