累加交叉并行级联单奇偶校验码的低复杂度译码算法

累加交叉并行级联单奇偶校验(A-CPSPC)码是一种新的纠错编码,其编码结构简单并具有较好的误比特率性能。该文针对A-CPSPC码的局部编码结构提出了一种低复杂度的最大后验(MAP)局部译码算法,该方法利用基于双向消息传递原则的和积算法(SPA)进行局部译码,消除了短环对局部译码性能的影响。分析及仿真表明,传统的置信传播算法并不适用于A-CPSPC码,该文提出的局部译码算法与基于BCJR算法的局部译码算法的性能一致,且复杂度更低。     

LDPC码的有效编码算法研究

LDPC码编码结构中短环的存在,导致译码时的重复迭代,降低了译码性能。介绍了一种编码算法,该算法先通过Richardson和Urbanke提出的Efficient编码算法对LDPC码的校验矩阵优化,然后再主要研究其二分图中长度为4的短环,提出了一种校验矩阵H的消4-环算法。最终实现了降低编码的复杂度的同时,译码效率也得到提高。     

低复杂度的LDPC码联合编译码构造方法研究

LDPC码因为其具有接近香农限的译码性能和适合高速译码的并行结构,已经成为纠错编码领域的研究热点。LDPC码校验矩阵的构造是基于稀疏的随机图,所以该类码字编码和译码的硬件实现比较复杂。以单位阵的循环移位阵为基本单元,构造LDPC码的校验矩阵,降低了LDPC码在和积算法下的译码复杂度。同时考虑到LDPC码的编码复杂度,给出了一种可以简化编码的结构。针对该方案构造的LDPC码,提出了消除其二分图上的短圈的方法。通过大量的仿真和计算分析,本文比较了这种LDPC码和随机构造的LDPC码在误码率性能,圈长分布以及最小码间距估计上的差异。     

基于弱群设计的酉空时星座图

一种利用Givens旋转矩阵构建酉空时星座图的新方法被提出。该方法构建的星座图由于具有弱群结构,当采用最大似然译时,接收端码元译码难度几译码复杂度较前大大降低。仿真结果表明,在发射天线数一定、星座容量大范围变化的情况下,该方法构建的星座图与目前各知名酉空时星座构建方法相比,其分级合及分级积计算复杂度及计算量降低,且分集合和分集积性能更为优异。     

一种用于RaptorQ码的降维快速译码算法

针对新型高效数字喷泉码RaptorQ码译码复杂度高的问题,利用它是系统码的特性,该文提出一种降维快速译码算法。该算法利用预先计算的逆矩阵,将译码过程中对接收编码约束矩阵的求逆转化为对更小维数矩阵的求逆,以降低译码复杂度。算法译码效果与现有译码算法等价。仿真结果表明,在信道符号删除概率较低(小于0.2)时,该算法的译码速度显著高于现有算法。     

一种快速编码的半随机LDPC码构造研究

低密度奇偶校验码(LDPC码)具有逼近Shannon限的优异纠错性能,在信道编码领域的应用越来越广泛,但是LDPC码的编码复杂性一直是制约其普遍应用的突出问题。奇偶校验矩阵的结构则直接决定着LDPC码的编码复杂度和译码性能。提出一种准双对角线结构的半随机LDPC码奇偶校验矩阵的构造方法,它具有IEEE 802.16e标准LDPC码的优异纠错性能和低编码复杂度,同时在码率、码长、基础校验矩阵和扩展因子等设计方面更具灵活性,能更好地适应工程实践的需要。采用这种构造方法,以(16 384,8 192)LDPC码为例进行快速迭代编码,能够获得优异的译码性能,可以用于实现高速率低复杂度的LDPC译码器设计。     

一种满速率空时分组编码CDMA系统及多用户接收方案

通过引入满速率空时分组码方案, 该文给出一种满速率空时分组编码CDMA系统模型, 并针对现有空时编码CDMA系统过高的译码复杂度, 提出一种低复杂度的多用户接收方案。该方案在通过类似多用户检测方法有效抑制多用户干扰后, 充分利用空时分组码的复正交性来简化原有方案高译码复杂度。与原有指数性译码复杂度相比, 该方案有着线性复杂度, 而且与满分集空时分组编码CDMA系统相比, 可实现满速率、低复杂度和部分分集, 有着相对多的空间冗余信息, 从而级联信道编码后可有效弥补部分分集所带来的性能损失。仿真结果表明在相同系统容量和级联码的情况下, 所给系统比相应的满分集空时编码CDMA系统有着低的误比特率。     

