基于组合交织器的高码率RA码的设计

针对一般交织器结构的重复累积(RA)码的奇偶校验矩阵中出现的短环问题,提出将一种组合技术应用于RA码的交织器结构,设计一种新型的组合交织器,使得产生的RA码具有高码率且无4环。仿真结果显示,在码长较长和高码率的情况下,组合交织的RA码译码性能优于传统交织器。     

基于Kirkman三元系的RA码交织器设计

重复累积(RA)码的随机交织器容易产生短环问题,增加了系统的误码率。通过平衡不完全区组设计中的Kirkman三元系设计,构造了KTS-RA码交织器。Kirkman三元系相遇数为1的特点使交织器中没有4环存在。RA码码率由所选平行类的个数确定,而Kirkman三元系含有较大的平行类数,因此码率可在较大范围内选择。仿真结果显示,KTS-RA码性能优于随机RA码。     

基于重复累积码的BICM系统译码算法

重复累积码(RA)由于其编译码复杂度低、性能接近香农限的优点,目前得到学术界的广泛关注。文中研究了RA码及其译码算法,并将其应用于比特交织编码调制(BICM)系统。针对低信噪比下基于RA码的编码调制系统误码率较高的问题,提出了一种改进算法,该算法通过在解调器和译码器之间引入迭代处理,利用译码器输出的外信息改善解映射结果,从而降低了系统误码率。仿真结果表明,在加性高斯白噪声(AWGN)信道、瑞利(Rayleigh)衰落信道下,BICM系统使用迭代的译码算法与原算法相比,误码性能有较明显提高。     

基于RA码的协作通信

协作通信能够通过多个用户之间共享天线及其他网络资源形成虚拟多天线阵列,有效抵抗无线信道中的衰落.重复累积码(RA)是可以实现线性时间编译码的好码,本文将RA码应用于协作通信模型中,从而可以提高协作通信系统的性能.     

一种旋转重复累积(RA)码的设计

文中分析了重复累积(RA)码的结构特点以及编码过程,设计了一种采用旋转结构的重复累积码.该码具有低密度码的特点和优点,同时具有旋转结构,编码简单,译码方便,易于调整码率,易于硬件实现等特点.文中给出了由置换子矩阵的索引确定交织序列的算法.仿真结果表明,长度适合的RA码性与通过复杂方法构造出来的码字性能接近.     

半双工译码转发中继信道下的空间耦合RA码设计

针对半双工译码转发中继信道,提出了一种可逼近三节点中继信道容量限的空间耦合RA码的设计方法。针对二进制删除信道,源节点分别向中继节点和目的节点发送空间耦合RA码,中继节点先正确恢复出源节点发送的空间耦合RA,然后再次编码产生额外的校验比特并转发给目的节点;目的节点结合中继节点发送的额外校验比特和源节点发送的空间耦合RA码进行译码,正确恢复出源节点的信息。为了评估所设计的空间耦合RA码在三节点中继信道下的渐近性能,推导了密度进化算法用于计算阈值。阈值分析结果表明,所提出的空间耦合RA码能够同时逼近源到中继链路和源到目的链路的容量限。同时,基于半双工二进制删除中继信道,仿真了所设计的空间耦合RA码的误码性能,结果表明,其误码性能与所推导的密度进化算法计算的阈值结果一致,呈现出逼近于容量限的优异性能,且优于采用空间耦合低密度奇偶校验(Low Density Parity Check,LDPC)码的性能。     

RA码与网络编码的联合设计

针对现有编码技术存在的编译码系统结构复杂、网络传输性能稳定性差等问题,文中提出了一种RA码与网络编码的联合设计方法。RA码融合了Turbo码编码和LDPC码译码各自的优点,采用RA码的BP译码算法,通过将RA码的译码器加入到PNC的信息计算流程中,将基于RA码的信道编码与PNC进行结合。最后,在MATLAB平台上进行仿真,基于AWGN信道获取SNR/BER性能曲线图。仿真结果显示,该方案有效简化了系统结构,降低了系统的信噪比和延迟性,提高了传输性能的稳定性。     

编码协作系统准循环重复累积码的联合设计与性能分析

重复累积(RA)码是一种特殊结构的低密度奇偶校验(LDPC)码,不仅具有LDPC码的优点,还能实现差分编码。针对LDPC编码协作系统编码复杂度高、时延长的问题,该文引入准循环RA(QC-RA)码,推导出信源节点和中继节点采用的QC-RA码对应的联合校验矩阵,基于公差构造方法设计该联合校验矩阵,并证明该方法设计的联合校验矩阵不存在围长为girth-4, girth-6的短环。理论分析和仿真结果表明,同等条件下该系统比相应点对点系统具有更优异的误码率性能。仿真结果同时表明,与采用一般构造QC-RA码或基于Z型构造QC-RA码相比,采用基于公差构造的联合设计QC-RA码的多信源多中继协作均可获得更高的编码增益。     

编码协作系统准循环重复累积码的联合设计与性能分析

重复累积(RA)码是一种特殊结构的低密度奇偶校验(LDPC)码,不仅具有LDPC码的优点,还能实现差分编码。针对LDPC编码协作系统编码复杂度高、时延长的问题,该文引入准循环RA(QC-RA)码,推导出信源节点和中继节点采用的QC-RA码对应的联合校验矩阵,基于公差构造方法设计该联合校验矩阵,并证明该方法设计的联合校验矩阵不存在围长为girth-4, girth-6的短环。理论分析和仿真结果表明,同等条件下该系统比相应点对点系统具有更优异的误码率性能。仿真结果同时表明,与采用一般构造QC-RA码或基于Z型构造QC-RA码相比,采用基于公差构造的联合设计QC-RA码的多信源多中继协作均可获得更高的编码增益。     

