|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'500'096
Articles rated: 2609
19 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Algebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level Soft Information | | Jing Jiang
; Krishna R. Narayanan
; | | Date: |
18 Nov 2006 | | Subject: | Information Theory | | Abstract: | The performance of algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies (MAS) of ASD with infinite cost are first studied over erasure channels and binary symmetric channels (BSC). The corresponding decoding radii are calculated in closed forms and tight bounds on the error probability are derived. The MAS and the corresponding performance analysis are then generalized to characterize the decoding region of ASD over a mixed error and bit-level erasure channel. The bit-level decoding region of the proposed MAS is shown to be significantly larger than that of conventional Berlekamp-Massey (BM) decoding. As an application, a bit-level generalized minimum distance (BGMD) decoding algorithm is proposed. The proposed BGMD compares favorably with many other RS soft-decision decoding (SDD) algorithms over various channels. Moreover, owing to the simplicity of BGMD, its performance can be tightly bounded using ordered statistics. | | Source: | arXiv, cs/0611090 | | 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