Article

Two Low-Complexity Reliability-Based Message-Passing Algorithms for Decoding Non-Binary LDPC Codes

Inst. of Commun. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan
IEEE Transactions on Communications (impact factor: 1.68). 12/2010; DOI:10.1109/TCOMM.2010.091310.090327 pp.3140 - 3147
Source: IEEE Xplore

ABSTRACT This paper presents two low-complexity reliability-based message-passing algorithms for decoding LDPC codes over non-binary finite fields. These two decoding algorithms require only finite field and integer operations and they provide effective trade-off between error performance and decoding complexity compared to the non-binary sum product algorithm. They are particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields.

0 0
 · 
0 Bookmarks
 · 
26 Views
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

decoding complexity
 
decoding LDPC codes
 
error performance
 
finite geometries
 
integer operations
 
non-binary sum product algorithm
 
two decoding algorithms
 

Chao-Yu Chen