Iterative Hard-Decision Decoding Algorithms for Binary Reed-Muller Codes
In this paper, novel hard-decision iterative decoding algorithms for binary Reed-Muller (RM) codes are presented. First, two algorithms are devised based on the majority-logic decoding algorithm with reliability measures of the received sequence. The bit-flipping (BF) and the normalized bit-flipping...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9789141/ |
| _version_ | 1811341446088753152 |
|---|---|
| author | Yong-Ting Ni Duc Nhat Nguyen Feng-Kai Liao Tzu-Chieh Kao Chao-Yu Chen |
| author_facet | Yong-Ting Ni Duc Nhat Nguyen Feng-Kai Liao Tzu-Chieh Kao Chao-Yu Chen |
| author_sort | Yong-Ting Ni |
| collection | DOAJ |
| description | In this paper, novel hard-decision iterative decoding algorithms for binary Reed-Muller (RM) codes are presented. First, two algorithms are devised based on the majority-logic decoding algorithm with reliability measures of the received sequence. The bit-flipping (BF) and the normalized bit-flipping (NBF) decoding algorithms are hard-decision decoding algorithms. According to the updated hard reliability measures, the BF and NBF algorithms flip one bit of the received hard-decision sequence at a time in each iteration. The NBF decoding algorithm performs better than the BF decoding algorithm by normalizing the reliability measures of the information bits. Moreover, the BF and NBF algorithms are modified to flip multiple bits in one iteration to reduce the average number of iterations. The modified decoding algorithms are called the multiple-bits-flipping (MBF) algorithm and the normalized multiple-bits-flipping (NMBF) algorithm, respectively. The proposed algorithms have low computational complexities and can converge rapidly after a small number of iterations. The simulation results show that the proposed hard-decision decoding algorithms outperform the conventional decoding algorithm. |
| first_indexed | 2024-04-13T18:56:31Z |
| format | Article |
| id | doaj.art-8d56d4afba3941b7ae42da37d193e55e |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-13T18:56:31Z |
| publishDate | 2022-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-8d56d4afba3941b7ae42da37d193e55e2022-12-22T02:34:14ZengIEEEIEEE Access2169-35362022-01-0110593735938210.1109/ACCESS.2022.31803689789141Iterative Hard-Decision Decoding Algorithms for Binary Reed-Muller CodesYong-Ting Ni0Duc Nhat Nguyen1Feng-Kai Liao2Tzu-Chieh Kao3Chao-Yu Chen4https://orcid.org/0000-0002-3717-5600Department of Engineering Science, National Cheng Kung University, Tainan, TaiwanDepartment of Engineering Science, National Cheng Kung University, Tainan, TaiwanDepartment of Engineering Science, National Cheng Kung University, Tainan, TaiwanDepartment of Engineering Science, National Cheng Kung University, Tainan, TaiwanDepartment of Engineering Science, National Cheng Kung University, Tainan, TaiwanIn this paper, novel hard-decision iterative decoding algorithms for binary Reed-Muller (RM) codes are presented. First, two algorithms are devised based on the majority-logic decoding algorithm with reliability measures of the received sequence. The bit-flipping (BF) and the normalized bit-flipping (NBF) decoding algorithms are hard-decision decoding algorithms. According to the updated hard reliability measures, the BF and NBF algorithms flip one bit of the received hard-decision sequence at a time in each iteration. The NBF decoding algorithm performs better than the BF decoding algorithm by normalizing the reliability measures of the information bits. Moreover, the BF and NBF algorithms are modified to flip multiple bits in one iteration to reduce the average number of iterations. The modified decoding algorithms are called the multiple-bits-flipping (MBF) algorithm and the normalized multiple-bits-flipping (NMBF) algorithm, respectively. The proposed algorithms have low computational complexities and can converge rapidly after a small number of iterations. The simulation results show that the proposed hard-decision decoding algorithms outperform the conventional decoding algorithm.https://ieeexplore.ieee.org/document/9789141/Reed-Muller codebit-flippingmajority-logic decodingiterative decoding |
| spellingShingle | Yong-Ting Ni Duc Nhat Nguyen Feng-Kai Liao Tzu-Chieh Kao Chao-Yu Chen Iterative Hard-Decision Decoding Algorithms for Binary Reed-Muller Codes IEEE Access Reed-Muller code bit-flipping majority-logic decoding iterative decoding |
| title | Iterative Hard-Decision Decoding Algorithms for Binary Reed-Muller Codes |
| title_full | Iterative Hard-Decision Decoding Algorithms for Binary Reed-Muller Codes |
| title_fullStr | Iterative Hard-Decision Decoding Algorithms for Binary Reed-Muller Codes |
| title_full_unstemmed | Iterative Hard-Decision Decoding Algorithms for Binary Reed-Muller Codes |
| title_short | Iterative Hard-Decision Decoding Algorithms for Binary Reed-Muller Codes |
| title_sort | iterative hard decision decoding algorithms for binary reed muller codes |
| topic | Reed-Muller code bit-flipping majority-logic decoding iterative decoding |
| url | https://ieeexplore.ieee.org/document/9789141/ |
| work_keys_str_mv | AT yongtingni iterativeharddecisiondecodingalgorithmsforbinaryreedmullercodes AT ducnhatnguyen iterativeharddecisiondecodingalgorithmsforbinaryreedmullercodes AT fengkailiao iterativeharddecisiondecodingalgorithmsforbinaryreedmullercodes AT tzuchiehkao iterativeharddecisiondecodingalgorithmsforbinaryreedmullercodes AT chaoyuchen iterativeharddecisiondecodingalgorithmsforbinaryreedmullercodes |