A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes

Author

Fujiwara, Toru ; Yamamoto, Hiroshi ; Kasami, Tadao ; Lin, Shu

Author_Institution

Graduate Sch. of Eng. Sci., Osaka Univ., Japan

Volume

44

Issue

2

fYear

1998

fDate

3/1/1998 12:00:00 AM

Firstpage

714

Lastpage

729

Abstract

This paper presents an efficient trellis-based maximum-likelihood decoding algorithm for binary linear block codes. This algorithm is recursive in nature and is devised based on the structural properties and optimum sectionalization of a code trellis. The complexity of the proposed decoding algorithm is analyzed. Numerical results show that the proposed decoding algorithm significantly reduces the decoding complexity. A recursive method for finding the optimum sectionalization of a trellis in terms of computational complexity is given

Keywords

binary sequences; block codes; computational complexity; linear codes; maximum likelihood decoding; binary linear block codes; code trellis; optimum sectionalization; recursive algorithm complexity; recursive method; structural properties; trellis-based recursive maximum-likelihood decoding; Algorithm design and analysis; Block codes; Communication system control; Computational complexity; Information science; Information theory; Maximum likelihood decoding; Meetings; NASA; Viterbi algorithm;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.661515

Filename

661515