Please use this identifier to cite or link to this item:
標題: Modified majority logic decoding of Reed–Muller codes using factor graphs
作者: Ting-Ya Yang
Houshou Chen
關鍵字: binary codes;decoding;error statistics;majority logic;Reed-Muller codes
Project: IET Communications, Volume 12, Issue 7, Page(s) 759-764
This study investigates the decoding algorithms of binary Reed-Muller (RM) codes. The main goal of the study is to modify majority-logic decoding using sum-product or min-sum decoding algorithms at the highest-order information bits in RM codes. Numerical results show that compared with the traditional majority-logic decoding algorithm, the modified majority-logic decoding method proposed in this study can reduce the bit error rate by a large margin. This is achieved without incurring a significant increase in decoding complexity because soft-decision decoding is only used in the highest information bits in RM codes whereas majority-logic decoding is still applied at the other orders of information bits in RM codes.
DOI: 10.1049/iet-com.2017.0987
Appears in Collections:通訊工程研究所

Files in This Item:
File Description SizeFormat Existing users please Login
305.pdf2.6 MBAdobe PDFThis file is only available in the university internal network   
Show full item record

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.