基于EXIT曲线图的IRA码译码方法研究

基于IRA码迭代译码器结构,研究了EXIT曲线图性能分析方法。利用此方法求出几种码率IRA码的收敛门限值,并与高斯近似和密度进化方法求得的结果进行比较分析,探讨EXIT曲线图的优点和应用技术。     

LDPC码EXIT曲线图分析方法研究

EXIT曲线图是ten Brink发明的分析迭代和积译码收敛性能的有效工具。在描述了LDPC码迭代译码器结构基础上,详细地推导和研究了在AWGN信道中EXIT曲线图性能分析方法的计算方法。利用此方法确定了多种度分布LDPC码的收敛门限,并与利用高斯近似和密度进化得到的仿真结果进行比较分析,探讨EXIT曲线图的优点和进一步应用前景。     

纠删信道中LDPC码EXIT曲线匹配设计

基于单栓码和重复码EXIT图面积特性的分析,介绍了在二元纠删信道中,采用EXIT曲线匹配设计LDPC码度分布序列的最佳性:当内外码的EXIT曲线完全匹配时,所设计的度分布序列对应的速率能够达到信道容量;而当内外码EXIT曲线之间有间隔时,所设计的度分布序列对应的速率严格小于信道容量,并且间隔面积越大,所损失的速率越大.     

基于EXIT图和自适应微粒群算法的度分布对优化方法

综合EXIT图法和自适应微粒群优化(APSO)算法的优点,该文提出了一种基于EXIT图和APSO算法的非正则LDPC码度分布对优化方法。该方法设计了衡量EXIT曲线匹配程度的全局代价函数,并运用APSO算法对度分布对进行快速迭代优化,迭代过程中不需要固定CND曲线,可以获得EXIT曲线更加匹配的优化度分布对,以及更高的噪声门限。仿真结果表明,该方法在码结构优化方面有着很好的性能,且优化速度较高斯逼近法有了较大提高。     

基于EXIT图的Turbo均衡LDPC码性能分析及优化研究

EXIT图是用来分析级联系统中外信息迭代交换的重要工具,本文将Brink的基于EXIT图的优化MIMO信道LDPC码的思想推广到用于Turbo均衡的LDPC码性能分析及码结构设计优化中。文章首先给出了基于互信息的接收机具体分析模型,接着分别讨论了接收机分析模型中两个单元的EXIT曲线:线性MMSE均衡器和VND(variable node decoder)的联合EXIT曲线,CND(check node variable)的EXIT曲线的详细计算步骤。进一步以获得的EXIT曲线为基础,提出了用于Tur- bo均衡的LDPC码的码结构优化算法,EQVAC-EXIT(EQVAC:equalizer VND and CND)算法,算法能够自动地进行码集噪声门限值计算及优化次数分布对的搜索。最后的数值仿真结果表明,(3,6)正则码及优化得到的非正则码的噪声门限值距离Narayanan的结果仅相差0．03dB左右,优化得到的边的次数分布及节点的次数分布与Narayanan的结果相比也很接近。     

LDPC编码的空时BICM系统中的一种优化设计方案

本文基于外附信息转移(EXIT)图的系统优化设计思想,提出了一种级联预编码器的低密度奇偶校验码(LDPC)编码的空时比特交织编码调制(BICM-MIMO)系统设计方案.该方案在调制器的前端级联一个码率为1的累加器作为预编码器,在相邻的比特之间引入相关性,从而使得联合检测器的EXIT曲线发生变化,与空时MIMO系统下优化LDPC码的译码器EXIT曲线相匹配,并使两条曲线相交于EXIT图的右上角.和已有系统设计方案相比,该方案可提高系统的译码性能并能降低误码的错误平层(error floor).     

基于EXIT图的SCMA通信系统多用户检测算法收敛性分析

消息传递算法（message passing algorithm,MPA）是基于稀疏码多址接入（sparse code multiple access,SCMA）技术中码本的稀疏性,提出的一类接近联合最优的多用户检测算法。针对现有的基于并行策略和串行策略的MPA算法,存在算法收敛性论述缺乏理论分析的问题,该文通过外信息转移图（extrinsic information transfer,EXIT）技术分析MPA算法的收敛性。首先将SCMA接收机检测器分为函数节点译码器和变量节点译码器,然后给出译码器的EXIT图的理论分析,最后通过比较两类算法的EXIT曲线估算出达到收敛状态所需的迭代次数。仿真结果验证了EXIT图分析的正确性。      

基于可变长纠错码和掺杂调制的联合信源信道编码调制方法

