PERFORMANCE EVALUATION OF LOW DENSITY PARITY CHECK CODES FOR DIGITAL RADIO MONDIALE (DRM) SYSTEM

In Digital Radio Mondiale (DRM) system, achieving good audio quality becomes a challenge due to its limited band-width of 9 or 10kHz and the very bad fading channels. Therefore, DRM needs highly efficient channel coding schemes. This paper, proposes the schemes which use the Low-Density Parity-Check (LDPC) coded Bit-Interleaved Coded Modulation (BICM) schemes for the implementation of DRM systems. Simulation results show that the proposed system is more efficient than the Rate Compatible Punctured Con volutional (RCPC) coded DRM system on various broadcast channels, and may be recommended as a coding technology for Digital Amplitude Modulation Broadcasting (DAMB) systems of China.

Application of the Henon Chaotic Model on to the Design of Low Density Parity Check Codes

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.

REGULAR LOW-DENSITY PARITY-CHECK CODES BASED ON SHIFTED IDENTITY MATRICES

This paper extends the class of Low-Density Parity-Check (LDPC) codes that can be constructed from shifted identity matrices. To construct regular LDPC codes, a new method is proposed. Two simple inequations are adopted to avoid the short cycles in Tanner graph, which makes the girth of Tanner graphs at least 8. Because their parity-check matrices are made up of circulant matrices, the new codes are quasi-cyclic codes. They perform well with iterative decoding.

Implementation of low-density parity-check codes decoder for CCSDS standard

The complexity/performance balanced decoder for low-density parity-check (LDPC) codes is preferred in practical wireless communication systems. A low complexity LDPC decoder for the Consultative Committee for Space Data Systems (CCSDS) standard is achieved in DSP. An approximate decoding algorithm, normalized min-sum algorithm, is used in the implementation for its low amounts of computation. To reduce the performance loss caused by the approximation, the parameters of the normalized min-sum algorithm are determined by calculating and finding the minimum value of thresholds through density evolution. The minimum value which indicates the best performance of the decoding algorithm is corresponding with the optimized parameters. In implementation, the memory cost is saved by decomposing the parity-check matrix into submatrices to store and the computation of passing message in decoding is accelerated by using the intrinsic function of DSP. The performance of the decoder with optimized factors is simulated and compared with the ideal BP decoder. The result shows they have about the same performance.

CONSTRUCTION OF NONSYSTEMATIC LOW-DENSITY PARITY-CHECK CODES BASED ON SYMMETRIC BALANCED INCOMPLETE BLOCK DESIGN

This paper studies the nonsystematic Low-Density Parity-Check(LDPC)codes based onSymmetric Balanced Incomplete Block Design(SBIBD).First,it is concluded that the performancedegradation of nonsystematic linear block codes is bounded by the average row weight of generalizedinverses of their generator matrices and code rate.Then a class of nonsystematic LDPC codes con-structed based on SBIBD is presented.Their characteristics include:both generator matrices andparity-check matrices are sparse and cyclic,which are simple to encode and decode;and almost arbi-trary rate codes can be easily constructed,so they are rate-compatible codes.Because there aresparse generalized inverses of generator matrices,the performance of the proposed codes is only0.15dB away from that of the traditional systematic LDPC codes.

THE Q-MATRIX LOW-DENSITY PARITY-CHECK CODES

This paper presents a matrix permuting approach to the construction of Low-Density Parity-Check (LDPC) code. It investigates the structure of the sparse parity-check matrix defined by Gallager. It is discovered that the problem of constructing the sparse parity-check matrix requires an algorithm that is efficient in search environments and also is able to work with constraint satisfaction problem. The definition of Q-matrix is given, and it is found that the queen algorithm enables to search the Q-matrix. With properly permuting Q-matrix as sub-matrix, the sparse parity-check matrix which satisfied constraint condition is created, and the good regular-LDPC code that is called the Q-matrix LDPC code is generated. The result of this paper is significant not only for designing low complexity encoder, improving performance and reducing complexity of iterative decoding arithmetic, but also for building practical system of encodable and decodable LDPC code.

Low-Complexity Optimization Algorithm for Irregular Low-Density Parity-Check Codes

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 results 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.

DESIGN OF LOW-DENSITY PARITY CHECK CODES FOR MIMO SYSTEMS WITH DOUBLY-ITERATIVE RECEIVERS

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.

Low-Density Parity-Check Codes: Research Status and Development Direction

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.

Data Gathering in Wireless Sensor Networks Via Regular Low Density Parity Check Matrix

