A study of performance and decoding complexity in lattice codes

J. A. Sheppard, A. G. Burr

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The decoding complexities and coding gains at finite error rates of a number of Barnes-Wall lattices and their sub-lattices have been estimated, and the performance/complexity trade-off compared with that of the Leech lattice.

Original languageEnglish
Title of host publicationProceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Pages523
Number of pages1
DOIs
Publication statusPublished - 1997
Event1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany
Duration: 29 Jun 19974 Jul 1997

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/TerritoryGermany
CityUlm
Period29/06/974/07/97

Cite this