.png){kind=icon}
Return
.png){kind=icon}
.png){kind=icon}
Abstract
En 中文
This paper presents a computationally efficient hybrid reliability-based decoding algorithm for Reed-Solomon (RS) codes. This hybrid decoding algorithm consists of two major components, a reencoding process and a successive erasure-and-error decoding process for both bit and symbol levels. The reencoding process is to generate a sequence of candidate codewords based on the information provided by the codeword decoded by an algebraic decoder and a set of test error patterns. Two criteria are used for testing in the decoding process to reduce the decoding computational complexity. The first criterion is devised to reduce the number of reencoding operations by eliminating the unlikely error patterns. The second criterion is to test the optimality of a generated candidate codeword. Numerical results show that the proposed decoding algorithm can achieve either a near-optimum error performance or an asymptotically optimum error performance.
Keywords:
hybrid decoding
Reed-Solomon (RS) codes
soft-decision 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
No organization information available
Cited Papers
Physical characterization of double asteroid (617) Patroclus from 2007/2012 mutual events observations.png)
Icarus.png)
OAAI
IcarusIF0
OAAI.png){kind=icon}
Share.png){kind=icon}
SaveShareSaveShareSave
View more