瑞利衰落信道上的6PSK环码

本文在文献「１０」的基础上，进一步探讨６ＰＳＫ环码在瑞利衰落信道上的误码特性，用分量码重量集合给出了衰落条件下误码概率指数Δ的表达式，并通过例子与相同构造条件下的陪集码进行了比较，证明了在瑞利衰落条件下，环码也优于任何一种构造的陪集码。     

规则LDPC码在瑞利平坦衰落信道下的设计和仿真

针对规则LDPC码,采用了行列都均匀的(evenboth)随机构造H的方式,在瑞利平坦衰落信道下和卷积码的性能进行了对比,证明了规则LDPC码在中短帧传输下在瑞利平坦衰落信道的优异性能。这对LDPC码应用于实际无线通信系统具有重要参考价值。     

卷积LDPC码在瑞利信道下的性能分析

本文研究了卷积LDPC码在瑞利衰落信道下的译码性能,给出了瑞利信道下,卷积LDPC码的译码算法,在同等条件下对比了卷积LDPC码在高斯信道和瑞利衰落信道下的译码性能。     

Turbo码联合信道估计在瑞利衰落信道中的运用

如果将信道衰落信息提供给Turbo译码器,则在瑞利衰落信道下更能发挥Turbo码的优良特性。该文分析了在瑞利衰落信道下Turbo译码算法,用Jake方法模拟瑞利衰落信道,采用将多时隙加权平均(WMSA)信道估计和Turbo码结合起来的算法。仿真结果显示此系统性能优异。     

衰落信道中不同集分割的多级编码调制方案的性能研究

本文以MLC系统各等价信道的信道容量为依据^[1],选用不同码长的BCH码系列作为MLC系统中各级的分量码,通过计算机模拟,比较了三种不同的集分割方法所构成的MLC/MSD方案,分别在AWGN和Rayleigh衰落信道中、8ASK调制方式下的性能.模拟结果表明:UP分割在AWGN信道中具有最好的性能;BP分割可自适应于AWGN和Rayleigh衰落混合的移动衰落信道,是MLC方案应用于移动衰落信道中的最佳集分割方案.     

基于校验矩阵构造BCM网格的一般方法

BCM是在不牺牲信道带宽的前提下，为提高数字传输系统的可靠性而使编码和调制实现最佳联合的一种有效途径，只有构造适当的BCM网格，才有可能采用Viterbi算法以较低的复杂度实现最大似然比译码。本文基于分组码的校验矩阵，提出了一种构造BCM网格的一般方法，该方法克服了以往BCM的Viterbi译码只局限在某些特殊情形的不足，对构成BCM的成分码数目，复杂性和次序未作任何限制，在理论上，可适用于任意的BCM网格译码器的构造。利用MQAM调制星座设计了多种BCM方案，并进行了计算机仿真。仿真结果表明：采用这种一般方法构造的Viterbi译码网格和以前采用特殊方法构造的网格一样，能在高斯信道中可获得最大似然比译码，在瑞利、莱斯信道中也可获得较高的译码性能。     

多元LDPC码与二元LDPC码的性能比较

介绍了一种基于有限域构造的多元准循环LDPC码的编码方法,译码采用基于快速傅立叶变换的和积算法.通过对多元LDPC码与二元LDPC码在高斯和衰落信道下的性能仿真比较,发现调制方式为BPSK时,二元LDPC码的性能在高斯信道和独立瑞利衰落信道下好于多元LDPC码,在相关衰落信道中则是多元LDPC码表现更佳;而当调制方式为16-QAM时,多元LDPC码在不同信道环境中的性能均好于谱效率相同的二元LDPC码.     

移动通信系统中空时格码的改进设计

本文根据空时格玛在快瑞利衰落信道下的成对错误概率上界，得出不同发射天线的码设计具有独立性，进而提出一种改进的快瑞利衰落信下空时格码的设计准则，当信道衰落快慢介于准静态和快瑞利衰落之间时，空时格码的设计方法也可做相应的改进，分析及仿真结果表明，由改进方法设计的空时格码比由传统方法得出的具有更优的性能。     

衰落信道中Turbo码的应用研究

Ｔｕｒｂｏ码以其优异的性能而迅速成为近年来信道编码领域研究的热点。本文针对无线信道的特点,提出了在无线衰落信道中Ｔｕｒｂｏ码的构造方法,并基于非选择性瑞利慢衰落信道模型,分析了Ｔｕｒｂｏ码在不同信道条件下的性能。     

一种准静态平坦衰落信道下空时编码设计的新方法

空时码在准静态平坦瑞利衰落信道下的设计准则被广泛采用的是秩准则和行列式准则,但这些准则并不是很紧的。为此,提出了准静态平坦瑞利衰落信道下一种新的更紧的设计准则,采用这种准则还大大降低了穷举搜索空时好码的复杂度,仿真结果表明,搜索得到的空时好码性能优于现有的其它好码。     

一种构造BCM码的新方法

由Imai与Hirakawa提出的多级编码方法,可用来构造具有任意大最小平方欧氏距离的分组调制(BCM)码.一个BCM码的性能主要取决于构成它的各个成分码,恰当地选择成分码是构造一个好的BCM码的关键.文章给出了一种新方法,通过选用不同长度的成分码来构造BCM码.仿真结果表明用此方法构造出的BCM码较传统的BCM码在性能与复杂度上有明显的改善.     

