REDUCED-STATE SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES.

K. R. Matis, J. W. Modestino

Research output: Chapter in Book/Report/Conference proceedingChapter

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 languageEnglish
Title of host publicationProceedings - Annual Allerton Conference on Communication, Control, and Computing
Pages60-66
Number of pages7
StatePublished - 1800
EventProc Annu Allerton Conf Commun Control Comput 18th - Monticello, IL, USA
Duration: Oct 8 1980Oct 11 1980

Other

OtherProc Annu Allerton Conf Commun Control Comput 18th
CityMonticello, IL, USA
Period10/8/8010/11/80

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'REDUCED-STATE SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES.'. Together they form a unique fingerprint.

  • Cite this

    Matis, K. R., & Modestino, J. W. (1800). REDUCED-STATE SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES. In Proceedings - Annual Allerton Conference on Communication, Control, and Computing (pp. 60-66)