Design of super-orthogonal space-time trellis codes based on trace criterion

A design of super-orthogonal space-time trellis codes （SOSTTCs） based on the trace criterion （TC） is proposed for improving the design of SOSTTCs. The shortcomings of the rank and determinant criteria based design and the advantages of the TC-based design are analyzed. The optimization principle of four factors is presented, which includes the space-time block coding （STBC） scheme, set partitioning, trellis structure, and the assignment of signal subsets and STBC schemes in the trellis. According to this principle, systematical and handcrafted design steps are given in detail. By constellation expansion, the code performance can be further improved. The code design results are given, and the new codes outperform others in the simulation.

LOW RATE SPACE-TIME TRELLIS CODES INPOWER LIMITED WIRELESSCOMMUNICATION SYSTEMS

Space-time trellis codes can achieve the best tradeoff among bandwidth efficiency, diversity gain, constellation size and trellis complexity. In this paper, some optimum low rate space-time trellis codes are proposed. Performance analysis and simulation show that the low rate space-time trellis codes outperform space-time block codes concatenated with convolutional code at the same bandwidth efficiency, and are more suitable for the power limited wireless communication system.

Beam Pattern Scanning (BPS) versus Space-Time Block Coding (STBC) and Space-Time Trellis Coding (STTC)

In this paper, Beam Pattern Scanning (BPS), a transmit diversity technique, is compared with two well known transmit diversity techniques, space-time block coding (STBC) and space-time trellis coding (STTC). In BPS (also called beam pattern oscillation), controlled time varying weight vectors are applied to the antenna array elements mounted at the base station (BS). This creates a small movement in the antenna array pattern directed toward the desired user. In rich scattering environments, this small beam pattern movement creates an artificial fast fading channel. The receiver is designed to exploit time diversity benefits of the fast fading channel. Via the application of simple combining techniques, BPS improves the probability-of-error performance and network capacity with minimal cost and complexity. In this work, to highlight the potential of the BPS, we compare BPS and Space-Time Coding (i.e., STBC and STTC) schemes. The comparisons are in terms of their complexity, system physical dimension, network capacity, probability-of-error performance, and spectrum efficiency. It is shown that BPS leads to higher network capacity and performance with a smaller antenna dimension and complexity with minimal loss in spectrum efficiency. This identifies BPS as a promising scheme for future wireless communications with smart antennas.

A new design criterion and construction method for space-time trellis codes based on classification of error events

The known design criterions of Space-Time Trellis Codes （STFC） on slow Rayleigh fading channel are rank, determinant and trace criterion. These criterions are not advantageous not onlv in operation but also in performance. With classifying the error events of STTC, a new criterion was presented on slow Rayleigh fading channels. Basod on the criterion, an effective and straighttbrward multi-step method is proposed to ennstruet codes with better performance. This method can reduce the computation of search to small enough. Simulation results show that the codes searched by computer have the same or even better performance than the repored codes.

Design of concatenated turbo-SPC coded space-time systems

Multiple antenna wireless systems can provide larger channel capacity and enable spatial diversity to combat fading. In this paper we conduct an investigation into the design of coded space-time system obtained by serially concatenating channel code module and space-time code module with an interleaver in between. As an example, the system is constructed by employing low decoding complexity turbo-SPC （single parity check） code as outer module and linear complex field space-time code as inner module, which achieves full diversity and lossless equivalent channel capacity. Simulation results prove that our designed system performs well and it only loses 0.8 dB from multiple-input multiple-output （MIMO） capacity at BER = 10^-5 in the case of information bit length 6048. Compared with turbo code-based systems, it also has lower error floor.

WATER-FILLING SPACE-TIME CODE IN CORRELATED FLAT RAYLEIGH FADING MISO CHANNELS

In this paper, STC with water-filling transmit power distribution in MISO system is proposed when the partial channel information feedback is possible, for example, at slow fading scenario. The performances of the water-filling STC including water-filling STTC and water-filling STBC are analyzed. Performance comparison of the Ungerboeck's 2/3 trellis coded 8PSK modulated 2-STBC and 2-STTCs with QPSK is given out in different channel correlation.

Design and implementation of space-time precoded systems with full diversity and lossless capacity

A new space-time(ST)code design is proposed based on the design criteria of space-time codes,which is applied to the MIMO systems with fewer receive antennas than transmit antennas.The space-time codes,referred to as full diversity lossless capacity(FDLLC)ST code,achieve full transmit diversity and lossless equivalent channel capacity for ST precoded systems.Combined FDLLC-ST codes with channel codes,ST bit interleaved coded modulation(ST-BICM)system is constructed and an iterative detector/decoder is employed at the receiver.Simulations are presented.It is proved that the proposed design has good performance compared with other ST precoded MIMO systems.

