Block and trellis codes for the binary (1-D) partial response channel with simple maximum likelihood decoders

Author

Siala, Mohamed ; Kaleh, Ghassan Kawas

Author_Institution

Ecole Nat. Superieure des Telecommun., Paris, France

Volume

44

Issue

12

fYear

1996

fDate

12/1/1996 12:00:00 AM

Firstpage

1613

Lastpage

1615

Abstract

We consider block and convolutional codes for improving the reliability of data transmission over the binary precoded noisy (1-D) partial response channel. We concentrate on a class of codes for which the maximum likelihood decoder, matched to the encoder, precoder, and the channel has the same trellis structure as the encoder. Thus, doubling the number of states due to the channel memory is avoided, We show that the necessary and sufficient condition to belong to this class is that all codewords be of the same parity. The Reed-Muller and Golay codes belong to this class

Keywords

Golay codes; Reed-Muller codes; block codes; convolutional codes; maximum likelihood decoding; partial response channels; trellis codes; Golay codes; Reed-Muller codes; binary (1-D) partial response channel; binary precoded noisy channel; block codes; convolutional codes; data transmission reliability; maximum likelihood decoders; trellis codes; Block codes; Convolutional codes; Data communication; Gaussian noise; Hamming distance; Magnetic recording; Maximum likelihood decoding; Partial response channels; Sufficient conditions; Transfer functions;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.545885

Filename

545885