移动通信中用于高阶调制LDPC码译码器的一种低复杂度盲信噪比估计器

在LDPC（Low Density Parity Check,低密度校验）码软迭代译码器中,需要信道信噪比以生成接收比特先验信息.同时,为了提高频谱利用率,传输符号通常采用高阶调制.本文研究的即是如何从高阶调制符号中估计出信噪比以用于LDPC译码器.本文在只适用于BPSK调制的在线信噪比估计器的基础上,推导得到一种适用于8PSK调制的低复杂度盲信噪比估计算法-8PSKM-BSNRE,这种算法的思路还可被扩展应用于其他高阶调制符号.计算机仿真结果证明,8PSKM-BSNRE在应用于LDPC码译码器时具有较好的性能.     

并行级联Gallager码的动态最大外迭代次数译码方案的研究

PCGC(Parallel Concatenated Gallager Code,并行级联Gallager码)是将LDPC(Low Density Parity Check,低密度奇偶校验)码运用于并行级联编码形式而得到的一种新型编码,它的译码器采用双层迭代的形式.传统的PCGC译码器采用FMSIN(Fixed Maximum Super Iteration Number,固定最大外迭代次数)的方案,在信道SNR(Signal-to-Noise Ratio,信噪比)较低时会导致译码器平均迭代次数,也即译码器复杂度偏高.针对于此,本文提出一种根据信道信噪比状况动态调整译码器中最大外迭代次数的方案,并通过计算机仿真,验证了运用此方案后,译码器复杂度可得到较大程度的降低.     

置信传播译码算法的性能测度

本文基于树和有限状态机系统地推导了低密度校验码(LDPC)置信传播译码算法中的消息修正公式,引入了连续消息空间的概率测度,推导了常见二元对称信道输出分布和迭代过程中消息密度进化的计算公式,讨论了算法性能的参数化估计.这种计算分析工具可以用于独立于信道的算法收敛性分析,有助于设计LDPC码,有助于分析LDPC码译码器的量化效应并实现快速译码方案,使其获得在实时通信系统中的应用.     

基于EXIT图分析的BICM-ID系统SNR估计失配研究

研究了基于LDPC码的BICM-ID系统中,信道的SNR估计失配对于接收机性能的影响.提出了采用EX-IT图的分析方法,比较SNR过估计和欠估计对于解调器以及LDPC码译码器性能的影响,该方法不需要BER性能的仿真,简单直观.仿真结果表明不管是对于解调器还是LDPC码译码器,SNR过估计的影响相对较大,而欠估计则对性能的影响较小.     

光通信乘性噪声信道基于LDPC码的SNR估计方法

针对目前现有的信噪比(SNR)估计 方法不适用光通信中乘性噪声信道的问题,分析了乘性噪声信道下,SNR失配 对低密度奇偶校验(LDPC)码性能的影响,并通过仿真表明乘性噪声信道下 SNR精确估计的必要性。提出了一种基于量化的LDPC 码判决反馈的SNR估计方法,首先对接收到的光信号进行量化,利用 简化后的期望最大(EM)算法对量化后的SNR 进行一次粗估计,接着利用基于LDPC迭代译码的判决反馈结果对 SNR进行精估计。仿真结果表明,本方法能够在接收 信号的均值和噪声方差等参数未知情况下,能有效完成LDPC码迭代译码的辅助 工作;在误码率(BER)为10－5时,SNR估计后 ,LDPC码的译码性能距离理想情况下的译码性能,仅有约0.12dB以内损失。     

RS码与LDPC码的联合迭代译码

针对RS码与LDPC码的串行级联结构,提出了一种基于自适应置信传播(ABP)的联合迭代译码方法.译码时,LDPC码置信传播译码器输出的软信息作为RS码ABP译码器的输入;经过一定迭代译码后,RS码译码器输出的软信息又作为LDPC译码器的输入.软输入软输出的RS译码器与LDPC译码器之间经过多次信息传递,译码性能有很大提高.码长中等的LDPC码采用这种级联方案,可以有效克服短环的影响,消除错误平层.仿真结果显示:AWGN信道下这种基于ABP的RS码与LDPC码的联合迭代译码方案可以获得约0.8 dB的增益.     

MIMO-OFDM低延迟信道估计改进算法

为了克服多输入多输出正交频分复用(MIMO-OFDM)移动系统中采用空间复用技术的下行链路性能出现衰退现象,提出一种信道估计改进算法。它根据信道状态并通过一个决策指导方案为4×4 MIMO系统提供大约4bit/s/Hz的数据。通过使用LDPC短码,在LDPC译码器输出端采用MIMO-OFDM符号重建方法,达到提高估计精度的目的。在3GPP MIMO空间信道模型下进行了仿真验证,结果表明指定速率下的估计精度得到改善。     

