Reconstruction of LDPC code check matrix based on random extraction at high bit error rate
In order to improve the performance of the sparse check matrix reconstruction algorithm of LDPC codes at high BER, an open set recognition algorithm of the check matrix with strong fault tolerance under the condition of sufficient and insufficient number of received code words was proposed.Firstly,...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2023-03-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023062/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841540053768077312 |
|---|---|
| author | Zhongyong WANG Zhenghao LI Kexian GONG Peng SUN Qingtao LI |
| author_facet | Zhongyong WANG Zhenghao LI Kexian GONG Peng SUN Qingtao LI |
| author_sort | Zhongyong WANG |
| collection | DOAJ |
| description | In order to improve the performance of the sparse check matrix reconstruction algorithm of LDPC codes at high BER, an open set recognition algorithm of the check matrix with strong fault tolerance under the condition of sufficient and insufficient number of received code words was proposed.Firstly, a new code word space was constructed by randomly extracting part bits of the code words for many times.Gaussian elimination method was used to solve the dual vector and restore the check vector in a lower dimension.Secondly, using the check vector, the proportion of error-free code groups in the received data was continuously increased by using the methods of “eliminating error code words” or“flipping the lowest unreliable bits” for iterative processing.Simulation results show that the proposed algorithm is superior to comparison algorithm under different bit error rates, different code lengths, different code rates and different number of code words.For (648,324) LDPC codes in IEEE 802.11n protocol, when the number of received code words is sufficient, the reconstruction rate of check matrix can reach more than 95% under the condition of bit error rate of 0.003.When the number of received code words is insufficient (the number of code words is 450), the reconstruction rate of check matrix can reach more than 90% under the condition of bit error rate of 0.0015. |
| format | Article |
| id | doaj-art-83391aed08044a7f998b4414450918d9 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2023-03-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-83391aed08044a7f998b4414450918d92025-01-14T06:23:20ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2023-03-014412813759387770Reconstruction of LDPC code check matrix based on random extraction at high bit error rateZhongyong WANGZhenghao LIKexian GONGPeng SUNQingtao LIIn order to improve the performance of the sparse check matrix reconstruction algorithm of LDPC codes at high BER, an open set recognition algorithm of the check matrix with strong fault tolerance under the condition of sufficient and insufficient number of received code words was proposed.Firstly, a new code word space was constructed by randomly extracting part bits of the code words for many times.Gaussian elimination method was used to solve the dual vector and restore the check vector in a lower dimension.Secondly, using the check vector, the proportion of error-free code groups in the received data was continuously increased by using the methods of “eliminating error code words” or“flipping the lowest unreliable bits” for iterative processing.Simulation results show that the proposed algorithm is superior to comparison algorithm under different bit error rates, different code lengths, different code rates and different number of code words.For (648,324) LDPC codes in IEEE 802.11n protocol, when the number of received code words is sufficient, the reconstruction rate of check matrix can reach more than 95% under the condition of bit error rate of 0.003.When the number of received code words is insufficient (the number of code words is 450), the reconstruction rate of check matrix can reach more than 90% under the condition of bit error rate of 0.0015.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023062/LDPCsparse check matrixGaussian eliminationeliminate error code wordlog-likelihood ratio |
| spellingShingle | Zhongyong WANG Zhenghao LI Kexian GONG Peng SUN Qingtao LI Reconstruction of LDPC code check matrix based on random extraction at high bit error rate Tongxin xuebao LDPC sparse check matrix Gaussian elimination eliminate error code word log-likelihood ratio |
| title | Reconstruction of LDPC code check matrix based on random extraction at high bit error rate |
| title_full | Reconstruction of LDPC code check matrix based on random extraction at high bit error rate |
| title_fullStr | Reconstruction of LDPC code check matrix based on random extraction at high bit error rate |
| title_full_unstemmed | Reconstruction of LDPC code check matrix based on random extraction at high bit error rate |
| title_short | Reconstruction of LDPC code check matrix based on random extraction at high bit error rate |
| title_sort | reconstruction of ldpc code check matrix based on random extraction at high bit error rate |
| topic | LDPC sparse check matrix Gaussian elimination eliminate error code word log-likelihood ratio |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023062/ |
| work_keys_str_mv | AT zhongyongwang reconstructionofldpccodecheckmatrixbasedonrandomextractionathighbiterrorrate AT zhenghaoli reconstructionofldpccodecheckmatrixbasedonrandomextractionathighbiterrorrate AT kexiangong reconstructionofldpccodecheckmatrixbasedonrandomextractionathighbiterrorrate AT pengsun reconstructionofldpccodecheckmatrixbasedonrandomextractionathighbiterrorrate AT qingtaoli reconstructionofldpccodecheckmatrixbasedonrandomextractionathighbiterrorrate |