一种码率自适应信源信道联合编码系统

双LDPC码系统是新近出现的一种信源信道联合编码系统,该系统的性能虽然好但不稳定,在信源熵增加时会产生很高的误码平台。为了解决这一问题,提出了一种码率自适应双LDPC码系统,此系统采用码率自适应LDPC码作为信源码,当信源熵变化时可以灵活地调整信源码率,从而保证系统在高低不同的信源熵情况下都具有优秀、稳定的性能。仿真结果显示,在高低不同的信源熵情况下,所提出的码率自适应双LDPC码系统性能均好于传统双LDPC码系统,而且在误比特率为10-6时都没有出现误码平台。     

基于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的结果相比也很接近。     

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

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

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

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

一种利用信源冗余的Turbo均衡新算法

为克服无线衰落信道中严重的符号间干扰( ISI)的影响,提出了一种新的利用信源冗余的Turbo均衡算法。该算法将联合信源信道译码技术与Turbo均衡技术结合起来,在均衡、译码、信源之间建立起软信息交互的环路,有效提高了整体接收的性能。外信息传递( EXIT)图分析与计算机仿真均表明,尽管信源冗余给译码器带来的性能提升较为有限,但是将这部分信息反馈回均衡器后,在严重ISI信道,信源冗余度为70%时,整体接收的性能改善约为9.5 dB,基本达到了理想加性高斯白噪声( AWGN)信道下的误码性能。     

DVB-S2中IRA码EXIT曲线图分析方法研究

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

一种利用信源冗余的Turbo均衡新算法

为克服无线衰落信道中严重的符号间干扰(ISI)的影响,提出了一种新的利用信源冗余的Turbo均衡算法。该算法将联合信源信道译码技术与Turbo均衡技术结合起来,在均衡、译码、信源之间建立起软信息交互的环路,有效提高了整体接收的性能。外信息传递(EXIT)图分析与计算机仿真均表明,尽管信源冗余给译码器带来的性能提升较为有限,但是将这部分信息反馈回均衡器后,在严重ISI信道,信源冗余度为70%时,整体接收的性能改善约为9.5 dB,基本达到了理想加性高斯白噪声（AWGN）信道下的误码性能。     

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

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

基于Markov信源和LDPC编码的信源信道联合译码算法

本文通过利用Markov信源的冗余信息,提出了一种基于系统LDPC码编码器的信源信道联合译码算法（JSCD）。仿真结果显示,当信源中存在更多的冗余信息时,该JSCD算法可相应取得更好的系统性能。     

类卷积译码的容错解扰算法

针对自同步扰码系统的联合信源信道译码问题,本文将自同步扰码看作一种特殊的卷积编码,提出了类似卷积译码的软输入软输出(SISO)自同步去扰算法。该算法利用信源冗余更新扰码序列的外信息,在信道译码时作为先验信息进行译码,实现了自同步去扰与信道译码之间的软信息交互,充分利用了信源冗余信息,使得接收系统的性能得到了有效提升。仿真结果表明,在TPC编码条件下,当信源冗余度为70%时,联合信源信道译码的性能增益约为4.1dB。相比于单一纠错编码系统,当通信系统中存在自同步扰码时,联合信源信道译码具有更大的性能增益。      

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

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

基于非线性光纤环镜的OCDMA全光码字转换方法

