TCM好码的结构分析及构造

TCM(Trellis Coded Modulation)好码的具体结构多种多样,该文从网格图的角度分析了TCM好码可能的结构。并应用分析结果构造了一种TCM好码的构造算法。它不仅缩小了所搜范围,提高了搜索效率,而且得到的结果性能较好。     

一种适用于宽带数据链的TCM编码新方法

针对现行TCM编码方法过于复杂、寻码不够灵活的问题,给出了一种新的TCM编码方法。通过分析TCM编码的直观规则,以一位延迟作为输出先画出任一编码器结构,然后转化为多项式表示通过MATLAB函数来验证其网格结构,最后画出状态分析图,写出映射方式。该方法采用一位延迟输出的任意编码器结构,通过网格验证后即可符合TCM编码的直观规则,简化了编码难度,提高了TCM编码的灵活性,并且可以快速写出编码的映射方式,使TCM的编码过程变得更加简捷。     

TCM好码的计算机搜索

本文主要研究网格编码调制(TOM)好码的搜索问题,对Ungerboeck中的算法进行验证并修正了一些规则,获得了更完整的结果。搜索结果表明,对一定约束长度和调制方式,具有最大欧氏自由距的TCM好码有多个,文中给出了具有最简编码器结构的TCM好码。本文还对采用最小编码器结构的TCM码进行了搜索。发现对于由相同一致校验矩阵衍生得到的系统TCM码和最小TCM码,在某些情况下前者不能达到最大欧氏自由距,而后者能够达到。     

基于非编码信息匹配的自适应Turbo TCM编码调制方案

本文提出了一种通过调整非编码信息量,并与信号映射相结合来改变编码、调制模式的自适应Turbo TCM编码调制方案,称之为基于非编码信息匹配的自适应Turbo TCM编码调制方案.由于将Turbo码和TCM编码调制技术相结合得到的Turbo TCM编码调制方案的带宽效率高,所以,在慢时变无线衰落信道中,自适应Turbo TCM编码调制的平均频谱效率也将很高.给出了该方案的工作原理、设计方法,并通过蒙特卡洛(Monte Carlo)仿真研究了该方案的性能.与现有编码调制方案相比,该方案具有频谱效率高、易于设计和实现的优点.     

一种新的TCM旋转不变码的构造算法

相位调制在载波提取时存在的不同程度的相位模糊,会导致网格编码调制系统的性能出现明显下降。设计对相位变化不敏感的TCM纠错码,可以在不增加额外信息的情况下克服相位模糊。一种基于网格旋转不变性的构造方法,可以避免复杂的计算机搜索算法,轻松构造出满足TCM分支转移条件,且对任意角度旋转均不敏感的MPSK旋转不变码。给出了16状态TCM-8PSK旋转不变码的设计实例。     

TCM信号序列的自由空间距离的矩阵算法

本文研究了TCM信号序列的自由空间距离的计算问题,提出一种新的算法矩阵算法,同时在理论上解决了计算TCM信号序列的自由空间距离所需状态转移次数问题。此矩阵算法的推导基于Viterbi算法,它是Viterbi算法的矩阵实现。与已有的算法相比,此算法的优点在于:(1)给出了显式解,使得计算的复杂度相对减小。(2)对空间距离的变化具有更强的适应性。作为实例,给出了高斯信道和衰落信道上的一些TCM信号序列的自由空间距离的计算结果。     

一种90°TCM旋转不变码的搜索算法及实现

概述了TCM旋转不变码的原理、设计思想及性能。并针对8psk调制介绍了一种90°旋转不变码的计算机搜索算法。对搜索出的旋转不变码进行了性能仿真。     

移动衰落信道下的格状编码MPSK调制

