基于DRP交织器的Turbo码高码率设计

删余是构造高码率Turbo码的主要方法,删余方案对于Turbo码的性能有重要影响。介绍Turbo码的原理,将DRP交织器和删余方案综合考虑,实现Turbo码的高码率。仿真结果表明,该综合设计具有优异的性能。     

提高MIMO系统容量的检测算法研究

为了满足通信容量的需求，在发射端和接收端设置多元素天线阵列构成多输入多输出系统，可以显著提高频谱的利用率，基于贝尔实验室提出的非线性迫零检测算法，提出了反向迫零检测算法．理论和仿真证明，在相同信噪比条件下，反向迫零检测算法获得的系统容量高于非线性迫零检测以及线性迫零检测算法．与奇异值分解算法相比，该算法虽然得到的系统容量有所减小，但是由于所需的运算量相对较小，因而易于实现．     

联合编码抗干扰设计和实现

该文讨论了联合编码技术在无线通信抗干扰中的应用。Turbo码有逼近香农极限的纠错性能,其陡峭的过渡带意味着可以用较少的信噪比换取较大的纠错能力。在帧结构中插入适当的训练序列,可以实现准确的干扰检测。将干扰数据块清零和解交织后,其软信息能在解码器中得到最优的解码纠错结果。该文讨论了基于Turbo编解码和干扰检测的抗干扰原理和设计方法,使用MATLAB对设计中的关键参数和抗干扰性能进行了性能仿真,最后在FPGA中对设计进行了原型验证。     

高性能LDPC/Turbo码双模译码器的发展综述

目前LDPC码和Turbo码广泛应用于3G和4G商用移动通信系统中,并且在无线局域网、光纤通信、水下通信、视频和图象的加密以及网络安全等方面也发挥着重要的作用.由于全球在不同地区的移动通信设备只支持一种码,这使得移动通信有一定的地域局限性并影响通信质量.因此,通过对LDPC码和Turbo码译码过程的研究与结合,实现一种高性能的LDPC/Turbo码双模译码器具有重要意义.文章回顾了目前LDPC/Turbo码双模译码器的发展情况,并针对存在的不足进行分析和总结,最后介绍LDPC码和极化码未来发展的趋势.     

Turbo-CPM系统在窄带低信噪比条件下的性能研究

为克服窄带低信噪比系统传统接收机中解调器与译码器之间缺少信息共享的弊端,将迭代检测原理应用到连续相位调制(Turbo-CPM)系统中,提出了一种基于软输入软输出(SISO)算法的迭代检测方法,探讨了Turbo分量码结构、交织深度、迭代次数和连续相位调制(CPM)指数等主要参数对系统性能的影响,为实际应用中系统参数的选择提供了参考依据。加性高斯白噪声(AWGN)信道下的仿真结果表明:在窄带低信噪比特定条件下,基于Turbo码的八进制部分响应CPM(8M2RC)系统能够有效地改善系统的收敛性,降低地板效应出现的概率,提高系统的误比特率性能,同时兼顾了信息传输的有效性,提高了频带利用率。     

LDPC/Turbo双模译码器技术发展与前景综述

Turbo码和LDPC码的性能接近Shannon理论极限,有着很强的抗衰落和抗干扰的能力,因此特别适合在卫星通信、深空通信、移动通信、无线接入等无线通信系统中运用.目前LDPC/Turbo双模译码器技术还没有形成相对成熟、完整的理论体系,对相关研究的系统性总结工作仍然相对缺乏.我们首先回顾了LDPC/Turbo双模译码器的发展现状,其次详细总结了译码器结构以及SISO的实现方法,并对其进展情况和特点分别进行总结分析.最后,就双模译码器研究中现存的问题加以分析,并探讨了其发展趋势.     

采用Tomlinson-Harashima预编码的多天线多用户系统的低复杂度用户选择算法

针对采用Tomlinson-Harashima预编码(THP)的下行多天线多用户系统,提出了一种基于启发式Gram-Schmidt(G-S)正交化的低复杂度的贪婪用户选择算法.仿真结果表明,该算法的系统吞吐量性能非常接近最优遍历搜索的性能,优于迫零波束成型准正交用户选择(ZFBF-SUS)方案的性能,并且在容量域上具有渐进最优性.     

浅海水声信道中的一种带循环均衡的Turbo译码结构

