Suboptimal SISO decoding of systematic binary algebraic block codes

Author

Tee, James S K ; Taylor, Desmond P.

Author_Institution

Commun. Res. Group, Univ. of Canterbury, Christchurch, New Zealand

Volume

51

Issue

5

fYear

2003

fDate

5/1/2003 12:00:00 AM

Firstpage

715

Lastpage

718

Abstract

Previous work on concatenated single parity-check codes has yielded exceptionally good performance despite, or perhaps because of, their weak algebraic structure. In this article, maximum a posteriori single parity-check decoders are applied to the decoding of systematic binary algebraic block codes. Results for a range of Hamming codes show good performance compared to soft-decision brute force (maximum-likelihood) and algebraic decoding. The decoding complexity of the proposed technique grows only linearly with increasing block length.

Keywords

AWGN channels; Rayleigh channels; algebraic codes; binary codes; block codes; concatenated codes; iterative decoding; maximum likelihood decoding; parity check codes; AWGN channels; Hamming codes; MAP single parity-check decoders; Rayleigh fading channels; block length. iterative decoding; concatenated single parity-check codes; decoding complexity; maximum a posteriori single parity-check decoders; maximum-likelihood decoding; soft-decision brute force coding; suboptimal SISO decoding; systematic binary algebraic block codes; weak algebraic structure; AWGN; Algorithm design and analysis; Block codes; Computational complexity; Concatenated codes; Helium; Iterative algorithms; Iterative decoding; Maximum likelihood decoding; Parity check codes;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2003.811378

Filename

1201501