提出了一种利用非线性光纤环镜(NOLND实现二维全光码字转换方法,设计了基于NOLM的码字转换方案,并进行了系统性能仿真分析.研究结果表明:该方法能够成功实现系统的数据传输;采用这种码字转换方法,系统误码率性能远远高于没有进行码字转换的系统性能.     

New decoding scheme for product accumulate code over an optical PPM channel

A new decoding scheme for product accumulate (PA) code over a space optical Poisson/ pulse-position modulation (PPM) channel is investigated. In this scheme, the PPM and the accumulator of the PA code are taken as a single inner code, decoded with an iterative demodulating-decoding technique based on Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm, rather than belief propagation (BP) algorithm in the original scheme. Simulation results show that this scheme provides much better bit error rate (BER) performance. At a BER of 10-5, the new scheme has a gain of 1.8 dB more than the original one. In addition, extrinsic information transfer (EXIT) charts are employed to analyze and compare the performance. The results indicate that the new scheme has not only better BER performance, but also lower error floor.     

大气弱湍流信道下松弛极化码译码方法

针对自由空间光通信中存在的大气湍流降低通信系统误码性能的问题,提出了基于松弛极化码的分段式极化码-循环冗余校验-串行抵消列表(PC-CRC-SCL)译码方法,并将其用于自由空间光通信系统中,在大气弱湍流强度下进行了仿真分析.仿真结果表明:与完全极化码的分段式CRC-SCL译码方法相比,在误码率为10-4时,基于松弛极化...     

Design of serially concatenated systems depending on the block length

Based on extrinsic information transfer (EXIT) charts, the convergence behavior of iterative decoding is studied for a number of serially concatenated systems, such as a serially concatenated code, coded data transmission over an intersymbol interference channel, bit-interleaved coded modulation, or trellis-coded modulation. Efficient optimization algorithms based on simplified EXIT chart construction are devised to find irregular codes improving the convergence of iterative decoding. One optimization criterion is to find concatenated systems exhibiting thresholds of successful decoding convergence, which are close to information-theoretic limits. However, these thresholds are approached only for very long block lengths. To overcome this problem, the decoding convergence after a fixed, finite number of iterations is optimized, which yields systems performing very well for short block lengths, too. As an example, optimal system configurations for communication over an additive white Gaussian noise channel are presented.     

多径下Turbo码IDMA网络编码中继合作系统性能分析

基于交织多址网络编码中继合作系统,分析了其采用Turbo编码后在多径信道环境下的系统性能。研究了该系统中利用不同交织器来实现多用户的多址接入方式以及网络编码的中继合作机制。将多径信道以及Turbo编码融入该系统中,搭建计算机仿真环境,通过仿真数据分析系统性能。仿真结果表明,在多径信道环境下,采用Turbo编码的交织多址网络编码中继合作系统的系统误码率有明显改善。     

Analysis of three-dimensional turbo codes

Our paper presents a detailed study of the three-dimensional turbo code (3D TC). This code which combines both parallel and serial concatenation is derived from the classical TC by concatenating a rate-1 post-encoder at its output. The 3D TC provides very low error rates for a wide range of block lengths and coding rates, at the expense of an increase in complexity and a loss in convergence. This paper deals with the performance improvement of the 3D TC. First, we optimize the distance spectrum of the 3D TC by means of the adoption of a non regular post-encoding pattern. This allows us to increase the minimum hamming distance (MHD) and thereby to improve the performance at very low error rates. Then, we propose a time varying construction of the post-encoded parity in order to reduce the observable loss of convergence at high error rates. Performance comparisons are made between the 3GPP2 standardized TC and the corresponding 3D code. The different improvement stages are illustrated with simulation results, asymptotical bounds, and EXIT charts.     

基于EXIT Chart的码率兼容LDPC码的构造

提出了一种码率兼容LDPC(Rate-Compatible LDPC,以下简称RC-LDPC)码的构造方法.通过该方法构造所得到的一个高码率LDPC码的校验矩阵(H矩阵)中所包含的其它低码率LDPC码的度分布对都是通过码率兼容约束EXIT Chart优化得到.仿真结果表明这样优化得到的各个码率的LDPC码性能与采用普通的最优约束EXIT Chart优化所得到的LDPC码的性能接近.     

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.     

BER analysis and power allocation for cooperative diversity networks with distributed Alamouti code

In this paper, we consider the distributed Alamouti code for a cooperative diversity network consisting of a source, a non‐regenerative relay, and a destination. While in the first time phase, the source radiates signals to both relay and destination; in the second time phase, the source and the relay cooperatively send signals to the destination by using an Alamouti code. Considering the amplify‐and‐forward protocol and independent Rayleigh fading, we first derive the exact average bit error rate performance in a single integral expression so that the system performance can be numerically evaluated. Then, based on a new approximation method of the Marcum Q‐function, we also give a tight upper bound for the system performance with a summation of a number of series components. We demonstrate through simulation that, in various operation scenarios with different channel quality and types of modulation, the results of the exact bit error rate expression accurately matches the simulation results, and the bound is tighter and more robust than existing approximation methods. Finally, we show that the analytic work also provides a method for the optimal allocation of power between the source and the relay in the second time phase. Copyright © 2013 John Wiley & Sons, Ltd.