LDPC编译码算法分析

低密度奇偶校验(LDPC)码是一种线性分组码,其纠错能力可以接近香农极限。针对LDPC码的编译码问题,分析了校验矩阵的构造方法。给出了LDPC码的编码算法以及算法的实现结构。分析了基于软判决的置信传播(BP)译码算法,并给出了可以进一步降低计算复杂度的简化译码方法。通过仿真对比了不同的译码算法在高斯信道下的译码性能。     

一种自适应线性分散码方案的性能研究

针对线性分散码复杂度较高的问题,提出一种自适应线性分散码(ALDC),并将其应用于协作通信网络.该码可以根据当前信道状态,自适应地选择不同的调制阶数和分散矩阵,以在不同信噪比下获得最优的误码率性能,同时降低译码复杂度.分析了该码在协作系统中的编码与译码,并在误比特率性能上与传统空时分组码和LDC进行了仿真对比.结果表明,ALDC的误码率性能要优于传统的正交空时分组码和LDC,且译码复杂度较低.     

一种改进的空时Turbo网格码Log-MAP译码算法

提出应用于多天线系统的空时编码是未来无线移动通信中极具前途的一种技术.文中在详细论述了空时Turbo 网格码的基础上,针对Log-MAP译码提出了优化方案.仿真结果表明, 新的算法在大大降低译码复杂度的同时较好地保持了译码性能, 使其非常接近Log-MAP 算法的译码性能,同时也非常有利于硬件实现.     

LDPC码在IEEE802.16e标准中的编译码分析

为了能够在保证译码性能的同时进一步降低译码的复杂度,该标准还在译码的过程中引入由M Fossorier等人提出的BP-Based算法,并分析了这两类算法的实际译码性能。实验仿真结果表明,BP-Based算法与LLR-BP算法相比,在不同码长及不同码率条件下可以更好地实现译码算法度和译码性能的有效均衡,因而更加适合作为硬件译码器的优化算法而应用到实际的通信系统中。     

On the Performance and Implementation Issues of Interleaved Single Parity Check Turbo Product Codes

In this paper, both performance and complexity aspects of two-dimensional single parity check turbo product codes (I-SPC-TPC) are investigated. Based on the proposed I-SPC-TPC coding scheme, a parallel decoding structure is developed to increase the decoding throughput with minor performance degradation compared with the serial structure. For both decoding architectures, a new helical interleaver is constructed to further improve the coding gain. In terms of decoding algorithm, the extremely simple Sign-Min decoding is alternatively derived with only three additions needed to compute each bit's extrinsic information. For performance evaluation, (16, 14, 2)² single parity check turbo product code with code rate 0.766 over AWGN channel using QPSK modulation is considered. The simulation results using Sign-Min decoding show that it can achieve bit-error-rate of 10^?5 at signal-to-noise ratio of 3.8 dB with 8 iterations. Compared to the same rate and codeword length turbo product code composed of extended Hamming codes, the considered scheme can achieve similar performance with much less complexity. Important implementation issues such as the finite precision analysis, efficient sorting circuit design and interleaver memory management are also presented.     

Mixed-Q linear space-time codes

A new modulation method for linear space-time codes is proposed based on using constellations of different sizes for different symbols. It is shown that the proposed method significantly reduces the complexity of the sphere decoding algorithm. The complexity reduction is more pronounced in high-rate codes, where each code matrix carries a large number of symbols. We also show that the choice of constellation size provides a tradeoff between performance and complexity. Using this, some guidelines for choosing constellation size are presented. As one introduces more constellation disparity in the code, the complexity is further reduced, while the performance loss grows. Typically, a complexity reduction of one to two orders of magnitude can be achieved at the expense of about 3 dB coding gain. We suggest a simple modification in our design to reduce this loss to about 2 dB.     

Belief Propagation Decoding of Polar Codes Using Intelligent Post-Processing

