New sufficient conditions for decoding optimality and regions containing the optimal codeword

Author

Moorthy, Hari T. ; Lin, Shu

Author_Institution

Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA

fYear

1997

fDate

29 Jun-4 Jul 1997

Firstpage

395

Abstract

Consider a binary linear block code that is used for error control over an AWGN channel using BPSK transmission. This paper presents three sufficient conditions that either assert the optimality of a suboptimally decoded codeword or define a small region which contains the optimal (or most likely) codeword. A new minimum-weight-trellis search based iterative decoding procedure using these sufficient conditions for optimality is proposed. Simulation results for well known codes of lengths up to 64 show that the new sufficient conditions for optimality are very effective for finding the optimal codeword. The new iterative decoding procedure results in low computational and implementation complexity

Keywords

Gaussian channels; AWGN channel; BPSK transmission; binary linear block code; code length; computational complexity; decoding optimality; error control; implementation complexity; minimum-weight-trellis search based iterative decoding procedure; optimal codeword; suboptimally decoded codeword; sufficient conditions; AWGN channels; Binary phase shift keying; Block codes; Error correction; Hamming distance; Iterative decoding; Matched filters; NASA; Sufficient conditions; Zinc;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on

Conference_Location

Ulm

Print_ISBN

0-7803-3956-8

Type

conf

DOI

10.1109/ISIT.1997.613332

Filename

613332