级联卷积编码调制的研究

Turbo码与格状编码调制相结合可以取得大的编码增益和高的带宽效率。本文在Turbo码的基础上,综述了级联卷积编码调制,包括基本结构、设计准则等。     

空时Turbo码在未来移动通信中的研究

未来移动通信需要高效的编码、调制和分集技术。本文简述了能逼近shannon限的turbo码技术，以及能获得高信道容量的空时编码及调制技术，并且讨论了将这两种编码技术结合起来在移动通信中的构造方案，还展望了这种联合技术的应用及研究方向。     

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

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

π旋转LDPC码与高阶调制相结合的性能分析

低密度奇偶校验（LDPC）码具有译码简单、抗衰落性能好的特点，成为未来宽带移动通信的信道编码研究热点之一。一类π旋转LDPC码利用双对角线校验矩阵克服了以往LDPC码编码复杂度高的缺点；同时由于LDPC码的随机性，码长越长，其等效交织效果越明显。为了提高信道频带利用率，本文利用准规则π旋转LDPC码设计了一种不采用交织的高阶编码调制方案。     

线性码编码的MSK调制

本文研究了线性码编码的MSK调制系统。指出在插入一个简单差分编码网络后,线性码的优化问题在汉明距离与在欧氏距离上是一致的,从而解决了线性码编码的MSK调制问题。由于插入网络简单、便于实现,因此在MSK上使用最优线性码调制在实践上是可行的。     

极化码在LTE系统中的应用

为了实现极化码在LTE系统中的应用,提出了两类LTE系统中的极化码编码调制方案:联合极化编码调制(MLC-PCM)方案和比特交织极化编码调制(BIPCM)方案.其中,MLC-PCM方案凸显了通信系统中联合极化设计对系统性能提升的重要作用.此外,由于极化码的编码码长不一定为2的幂次,因此提出了一套简单易行且性能优异的极化码速率适配打孔方案,使得极化码的码长可以任意变化.最后,将极化编码调制方案与LTE系统Turbo码编码调制方案在所有MCS等级上进行了对比,仿真结果显示,在所有MCS等级上,极化编码调制方案都有明显性能增益.     

八状态网格码的编译码方法

本文介绍一种码率为２／３，约束长度为３的网格码调制（ＴＣＭ）码的编码和译码方法，与ＱＰＳＫ方式的相比，在不增加系统的频带宽度基础上，可以得到较高的编码增益。     

结合Turbo码的多级编码调制研究介绍

论文作者在对已有的多级编码调制方案深入研究的基础上，进一步研究了Turbo码编码技术，并把Turbo码作为分量码结合多级编码调制方案进行了理论研究．符合当今移动通信的大容量、高可靠性的要求．论文的主要创新点有，通过理论研究，证明了以Turbo码为分量码的多级编码方案比以往的以分组码及卷积码为分量码的方案具有一定的优越性。     

高阶调制系统下LDPC码优化设计

为了提高编码调制系统的整体编码增益,提出一种高阶调制系统下LDPC码的度分布优化方法.根据高阶调制符号中不同比特的误比特特性,将调制符号所经历信道建模为一组对称二进制输入加性高斯信道.在此基础上,推导了高阶调制系统下LDPC码高斯近似密度进化分析方法,并得到译码收敛条件.结合度分布约束关系及译码收敛条件,提出高阶调制系统下LDPC码的度分布优化问题及差分进化实现方法.仿真结果表明,设计的LDPC码在高阶调制系统中的渐进性能和误码性能优于基于比特优化映射的编码调制方案.     

衰落信道中自适应编码调制技术的研究

介绍了在慢衰落信道中自适应编码调制技术的基本原理,比较了几种自适应编码调制系统的技术特点,设计了一种基于Turbo乘积码的自适应编码调制多媒体通信方案。     

Channel coding with multilevel/phase signals