衰落信道下的格状编码调制(TCM)与加性高斯白噪声(AWGN)信道下的TCM在设计方法上有所不同。已经知道,在AWGN信道下格状码设计的性能标准是最大的自由欧氏距离(MFED)。在本文中,我们将给出在高信噪比Rician衰落信道下应用交错/解交错时,最佳格状码设计的另外两个性能标准:最短错误路径长度和沿该路径的分支距离乘积。基于这一点,多维TCM由于其在最短错误路径长度上的更大自由度,因而更适合于移动信道。最后,本文根据以上两个标准推导了衰落信道下多维MPSK信号的集合分块方法,结果表明,衰落信道下的最佳集合分块不一定对应一树状结构。     

M元多码MC-CDMA系统信号包络特性分析

针对扩频通信中的M元多码系统,结合OFDM技术特点,提出了一种新的M元多码MC-CDMA系统。在分析系统基本原理基础上,建立了系统信号模型,对系统发射信号包络特性进行了分析研究,推导出系统信号包络公式,讨论了系统多码分路数与系统包络以及系统PAPR的关系。对系统不同分路数情况下包络状态进行了仿真,结果表明M元多码MC-CDMA系统发射信号包络和PAPR受多码分路数以及扩频序列的影响。     

基于协方差反馈的多天线系统优化发送研究

为了克服多天线信道相关性的影响，提出一种新的自适应发送方案。应用空时分组码特征波束成型技术和格形编码调制（TCM）来获得分集增益和编码增益。针对采用和不采用交织器两种情况，基于成对差错概率（PEP）准则。分析了系统的统计性能，分别得到了使系统编码增益和分集增益最大化的TCM设计准则。根据注水法则和Lagrange乘子法求得波束间功率分配算法最优解。此外，码距作为优化功率加载算法中的权重因子，有效降低了获取波束成形分集的信噪比门限。分析和实验结果表明此方案复杂度低。能有效克服相关衰落。     

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     

On the theory and performance of trellis termination methods forturbo codes

The performance of a turbo code can be severely degraded if no trellis termination is employed. This paper investigates the implications of the choice of trellis termination method for turbo codes, and explains the origin of the performance degradation often experienced without trellis termination. An efficient method to derive the distance spectrum of turbo codes for different trellis termination methods is presented. Further, we present interleaver design rules that are tailored to each termination method. Using interleavers designed with these restrictions, we demonstrate that the performance difference between various termination methods is very small, including no trellis termination at all. For example, we demonstrate a turbo code with a 500-bit interleaver that exhibits no sign of an error floor for frame error rates as low as 10^-8, even though no trellis termination is employed     

Systematic design of space-time codes employing multiple trelliscoded modulation

The design of space-time (ST) codes employing multiple trellis coded modulation (MTCM) is considered. This structure is shown to be necessary for achieving maximum transmit diversity gain when using trellis codes with parallel paths. Systematic code search procedures with low complexity are described based on the properties of ST-MTCM codes. It is illustrated that, if the trellis branches are properly labeled, the overall coding gain can be made larger than that achieved by conventional ST codes with the same transmission rate and the same number of states     

Matched information rate codes for Partial response channels

In this paper, we design capacity-approaching codes for partial response channels. The codes are constructed as concatenations of inner trellis codes and outer low-density parity- check (LDPC) codes. Unlike previous constructions of trellis codes for partial response channels, we disregard any algebraic properties (e.g., the minimum distance or the run-length limit) in our design of the trellis code. Our design is purely probabilistic in that we construct the inner trellis code to mimic the transition probabilities of a Markov process that achieves a high (capacity-approaching) information rate. Hence, we name it a matched information rate (MIR) design. We provide a set of five design rules for constructions of capacity-approaching MIR inner trellis codes. We optimize the outer LDPC code using density evolution tools specially modified to fit the superchannel consisting of the inner MIR trellis code concatenated with the partial response channel. Using this strategy, we design degree sequences of irregular LDPC codes whose noise tolerance thresholds are only fractions of a decibel away from the capacity. Examples of code constructions are shown for channels both with and without spectral nulls.     

Multiple trellis coded modulation (MTCM)