A great challenge faced by wireless sensor networks(WSNs) is to reduce energy consumption of sensor nodes. Fortunately, the data gathering via random sensing can save energy of sensor nodes. Nevertheless, its randomness and density usually result in difficult implementations, high computation complexity and large storage spaces in practical settings. So the deterministic sparse sensing matrices are desired in some situations. However,it is difficult to guarantee the performance of deterministic sensing matrix by the acknowledged metrics. In this paper, we construct a class of deterministic sparse sensing matrices with statistical versions of restricted isometry property(St RIP) via regular low density parity check(RLDPC) matrices. The key idea of our construction is to achieve small mutual coherence of the matrices by confining the column weights of RLDPC matrices such that St RIP is satisfied. Besides, we prove that the constructed sensing matrices have the same scale of measurement numbers as the dense measurements. We also propose a data gathering method based on RLDPC matrix. Experimental results verify that the constructed sensing matrices have better reconstruction performance, compared to the Gaussian, Bernoulli, and CSLDPC matrices. And we also verify that the data gathering via RLDPC matrix can reduce energy consumption of WSNs.

基于帧交错的LDPC译码器流水结构设计

低密度奇偶校验码(LDPC)的译码器通常采用基于节点置信度更新迭代的算法,这种算法可以并行实现,具有非常高的吞吐量。在此提出了一种具有高硬件利用效率(HUE)的帧交错译码结构,并提供了一种用于层内节点重排序的动态规划方法,解决内存访问冲突问题。与现有的结构相比,该结构可以实现更高的硬件利用效率。

天基信息传输高效低复杂度LDPC译码算法研究

军事卫星通信由于需满足信息实时性、传输速率高、通信容量大以及符合星间链路信道的时变特性等要求,通常采用高编码增益、高吞吐量的信道编码方案。低密度奇偶校验(Low-Density Parity-Check,LDPC)码由于具备接近Shannon极限的优异纠错性能和可并行计算的特性成为卫星通信主导信道编码标准之一。目前卫星通信接收机的译码器模块设计仍存在诸如无法实时在线判断迭代停止、系统吞吐量受限、大量判决电路影响核心译码电路的低功耗和实时性等问题。考虑上述问题,以因子图模型为基础,针对空间数据系统咨询委员会(Consultative Committee for Space Data Systems,CCSDS)标准深空通信码型,将校验节点归一化满足概率进化图案与LDPC译码器状态紧密耦合,给出可实时在线判断迭代停止的最优停止准则,实现高性能、低复杂度的停止准则译码算法设计。当优先考虑高吞吐量时,误码率(Bit Error Rate,BER)性能退化0.13 dB,中低信噪比平均迭代次数(Average Number of Iteration,ANI)降低50%以上;当优先考虑纠错性能时,BER性能仅退化0.02 dB,同时大幅降低ANI。该译码算法为高效低复杂度LDPC译码器设计提供有效解决方案。

High Robust Broadcasting over DTMB-A with Low-rate LDPC Codes

As the 2nd generation digital terrestrial television broadcasting(DTTB)standard,digital terrestrial/television multimedia broadcasting-advanced(DTMB-A)can provide higher spectrum efficiency and transmission reliability by adopting flexible frame structure and advanced forward error correction coding compared with the 1 st generation DTTB systems.In order to increase the flexibility and robustness of the DTTB network,the frequency reuse scheme of factor one(reuse-1)is proposed,where the same RF channel is used by different stations covering the adjacent service areas.However,it demands a very low carrier-tonoise ratio(C/N)threshold below 0 dB at the DTTB physical layer.In this paper,a robust broadcasting technique is proposed based on DTMB-A with newly designed low-rate low density parity check(LDPC)codes.By adopting quasi-cyclic(QC)Raptor-like structure and progressive lifting method,the high performance low-rate LDPC codes are designed supporting multiple code lengths.Both density-evolution analyses and laboratory measurements demonstrate that DTMB-A with low-rate coding can complete the demodulation reliably with the C/N threshold below0 d B,which is one important necessary condition to support frequency reuse-1 scheme.

相关噪声下基于深度学习的LDPC码联合降噪译码算法设计

为了改善采用低密度奇偶校验(LDPC)码和高阶调制的无线通信系统在相关噪声下的译码性能,提出了一种联合优化降噪和译码的深度学习算法。降噪器中采用了残余收缩模块(RSBU),译码器采用了基于循环神经网络的神经网络最小和译码算法。在提出的联合降噪译码(JDD)算法中,利用复数神经网络在处理复信号方面比实数神经网络更有优势的特点,提出了一个复数RSCNN(CRSCNN),接收的复信号直接输入CRSCNN并利用新颖的联合优化降噪损失函数和译码损失函数的多任务学习策略来改善译码性能。仿真结果显示基于CRSCNN的JDD算法获得了比基于循环神经网络的神经网络最小和译码算法更好的译码性能。

一种非二进制LDPC与SCMA系统的联合检测译码方案