针对浅海水声信道长时延、强多途干扰的特点,建立了一种新的带自适应循环判决反馈均衡的Turbo译码结构,并对其性能进行了仿真研究.该结构对典型的Turbo译码器进行了改进,使之不但能输出信息比特,同时又能输出校验比特,这些比特经硬判决、符号映射及信道交织后反馈回判决反馈均衡器,构成带自适应循环判决反馈均衡的Turbo译码结构.厦门港实测5途浅海水声信道仿真结果显示,该结构具有优良的抗多途性能,信噪比大于4dB时,误比特率小于10-5,比联合判决反馈均衡的Turbo译码结构提高了约2.5dB.     

极化码译码算法研究现状及发展前景

极化码是目前唯一被理论证明可以达到香农极限的线性纠错信道编码,已经成为5G标准的信道编码技术方案.针对具有线性复杂度的接续删除译码算法进行了仿真.针对接续删除算法的高译码时延,深入研究了每个时钟周期的计算特点,并且介绍了各种改进方案.针对上述存在的不足进行分析和总结得到了新的研究方向,最后说明了极化码与LDPC码、Turbo码多模译码器的研究可行性.     

极化码在OFDM水声通信中的应用研究

极化码（Polar code）因其高可靠性、实用的线性编、译码复杂度和理论上唯一可达香农极限等特点,成为信道编码领域新的研究热点。其编、译码方法的研究扩展至多种信道类型和应用领域,但在水声信道中的理论证明和应用研究相对较少且滞后。针对具有显著多途、多普勒扩散和有限带宽等复杂特性的水声信道,文章提出了与之相匹配的极化码信道编码机制;并结合正交频分复用（Orthogonal Frequency Division Multiplexing,OFDM）技术搭建水声通信仿真系统,研究极化码在OFDM水声通信系统中的性能表现;同时研究极化码在不同的水声信道模型、信道参数、码长、码率下的性能。仿真结果表明,在信噪比为4 dB时,码率为1/2的极化码在水声时变信道中的误码率可达10^-4～10^-5,优于低密度校验（Low density Parity Check,LDPC）、Turbo码,约有0.5～1 dB的性能增益,该极化码信道编码机制与水声信道相匹配,可有效提高水声通信的可靠性。     

Super-orthogonal space-time-frequency trellis coded OFDM

Super-orthogonal space-time trellis codes (SOSTTCs) given in the literature are full rate and provide full spatial diversity with high coding gain in narrowband quasistatic fading channels. The high number of parallel transitions in their trellis structure restricts their performance in wideband channels where the code performance suffers from multipath. Code design criteria are derived and a computer search based method is proposed to design full-rate optimised SOSTTCs exploiting full spatial and multipath diversity for multiple-input multiple-output orthogonal frequency division multiplexing systems. The proposed codes have codewords defined in space, time, and frequency. We evaluate the codeword error rates of the new 16, 32 and 64-state super-orthogonal space-time-frequency trellis codes for quadrature phase shift keying by computer simulation and show that they provide significant error performance improvement compared to their counterparts with equivalent delay length     

Turbo codes with symmetric and asymmetric component codes defined over finite fields of integers

Binary asymmetric turbo codes and non-binary turbo codes have been proposed to improve the bit error rate (BER) performance of parallel concatenated coding schemes. Both strategies have certain advantages that can be exploited when they are put together. This paper investigates turbo codes based on two component recursive systematic convolutional (RSC) codes defined over a finite field of integers. Symmetric and asymmetric non-binary turbo codes are obtained and their BER performance in both the `waterfall? and the `error-floor? regions is analysed. The results show good performance improvements when compared to binary and quaternary turbo codes with same throughput.     

Distributed source coding using symbol-based and non-binary turbo codes - applications to wireless sensor networks

A simple but powerful scheme for distributed source coding (DSC) based on the concept of binning and syndromes and non traditional turbo codes is proposed. The previous works on the compression with side information using turbo codes and the binning technique are focused on binary turbo codes. The source is considered to be binary or is converted to a binary stream. This conversion, however, reduces the redundancy that could be exploited by the compression algorithm. To achieve higher compression efficiency, the authors propose using a scheme based on a turbo decoder that decides over symbols rather than bits. In the same direction and for further performance improvement, at the cost of increased encoder complexity, they also present a DSC scheme based on non-binary turbo codes. The results demonstrate improved performance. Based on the suggested algorithms, a scheme for gathering real data in wireless sensor networks and assess the corresponding energy savings is proposed.     

