.png){kind=icon}
Return
Non-Sequential Decoding Algorithm for Hard Iterative Turbo Product Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2009.06.070010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we propose a new decoding algorithm to improve the bit error rate performance of the hard-input hard-output (HIHO) turbo product codes (TPC) with hard iterative decoding. The proposed algorithm iteratively, but not sequentially, decodes the received TPC blocks based on the reliability of the constituent codes. Simulation results confirm a noticeable coding gain improvement using the proposed decoding process with respect to standard HIHO TPC decoding. An efficient implementation of the new technique offers a negligible additional complexity when the channel-bit error probability is less than 10(-2).
Keywords:
Turbo block codes
TPC
hard decision decoding
iterative decoding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
View more