多元LDPC编码调制系统CNN辅助迭代检测译码算法

针对相关噪声信道,提出了一种适用于多元LDPC码的深度学习辅助译码算法,将卷积神经网络(Convolution Neural Network,CNN)引入到基于硬信息的迭代大数逻辑算法中,以对抗相关信道噪声影响。在CNN与硬判决译码器之间的迭代能够减弱噪声对编码调制系统的影响,使得译码器可以获得更为准确的估计。为了充分发挥CNN的能力,对于经过高阶调制的复数形式信号数据,通过预处理转化为实数形式。仿真结果表明,相较于已有研究中提出的联合迭代检测译码结构,GF(64)域上的(42,21)多元LDPC码经64-QAM调制传输,CNN方案能够获得最高1 dB的性能增益,验证了其在抵抗相关信道噪声的有效性。     

基于生成矩阵的LDPC/Turbo码的构造及内外迭代译码新技术

提出了一种新的LDPC／Turbo码（简称L／T码）,及采用内外迭代译码新技术的简便实用的译码器。L／T码将原来Turbo编码中的两个子编码器分别用RSC码和LDPC码来代替,并由一个交织器连接。解码采用软输入／软输出的最大后验概率算法迭代执行,利用外信息的传递,每个子译码器都可以充分利用另一个在上一步计算中得到的结果。仿真在加性白高斯信道下进行,并将其结果和传统方法进行了比较。     

基于水印位的信道估计对100 Gb/sPDM-DQPSK光通信系统中低密度奇偶校验码纠错性能的提升

针对高速光通信系统中高斯白噪声和偏振模色散(PMD)引起的干扰问题,研究了一种改进的前向纠错方法,通过向低密度奇偶校验(LDPC)码中插入具有固定信息的比特位("水印位")来估计信道,并将其与译码算法结合构成新的算法。研究发现,若以误比特率(BER)低于10-9为标准,则在纠错性能方面,高斯信道中含16、32位水印位的LDPC码与卡方信道中传统的LDPC码相比,所需的光信噪比(OSNR)值可分别减少约0.25dB、0.35dB;当考虑高速光通信中的PMD时,在差分群时延(DGD)为20ps和30ps时,含16、32位水印位的LDPC码与传统LDPC码字相比,所需OSNR值可分别减少约0.63dB、0.98dB和1.16dB、1.87dB。     

LDPC译码器信道似然比信息存储模块优化设计

以CCSDS(太空数据系统咨询委员会)标准中1/2码率的LDPC码为例,分析了低密度奇偶校验码(LDPC)译码算法的特点,提出了在译码器的FPGA实现中采用乒乓操作的设计方法,优化译码器信道似然比信息存储模块结构,交替接收两帧数据,使译码器不间断地工作,提高了硬件资源利用率,使译码器的吞吐量增加一倍.     

高码率LDPC码译码器的优化设计与实现

本文以CCSDS推荐的7/8码率LDPC码为例,提出了一种适于高码率LDPC码译码器的硬件结构优化方法。高码率的LDPC码通常也伴随着行重与列重的比例较高的问题。本方法是在拆分校验矩阵的基础上,优化常用的部分并行译码结构,降低了高码率LDPC码译码时存在的校验节点运算单元(CNU)与变量节点运算单元(VNU)之间的复杂度不平衡,并由此提高了译码器的时钟性能。实验证明,本文方案提供的结构与常用的部分并行译码结构相比,节省硬件资源为41％;采用与本文方案相同的硬件资源而未经矩阵拆分的部分并行译码方案的码速率为本文方案的75％。     

Augmented Belief Propagation Decoding of Low-Density Parity Check Codes

We propose an augmented belief propagation (BP) decoder for low-density parity check (LDPC) codes which can be utilized on memoryless or intersymbol interference channels. The proposed method is a heuristic algorithm that eliminates a large number of pseudocodewords that can cause nonconvergence in the BP decoder. The augmented decoder is a multistage iterative decoder, where, at each stage, the original channel messages on select symbol nodes are replaced by saturated messages. The key element of the proposed method is the symbol selection process, which is based on the appropriately defined subgraphs of the code graph and/or the reliability of the information received from the channel. We demonstrate by examples that this decoder can be implemented to achieve substantial gains (compared to the standard locally-operating BP decoder) for short LDPC codes decoded on both memoryless and intersymbol interference Gaussian channels. Using the Margulis code example, we also show that the augmented decoder reduces the error floors. Finally, we discuss types of BP decoding errors and relate them to the augmented BP decoder.     