针对无线通信中存在的频谱资源有限、信道衰落和多径效应等问题，该文将可变长纠错(VLEC)编码和掺杂调制相结合，提出一种新的联合信源信道编码调制方法。该方法利用外信息转移(EXIT)图分析系统的迭代译码特性，优化设计可变长纠错编码和掺杂调制的参数。主要包括：(1)设计有更大自由距离的可变长码，使其具有纠错能力；(2)设计优化掺杂调制的掺杂和映射规则的方法，使掺杂调制EXIT曲线与可变长纠错编码EXIT曲线匹配，降低迭代译码收敛所需的信噪比(SNR)。仿真结果表明，在AWGN信道和瑞利衰落信道下，该联合信源信道编码调制方法与分离的信源信道编码调制方相比，迭代收敛所需的信噪比减小了1 dB以上，相比其他的联合信源信道编码调制方法，也有更好的误码率性能。在误码率为10–4时，该方法距离AWGN信道和瑞利衰落信道的香农限分别为0.7 dB和1.0 dB。     

解码前传半双工中继信道下协作LDPC码设计

为逼近解码前传半双工中继信道容量,该文提出一种协作LDPC编码结构及度分布优化方法。与双层删除LDPC码不同,该结构将中继校验比特视为协作LDPC码的一部分,目的端利用从信源和中继接收的消息进行联合译码获得信源信息。为了分析协作LDPC码性能,拓展传统外信息转移(EXIT)图,推导了基于消息错误概率的双层EXIT图噪声门限分析方法。在此基础上,提出了协作LDPC码度分布优化方法,采用差分进化算法搜索了一组具有最大噪声门限的协作LDPC码。实验仿真证明,与双层删除LDPC码相比,协作LDPC码的性能得到了不同程度的改善。     

不规则重复累积码的分析与仿真

本文主要研究非规则重复累积码(Irregular RepeatAccumulate,IRA码)的编译码原理。着重整理与实现了IRA码的编译码方法 ,对IRA码译码算法进行了研究。最后,对IRA码进行矩阵整理、仿真和分析,从而得出该码编译码性能以及相应的分析结果。     

Near-Capacity Dirty-Paper Code Design: A Source-Channel Coding Approach

This paper examines near-capacity dirty-paper code designs based on source-channel coding. We first point out that the performance loss in signal-to-noise ratio (SNR) in our code designs can be broken into the sum of the packing loss from channel coding and a modulo loss, which is a function of the granular loss from source coding and the target dirty-paper coding rate (or SNR). We then examine practical designs by combining trellis-coded quantization (TCQ) with both systematic and nonsystematic irregular repeat-accumulate (IRA) codes. Like previous approaches, we exploit the extrinsic information transfer (EXIT) chart technique for capacity-approaching IRA code design; but unlike previous approaches, we emphasize the role of strong source coding to achieve as much granular gain as possible using TCQ. Instead of systematic doping, we employ two relatively shifted TCQ codebooks, where the shift is optimized (via tuning the EXIT charts) to facilitate the IRA code design. Our designs synergistically combine TCQ with IRA codes so that they work together as well as they do individually. By bringing together TCQ (the best quantizer from the source coding community) and EXIT chart-based IRA code designs (the best from the channel coding community), we are able to approach the theoretical limit of dirty-paper coding. For example, at 0.25 bit per symbol (b/s), our best code design (with 2048-state TCQ) performs only 0.630 dB away from the Shannon capacity.     

空间双向中继多元调制编码系统及设计方法

针对空间网络信息交换速率和容量要求越来越高的问题,提出了采用多元调制编码的物理层网络编码有效提高双向中继无线网络信息交换速率的方案。该方案中2个用户使用完全相同的多元非规则重复累积（IRA）调制编码,从而使中继节点可以直接从叠加信号中恢复网络编码信息。通过EXIT分析方法,得到了双向中继信道下度分布优化的多元IRA调制编码。仿真结果表明,所提方案相对传统时分多路方案而言可以将信息交换时间缩短约48%。     

EXIT-chart aided near-capacity Irregular Bit-Interleaved Coded Modulation design

A near-capacity irregular Bit-Interleaved Coded Modulation based Iterative Decoding (Ir-BICM-ID) aided scheme is proposed. The irregular design of the scheme pervades the three basic components of BICM-ID, namely the encoder, the unity-rate precoder and the bit-to-symbol mapper. As a result, irregular BICM-ID schemes constituted by irregular components are created, which are capable of approaching the capacity of coded modulation. This is achieved by creating a marginally open EXtrinsic Information Transfer (EXIT) chart tunnel, and exploiting the theorem that the open tunnel's area is characteristic of how closely the scheme operates to the channel's capacity. The proposed Ir-BICM-ID scheme employs Irregular Convolutional Codes (IrCC), Irregular Unity-Rate Codes (IrURC) and Irregular Mappers (IrMapper).     

Bandwidth-Efficient Modulation Codes Based on Nonbinary Irregular Repeat–Accumulate Codes