A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth. This is achieved by channel coding with expanded sets of multilevel/phase signals in a manner which increases free Euclidean distance. Soft maximum--likelihood (ML) decoding using the Viterbi algorithm is assumed. Following a discussion of channel capacity, simple hand-designed trellis codes are presented for 8 phase-shift keying (PSK) and 16 quadrature amplitude-shift keying (QASK) modulation. These simple codes achieve coding gains in the order of 3-4 dB. It is then shown that the codes can be interpreted as binary convolutional codes with a mapping of coded bits into channel signals, which we call "mapping by set partitioning." Based on a new distance measure between binary code sequences which efficiently lower-bounds the Euclidean distance between the corresponding channel signal sequences, a search procedure for more powerful codes is developed. Codes with coding gains up to 6 dB are obtained for a variety of multilevel/phase modulation schemes. Simulation results are presented and an example of carrier-phase tracking is discussed.     

On block-coded modulation using unequal error protection codes overRayleigh-fading channels

This paper considers block-coded 8-phase-shift-keying (PSK) modulations for the unequal error protection (UEP) of information transmitted over Rayleigh-fading channels. Both conventional linear block codes and linear UEP (LUEP) codes are combined with a naturally labeled 8-PSK signal set, using the multilevel construction of Imai and Hirakawa (1977). Computer simulation results are presented showing that, over Rayleigh-fading channels, it is possible to improve the coding gain for the most significant bits with the use of binary LUEP codes as constituent codes, in comparison with using conventional binary linear codes alone     

Coding theorems for the nonsynchronized channel

Capacity and error bounds are derived for a memoryless binary symmetric channel with the receiver having no a priori information as to the starting time of the code words. The channel capacity is the same as the capacity of the synchronized channel. For all rates below capacity, the minimum probability of error for the nonsynchronized channel decreases exponentially with the code-block length. For rates near channel capacity, the exponent in the upper bound on the probability of error for the nonsynchronized channel is the same as the corresponding exponent for the synchronized channel. For low rates, the largest exponent obtained for the nonsynchronized channel with conventional block coding is inferior to the exponent obtained for the synchronized channel. Stronger results are obtained for a new form of coding that allows for a Markov dependency between successive code words. Bounds on the minimum probability of error are obtained for unconstrained binary codes and for several classes of parity-check codes and are used to obtain asymptotic distance properties for various classes of binary codes. At certain rates there exist codes whose minimum distance, in the comma-free sense, is not only greater than one, but is proportional to the block length.     

自适应调制编码的VBLAST系统研究

在高速下行分组接入（HSDPA）中,采用自适应调制编码（AMC）技术能提高下行信道传输数据的能力。仿真信道编码采用Turbo码,将自适应调制编码技术应用于VBLAST系统以进一步提高系统性能和容量。因此系统能选择调制编码方式和信道编码方式,又能对抗衰落引起的突发错误。对该系统进行仿真表明：自适应调制编码的VBLAST系统能有效地提高数据传输效率和传输质量。     

Bandwidth‐efficient turbo coding over Rayleigh fading channels

Introduced in 1993, turbo codes can achieve high coding gains close to the Shannon limit. In order to design power and bandwidth‐efficient coding schemes, several approaches have been introduced to combine high coding rate turbo codes with multilevel modulations. The coding systems thus obtained have been shown to display near‐capacity performance over additive white Gaussian noise (AWGN) channels. For communications over fading channels requiring large coding gain and high bandwidth efficiency, it is also interesting to study bit error rate (BER) performance of turbo codes combined with high order rectangular QAM modulations. To this end, we investigate, in this paper, error performance of several bandwidth‐efficient schemes designed using the bit‐interleaved coded modulation approach that has proven potentially very attractive when powerful codes, such as turbo codes, are employed. The structure of these coding schemes, termed ‘bit‐interleaved turbo‐coded modulations’ (BITCMs), is presented in a detailed manner and their BER performance is investigated for spectral efficiencies ranging from 2 to 7 bit/s/Hz. Computer simulation results indicate that BITCMs can achieve near‐capacity performance over Rayleigh fading channels, for all spectral efficiencies considered throughout the paper. It is also shown that the combination of turbo coding and rectangular QAM modulation with Gray mapping constitutes inherently a very powerful association, since coding and modulation functions are both optimized for operation in the same signal‐to‐noise ratio region. This means that no BER improvement is obtainable by employing any other signal constellation in place of the rectangular ones. Finally, the actual influence of the interleaving and mapping functions on error performance of BITCM schemes is discussed. Copyright © 2002 John Wiley & Sons, Ltd.     

