比特交织IRA码编码调制

提出了不规则重复累积（IRA）码实现比特交织编码调制（BIRACM）的设计方案,并在AWGN和Rayleigh平衰落信道下进行了仿真。仿真结果表明：BIRACM的性能优于传统的网格编码调制和比特交织编码调制。     

Design of Rate-Compatible Irregular Repeat Accumulate Codes

We consider the design of efficient rate-compatible (RC) irregular repeat accumulate (IRA) codes over a wide code rate range. The goal is to provide a family of RC codes to achieve high throughput in hybrid automatic repeat request (ARQ) scheme for high-speed data packet wireless systems. As a subclass of low-density parity-check codes, IRA codes have an extremely simple encoder and a low-complexity decoder while providing capacity approaching performance. We focus on a hybrid design method which employs both puncturing and extending. We propose a simple puncturing method based on minimizing the maximal recoverable step of the punctured nodes. We also propose a new extending scheme for IRA codes by introducing the degree-1 parity bits for the lower rate codes and obtaining the optimal proportions of extended nodes through density evolution analysis. The throughput performance of the designed RC-IRA codes in hybrid ARQ is evaluated for both AWGN and block fading channels. Simulation results demonstrate that our designed RC codes offer good error correction performance over a wide rate range and provide high throughput, especially in the high and low signal-to-noise ratio regions.     

Bandwidth-Efficient Differential Space–Time Modulation

We propose an extension of differential unitary space–time modulation by an additional differential amplitude modulation for bandwidth-efficient transmission with noncoherent detection in a wireless system with multiple transmit antennas. The input bits are subdivided into two groups. The first group chooses a unitary matrix, whereas the second group determines the amplitude of the transmit matrix. We derive a noncoherent soft-output detector that does not require knowledge of channel state or statistical channel properties. The modulation parameters are optimized based on an analytical bit error rate (BER) analysis and mutual information. Furthermore, we propose a pragmatic scheme for outer forward error control coding and interleaving. Compared to differential unitary space–time modulation, the proposed scheme has lower detection complexity and provides superior performance for bandwidth-efficient transmission, particularly in time-varying channels.      

Spectra and Minimum Distances of Repeat Multiple–Accumulate Codes

In this paper, the ensembles of repeat multiple- accumulate codes (RAm), which are obtained by interconnecting a repeater with a cascade of m accumulate codes through uniform random interleavers, are analyzed. It is proved that the average spectral shapes of these code ensembles are equal to 0 below a threshold distance epsiv_m and, moreover, they form a nonincreasing sequence in m converging uniformly to the maximum between the average spectral shape of the linear random ensemble and 0. Consequently the sequence epsiv_m converges to the Gilbert-Varshamov (GV) distance. A further analysis allows to conclude that if m ges 2 the RA^m are asymptotically good and that epsiv_m is the typical normalized minimum distance when the interleaver length goes to infinity. Combining the two results it is possible to conclude that the typical distance of the ensembles RA^m converges to the Gilbert-Varshamov bound.     

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

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

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

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

基于置信传播译码的DRA码设计

该文通过重复器、组合器、交织器的联合优化,设计了一种没有小环的双重复累积码(DRA码);基于EXIT图优化设计了该码的度分布。研究结果显示,这类DRA码的度分布灵活;当采用置信传播译码时,错误平层低。     

基于新停止准则的多进制LDPC码加权符号翻转译码算法

为了降低多进制低密度奇偶校验(Low-Density Parity-Check,LDPC)码译码算法的复杂度,该文提出了基于新停止准则的符号翻转译码算法。该算法根据翻转函数和接收比特可靠性度量来确定对应的翻转符号,通过分析不满足校验方程个数的变化趋势来提前终止迭代。仿真结果表明,新算法在保持原有符号翻转译码算法误码性能不变的情况下,极大地减少了译码迭代次数,取得了译码性能和复杂度的折衷。     

一种基于分层译码和Min-max的多进制LDPC码译码算法

该文在现有译码算法的基础上提出一种高效的非二进制低密度奇偶校验码(NB-LDPC)译码方法,充分利用了分层译码算法与Min-max算法的优点,不但译码复杂度低、需要的存储空间小,而且可将译码速度提高一倍。应用该算法,对一种定义在GF(25)上的(620,509)码进行了仿真。该码的仿真结果表明：在相同误码率下,该文译码算法所需最大迭代次数仅为Zhang的算法(2011)的45%。     

基于可靠度差值特征的自适应判决多元LDPC译码算法

利用变量节点符号可靠度在迭代过程中的分布特征,提出了一种基于可靠度差值特征的自适应判决多元低密度奇偶校验（Low Density Parity Check,LDPC)译码算法。整个迭代过程划分为两个阶段,针对不同阶段节点可靠度的差值特征分别采用不同的判决策略:前期阶段,采用传统的基于最大可靠度的判决策略;后期阶段,根据最大、次大可靠度之间的差值特征,设计自适应的码元符号判决策略。仿真结果表明,所提算法在相当的译码复杂度前提下,能获得0.15~0.4 dB的性能增益。同时,对于列重较小的LDPC码,具有更低的译码错误平层。     

