Logo image
Iterative Soft-decision Decoding of Reed-Solomon Codes Using Informed Dynamic Scheduling
Thesis

Iterative Soft-decision Decoding of Reed-Solomon Codes Using Informed Dynamic Scheduling

Huang, Guan-Xun
Masters, 國立清華大學, 電機工程學系
2014

Abstract

里德所羅門碼 置信傳播演算法 適應性奇偶檢查矩陣 依消息動態排程 軟疊代解碼 Reed-Solomon codes belief propagation adapting parity-check matrix informed dynamic scheduling iterative soft decoding
In this thesis, an iterative soft-decision decoding algorithm is proposed for Reed-Solomon (RS) codes. The concept of adapting the parity-check matrix in is combined with informed dynamic scheduling in this proposed decod- ing algorithm. Prior to each decoding iteration, the parity-check matrix is re-arranged according to the log-likelihood-ratio (LLR) of the codeword bits on the last decoding iteration, on purpose to lower the influence of the least reliable variable nodes (LRVNs) on the decoding process. With the help of informed dynamic scheduling, the important decoding messages can be scheduled to be updated first, and the reliability of the LRVNs can be en- hanced. The simulation results show that the proposed decoding algorithm can provide significant improvement in the error-rate performance. By us- ing the proposed algorithm, a gain of 0.5 dB can be achieved compared to the conventional adapting belief propagation algorithm. Another reliability- based decoding algorithm, ordered statistic decoding (OSD) algorithm, can be added to improve performance further.

Metrics

1 Record Views

Details

Logo image