The authors demonstrate a trellis coded modulation technique referred to as multiple trellis coded modulation (MTCM) wherein more than one channel symbol per trellis branch is transmitted. They have found simple two-state trellis codes for symmetric MPSK multiple phase-shift keying and AM modulations that can achieve 3-dB gain over uncoded modulation at very high signal-to-noise ratios without bandwidth expansion or reduction in information bit rate. The gain of these codes with respect to previously reported two-state trellis codes is between 1 and 2 dB at very high signal-to-noise ratios, depending on the number of bits per Hertz transmitted. These gains are achieved for those of the equivalent conventional trellis codes with the same number of states in the trellis diagram. The authors note that additional computations per branch are needed for the multiple trellis coding scheme. The concept can be extended to a higher number of states and other types of modulations     

Super-orthogonal space-time trellis codes

We introduce a new class of space-time codes called super-orthogonal space-time trellis codes. These codes combine set partitioning and a super set of orthogonal space-time block codes in a systematic way to provide full diversity and improved coding gain over earlier space-time trellis code constructions. We also study the optimality of our set partitioning and provide coding gain analysis. Codes operating at different rates, up to the highest theoretically possible rate, for different number of states can be designed by using our optimal set partitioning. Super-orthogonal space-time trellis codes can provide a tradeoff between rate and coding gain. Simulation results show more than 2-dB improvements over the codes presented in the literature while providing a systematic design methodology.     

A comparison of turbo codes using different trellis terminations

This paper investigates the incidence of trellis termination on the performance of turbo codes and accounts for the performance degradation often experienced in the absence of trellis termination. Analytical upper bounds on the performance for the ensemble of turbo codes using different trellis termination strategies as well as performance results obtained by computer simulation are presented. In the case of uniform interleaving, the performance differences between various termination methods are relatively small, except when using no trellis termination at all.     

Optimal sectionalization of a trellis

While the complexity of trellis decoding for a given block code is essentially a function of the number of states and branches in its trellis, the decoding complexity may be often reduced by means of an appropriate sectionalization of the trellis. Notwithstanding the many examples of such sectionalizations for particular codes that appeared in the literature, no systematic method for finding the best sectionalization of a given trellis is presently known. We present a polynomial-time algorithm which produces the optimal sectionalization of a given trellis T in time O(n²), where n is the length of the code generated by T. The algorithm is developed in a general setting of certain operations and functions defined on the set of trellises; it therefore applies to both linear and nonlinear codes, and easily accommodates a broad range of optimality criteria. The particular optimality criterion based on minimizing the total number of additions and comparisons required for maximum-likelihood trellis decoding is investigated in detail: several different methods for decoding a given trellis are discussed and compared in a number of examples. Finally, analysis of the dynamical properties of certain optimal sectionalizations is presented     

Robustly good trellis codes

The relationship between the distance properties of trellis codes and the computational effort and error performance of sequential decoding is studied and optimum distance profile (ODP) and optimum free distance (OFD) trellis codes are constructed for 8-PSK and 16 QAM modulation. A comparison of the performance of both the ODP and the OFD trellis codes reveals that neither class of codes results in the best trade-off between error performance and computational effort when sequential decoding is used. A new algorithm is then proposed to construct robustly good trellis codes for use with sequential decoding. New trellis codes with asymptotic coding gains up to 6.66 dB are obtained using this algorithm, and the new codes achieve nearly the same free distances as the OFD codes and nearly the same distance profiles as the ODP codes     

基于空时格形码的差分调制

提出了空时格形码的差分调制方案,并对空时格形码和系统模型以及差分调制技术进行了深入的研究。在发射天线和接收天线数量乘积大于3时,对QPSK和8-PSK的STTCM码和TSC码以及BBH码进行了仿真,仿真结果表明:STTCM码与相应的TSC和BBH码相比具有更低的帧误码率,而且STTCM码能够提供最大可能的分集增益和编码增益。