针对现有的一些低密度奇偶校验码(low-density parity code,LDPC)与稀疏码多址(sparse code multiple access,SCMA)系统联合检测方案复杂度高、误码率高、传输时延大、收敛速度慢的问题,提出一个非二进制低密度奇偶校验码(non-binary lowdensity parity code,NB-LDPC)与SCMA系统的联合检测译码(joint detection decoding,JDD)方案。在SCMA多用户检测部分改进基于阈值辅助的期望传播算法(expect propagation algorithm,EPA),在LDPC部分采用NB-LDPC并且在两节点更新过程选取部分消息状态值来改进译码算法,同时,利用联合因子图在联合检测译码信息交互时加入一种消息阻尼因子来提高收敛速度,最终完成联合检测译码过程。通过多角度仿真发现,该方案降低了复杂度和误码率,减小了传输时延,提高了收敛速度,并且在不同码本下均验证了所提方案的适用性。

基于双序列反序的(4,L)规则girth-8 QC-LDPC短码

围长较大的短码长准循环(QC)低密度奇偶校验(LDPC)码的显式构造对于QC-LDPC短码的理论研究与工程应用具有重要意义。首先提出一种基于成对策略的贪婪搜索算法,并根据此算法在列重J为4时的经验结果,归纳总结出一种具有双序列反序特征的指数矩阵。随后证明了该指数矩阵对于任意行重L均对应于围长为8的QC-LDPC码。与现有的典型显式构造方法即最大公约数(GCD)方法相比,新QC-LDPC码提供的码长显著降低。最后,将指数矩阵的拆分拼接和掩膜处理技巧与新QC-LDPC码结合起来,设计出了译码性能在高信噪比区超过5G NR LDPC码的合成码。

基于Stanley序列的QC-LDPC码新颖构造方法

针对准循环低密度奇偶校验(quasi-cyclic low-density parity-check,QC-LDPC)码的短环结构会严重影响码字纠错性能的问题,基于Stanley序列(Stanley sequence,SS)提出一种围长至少为8的QC-LDPC码新颖构造方法。从Stanley序列中选取某些特定元素构成一个呈递增关系的集合,利用穷举算法搜索出满足无环4和环6条件的元素得到另一个递增集合,构造相应的指数矩阵,得到其奇偶校验矩阵。仿真结果表明,在误码率(bit error rate,BER)为10-6时,所构造的SS-QC-LDPC码与同码率码长的其他QC-LDPC码码型相比,其净编码增益均有一定提升,因而其纠错性能较好,且无错误平层现象。此外,该构造方法的计算复杂度较低。

一种引入积分修正的二维信息大数逻辑LDPC译码算法

为了解决基于可靠度的迭代大数逻辑译码(Modified Reliability-based Iterative Majority Logic Decoding,MRBI-MLGD)算法的错误平层问题,提出了一种基于大数逻辑的低密度奇偶校验(Low Density Parity Check,LDPC)译码算法。所提算法在译码函数中引入积分修正项,实现了基于二维信息修正的译码策略,可有效降低错误平层。此外,与基于二元译码信息的的迭代大数逻辑译码(Binary Message Majority Logic Decoding,BM-MLGD)算法不一样,所提算法可适用于不同列重的LDPC码。仿真结果表明,所提译码算法在整个工作信噪比区间内都具有稳定的译码性能,表现出更好的普适性和鲁棒性。

基于LDPC码的动态阈值自适应调制编码算法

自适应调制编码技术能够根据信道状态自适应地选择调制和编码参数,从而最大化系统吞吐量。传统的自适应调制编码使用固定的信噪比阈值,但在实际中信噪比阈值会随信道改变而变化,此时传统方法的性能将显著降低。针对该问题,提出一种基于LDPC码的动态阈值自适应调制编码算法,利用LDPC码的译码后校验方程失败比例以及信噪比估计值对各模式的信噪比阈值进行动态调整。仿真结果显示,提出方法能够自适应地使各模式信噪比阈值收敛至当前信道对应的真实阈值附近,从而保证自适应模式选择的正确性,提高系统吞吐量。

Design of Irregular QC-LDPC Code Based Multi-Level Coded Modulation Scheme for High Speed Optical Communication Systems

In this paper, we focus on the design of irregular QC-LDPC code based multi-level coded modulation(MLCM) scheme by jointly optimizing the component code rate and the degree distribution of the irregular QC-LDPC component code. Firstly, the sub-channel capacities of MLCM systems is analyzed and discussed, based on which the optimal component code rate can be obtained. Secondly, an extrinsic information transfer chart based two-stage searching algorithm is proposed to find the good irregular QC-LDPC code ensembles with optimal component code rates for their corresponding sub-channels. Finally, by constructing the irregular QC-LDPC component codes from the designed ensembles with the aim of possibly enlarging the girth and reducing the number of the shortest cycles, the designed irregular QC-LDPC code based 16QAM and 64QAM MLCM systems can achieve 0.4 dB and 1.2 dB net coding gain, respectively, compared with the recently proposed regular QC-LDPC code based 16QAM and 64QAM MLCM systems.