.png){kind=icon}
Return
Shortened turbo product codes: Encoding design and decoding algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2007.901931.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Shortened turbo product codes (TPCs) have already been adopted in many standards. In this paper, we study shortened TPCs from two aspects, namely encoding design and decoding algorithm. To obtain different encoding block sizes, shortened-extended Hamming codes are used as the component codes of product codes in the IEEE 802.16 Standard. To design a good structure for the shortened TPC, we compute the undetected error probability of its corresponding component codes. The component codes are shortened-extended Hamming codes, and their optimal generator polynomials are selected in terms of their undetected error probability. For the decoding algorithm, we present an efficient Chase decoding algorithm for shortened TPCs in flat fading channels. In the proposed scheme, the reliability factor used in Pyndiah's scheme is not needed; thus, the decoding complexity is greatly reduced by avoiding the normalization operation of the whole code word at each iteration. Simulation results are also presented to verify the performance of the proposed algorithm.
Keywords:
block codes
Chase decoding algorithm
product codes
shortened codes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave
View more