MULTIPLE TRELLIS CODED ORTHOGONAL TRANSMIT SCHEME FOR MULTIPLE ANTENNA SYSTEMS

In this paper, a novel multiple trellis coded orthogonal transmit scheme is proposed to exploit transmit diversity in fading channels. In this scheme, a unique vector from a set of orthogonal vectors is assigned to each transmit antenna. Each of the output symbols from the multiple trellis encoder is multiplied with one of these orthogonal vectors and transmitted from corresponding transmit antennas. By correlating with corresponding orthogonal vectors, the receiver separates symbols transmitted from different transmit antennas. This scheme can be adopted in coherent/differential systems with any number of transmit antennas. It is shown that the proposed scheme encompasses the conventional trellis coded unitary space-time modulation based on the optimal cyclic group codes as a special case. We also propose two better designs over the conventional trellis coded unitary space-time modulation. The first design uses 8 Phase Shift Keying （8-PSK） constellations instead of 16 Phase Shift Keying （16-PSK） constellations in the conventional trellis coded unitary space-time modulation. As a result, the product distance of this new design is much larger than that of the conventional trellis coded unitary space-time modulation. The second design introduces constellations with multiple levels of amplitudes into the design of the multiple trellis coded orthogonal transmit scheme. For both designs, simulations show that multiple trellis coded orthogonal transmit schemes can achieve better performance than the conventional trellis coded unitarv space-time schemes.

Performance of STBC-MC-CDMA system based on complex wavelet packet and turbo coding

On the basis of analyzing the principle of the space-time coding technique and the multi-carrier code division multiple access （MC-CDMA） technique, adopting the turbo codes as channel coding and the optimized complex wavelet packet as multi-carrier modulation, a novel space-time block coded the MC-CDMA system based on complex wavelet packet and turbo coding is proposed, and the system bit error rate （BER） performance in the Rayleigh fading channel is investigated. The system can make full use of space-time block codes＇ transmit diversity and turbo codes＇ good ability against fading channel to improve the BER performance significantly, and it can also avoid the decrease of spectrum efficiency of conventional MC-CDMA due to inserting cyclic prefix （CP） by utilizing superior characteristics of the optimized complex wavelet packet. Simulation results show that the proposed space-time block coded MC-CDMA system based on the complex wavelet packet performs better than the conventional space-time block coded MC-CDMA （STBC-MC-CDMA） system, and slightly outperforms the STBC-MC-CDMA with CP. Moreover, the application of the space-time block coding technique concatenated with turbo codes strengthens the system ability to combat various interferences in fading channel further.

A Self-Terminated Interleaver Design for Turbo Codes

Turbo codes can achieve excellent performance at low signal-to-noise ratio (SNR), but the performance can be severely degraded if no trellis termination is employed. This paper proved that if trellis termination bits were appended to RSC1, trellis of RSC2 could be terminated by designing the interleaver properly, consequently, derived the designing condition of such self-terminated interleaver (STI). Then we presented an algorithm of implementing a kind of STI, which could terminate RSC2 as well on condition that the RSC1 was terminated. We verified the performance of STI for turbo codes by simulation, and the simulation results showed that turbo codes with STI outperformed interleavers that could not terminate RSC2 as well.

JOINT EARLY DETECTION AND EARLY STOPPING SCHEME FOR COMPLEXITY REDUCTION OF TURBO DECODING

In this paper,a Joint Early Detection and Early Stopping (JEDES) approach for effectively reducing the complexity of turbo decoding with negligible performance loss is proposed. It combines the effectiveness of both early detection and early stopping techniques. Our simulation results demon-strated that the proposed JEDES scheme based on cyclic redundancy check and trellis splicing can achieve a complexity saving of 15% to 20% at practical bit error rates over the idealized GENIE stopping scheme,which is widely accepted as the theoretically best possible early stopping scheme.

归零Turbo码的盲识别方法

针对归零Turbo码的识别问题,提出一种有效的识别方法。该方法首先根据归零Turbo码的特殊结构,利用遍历矩阵列数的方式,寻找相关列均值最大值的位置,识别归零Turbo码长和起始点;其次,构建归零Turbo码的交织器识别模型,利用分层比对的方法得到交织置换关系,完成对交织器参数的识别。仿真实验表明,该方法在0.02的误码率条件下识别率仍能达到80%以上,验证了所提方法的有效性和鲁棒性。

归零Turbo码识别算法