Turbo码在无线图像传输系统中的应用

通过Matlab仿真,信源编码采用矢量量化法,对静止图像通过无线瑞利(Rayleigh)衰落信道传输时,不采用信道编码和采用Turbo码作为信道编码两种情况进行了研究。依据失真度的主观评价,对两种情况下重构的图像进行了比较和分析。结果表明,Turbo码具有很强的抗衰落和抗多径效应能力,它不仅有效地提高了无线图像传输的可靠性,而且大大节省了系统发射功率。     

On multilevel block modulation codes

The multilevel technique for combining block coding and modulation is investigated. A general formulation is presented for multilevel modulation codes in terms of component codes with appropriate distance measures. A specific method for constructing multilevel block modulation codes with interdependency among component codes is proposed. Given a multilevel block modulation code C with no interdependency among the binary component codes, the proposed method gives a multilevel block modulation code C' that has the same rate as C, a minimum squared Euclidean distance not less than that of C, a trellis diagram with the same number of states as that of C, and a smaller number of nearest neighbor codewords than that of C . Finally, a technique is presented for analyzing the error performance of block modulation codes for an additive white Gaussian noise (AWGN) channel based on soft-decision maximum likelihood decoding. Error probabilities of some specific codes are evaluated by simulation and upper bounds based on their Euclidean weight distributions     

Fast turbo codes with space‐time block codes in fast fading channels

In this paper, space‐time block coding has been used in conjunction with Turbo codes to provide good diversity and coding gains. A new method of dividing turbo encoder and decoder into several parallel encoding and decoding blocks is considered. These blocks work simultaneously and yield a faster coding scheme in comparison to classical Turbo codes. The system concatenates fast Turbo coding as an outer code with Alamouti's G2 space‐time block coding scheme as an inner code, achieving benefits associated with both techniques including acceptable diversity and coding gain as well as short coding delay. In this paper, fast fading Rayleigh and Rician channels are considered for discussion. For Rayleigh fading channels, a fixed frame size and channel memory length of 5000 and 10, respectively, the coding gain is 7.5 dB and bit error rate (BER) of 10^?4 is achieved at 7 dB. For the same frame size and channel memory length, Rician fading channel yields the same BER at about 4.5 dB. Copyright © 2013 John Wiley & Sons, Ltd.     

Improved decoding of LDPC coded modulations

A coded modulation belief propagation (CMBP) decoder is proposed for decoding LDPC codes with multilevel modulations. The decoder takes into account statistical dependencies among bits originating in the same symbol, providing better performance than the marginal BP (MBP) decoder. Asymptotically it converges to MAP decoding. The CMBP decoder is based on a single-level coding (SLC) scheme and does not suffer from practical disadvantages of multi-level coding (MLC) schemes. Furthermore, the CMBP decoder can close the capacity gap of the bit interleaved coded modulation (BICM) SLC scheme. The BICM capacity gap increases when the modulation size increases and in scenarios where gray mapping is not possible.     

第3代移动通信系统中的信道编码技术研究

第3代移动通信系统IMT2000是当前的研究热点,而信道编码又是其关键技术之一.第3代移动通信系统中的业务范围和数据传输速率都大有提高,因此信道编码在语音业务上除了继承第2代系统的前向纠错(FEC)卷积编码技术外,还采纳了以Turbo码为代表的纠错能力更强的、先进的编码技术.讨论了CDMA2000[1]系统中的纠错编码技术,尤其是Turbo码在其中的应用.