Study on coded distributed fast Hadamard transform based non-binary LDPC code decoding algorithm
Despite the excellent error correction performance and burst error resistance capability of non-binary LDPC codes, the complexity of the decoding algorithms hinders their broader application.In the classic FHT-QSPA decoding, the fast Hadamard transform (FHT) and its inverse transform (IFHT) have bec...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2023-10-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023199/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841540079917465600 |
|---|---|
| author | Rui LIU Yong LI |
| author_facet | Rui LIU Yong LI |
| author_sort | Rui LIU |
| collection | DOAJ |
| description | Despite the excellent error correction performance and burst error resistance capability of non-binary LDPC codes, the complexity of the decoding algorithms hinders their broader application.In the classic FHT-QSPA decoding, the fast Hadamard transform (FHT) and its inverse transform (IFHT) have become the main bottleneck for updating the check nodes.Therefore, a coded distributed FHT scheme based on systematic MDS codes was proposed.In the scheme, the channel probability was modeled by the master node as a matrix and it was segmented, and those sub-matrices were encoded into redundant ones.Then, all the sub-matrices were offloaded to worker nodes to perform parallel FHT and IFHT, and the results were sent back to the master node for the final decoding.By embedding redundant information, the proposed scheme resolved the straggling problem, improving the efficiency, and accelerating the entire decoding process.Comparisons with other coded matrix multiplication schemes, the proposed scheme provides lower encoding complexity, higher numerical accuracy in decoding recovery, and maintains an efficient butterfly operation, effectively reducing the computational complexity of worker nodes.The time comparison and decoding performance analysis reveal that the proposed scheme achieves up to approximately 3.8 times acceleration compared to the traditional single-node FHT scheme, significantly enhances the FHT-QSPA decoding efficiency without affecting the decoding performance. |
| format | Article |
| id | doaj-art-e498a83ad34f45b09ade0b149bdae9af |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2023-10-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-e498a83ad34f45b09ade0b149bdae9af2025-01-14T06:23:28ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2023-10-0144233359388130Study on coded distributed fast Hadamard transform based non-binary LDPC code decoding algorithmRui LIUYong LIDespite the excellent error correction performance and burst error resistance capability of non-binary LDPC codes, the complexity of the decoding algorithms hinders their broader application.In the classic FHT-QSPA decoding, the fast Hadamard transform (FHT) and its inverse transform (IFHT) have become the main bottleneck for updating the check nodes.Therefore, a coded distributed FHT scheme based on systematic MDS codes was proposed.In the scheme, the channel probability was modeled by the master node as a matrix and it was segmented, and those sub-matrices were encoded into redundant ones.Then, all the sub-matrices were offloaded to worker nodes to perform parallel FHT and IFHT, and the results were sent back to the master node for the final decoding.By embedding redundant information, the proposed scheme resolved the straggling problem, improving the efficiency, and accelerating the entire decoding process.Comparisons with other coded matrix multiplication schemes, the proposed scheme provides lower encoding complexity, higher numerical accuracy in decoding recovery, and maintains an efficient butterfly operation, effectively reducing the computational complexity of worker nodes.The time comparison and decoding performance analysis reveal that the proposed scheme achieves up to approximately 3.8 times acceleration compared to the traditional single-node FHT scheme, significantly enhances the FHT-QSPA decoding efficiency without affecting the decoding performance.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023199/non-binary LDPC code decodingcoded distributed computingfast Hadamard transform |
| spellingShingle | Rui LIU Yong LI Study on coded distributed fast Hadamard transform based non-binary LDPC code decoding algorithm Tongxin xuebao non-binary LDPC code decoding coded distributed computing fast Hadamard transform |
| title | Study on coded distributed fast Hadamard transform based non-binary LDPC code decoding algorithm |
| title_full | Study on coded distributed fast Hadamard transform based non-binary LDPC code decoding algorithm |
| title_fullStr | Study on coded distributed fast Hadamard transform based non-binary LDPC code decoding algorithm |
| title_full_unstemmed | Study on coded distributed fast Hadamard transform based non-binary LDPC code decoding algorithm |
| title_short | Study on coded distributed fast Hadamard transform based non-binary LDPC code decoding algorithm |
| title_sort | study on coded distributed fast hadamard transform based non binary ldpc code decoding algorithm |
| topic | non-binary LDPC code decoding coded distributed computing fast Hadamard transform |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023199/ |
| work_keys_str_mv | AT ruiliu studyoncodeddistributedfasthadamardtransformbasednonbinaryldpccodedecodingalgorithm AT yongli studyoncodeddistributedfasthadamardtransformbasednonbinaryldpccodedecodingalgorithm |