DC-free trellis-based error-control codes

Trellis-based error-control (EC) codes, such as convolutional or turbo codes, are integrated with guided scrambling (GS) multimode coding to generate DC-free GS-convolutional/ turbo codes. On the basis of the generators of the convolutional/turbo code, we employ puncturing or flipping to ensure that the EC-coded sequences are DC-free. At the receiver, convolutional/turbo decoding is performed before GS decoding to circumvent the performance degradation that can occur when GS decoding is performed prior to EC decoding. Performance of the new DC-free GS-convolutional/turbo codes is evaluated in terms of both spectral suppression and bit error rate (BER). It is shown that the new codes can provide superior BER performance and approximately the same suppression of low frequencies as the conventional concatenation of convolutional/turbo codes and DC-free GS codes.     

Compound precoding: a pre-equalisation technique for the bandlimited Gaussian channel

Compound precoding is a state-of-the-art technique for combining trellis coding and decision-feedback equalisation (DFE) prior to upstream transmission on the telephone-line channel, and is an option in the International Telecommunications Union (ITU)-T V.92 standard. In this paper, we provide a detailed overview of this technique. We demonstrate that compound precoding combines in a straightforward manner with most practical trellis codes. We show that compound precoding exhibits a signal-to-noise ratio (SNR) gain with respect to other schemes which combine with trellis coding, and quantify this gain. We also show that, for stability of the compound precoder, the precoder feedforward filter must be decomposed into its constituent minimum phase (MP) and all pass (AP) components. Finally, a simulation study of V.92 upstream transmission demonstrates the shaping advantage of compound precoding over competitor techniques for pre-equalisation in this setting.     

Trellis complexity and pseudoredundancy of relative two-weight codes

Relative two-weight codes have been studied due to their applications to wiretap channel and secret sharing. It has been shown that these codes form a large family, which includes dual Hamming codes and subcodes of punctured Reed-Muller codes as special instances. This work studies the properties of relative two-weight codes with regard to efficient decoding. More specifically, the trellis complexity, which determines the complexity of Viterbi algorithm based decoding and pseudoredundancy that measures the performance and complexity of linear programming decoding are studied for relative two-weight codes. Separating properties of these codes have been identified and proved first. Based on the results of separating properties, the trellis complexity of binary relative two-weight codes is fully determined. An upper bound on the pseudoredundancy of binary relative two-weight codes is derived.     

Weight distribution of turbo codes with convolutional interleavers

A simple algorithm for the weight calculation of turbo codes with convolutional interleavers is presented. For codes with short interleaver lengths, the weight distributions are computed using conventionally proposed methods and then utilised together with the interleaver properties to determine the weight specifications for the code with a longer desired length. Based on the calculated weights, a new upper bound for the code is computed. It agrees with simulation results of the code performance in the error-floor region     

Bandwidth-efficient code design for coordinate interleaved coded cooperation

A two-user coordinate interleaved coded cooperation scheme is proposed for quasi-static Rayleigh fading channels, where cooperative and modulation diversity techniques are properly combined to take their full advantage. Two selective cooperation schemes are considered related to whether users know the cooperation case or not. Pairwise error probability (PEP) analysis is performed for all cooperation cases and code design criteria are derived from the PEP upper bounds. Bandwidth-efficient 4-, 8- and 16-state rate 2/4 cooperative quadrature phase shift keying (QPSK) trellis codes are obtained based on these criteria by means of exhaustive computer search. The error performances of the new codes evaluated by computer simulations show their superiority compared to the corresponding best space-time codes used in cooperation with coordinate interleaving. The simulation results are supported by an upper bound on the bit error probability developed using union bounding technique.     

平坦快衰落条件下天线数较多时空时格码的设计

空时格码技术是近年来无线通信领域的一个研究热点，空时格码的设计准则问题一直是该技术的一个难点。在平坦快衰落条件下且天线数目较多时，基于最小平方欧式距离最大化的空时格码设计准则虽然优于经典的距离－积准则，但仍不完善。从平方距离分布与平方距离和方－方和比分布的角度对此进行了改进，得到改进的准则以及性能为目前最优的新码。还对快慢2种衰落条件下码性能差异的原因给出了新的解释，并将改进的码设计准则应用于智贪码的设计。