| | |
| | |
Stat |
Members: 3645 Articles: 2'504'928 Articles rated: 2609
25 April 2024 |
|
| | | |
|
Article overview
| |
|
Iterative Soft Input Soft Output Decoding of Reed-Solomon Codes by Adapting the Parity Check Matrix | Jing Jiang
; Krishna R. Narayanan
; | Date: |
17 Jun 2005 | Subject: | Information Theory | cs.IT | Abstract: | An iterative algorithm is presented for soft input soft output (SISO) decoding of Reed-Solomon (RS) codes. The proposed algorithm works at the bit level using the binary parity check matrix associated with the RS code. The novelty in the proposed algorithm is in reducing a submatrix of the binary parity check matrix that corresponds to less reliable bits to a sparse nature before each decoding iteration. The proposed algorithm can be geometrically interpreted as a gradient descent with an adaptive potential function. This adaptive procedure is crucial to the convergence behavior of the gradient descent algorithm and, therefore, significantly improves the decoding performance. Simulation results show that the proposed decoding algorithm and its variations provide significant gain over hard decision decoding (HDD) and compares favorably with other popular soft decision decoding methods both in terms of error performance and complexity. | Source: | arXiv, cs.IT/0506073 | 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:
| |