Reduced-Search Soft-Decision Trellis Decoding of Linear Block Codes

K. R. Matis, James W. Modestino

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


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 (US)
Pages (from-to)349-355
Number of pages7
JournalIEEE Transactions on Information Theory
Issue number2
StatePublished - Mar 1982

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Reduced-Search Soft-Decision Trellis Decoding of Linear Block Codes'. Together they form a unique fingerprint.

Cite this