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 - 1800 |
| 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 |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)
Cite this
REDUCED-STATE SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES. / Matis, K. R.; Modestino, J. W.
Proceedings - Annual Allerton Conference on Communication, Control, and Computing. 1800. p. 60-66.Research output: Chapter in Book/Report/Conference proceeding › Chapter
}
TY - CHAP
T1 - REDUCED-STATE SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES.
AU - Matis, K. R.
AU - Modestino, J. W.
PY - 1800
Y1 - 1800
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0019339394&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0019339394&partnerID=8YFLogxK
M3 - Chapter
SP - 60
EP - 66
BT - Proceedings - Annual Allerton Conference on Communication, Control, and Computing
ER -