Using nonbinary low-density parity-check (LDPC) codes with random-coset mapping, Bennatan and Burshtein constructed bandwidth-efficient modulation codes with remarkable performance under belief propagation (BP) decoding. However, due to the random nature of LDPC codes, most of the good LDPC codes found in the literature do not have a simple encoding structure. Thus, the encoding complexity of those LDPC codes can be as high as O(N ²), where N is the codeword length. To reduce the encoding complexity, in this paper, nonbinary irregular repeat-accumulate (IRA) codes with time-varying characteristic and random-coset mapping are proposed for bandwidth-efficient modulation schemes. The time-varying characteristic and random-coset mapping result in both permutation-invariance and symmetry properties, respectively, in the densities of decoder messages. The permutation-invariance and symmetry properties of the proposed codes enable the approximations of densities of decoder messages using Gaussian distributions. Under the Gaussian approximation, extrinsic information transfer (EXIT) charts for nonbinary IRA codes are developed and several codes of different spectral efficiencies are designed based on EXIT charts. In addition, by proper selection of nonuniform signal constellations, the constructed codes are inherently capable of obtaining shaping gains, even without separate shaping codes. Simulation results indicate that the proposed codes not only have simple encoding schemes, but also have remarkable performance that is even better than that constructed using nonbinary LDPC codes.     

Layered steered space-time codes using multi-dimensional sphere packing modulation

We present a novel multi-functional Multiple-Input Multiple-Output (MIMO) scheme, that combines the benefits of Space-Time Codes (STC), of Vertical Bell Labs Layered Space- Time (V-BLAST) scheme as well as of beamforming. To further enhance the attainable system performance and to maximise the coding advantage of the proposed transmission scheme, the system is also combined with multi-dimensional Sphere Packing (SP) modulation. Additionally, we quantify the capacity of the proposed multi-functional MIMO aided multi-dimensional SP arrangement and propose a novel technique of computing an upper limit on the achievable bandwidth efficiency of the system based on EXtrinsic Infomation Transfer (EXIT) charts. Further system performance improvements can be attained by serially concatenating our proposed scheme with an outer code together with a Unity-Rate Code (URC), where three different receiver structures are created by varying the iterative detection configuration of the constituent decoders/demappers. Moreover, the convergence behaviour of the proposed schemes is evaluated with the aid of EXIT charts. Explicitly, the three proposed systems are capable of operating within 0.9 dB, 0.6 dB and 0.4 dB of the maximum achievable rate limit. Additionally, the three stage assisted SP aided scheme is capable of outperforming its counterpart employing QPSK by 1 dB at a BER of 10?⁶.     

Serially-Concatenated Low-Density Generator Matrix (SCLDGM) Codes for Transmission Over AWGN and Rayleigh Fading Channels

Low density generator matrix (LDGM) codes are a particular class of low density parity check (LDPC) codes with very low encoding complexity. Single LDGM codes present high error-floors, which can be substantially reduced with the serial concatenation of two LDGM (SCLDGM) codes. We propose a technique to obtain good SCLDGM codes using extrinsic information transfer (EXIT) functions in a novel way. Although the optimization is performed for AWGN channels with binary signaling, the resulting codes are also optimal for AWGN and perfectly-interleaved Rayleigh fading channels with non-binary signaling and perfect CSI at reception, provided that Gray mapping is utilized. Optimized regular and irregular SCLDGM codes outperform heuristically-designed LDGM codes existing in the literature, and have a performance similar to or better than that of irregular repeat accumulate (IRA) codes.     

Extrinsic information transfer functions: model and erasure channel properties

Extrinsic information transfer (EXIT) charts are a tool for predicting the convergence behavior of iterative processors for a variety of communication problems. A model is introduced that applies to decoding problems, including the iterative decoding of parallel concatenated (turbo) codes, serially concatenated codes, low-density parity-check (LDPC) codes, and repeat-accumulate (RA) codes. EXIT functions are defined using the model, and several properties of such functions are proved for erasure channels. One property expresses the area under an EXIT function in terms of a conditional entropy. A useful consequence of this result is that the design of capacity-approaching codes reduces to a curve-fitting problem for all the aforementioned codes. A second property relates the EXIT function of a code to its Helleseth-Klove-Levenshtein information functions, and thereby to the support weights of its subcodes. The relation is via a refinement of information functions called split information functions, and via a refinement of support weights called split support weights. Split information functions are used to prove a third property that relates the EXIT function of a linear code to the EXIT function of its dual.     

EXIT functions for binary input memoryless symmetric channels

Use of extrinsic information transfer (EXIT) functions, characterizing the amplification of mutual information between the input and output of the maximum a posteriori (MAP) decoder, significantly facilitates analysis of iterative coding schemes. Previously, EXIT functions derived for binary erasure channels (BECs) were used as an approximation for other channels. Here, we improve on this approach by introducing more accurate methods to construct EXIT functions for binary-input memoryless symmetric (BMS) channels. By defining an alternative pseudo-MAP decoder coinciding with the MAP decoder over BEC, we provide an expression for the EXIT functions of block codes over BEC. Furthermore, we draw a connection between the EXIT function over BEC and the EXIT function over the BMS channel under certain conditions. This is used for deriving accurate or approximate expressions of EXIT functions over BMS channels in certain scenarios.