LP Decoding Corrects a Constant Fraction of Errors

We show that for low-density parity-check (LDPC) codes whose Tanner graphs have sufficient expansion, the linear programming (LP) decoder of Feldman, Karger, and Wainwright can correct a constant fraction of errors. A random graph will have sufficient expansion with high probability, and recent work shows that such graphs can be constructed efficiently. A key element of our method is the use of a dual witness: a zero-valued dual solution to the decoding linear program whose existence proves decoding success. We show that as long as no more than a certain constant fraction of the bits are flipped by the channel, we can find a dual witness. This new method can be used for proving bounds on the performance of any LP decoder, even in a probabilistic setting. Our result implies that the word error rate of the LP decoder decreases exponentially in the code length under the binary-symmetric channel (BSC). This is the first such error bound for LDPC codes using an analysis based on "pseudocodewords." Recent work by Koetter and Vontobel shows that LP decoding and min-sum decoding of LDPC codes are closely related by the "graph cover" structure of their pseudocodewords; in their terminology, our result implies that that there exist families of LDPC codes where the minimum BSC pseudoweight grows linearly in the block length     

Simple and Accurate Design of Low-Density Parity-Check Codes for Multi-Input Multi-Output Systems

In this paper we design an irregular low-density parity-check (LDPC) code for multiple-input multiple-output (MIMO) systems, using a simple extrinsic information transfer (EXIT) chart method. The MIMO systems considered are the optimal maximum a posteriori probability (MAP) detector and the suboptimal minimum mean square error soft-interference cancellation (MMSE-SIC) detector. The MIMO detector and the LDPC decoder exchange soft information and form a turbo iterative receiver. The EXIT charts are used to obtain the edge degree distribution of the irregular LDPC code which is optimized for the MIMO detector. It is shown that the performance of the designed LDPC code is better than that of conventional LDPC code which was optimized for either the Additive White Gaussian Noise (AWGN) channel or the MIMO channel without an explicit consideration of the given detector structure.     

基于MRF的高性能二进制LDPC码译码算法

二进制LDPC码译码改进算法主要是提升硬判决性能或者降低软判决计算复杂度。本文应用高斯-马尔可夫随机场(Markov Random Field,MRF)模型实现信源参数估计,对信道译码端接收的比特序列进行对数似然比修正,在译码时加入信源的残留冗余信息来增加译码器的纠错能力。信源估计修正系数自适应可变,是由误码率参数调控。在计算复杂度不变的情况下,基于MRF的LDPC码译码算法有效提高了译码性能,降低误比特率     

瑞利衰落信道下基于LDPC码USTM的MIMO系统

研究了一种联合低密度校验(LDPC,Low-Density Parity-Check)码和酉空时调制(USTM,Unitary Space-Time Modulation)技术在不相关瑞利平坦衰落(Rayleigh flat fading)下的多输入多输出信道(MIMO,Multiple-Input Multiple-Output)系统的性能.在无信道状态信息下,采用可并行操作的和积译码算法(SPA,Sum-Product Algorithm)的LDPCC-USTM级联系统具有优异的性能,并分析了不同LDPC码集下对系统性能的影响.仿真结果表明LDPCC-USTM级联系统比与未级联的相比有近23dB的编码增益,与基于Turbo码的USTM[6]系统相比有5dB多的编码增益,且基于非规则的LDPC码的级联系统比基于规则码有近1dB的编码增益.     

Quasi-cyclic LDPC codes using overlapping matrices and their layered decoders

Quasi-cyclic (QC) low-density parity-check (LDPC) codes have the parity-check matrices consisting of circulant matrices. Since QC LDPC codes whose parity-check matrices consist of only circulant permutation matrices are difficult to support layered decoding and, at the same time, have a good degree distribution with respect to error correcting performance, adopting multi-weight circulant matrices to parity-check matrices is useful but it has not been much researched. In this paper, we propose a new code structure for QC LDPC codes with multi-weight circulant matrices by introducing overlapping matrices. This structure enables a system to operate on dual mode in an efficient manner, that is, a standard QC LDPC code is used when the channel is relatively good and an enhanced QC LDPC code adopting an overlapping matrix is used otherwise. We also propose a new dual mode parallel decoder which supports the layered decoding both for the standard QC LDPC codes and the enhanced QC LDPC codes. Simulation results show that QC LDPC codes with the proposed structure have considerably improved error correcting performance and decoding throughput.