Sequential decoding of lattice codes
Publication
, Conference
Tarokh, V; Vardy, A; Zeger, K
Published in: IEEE International Symposium on Information Theory - Proceedings
December 1, 1997
We consider lattice tree-codes based on a lattice Λ having a finite trellis diagram T. Such codes are easy to encode and benefit from the structure of Λ . Sequential decoding of lattice tree-codes is studied, and the corresponding Fano (1963) metric is derived. An upper bound on the running time of the sequential decoding algorithm is established, and found to resemble the Pareto distribution. Our bound indicates that the order of label groups in T plays an important role in determining the complexity of sequential decoding. Furthermore, it is proved that lattice tree-codes of arbitrarily high rate, based on Λ and T, can be sequentially decoded with the same complexity, and without any possibility of buffer overflow. © 1997 IEEE.
Duke Scholars
Published In
IEEE International Symposium on Information Theory - Proceedings
DOI
ISSN
2157-8095
Publication Date
December 1, 1997
Start / End Page
497
Citation
APA
Chicago
ICMJE
MLA
NLM
Tarokh, V., Vardy, A., & Zeger, K. (1997). Sequential decoding of lattice codes. In IEEE International Symposium on Information Theory - Proceedings (p. 497). https://doi.org/10.1109/ISIT.1997.613434
Tarokh, V., A. Vardy, and K. Zeger. “Sequential decoding of lattice codes.” In IEEE International Symposium on Information Theory - Proceedings, 497, 1997. https://doi.org/10.1109/ISIT.1997.613434.
Tarokh V, Vardy A, Zeger K. Sequential decoding of lattice codes. In: IEEE International Symposium on Information Theory - Proceedings. 1997. p. 497.
Tarokh, V., et al. “Sequential decoding of lattice codes.” IEEE International Symposium on Information Theory - Proceedings, 1997, p. 497. Scopus, doi:10.1109/ISIT.1997.613434.
Tarokh V, Vardy A, Zeger K. Sequential decoding of lattice codes. IEEE International Symposium on Information Theory - Proceedings. 1997. p. 497.
Published In
IEEE International Symposium on Information Theory - Proceedings
DOI
ISSN
2157-8095
Publication Date
December 1, 1997
Start / End Page
497