Polar code is a channel coding method that has been proved to be able to reach Shannon capacity in the binary discrete memoryless channel. Because of the superior performance and low encoding and decoding complexity, polar code has attracted extensive attention in the industry and been chosen as the channel coding scheme for the control channel in the scenario of EMBB in 5G mobile communication. In this work, we propose an intelligent BP decoding algorithm of polar code based on smart post-processing. We employ the neural network to classify the output data of regular BP decoding into “good-bit” and “bad-bit” categories. We also design a strategy to search the bits, which are most probably incorrect from the “bad-bit” group for post-processing. Then, we can invert the “bad-bit” to correct the residual error in the Belief Propagation (BP) iterative process. Simulation results prove that the proposed algorithm can achieve at least 0.5dB error correction performance enhancement compared with the regular BP decoding with slight computation complexity and energy consumption increase.

     

基于Fourier矩阵的酉空时码设计

基于Fourier矩阵提出了一种新的酉空时码设计技术,依据满分集增益的定义证明了该码能获得满分集增益。在此基础上推导了该空时码成对错误概率的闭式上界,充分利用了该码的结构特点设计了一种快速极大似然解码算法,最后给出了误码性能的仿真结果。     

Further results on noncoherent block-coded MPSK [transactions papers]

A novel noncoherent block coding scheme, called noncoherent block-coded MPSK (NBC-MPSK), was proposed recently. In this paper, we present further research results on NBC-MPSK. We first focus on the rotational invariance (RI) of NBC-MPSK. Based on the RI property of NBC-MPSK with multistage decoding, a noncoherent near-optimal linear complexity multistage decoder for NBC-MPSK is proposed. Then we investigate a tree-search ML decoding algorithm for NBCMPSK. The derived algorithm is shown to have low complexity and excellent error performance. In this paper, we also utilize the idea of the NBC-MPSK to design noncoherent space-time block codes, called noncoherent space-time block-coded MPSK (NSTBC-MPSK). For two transmit antennas, we propose a signal set with set partitioning and derive the minimum noncohent distance of NSTBC-MPSK with this signal set. For the decoding of NSTBC-MPSK, we modify the ML decoding algorithm of NBC-MPSK and propose an iterative hard-decision decoding algorithm. Compared with training codes and unitary space-time modulation, NBC-MPSK and NSTBC-MPSK have larger minimum noncoherent distance and thus better error performance for the noncoherent ML decoder.     

An MMSE Decoding Algorithm without Matrix Inversion in QSTBC

The matrix inversion operation is needed in the MMSE decoding algorithm of orthogonal space-time block coding （OSTBC） proposed by Papadias and Foschini. In this paper, an minimum mean square error （MMSE） decoding algorithm without matrix inversion is proposed, by which the computational complexity can be reduced directly but the decoding performance is not affected.     

High-performance simple-encoding generator-based systematic irregular LDPC codes and resulted product codes

Low-Density Parity-Check (LDPC) code is one of the most exciting topics among the coding theory community.It is of great importance in both theory and practical communications over noisy channels.The most advantage of LDPC codes is their relatively lower decoding complexity compared with turbo codes,while the disadvantage is its higher encoding complexity.In this paper,a new ap- proach is first proposed to construct high performance irregular systematic LDPC codes based on sparse generator matrix,which can significantly reduce the encoding complexity under the same de- coding complexity as that of regular or irregular LDPC codes defined by traditional sparse parity-check matrix.Then,the proposed generator-based systematic irregular LDPC codes are adopted as con- stituent block codes in rows and columns to design a new kind of product codes family,which also can be interpreted as irregular LDPC codes characterized by graph and thus decoded iteratively.Finally, the performance of the generator-based LDPC codes and the resultant product codes is investigated over an Additive White Gaussian Noise (AWGN) and also compared with the conventional LDPC codes under the same conditions of decoding complexity and channel noise.     

矩形窗正交时频空检测算法

针对正交时频空(Orthogonal Time Frequency Space, OTFS)调制系统采用矩形窗函数时,信道矩阵结构复杂导致的鲁棒性差的问题,提出了一种基于时域处理和酉近似消息传递的检测算法。该算法首先添加循环前缀,将时域信道转换为分块对角矩阵;然后应用酉变换和近似消息传递建立迭代检测算法。仿真结果表明,所提检测算法能够在不增加复杂度的条件下有效提升检测精度和鲁棒性,特别是存在信道编码的条件下表现出2 dB的性能增益,使得该算法更适用于杂散多径、高速移动等环境,具有较高的应用价值。