Multilevel Codes and Multistage Decoding

Published

Journal Article

Imai and Hirakawa have proposed a multilevel coding method based on binary block codes that admits a staged decoding procedure. This method has been extended to the design of codes for the Gaussian channel that admit multistage decoding procedures by Ginzburg, by Sayegh, and by Tanner. In this paper, we extend the multilevel coding method to coset codes and we show how to calculate minimum squared distance and path multiplicity in terms of the norms and multiplicities of the different cosets. The multilevel structure allows the redundancy in the coset selection procedure to be allocated efficiently among the different levels. It also allows the use of suboptimal multistage decoding procedures that have performance/complexity advantages over maximum likelihood decoding. © 1989 IEEE

Full Text

Duke Authors

Cited Authors

  • Calderbank, AR

Published Date

  • January 1, 1989

Published In

Volume / Issue

  • 37 / 3

Start / End Page

  • 222 - 229

International Standard Serial Number (ISSN)

  • 0090-6778

Digital Object Identifier (DOI)

  • 10.1109/26.20095

Citation Source

  • Scopus