DocumentCode :
2935461
Title :
Soft decision decoding of block codes and concatenated block-convolutional codes using the stack algorithm
Author :
Offer, Elke ; Perkins, Michael G.
Author_Institution :
German Aerosp. Res. Establ. (DLR), Oberpfaffenhofen, Germany
fYear :
1991
fDate :
2-5 Dec 1991
Firstpage :
765
Abstract :
An approach to soft decision-decoding of block codes and concatenated block-convolutional codes is presented. These codes are shown to have a convenient tree structure that allows depth-first and metric-first sequential decoding techniques to be used to decode them. The unique features of the metric used for decoding are discussed, and a complete decoder of acceptable complexity is presented. For the additive white Gaussian noise (AWGN) channel, gains in excess of 1 dB at reasonable bit error rates (BER) with respect to conventional hard decision algebraic decoding are demonstrated for the (23,12) Golay code and for two Reed-Solomon codes
Keywords :
Reed-Solomon codes; block codes; convolutional codes; decoding; telecommunication channels; white noise; (23,12) Golay code; AWGN channel; Reed-Solomon codes; additive white Gaussian noise; bit error rates; block codes; concatenated block-convolutional codes; depth-first sequential decoding; metric-first sequential decoding; soft decision-decoding; stack algorithm; tree structure; AWGN channels; Bit error rate; Block codes; Concatenated codes; Convolutional codes; Galois fields; Maximum likelihood decoding; Reed-Solomon codes; Tree data structures; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 1991. GLOBECOM '91. 'Countdown to the New Millennium. Featuring a Mini-Theme on: Personal Communications Services
Conference_Location :
Phoenix, AZ
Print_ISBN :
0-87942-697-7
Type :
conf
DOI :
10.1109/GLOCOM.1991.188486
Filename :
188486
Link To Document :
بازگشت