Algorithms for the soft-decision decoding of linear block codes are presented. These algorithms perform a reduced complexity search through a trellis derived from the parity check matrix of an (n, k) linear block code. The computational complexity of the algorithms is considerably reduced from that of a full maximum-likelihood algorithm. The authors demonstrate the trade-off between complexity and efficiency of the algorithms through computer simulation.
|Number of pages||7|
|Journal||IEEE Transactions on Information Theory|
|Issue number||2 pt 2|
|State||Published - Mar 1 1982|
ASJC Scopus subject areas
- Information Systems
- Electrical and Electronic Engineering