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

K. R. Matis, James W. Modestino

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)349-355
Number of pages7
JournalIEEE Transactions on Information Theory
VolumeIT-28
Issue number2 pt 2
StatePublished - Mar 1 1982

Fingerprint

Block codes
Decoding
computer simulation
Maximum likelihood
Computational complexity
efficiency
Computer simulation

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

REDUCED-RESEARCH SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES. / Matis, K. R.; Modestino, James W.

In: IEEE Transactions on Information Theory, Vol. IT-28, No. 2 pt 2, 01.03.1982, p. 349-355.

Research output: Contribution to journalArticle

Matis, KR & Modestino, JW 1982, 'REDUCED-RESEARCH SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES.', IEEE Transactions on Information Theory, vol. IT-28, no. 2 pt 2, pp. 349-355.
Matis, K. R. ; Modestino, James W. / REDUCED-RESEARCH SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES. In: IEEE Transactions on Information Theory. 1982 ; Vol. IT-28, No. 2 pt 2. pp. 349-355.
@article{8a4c938a7f834573bf2dbf53d6c20531,
title = "REDUCED-RESEARCH SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES.",
abstract = "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.",
author = "Matis, {K. R.} and Modestino, {James W.}",
year = "1982",
month = "3",
day = "1",
language = "English",
volume = "IT-28",
pages = "349--355",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2 pt 2",

}

TY - JOUR

T1 - REDUCED-RESEARCH SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES.

AU - Matis, K. R.

AU - Modestino, James W.

PY - 1982/3/1

Y1 - 1982/3/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0020100670&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020100670&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0020100670

VL - IT-28

SP - 349

EP - 355

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 2 pt 2

ER -