低复杂度的基于迭代译码的LDPC编码方法

基于迭代译码的LDPC编码方法,是一种分两个阶段编码的方法,然而对校验矩阵的列交换以及添加新行都会增加编码所需的存储资源.文中着力于寻找低复杂度实现该编码算法的校验矩阵,首先研究了重复累积(RA)码的基于迭代译码的编码实现,然后针对802.11n[1]和802.16e[2]中一种类RA码的LDPC码,提出了另一形式的分阶段编码,可以降低编码复杂度.     

Combinatorial Interleavers for Systematic Regular Repeat-Accumulate Codes [Transactions Letters]

This paper proposes novel interleaver and accumulator structures for systematic, regular repeat-accumulate (RA) codes. It is well known that such codes are amenable to iterative (sum-product) decoding on the Tanner graph of the code, yet are as readily encodable as turbo codes. In this paper, interleavers for RA codes are designed using combinatorial techniques as a basis for deterministic interleaver constructions, yielding RA codes whose Tanner graphs are free of 4-cycles. Further, a generalized RA code accumulator structure is proposed, leading to codes, termed w3RA codes, whose parity-check matrices have many fewer weight-2 columns than conventional RA codes. The w3RA codes retain the low-complexity encoding of conventional RA codes and exhibit improved error-floor performance.     

Iterative decoding and channel parameter estimation algorithms for repeat-accumulate codes

The sensitivity of the iterative decoder for repeat-accumulate (RA) codes to carrier phase and channel signal-to-noise ratio estimation errors is investigated, and efficient algorithms to estimate and correct these errors are developed. The behavior of RA codes with imperfect channel estimation is different from that of turbo codes, and correction algorithms specific to RA codes must be formulated. The proposed algorithms use the soft information generated within the iterative decoder, and thus, are not only hardware-efficient, but also offer excellent performance.     

Weighted nonbinary repeat-accumulate codes

Repeat-accumulate (RA) codes are random-like codes having remarkably good performance over an additive white Gaussian noise (AWGN) channel, like turbo and low-density parity-check (LDPC) codes. In this correspondence, we introduce an ensemble of random codes called "weighted nonbinary repeat-accumulate (WNRA) codes" whose encoder consists of a nonbinary repeater, a weighter, a pseudorandom symbol interleaver, and an accumulator over a finite field GF(q). They can be decoded in a simple way by applying the sum-product algorithm to their factor graphs over GF(q). Simulation results show that WNRA codes with proper weighting values over GF(4) or GF(8) are superior to binary RA codes on AWGN channels.     

规则RA码在混合信道上的高斯估计

将高斯估计方法运用到规则重复累积（RA）码在具有加性白色高斯噪声和删除干扰的混合信道上的性能分析中．导出了RA码在该信道上概率密度进化的递归等式和误码率的解析表达式。仿真结果验证了解析结果的正确性。因此解析结果可以直接用来预测RA码在混合信道上的性能。     

Design of repeat-accumulate codes for iterative detection and decoding

Extrinsic information transfer (EXIT) charts are used to design systematic and nonsystematic repeat-accumulate (RA) codes for iterative detection and decoding. The convergence problems of nonsystematic RA codes are solved by introducing a biregular, or doped, layer of check nodes. As examples, such nonsystematic codes are designed for multi-input/multi-output (MIMO) fading channels and are shown to operate close to capacity.     

On the asymptotic input-output weight distributions of some accumulate-based codes

In this letter, we show how to compute the asymptotic growth rate of input-output weight enumerator (AGR-IOWE) for some accumulate-based codes by using the sharp tools already developed. Numerical results on the AGR-IOWE for irregular repeat-accumulate (IRA) codes, systematic regular RA (SRA) codes, and concatenated zigzag codes are reported. It is observed that the SRA code has the same AGR-IOWE as a comparable concatenated zigzag code. For both SRA and concatenated zigzag codes, if keeping the code rate fixed, the increase of the grouping factor for the component punctured accumulate code may result in better asymptotic performance under maximum-likelihood decoding, but often worse performance under iterative sum-product decoding.     

系统RA码的基于WBF策略的改进BP译码算法

 针对重复累积(RA)码译码算法(BP算法和最小和算法)复杂度高或纠错性能下降的问题,将加权位翻转WBF的思想用于改进BP算法,提出了基于WBF策略的改进BP译码算法. 在每次迭代译码中若未能译出合法码字,则按一定规则进行位翻转操作,以期获得合法码字. 仿真结果表明,本算法能有效降低系统RA码的运算复杂度,且能保持优异的译码性能.     

LDPC Codes Based on Serially Concatenated Multiple Parity-Check Codes

This letter proposes a new class of serially concatenated codes that can be viewed as Low-Density Parity- Check (LDPC) codes. They are derived from Multiple Serially Concatenated Single Parity-Check (M-SC-SPC) codes, but they use different components, that we call Multiple Parity-Check (MPC) codes. In comparison with M-SC-SPC codes, the new scheme achieves better performance with similar complexity. The proposed codes can represent an alternative to the well-known family of Repeat Accumulate (RA) codes, being based on the same principles.