.png){kind=icon}
Return
Fast Chase algorithm with an application in turbo decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/26.957387.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Turbo product codes (TPCs) provide an attractive alternative to recursive systematic convolutional (RSC)-based turbo systems. Rather than employ trellis-based decoders, an algebraic decoder may be repeatedly employed in a low-complexity, soft-input/soft-output errors-and-erasures decoder such as the Chase algorithm. Taking motivation from efficient forced erasure decoders, this implementation re-orders the Chase algorithm's repeated decodings such that the inherent computational redundancy is greatly reduced without degrading performance. The result is a highly efficient Fast Chase implementation; the algorithm presented here is principally applicable to single error-correcting codes although consideration is also given to the more general case. The new decoder's value in practical turbo schemes is demonstrated via application to decoding of the (64,57,4) extended Hamming TPC.
Keywords:
Hamming codes
linear codes
MAP estimation
maximum-likelihood decoding
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
No organization information available
Cited Papers
New P–Se compounds from the reaction of 2,4-bis(phenyl)-1,3-diselenadiphosphetane-2,4-diselenide with alkyl-diols.png)
Tetrahedron
TetrahedronIF0
PREAI
ShareSave
ShareSaveShareSaveShareSave
ShareSave
View more