Abstract
An algorithm for soft-decision decoding of linear block codes is presented. This algorithm performs a reduced-state search through a trellis derived from the parity check matrix of an (n,k) linear block code. The computational complexity of the algorithm is considerably reduced from that of a full maximum likelihood algorithm. The tradeoff between complexity and efficiency of the algorithms through computer simulation is demonstrated.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - Annual Allerton Conference on Communication, Control, and Computing |
| Pages | 60-66 |
| Number of pages | 7 |
| State | Published - 1980 |
| Event | Proc Annu Allerton Conf Commun Control Comput 18th - Monticello, IL, USA Duration: Oct 8 1980 → Oct 11 1980 |
Other
| Other | Proc Annu Allerton Conf Commun Control Comput 18th |
|---|---|
| City | Monticello, IL, USA |
| Period | 10/8/80 → 10/11/80 |
ASJC Scopus subject areas
- Engineering(all)