Source-channel optimized trellis codes for bitonal imagetransmission over AWGN channels

We consider the design of trellis codes for transmission of binary images over additive white Gaussian noise (AWGN) channels. We first model the image as a binary asymmetric Markov source (BAMS) and then design source-channel optimized (SCO) trellis codes for the BAMS and AWGN channel. The SCO codes are shown to be superior to Ungerboeck's codes by approximately 1.1 dB (64-state code, 10^-5 bit error probability), We also show that a simple “mapping conversion” method can be used to improve the performance of Ungerboeck's codes by approximately 0.4 dB (also 64-state code and 10 ^-5 bit error probability). We compare the proposed SCO system with a traditional tandem system consisting of a Huffman code, a convolutional code, an interleaver, and an Ungerboeck trellis code. The SCO system significantly outperforms the tandem system. Finally, using a facsimile image, we compare the image quality of an SCO code, an Ungerboeck code, and the tandem code, The SCO code yields the best reconstructed image quality at 4-5 dB channel SNR     

Novel Trellis‐Coded Spatial Modulation over Generalized Rician Fading Channels

In this paper, a novel trellis‐coded spatial modulation (TCSM) design method is presented and analyzed. Inspired by the key idea of trellis‐coded modulation (TCM), the detailed analysis is firstly provided on the unequal error protection performance of spatial modulation constellation. Subsequently, the Ungerboeck set partitioning rule is proposed and applied to develop a general method to design the novel TCSM schemes. Different from the conventional TCSM approaches, the novel one based on the Ungerboeck set partitioning rule has similar properties as the classic TCM, which has simple but effective code design criteria. Moreover, the novel designed schemes are robust and adaptive to the generalized Rician fading channels, which outperform the traditional TCSM ones. For examples, the novel 4‐, 8‐, and 16‐state TCSM schemes are constructed by employing different transmit antennas and different modulation schemes in different channel conditions. Simulation results clearly demonstrate the advantages of the novel TCSM schemes over the conventional ones.     

Multilevel codes based on partitioning

Following V.V. Ginzburg (1984), a hierarchy of codes is proposed to match the geometric partitioning of a signal set. The authors show that coset codes (including Ungerboeck, lattice, and binary codes) and indeed any codes which rely on partitioning of the signal set are all subclasses of the proposed coding scheme. The combination of such codes in a multilevel scheme often leads to reduced complexity in comparison with previously published schemes. A variety of decoder structures is discussed     

Multidimensional M-PSK trellis codes for fading channels

This paper investigates the code search problem for trellis-coded multidimensional phase modulation for Rayleigh fading channels. New set partitionings for multiple phase-shift keying (M-PSK) are proposed using the effective code length (ECL) and the minimum product distance (PD) as the code design criteria. By using these set-partitionings rules, new multidimensional codes which are optimum for Rayleigh fading channels are constructed. The proposed codes compare favorably with the existing multidimensional trellis codes on fading channels in terms of bit error performance. The bit error performance is evaluated by simulation     

Minimal transmitter complexity design of analytically describedtrellis codes

G. Ungerboeck's (1982) design rules for a class of bandlimited codes called trellis codes are reviewed. His design of the trellis is based on a set partitioning of the signal constellation, and he realized these trellis codes by a convolutional encoder followed by a mapping rule from the coder output to modulation symbols. R. Calderbank and J.E. Mazo (1984) showed how to realize trellis codes for one-dimensional signal sets in a single-step, easily derived, nonlinear transformation with memory on a sliding block of source symbols. The design rules that give a signal (state) specification in a trellis that yields the Calderbank-Mazo transformation with the smallest number of terms are presented. This gives a minimal transmitter complexity design. It is shown how to realize the Ungerboeck from the Calderbank-Mazo form, and as a result a step-by-step, search-free design procedure for trellis codes is presented. Two additional design rules are presented and applied to two examples by analytically designing two trellis codes. A simple procedure for converting an analytic code expression to a convolutional encoder realization is discussed. The analytic designs of a 4-D code and a 2-D code are presented     

Multilevel trellis coded modulations for the Rayleigh fadingchannel

The authors present coded 8-phase-shift-keyed (8-PSK) modulations for the Rayleigh fading channel. The schemes are based on multilevel trellis-coded-modulation constructions and utilize maximum free Hamming distance binary convolutional codes as building blocks. A suboptimal multistage decoder that utilizes interstage interleaving and iterative decoding is proposed and evaluated. Examples are constructed to show that the proposed schemes outperform the best modified codes of the Ungerboeck type due to significantly higher implicit time diversity, yielding seven branches of built-in time diversity, whereas the Ungerboeck code yields four branches of time diversity for a 64-state system. The transmission delay is higher, however. The new schemes can provide three levels of unequal error protection when 8-PSK or 8-differential-phase-shift-keying (8-DPSK) modulations are used. They provide 10-14-dB channel signal-to-noise ratio gain over uncoded 4-DPSK at a bit error rate of 10^-3 for a modest decoding complexity     

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.