Abstract
A systematic design of a trellis-based maximum- likelihood soft-decision decoder for linear block codes is presented. The essence of the decoder is to apply an efficient search algorithm for the error pattern on a reduced trellis representation of a certain coset. Rather than other efficient decoding algorithms, the proposed decoder is systematically designed for long codes, as well as for short codes. Computational gain of up to 6 is achieved for long high-rate codes over the well-known trellis decoder of Wolf. Efficient decoders are also obtained for short and moderate length codes.
Original language | English |
---|---|
Pages (from-to) | 764-773 |
Number of pages | 10 |
Journal | IEEE Transactions on Information Theory |
Volume | 40 |
Issue number | 3 |
DOIs | |
State | Published - May 1994 |
Keywords
- Trellis
- block codes
- maximum-likelihood decoding
- soft-decision decoding