A TRELLIS-BASED RECURSIVE MAXIMUM-LIKELIHOOD DECODING ALGORITHM FOR BINARY LINEAR BLOCK-CODES

Authors
FUJIWARA T YAMAMOTO H KASAMI T LIN S
Citation
T. Fujiwara et al., A TRELLIS-BASED RECURSIVE MAXIMUM-LIKELIHOOD DECODING ALGORITHM FOR BINARY LINEAR BLOCK-CODES, IEEE transactions on information theory, 44(2), 1998, pp. 714-729
Citations number
18
Categorie Soggetti
Computer Science Information Systems","Engineering, Eletrical & Electronic","Computer Science Information Systems
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
44
Issue
2
Year of publication
1998
Pages
714 - 729
Database
ISI
SICI code
0018-9448(1998)44:2<714:ATRMDA>2.0.ZU;2-X
Abstract
This paper presents an efficient trellis-based maximum-likelihood deco ding algorithm for binary linear block codes, This algorithm is recurs ive in nature and is devised based on the structural properties and op timum sectionalization of a code trellis. The complexity of the propos ed decoding algorithm is analyzed. Numerical results show that the pro posed decoding algorithm significantly-reduces the decoding complexity . A recursive method for finding the optimum sectionalization of a tre llis in terms of computational complexity is given.