|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'501'711
Articles rated: 2609
20 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A Rate-Distortion Perspective on Multiple Decoding Attempts for Reed-Solomon Codes | | Phong S. Nguyen
; Henry D. Pfister
; Krishna R. Narayanan
; | | Date: |
20 Aug 2009 | | Abstract: | Recently, a number of authors have proposed decoding schemes for Reed-Solomon
(RS) codes based on multiple trials of a simple RS decoding algorithm. In this
paper, we present a rate-distortion (R-D) approach to analyze these
multiple-decoding algorithms for RS codes. This approach is first used to
understand the asymptotic performance-versus-complexity trade-off of multiple
error-and-erasure decoding of RS codes. By defining an appropriate distortion
measure between an error pattern and an erasure pattern, the condition for a
single error-and-erasure decoding to succeed reduces to a form where the
distortion is compared to a fixed threshold. Finding the best set of erasure
patterns for multiple decoding trials then turns out to be a covering problem
which can be solved asymptotically by rate-distortion theory. Next, this
approach is extended to analyze multiple algebraic soft-decision (ASD) decoding
of RS codes. Both analytical and numerical computations of the R-D functions
for the corresponding distortion measures are discussed. Simulation results
show that proposed algorithms using this approach perform better than other
algorithms with the same complexity. | | Source: | arXiv, 0908.2828 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER