.png){kind=icon}
.png){kind=icon}
Return
Decoding the (47,24,11) Quadratic Residue Code Using Bit-Error Probability Estimates
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2009.07.060542.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new algorithm is developed to facilitate faster decoding of the (47,24,11) Quadratic Residue (QR) code. This decoder, based on the idea first developed by Reed in a 1959 MIT Lincoln Laboratory Report, uses real channel data to estimate the individual bit-error probabilities in a received word. The algorithm then sequentially inverts the bits with the highest probability of error until one of the errors is canceled. The remaining errors are then corrected by the use of algebraic decoding techniques. This new algorithm, called the reliability-search algorithm, is a complete decoder that significantly reduces the decoding complexity in terms of CPU time while maintaining the same bit-error rate (BER) performance. In fact, this algorithm is an appropriate modification to the algorithm developed by Chase.
Keywords:
Quadratic residue codes
algebraic decoding
reliability-search algorithm
bit-error probability estimate
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