针对信息截获领域中Turbo码盲识别问题,将归零Turbo码识别算法归纳为编码结构识别与编码器参数识别.在编码结构识别方面,利用归零Turbo码所具有的线性分组码的特性,通过分析编码序列矩阵在不同列数、不同起点条件下秩的特征,实现了码组长度、码字起点的盲识别;在编码器参数识别方面,通过对比交织前后序列矩阵的列向量,设定判决门限,将个数小于门限值的误码影响抹去,解决了传统交织方式识别算法容错性能较差的问题.仿真实验表明,识别算法在10-3误码率条件下识别正确率在80%以上,验证了该算法的有效性和可靠性.

Turbo码的编码调制技术

本文研究了Turbo码与网路编码调制（TrellisCodedModulation，TCM）相结合的Turbo码编码调制技术，给出了3种Turbo码与TCM相结合的调制方案，并进行了比较。对方案三进行了计算机模拟,从模拟得到的性能曲线表明，其性能要优于传统的采用卷积码的TCM调制。

Turbo码的迫零研究

Turbo码在低信噪比 ( SNR)下能获得优异的性能 ,但是若不进行迫零处理 ,Turbo的性能可能会受到严重的影响 .文中从迫零对 Turbo码距离谱的影响 ,迫零在 Turbo码中的作用进行了理论分析 ,提出了一种具自迫零特性的交织器的实现算法 .并通过仿真验证了这种具自迫零特性的交织器的性能 .对几种迫零方式的性能进行比较 .仿真结果表明 ,该交织器表现的性能优于只对RSC1迫零的性能 ,迫零有助于 Turbo码性能的改善 .

一种基于矩阵分析的Turbo码长识别算法

针对信息截获领域中Turbo码识别问题,提出了一种基于矩阵分析的Turbo码长识别算法。简述了Turbo码编码和归零的基本原理,深入分析了Turbo码第1路、第2路、第3路和整体的生成矩阵,得出其本质上是一种线性分组码。将线性分组码的码长识别方法引入到Turbo码识别当中,并对算法进行了改进。仿真实验表明,此方法在较高的误码率基础上有着良好的识别效果。

一种短延时Turbo编码调制系统的设计

本文设计了一种比传统体制减少了一半延时的Turbo编码调制系统 ,介绍了交织器的相关限制 .提出了一种在译码过程中对信道值的估计方法 ,使得外信息的计算更加趋于精确 ,从而提高了译码性能 .这种迭代译码算法是标准格码调制译码算法的一种自然推广 ,同时也类似于二元Turbo码在BPSK调制下的逐比特译码算法 .采用吞吐率为 2bits/s/Hz的 8PSK调制 ,比特错误率为 10 -5所需的信噪比与Shannon限相距不到 0 4dB .

栅格终止方案对Turbo码性能的影响

针对码速率为 1/3、编码存储级数为 m的 Turbo码 ,研究了 3种栅格终止方案 :传统的单归零栅格终止方案 ,作者提出的前 m尾交织双归零栅格终止方案和第三代移动通信系统 (3GPP)推荐采用的无尾交织双归零栅格终止方案 . Turbo码的译码采用软输出维特比算法 (SOVA) .从译码原理出发 ,对 3种栅格终止方案的设计、译码性能及编码效率进行了分析和比较 ,并通过仿真给出了分别采用 3种栅格终止方案的 Turbo码的误码率曲线 .仿真结果表明 ,前 m尾交织双归零栅格终止方案具有最低的误码率底限 .

归零Turbo码参数的盲识别

针对归零Turbo码码率、码组起点、交织起点、交织长度参数识别问题,首先引入矩阵秩量比的概念,推导出适用于归零Turbo码矩阵秩量比下限,提出了基于秩量比判决门限的码长识别算法;其次,遍历一交织帧输出码元,找出最小秩量比对应的位置,实现交织起点和码组起点的识别;然后,依靠完整的交织帧输出数据,利用分析矩阵实现码率与分量编码器中寄存器个数识别;最后,由以上识别的参数计算出交织长度。仿真结果表明:在信噪比为5 dB时,单靠信息序列,各部分的识别概率能达到80%以上;在交织长度为100时,提出的识别算法与传统算法相比,性能相近,识别时间大约缩短为原来的1/3。

基于修正路径量度的Turbo码SOVA译码算法研究

针对传统SOVA(softoutput Viterbi algorithm)算法在选择错误路径概率的计算上存在的不足,提出了改进的Turbo码SOVA译码方法。根据各状态幸存路径累计量度的差值,对译码回溯深度范围内最末位的数个比特的可靠度值进行修正,然后将修正值作为软判决输出。理论推导和计算机仿真结果均表明,所提出的修正算法能提高译码性能。