多层叠加LDPC码编码调制技术

 本文提出了一种多层叠加LDPC码编码调制系统.与传统的基于速率分配的多层编码调制技术相比,多层叠加编码调制系统具有很好的对称性和可扩展性.通过分析比较Turbo码译码算法与LDPC码的译码算法的复杂度,本文指出了多层叠加LDPC码编码调制系统具有译码简单,易于实现的优点.实验结果表明,多层叠加LDPC码编码调制系统可以在不牺牲带宽的同时获得较好的性能.     

Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity

This paper introduces ensembles of systematic accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity, per information bit, of encoding and decoding. It also introduces symmetry properties which play a central role in the construction of new capacity-achieving ensembles for the BEC. The results here improve on the tradeoff between performance and complexity provided by previous constructions of capacity-achieving code ensembles defined on graphs. The superiority of ARA codes with moderate to large block length is exemplified by computer simulations which compare their performance with those of previously reported capacity-achieving ensembles of low-density parity-check (LDPC) and irregular repeat-accumulate (IRA) codes. ARA codes also have the advantage of being systematic.     

非规则LDPC码在RICE信道中的性能分析

本文对非规则LDPC码在RICE信道的性能进行了分析和仿真,修正了BP译码算法,证明了RICE信道满足对称性,给出了RICE信道译码稳定性条件,推导出了RICE信道的Shannon容量限,采用VC编程对码长N=49512和3072进行了仿真,同时与同码长的Turbo码进行了比较;仿真结果表明LDPC码在码长N＝49512、码率R＝1/3时,与Shannon限相差1dB以内、在低信噪比时其性能优于Turbo码,以及LDPC码本身有很好的交织特性和抗衰落的能力;这进一步表明了LDPC码在包括RICE信道在内的各种信道中的性能都是非常优良的.     

多元速率兼容LDPC码的自适应编码调制系统研究

本文设计了一种基于有限域GF(q)上的多元速率兼容LDPC (RC-LDPC) 码结合高阶调制的自适应编码调制(Adaptive Coded Modulation, ACM) 系统。并提出了多元RC-LDPC码在独立和相关衰落信道下的增量冗余型自适应编码调制方案。本方案中多元LDPC码码率从1/3到5/6灵活变化,以较低的系统复杂度,有效提高了系统的频带利用率。仿真结果表明:随着系统吞吐率提高,多元ACM系统相对于二元ACM系统具有越来越明显的编码增益,最高可达约9 dB。      

A Unified Approach to the Construction of Binary and Nonbinary Quasi-Cyclic LDPC Codes Based on Finite Fields

A unified approach for constructing binary and nonbinary quasi-cyclic LDPC codes under a single framework is presented. Six classes of binary and nonbinary quasi-cyclic LDPC codes are constructed based on primitive elements, additive subgroups, and cyclic subgroups of finite fields. Numerical results show that the codes constructed perform well over the AWGN channel with iterative decoding.     

关于非规则LDPC码的基于度分布HARQ性能研究

该文提出了一种非规则LDPC码字基于度分布HARQ技术的改进方案。该方案在选择重传信息的过程中,不仅考虑了节点度分布的影响,而且考虑了非规则LDPC码字自身的不均等错误保护特性。与原始的基于度分布的HARQ方案相比,该方案使系统的误比特率和吞吐量指标得到了明显改善。     

基于Turbo乘积码的自适应编码调制技术研究

随着高速无线数据通信的发展,自适应调制技术逐渐成为业界研究的热点之一。研究了MQAM自适应调制技术,分析了自适应调整区间的划分方案,设计了基于Turbo乘积码的自适应编码调制方法,提高了系统的频谱利用率。     

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

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

非正则LDPC码在AWGN信道中的性能研究

简单介绍了非正则低密度奇偶校验(Low Density Parity Check,LDPC)码的结构。研究了其对数域概率译码的和积算法(Sum Product Algorithm,SPA),并对该算法的主要公式进行了推导,给出了其迭代核心部分的C语言实现伪码。对一种基于802.16e直接编码法生成的非正则LDPC码在高斯信道下进行了仿真分析,表明中短码长的非正则LDPC码已经具有优异的纠错性能。     

An Analog Squaring Technique Based on Asynchronous Sigma–Delta Modulation

Accurate analog squarers are required for different signal processing functions, such as amplitude modulation, frequency shifting, signal power estimation, and neural and image processing. Transistor-level analog squarers suffer from limited accuracy, particularly in modern deep-submicrometer technology, where the squared law of the MOS transistor in the saturation region is no longer valid. Based on the asynchronous sigma–delta modulator (ASDM), a new circuit that provides the squared value of the input signal is proposed. For slowly varying input signals, the filtered output is a replica of the squared input signal. In this brief, the proposed analog squarer is studied, and the analytical results are validated by simulation in the time domain. The effect of analog imperfections on the accuracy of the squarer is also analyzed by showing that a high signal-to-noise-plus-distortion ratio can be obtained for typical values of the mismatch and up to frequencies near half the maximum frequency of the ASDM limit cycle.