Low-density parity-check （LDPC） codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate （BER） performance approaches remarkably close to the Shannon limit. The LDPC cod...Low-density parity-check （LDPC） codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate （BER） performance approaches remarkably close to the Shannon limit. The LDPC codes created much interest after the rediscovery by Mackay and Neal in 1995. This paper introduces some new LDPC codes by considering some combinatorial structures. We present regular LDPC codes based on group divisible designs which have Tanner graphs free of four-cycles.展开更多
In this paper, the Multiple Input Multiple Output (MIMO) doubly-iterative receiver which consists of the Probabilistic Data Association detector (PDA) and Low-Density Parity-Check Code (LDPC) decoder is developed. The...In this paper, the Multiple Input Multiple Output (MIMO) doubly-iterative receiver which consists of the Probabilistic Data Association detector (PDA) and Low-Density Parity-Check Code (LDPC) decoder is developed. The receiver performs two iterative decoding loops. In the outer loop, the soft information is exchanged between the PDA detector and the LDPC decoder. In the inner loop, it is exchanged between variable node and check node decoders inside the LDPC decoder. On the light of the Extrinsic Information Transfer (EXIT) chart technique, an LDPC code degree profile optimization algorithm is developed for the doubly-iterative receiver. Simulation results show the doubly-receiver with optimized irregular LDPC code can have a better performance than the one with the regular one.展开更多
A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check （LDPC） codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional densit...A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check （LDPC） codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation resuits show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost.展开更多
A new method to design parity-check matrix based on Henon chaos model is presented. The designed parity-check matrix is with rather random behavior. Simulation results show that the proposed method makes an improvemen...A new method to design parity-check matrix based on Henon chaos model is presented. The designed parity-check matrix is with rather random behavior. Simulation results show that the proposed method makes an improvement in bit error rate （BER） performance by 0.4 dB compared with that of Luby for AWGN channel. The proposed method decreases the complexity of decoding significantly, and improves the error correcting performance of LDPC codes. It has been shown that Henon chaotic model is a powerful tool for construction of good LDPC codes, which make it possible to apply the LDPC code in real communication systems.展开更多
In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the ...In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the analysis of the code rate and parameters of these eight kinds of structures, we find that the construction of low-density parity-check matrix tends to be more flexible and the parameter variability is enhanced. We propose that the current development cost should be lower with the progress of electronic technology and we need research on more practical Low-Density Parity-Check Codes (LDPC). Combined with the application of the quantum distribution key, we urgently need to explore the research direction of relevant theories and technologies of LDPC codes in other fields of quantum information in the future.展开更多
Three families of low-density parity-check （LDPC） codes are constructed based on the totally isotropic subspaces of symplectic, unitary, and orthogonal spaces over finite fields, respectively. The minimum distances ...Three families of low-density parity-check （LDPC） codes are constructed based on the totally isotropic subspaces of symplectic, unitary, and orthogonal spaces over finite fields, respectively. The minimum distances of the three families of LDPC codes in some special cases are settled.展开更多
In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are de...In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are derived by permuting the matrices of the corresponding RC-LDPC block codes,are systematic and have maximum encoding memory.Simulation results show that the proposed RC-LDPC convolutional codes with belief propagation(BP) decoding collectively offer a steady improvement on performance compared with the block counterparts over the binary-input additive white Gaussian noise channels(BI-AWGNCs).展开更多
Area-efficient design methodology is proposed for the analog decoding implementations of the rate-l/2 accumulate repeat-4 jagged-accumulate （AR4JA） low density parity check （LDPC） code. The proposed approach is de...Area-efficient design methodology is proposed for the analog decoding implementations of the rate-l/2 accumulate repeat-4 jagged-accumulate （AR4JA） low density parity check （LDPC） code. The proposed approach is designed using optimized decoding architecture and regularized routing network, in such a way that the overall wiring overhead is minimized and the silicon area utilization is significantly improved. The prototyping chip used to verily the approach is tully integrated in a four-metal double-poly 0.35 lam complementary metal oxide semiconductor （CMOS） technology, and includes an input-output interface that maximizes the decoder throughput. The decoding core area is 2.02 mm2 with a post-layout area utilization of 80%. The decoder was successfully tested at the maximum data rate of 10 Mbit/s, with a core power consumption of 6.78 mW at 3.3 V, which corresponds to an energy per decoded bit of 0.677 nJ. The proposed analog LDPC decoder with low processing power and high-reliability is suitable lbr space- and power-constrained spacecraft system.展开更多
The problem of improving the performance of linear programming（LP） decoding of low-density parity-check（LDPC） codes is considered in this paper.A multistep linear programming（MLP） algorithm was developed for dec...The problem of improving the performance of linear programming（LP） decoding of low-density parity-check（LDPC） codes is considered in this paper.A multistep linear programming（MLP） algorithm was developed for decoding LDPC codes that includes a slight increase in computational complexity.The MLP decoder adaptively adds new constraints which are compatible with a selected check node to refine the results when an error is reported by the original LP decoder.The MLP decoder result is shown to have the maximum-likelihood（ML） certificate property.Simulations with moderate block length LDPC codes suggest that the MLP decoder gives better performance than both the original LP decoder and the conventional sum-product（SP） decoder.展开更多
Structured flowchart( SFC) and Automatic code generation based on SFC( CG-SFC) have been widely used in software requirements,design and testing phases. Some CG-SFC tools such as Rhapsody have the ability to build flo...Structured flowchart( SFC) and Automatic code generation based on SFC( CG-SFC) have been widely used in software requirements,design and testing phases. Some CG-SFC tools such as Rhapsody have the ability to build flowchart and generate code,but they do not check whether a given flowchart is correct or structural. For unstructured error ‘goto'statements will be generated randomly. We proposed three algorithms and some error recognition criteria to solve those problems. Structure recognition algorithm can recognize Selection,While/for and do-while structures. Error recognition algorithm incorporating criteria can check all the errors. At last,we develop a CG-SFC system,and compared with existing Rhapsody,it shows that the proposed algorithms are correct and effective.展开更多
信道编码参数的盲识别作为非合作通信和自适应调制编码(Adaptive Modulation and Coding,AMC)系统中的一项重要技术,近些年受到了更多关注.在第五代移动通信技术(5th Generation mobile networks,5G)中,其采用了低密度奇偶检验(Low-Dens...信道编码参数的盲识别作为非合作通信和自适应调制编码(Adaptive Modulation and Coding,AMC)系统中的一项重要技术,近些年受到了更多关注.在第五代移动通信技术(5th Generation mobile networks,5G)中,其采用了低密度奇偶检验(Low-Density Parity-Check,LDPC)码作为数据信道的前向纠错码,但其使用了删余和填充导致传统的盲识别技术不再适用.本文提出了一种新的方案,借鉴置信传播(Belief Propagation,BP)译码迭代思路来进行盲识别.该方案基于传统平均对数似然比(Log-Likelihood Ratio,LLR)算法,进一步采用BP译码的思想对删余和填充比特进行迭代,以解决传统算法无法识别这部分比特的问题.仿真结果表明:与现有的相关算法相比,本文算法具有更好的性能.展开更多
基金Supported by the National Natural Science Foundation of China(Grant Nos.1107105611201114)
文摘Low-density parity-check （LDPC） codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate （BER） performance approaches remarkably close to the Shannon limit. The LDPC codes created much interest after the rediscovery by Mackay and Neal in 1995. This paper introduces some new LDPC codes by considering some combinatorial structures. We present regular LDPC codes based on group divisible designs which have Tanner graphs free of four-cycles.
基金Supported by the National Natural Science Foundation of China (No. 60772061)Science Foundation of Nanjing University of Posts and Telecommunications (No. NY207132)
文摘In this paper, the Multiple Input Multiple Output (MIMO) doubly-iterative receiver which consists of the Probabilistic Data Association detector (PDA) and Low-Density Parity-Check Code (LDPC) decoder is developed. The receiver performs two iterative decoding loops. In the outer loop, the soft information is exchanged between the PDA detector and the LDPC decoder. In the inner loop, it is exchanged between variable node and check node decoders inside the LDPC decoder. On the light of the Extrinsic Information Transfer (EXIT) chart technique, an LDPC code degree profile optimization algorithm is developed for the doubly-iterative receiver. Simulation results show the doubly-receiver with optimized irregular LDPC code can have a better performance than the one with the regular one.
基金Leading Academic Discipline Project of Shanghai Municipal Education Commission,China(No.J51801)Shanghai Second Polytechnic University Foundation,China(No.QD209008)Leading Academic Discipline Project of Shanghai Second Polytechnic University,China(No.XXKZD1302)
文摘A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check （LDPC） codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation resuits show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost.
基金Supported by the National High Technology Research and Development Program of China (2001AA123053)
文摘A new method to design parity-check matrix based on Henon chaos model is presented. The designed parity-check matrix is with rather random behavior. Simulation results show that the proposed method makes an improvement in bit error rate （BER） performance by 0.4 dB compared with that of Luby for AWGN channel. The proposed method decreases the complexity of decoding significantly, and improves the error correcting performance of LDPC codes. It has been shown that Henon chaotic model is a powerful tool for construction of good LDPC codes, which make it possible to apply the LDPC code in real communication systems.
文摘In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the analysis of the code rate and parameters of these eight kinds of structures, we find that the construction of low-density parity-check matrix tends to be more flexible and the parameter variability is enhanced. We propose that the current development cost should be lower with the progress of electronic technology and we need research on more practical Low-Density Parity-Check Codes (LDPC). Combined with the application of the quantum distribution key, we urgently need to explore the research direction of relevant theories and technologies of LDPC codes in other fields of quantum information in the future.
基金This work was supported in part by the National Natural Science Foundation of China （Grant Nos. 11271004, 11371121, 11471096）.
文摘Three families of low-density parity-check （LDPC） codes are constructed based on the totally isotropic subspaces of symplectic, unitary, and orthogonal spaces over finite fields, respectively. The minimum distances of the three families of LDPC codes in some special cases are settled.
基金the National Natural Science Foundation of China(Nos.61401164,61471131 and 61201145)the Natural Science Foundation of Guangdong Province(No.2014A030310308)
文摘In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are derived by permuting the matrices of the corresponding RC-LDPC block codes,are systematic and have maximum encoding memory.Simulation results show that the proposed RC-LDPC convolutional codes with belief propagation(BP) decoding collectively offer a steady improvement on performance compared with the block counterparts over the binary-input additive white Gaussian noise channels(BI-AWGNCs).
文摘Area-efficient design methodology is proposed for the analog decoding implementations of the rate-l/2 accumulate repeat-4 jagged-accumulate （AR4JA） low density parity check （LDPC） code. The proposed approach is designed using optimized decoding architecture and regularized routing network, in such a way that the overall wiring overhead is minimized and the silicon area utilization is significantly improved. The prototyping chip used to verily the approach is tully integrated in a four-metal double-poly 0.35 lam complementary metal oxide semiconductor （CMOS） technology, and includes an input-output interface that maximizes the decoder throughput. The decoding core area is 2.02 mm2 with a post-layout area utilization of 80%. The decoder was successfully tested at the maximum data rate of 10 Mbit/s, with a core power consumption of 6.78 mW at 3.3 V, which corresponds to an energy per decoded bit of 0.677 nJ. The proposed analog LDPC decoder with low processing power and high-reliability is suitable lbr space- and power-constrained spacecraft system.
基金Supported by the National Key Basic Research and Development (973) Program of China (No.2009CB320300)
文摘The problem of improving the performance of linear programming（LP） decoding of low-density parity-check（LDPC） codes is considered in this paper.A multistep linear programming（MLP） algorithm was developed for decoding LDPC codes that includes a slight increase in computational complexity.The MLP decoder adaptively adds new constraints which are compatible with a selected check node to refine the results when an error is reported by the original LP decoder.The MLP decoder result is shown to have the maximum-likelihood（ML） certificate property.Simulations with moderate block length LDPC codes suggest that the MLP decoder gives better performance than both the original LP decoder and the conventional sum-product（SP） decoder.
基金Sponsored by the National Natural Science Foundation of China(Grant No.61402131)the China Postdoctoral Science Foundation(Grant No.2014M551245,2016T90293)+1 种基金the Heilongjiang Postdoctoral Science Foundation(Grant No.LBH-Z13105)the Fundamental Research Funds for the Central Universities(Grant No.HIT.NSRIF.201651)
文摘Structured flowchart( SFC) and Automatic code generation based on SFC( CG-SFC) have been widely used in software requirements,design and testing phases. Some CG-SFC tools such as Rhapsody have the ability to build flowchart and generate code,but they do not check whether a given flowchart is correct or structural. For unstructured error ‘goto'statements will be generated randomly. We proposed three algorithms and some error recognition criteria to solve those problems. Structure recognition algorithm can recognize Selection,While/for and do-while structures. Error recognition algorithm incorporating criteria can check all the errors. At last,we develop a CG-SFC system,and compared with existing Rhapsody,it shows that the proposed algorithms are correct and effective.
文摘信道编码参数的盲识别作为非合作通信和自适应调制编码(Adaptive Modulation and Coding,AMC)系统中的一项重要技术,近些年受到了更多关注.在第五代移动通信技术(5th Generation mobile networks,5G)中,其采用了低密度奇偶检验(Low-Density Parity-Check,LDPC)码作为数据信道的前向纠错码,但其使用了删余和填充导致传统的盲识别技术不再适用.本文提出了一种新的方案,借鉴置信传播(Belief Propagation,BP)译码迭代思路来进行盲识别.该方案基于传统平均对数似然比(Log-Likelihood Ratio,LLR)算法,进一步采用BP译码的思想对删余和填充比特进行迭代,以解决传统算法无法识别这部分比特的问题.仿真结果表明:与现有的相关算法相比,本文算法具有更好的性能.
