DocumentCode :
3663472
Title :
On the multiple threshold decoding of LDPC codes over GF(q)
Author :
Alexey Frolov;Victor Zyablov
Author_Institution :
Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
fYear :
2015
fDate :
6/1/2015 12:00:00 AM
Firstpage :
2673
Lastpage :
2677
Abstract :
We consider the decoding of LDPC codes over GF(q) with the low-complexity majority algorithm from [1]. A modification of this algorithm with multiple thresholds is suggested. A lower estimate on the decoding radius realized by the new algorithm is derived. The estimate is shown to be better than the estimate for a single threshold majority decoder. At the same time the transition to multiple thresholds does not affect the order of complexity.
Keywords :
"Decoding","Complexity theory","Image edge detection","Iterative decoding","Linear matrix inequalities","Graph theory"
Publisher :
ieee
Conference_Titel :
Information Theory (ISIT), 2015 IEEE International Symposium on
Electronic_ISBN :
2157-8117
Type :
conf
DOI :
10.1109/ISIT.2015.7282941
Filename :
7282941
Link To Document :
بازگشت