Thumbnail
Access Restriction
Subscribed

Author Matis, K. ♦ Modestino, J.
Sponsorship IEEE Information Theory Society
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1963
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Description 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<tex>(n, k)</tex>linear block code. The computational complexity of the algorithms is considerably reduced from that of a full maximum-likelihood algorithm. We demonstrate the trade-off between complexity and efficiency of the algorithms through computer simulation.
ISSN 00189448
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1982-03-01
Publisher Place U.S.A.
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Volume Number 28
Issue Number 2
Size (in Bytes) 1.05 MB
Page Count 7
Starting Page 349
Ending Page 355


Source: IEEE Xplore Digital Library