Iterative decoding of systematic binary algebraic block codes

Author

Tee, James S K ; Taylor, Desmond P.

Author_Institution

Dept. of Electr. & Electron. Eng., Canterbury Univ., Christchurch, New Zealand

Volume

2

fYear

2000

fDate

2000

Firstpage

842

Abstract

In this paper, MAP decoders for single parity check (SPC) codes are applied to the decoding of systematic binary algebraic block codes. We compare the performance of this decoding technique to hard decision syndrome decoding and soft decision brute force decoding. Simulation results are presented for the (7,4,3) and (15,11,3) Hamming codes in the AWGN and Rayleigh fading channels. Using a product (7,4,3) Hamming code, the proposed scheme is also compared to the dual code technique as described Berrou and Glavieux (see IEEE Trans. Communications, vol.44, no.10, p.1261-71, 1996). Although the BER performance is slightly inferior, the proposed scheme is much less complex to implement

Keywords

AWGN channels; Hamming codes; Rayleigh channels; algebraic codes; binary codes; block codes; error detection codes; error statistics; iterative decoding; AWGN fading channels; BER performance; Hamming codes; MAP decoders; Rayleigh fading channels; decoding performance; dual code; hard decision syndrome decoding; iterative decoding; product Hamming code; simulation results; single parity check codes; soft decision brute force decoding; systematic binary algebraic block codes; AWGN; Bit error rate; Block codes; Channel capacity; Concatenated codes; Convolutional codes; Fading; Iterative decoding; Parity check codes; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE

Conference_Location

San Francisco, CA

Print_ISBN

0-7803-6451-1

Type

conf

DOI

10.1109/GLOCOM.2000.891257

Filename

891257