.png){kind=icon}
.png){kind=icon}
Return
Test-Pattern-Reduced Decoding for Turbo Product Codes with Multi-Error-Correcting eBCH Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2009.02.0603752.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a method to reduce the number of test patterns (TPs) decoded in the Chase-II algorithm for turbo product codes (TPCs) constructed with multi-error-correcting extended Bose-Chaudhuri-Hocquengem (eBCH) codes. We classify TPs into different conditions based on the relationship between syndromes and the number of errors so that TPs with the same codeword are not decoded except the one with the least number of errors. For eBCH with code length of 64, simulation results show that over 50% of TPs need not to be decoded without any performance degradation.
Keywords:
Chase-II algorithm
extended BCH codes
test patterns
turbo product 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:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
View more organizations