DocumentCode
2059233
Title
Soft-input soft-output list-based decoding algorithm
Author
Martin, Philippa A. ; Taylor, Desmond P. ; Fossorier, Marc P C
Author_Institution
Canterbury Univ., Christchurch, New Zealand
fYear
2002
fDate
2002
Firstpage
339
Abstract
List-based SISO decoding algorithms calculate extrinsic information using a list of codewords. They try to produce a list containing the closest codewords to the soft input by encoding or decoding test sequences. Ideally for each position in the code, there is at least one codeword in the list with a ´1´ in that position and at least one with a ´0´. The extrinsic information must be estimated in positions where there is not. We focus on encoding-based algorithms since they retain performance as the minimum Hamming distance of the code, dH,min, increases, whereas, decoding-based algorithms generally become increasingly inefficient. We consider product codes with extended BCH component codes. They are transmitted using BPSK over a memoryless additive white Gaussian noise channel. The proposed algorithm can easily be extended to different channel models, modulation schemes and concatenated codes.
Keywords
AWGN channels; BCH codes; decoding; memoryless systems; product codes; sequences; BPSK; channel models; codewords list; concatenated codes; decoding-based algorithms; encoding-based algorithms; extended component codes; extrinsic information; list-based SISO decoding algorithms; list-based decoding algorithm; memoryless AWGN channel; memoryless additive white Gaussian noise channel; minimum Hamming distance; modulation; product codes; soft-input soft-output decoding; test sequences coding; test sequences decoding; Additive white noise; Algorithm design and analysis; Binary phase shift keying; Bit error rate; Hamming distance; Iterative decoding; Maximum likelihood decoding; Personal communication networks; Product codes; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023611
Filename
1023611
Link To Document