Coset Codes for Partial Response Channels; or, Coset Codes with Spectral Nulls

Published

Journal Article

Known coset codes are adapted for use on partial response channels or to generate signals with spectral nulls. By the use of methods of coset precoding and running digital sum feedback, any desired tradeoff can be achieved between the power and spectra of the relevant sequences, up to the optimum tradeoff possible. A fundamental theorem specifying this optimum tradeoff is given. A maximum likelihood sequence estimator (MLSE) decoder for the original code may be used for the adapted code, and such a decoder then attains the minimum squared distance of the original code. These methods sometimes generate codes with greater minimum squared distance than that of the original code; this distance can be attained by augmented decoders, although such decoders inherently require long decoding delays and may be subjected to quasi-catastrophic error propagation. We conclude that, at least for sequences supporting large numbers of bits per symbol, coset codes can be adapted to achieve effectively the same performance and complexity on partial response channels, or for sequences with spectral nulls, as they do in the ordinary memoryless case. © 1989 IEEE

Full Text

Duke Authors

Cited Authors

  • Forney, GD; Calderbank, AR

Published Date

  • January 1, 1989

Published In

Volume / Issue

  • 35 / 5

Start / End Page

  • 925 - 943

Electronic International Standard Serial Number (EISSN)

  • 1557-9654

International Standard Serial Number (ISSN)

  • 0018-9448

Digital Object Identifier (DOI)

  • 10.1109/18.42211

Citation Source

  • Scopus