【文件名】:0669@52RD_um decoding of product codes_block turbo codes.rar
【格 式】:rar
【大 小】:259K
【简 介】:Abstract—This paper describes an iterative decoding algorithm
for any product code built using linear block codes. It is based on
soft-input/soft-output decoders for decoding the component codes
so that near-optimum performance is obtained at each iteration.
This soft-input/soft-output decoder is a Chase decoder which
delivers soft outputs instead of binary decisions. The soft output
of the decoder is an estimation of the log-likelihood ratio (LLR) of
the binary decisions given by the Chase decoder. The theoretical
justifications of this algorithm are developed and the method used
for computing the soft output is fully described. The iterative
decoding of product codes is also known as block turbo code
(BTC) because the concept is quite similar to turbo codes based on
iterative decoding of concatenated recursive convolutional codes.
The performance of different Bose–Chaudhuri–Hocquenghem
(BCH)–BTC’s are given for the Gaussian and the Rayleigh
channel. Performance on the Gaussian channel indicates that
data transmission at 0.8 dB of Shannon’s limit or more than 98%
(R=C > 0.98) of channel capacity can be achieved with high-coderate
BTC using only four iterations. For the Rayleigh channel,
the slope of the bit-error rate (BER) curve is as steep as for the
Gaussian channel without using channel state information.
【目 录】:
I. INTRODUCTION
II. PRODUCT CODES
III. SOFT DECODING OF LINEAR BLOCK CODES
IV. RELIABILITY OF DECISION D GIVEN BY SOFT-INPUT DECODER
V. COMPUTING THE SOFT DECISION AT THE OUTPUT OF THE SOFT-INPUT DECODER
VI. TURBO DECODING OF PRODUCT CODES
VII. DISCUSSION AND CONCLUSION