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

Fingerprint

Block codes
Decoding
Maximum likelihood
Computational complexity
Computer simulation

ASJC Scopus subject areas

  • Engineering(all)

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)

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 proceedingChapter

Matis, KR & Modestino, JW 1800, REDUCED-STATE SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES. in Proceedings - Annual Allerton Conference on Communication, Control, and Computing. pp. 60-66, Proc Annu Allerton Conf Commun Control Comput 18th, Monticello, IL, USA, 10/8/80.
Matis KR, Modestino JW. REDUCED-STATE SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES. In Proceedings - Annual Allerton Conference on Communication, Control, and Computing. 1800. p. 60-66
Matis, K. R. ; Modestino, J. W. / REDUCED-STATE SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES. Proceedings - Annual Allerton Conference on Communication, Control, and Computing. 1800. pp. 60-66
@inbook{b8e2424910204ff5be018ab754ac2030,
title = "REDUCED-STATE SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES.",
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.",
author = "Matis, {K. R.} and Modestino, {J. W.}",
year = "1800",
language = "English",
pages = "60--66",
booktitle = "Proceedings - Annual Allerton Conference on Communication, Control, and Computing",

}

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 -