DocumentCode :
1229673
Title :
Soft-decision decoding of linear block codes based on ordered statistics
Author :
Fossorier, Marc P C ; Lin, Shu
Author_Institution :
Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA
Volume :
41
Issue :
5
fYear :
1995
fDate :
9/1/1995 12:00:00 AM
Firstpage :
1379
Lastpage :
1396
Abstract :
Presents a novel approach to soft decision decoding for binary linear block codes. The basic idea is to achieve a desired error performance progressively in a number of stages. For each decoding stage, the error performance is tightly bounded and the decoding is terminated at the stage where either near-optimum error performance or a desired level of error performance is achieved. As a result, more flexibility in the tradeoff between performance and decoding complexity is provided. The decoding is based on the reordering of the received symbols according to their reliability measure. The statistics of the noise after ordering are evaluated. Based on these statistics, two monotonic properties which dictate the reprocessing strategy are derived. Each codeword is decoded in two steps: (1) hard-decision decoding based on reliability information and (2) reprocessing of the hard-decision-decoded codeword in successive stages until the desired performance is achieved. The reprocessing is based on the monotonic properties of the ordering and is carried out using a cost function. A new resource test tightly related to the reprocessing strategy is introduced to reduce the number of computations at each reprocessing stage. For short codes of lengths N⩽32 or medium codes with 32<N⩽64 with rate R⩾0.6, near-optimum bit error performance is achieved in two stages of reprocessing with at most a computation complexity of o(K2) constructed codewords, where K is the dimension of the code. For longer codes, three or more reprocessing stages are required to achieve near-optimum decoding. However, most of the coding gain is obtained within the first two reprocessing stages for error performances of practical interest. The proposed decoding algorithm applies to any binary linear code, does not require any data storage, and is well suitable for parallel processing. Furthermore, the maximum number of computations required at each reprocessing stage is fixed, which prevents buffer overflow at low SNR
Keywords :
binary sequences; block codes; computational complexity; decoding; linear codes; reliability; statistical analysis; binary linear block codes; bit error performance; code length; coding gain; computation complexity; cost function; decoding algorithm; decoding complexity; error performance; hard-decision decoding; hard-decision-decoded codeword; monotonic properties; near-optimum decoding; noise statistics; ordered statistics; parallel processing; received symbols reordering; reliability information; reliability measure; reprocessing strategy; resource test; soft decision decoding; Block codes; Buffer overflow; Cost function; Decoding; Linear code; Memory; Parallel processing; Performance gain; Statistics; Testing;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.412683
Filename :
412683
Link To Document :
بازگشت