满速率串行级联空时分组MTCM编码方法研究

该文研究了级联空时编码系统在编码增益,分集增益和传输能量效率的限定下最大化传输速率的问题,提出了一种在保留TCM编码方法校验位冗余的同时,还可获得满速率串行级联空时分组TCM编码方法。新方法通过引入具有不同功率分集因子的正交发射码字矩阵,并给出新的译码算法,从而使得新的编码方法在获得满速率的同时还可以获得满分集增益。分析和MATLAB仿真结果表明,在相同的编码状态数下,新方法在编码增益上比现有的满速率超正交空时分组编码方法提高1dB左右。     

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.     

无线通信系统中的低码率空时网格码

空时网格编码能在频带利用率、分集增益、调制方式与编码网络图复杂度之间达到最佳的折衷。本文给出了几种低码率空时网格码的好码。理论分析和系统仿真表明,在相同的频带利用率下,该空时网格码可具有比空时块码级联卷积码具有更好的误码率性能,更适合于对频带利用率要求不高的功率受限无线通信系统。     

Concatenated space-time block coding with trellis coded modulation in fading channels

Trellis coded modulation (TCM) is a bandwidth efficient transmission scheme that can achieve high coding gain by integrating coding and modulation. This paper presents an analytical expression for the error event probability of concatenated space-time block coding with TCM which reveals some dominant factors affecting the system performance over slow fading channels when perfect interleavers are used. This leads to establishing the design criteria for constructing the optimal trellis codes of such a concatenated system over slow flat fading channels. Through simulation, significant performance improvement is shown to be obtained by concatenating the interleaved streams of these codes with space-time block codes over fading channels. Simulation results also demonstrate that these trellis codes have better error performance than traditional codes designed for single-antenna Gaussian or fading channels. Performance results over quasi-static fading channels without interleaving are also compared in this paper. Furthermore, it is shown that concatenated space-time block coding with TCM (with/without interleaving) outperforms space-time trellis codes under the same spectral efficiency, trellis complexity, and signal constellation.     

Space-time codes and concatenated channel codes for wirelesscommunications

Following a brief historical perspective on channel coding, an introduction to space-time block codes is given. The various space-time codes considered are then concatenated with a range of channel codecs, such as convolutional and block-based turbo codes as well as conventional and turbo trellis codes. The associated estimated complexity issues and memory requirements are also considered. These discussions are followed by a performance study of various space-time and channel-coded transceivers. Our aim is first to identify a space-time code/channel code combination constituting a good engineering tradeoff in terms of its effective throughput, bit-error-rate performance, and estimated complexity. Specifically, the issue of bit-to-symbol mapping is addressed in the context of convolutional codes (CCs) and convolutional coding as well as Bose-Chaudhuri-Hocquenghem coding-based turbo codes in conjunction with an attractive unity-rate space-time code and multilevel modulation is detailed. It is concluded that over the nondispersive or narrow-band fading channels, the best performance versus complexity tradeoff is constituted by Alamouti's twin-antenna block space-time code concatenated with turbo convolutional codes. Further comparisons with space-time trellis codes result in similar conclusions     

Full rate space-time turbo codes

This paper proposes a class of full space diversity full rate space-time turbo codes. Both parallel concatenated and serially concatenated codes are designed. A rank theory proposed by the authors earlier is employed to check the full space diversity of the codes. The simulations show that the space-time turbo codes can take full advantage of space diversity and time diversity if they are available in the channels. We also study the robustness of performance of both turbo codes and trellis codes in space-time correlated fading channels     

Enhanced space-time block coded systems by concatenating turbo product codes

The BER performance of a turbo product code (TPC) based space-time block coding (STBC) wireless system has been investigated. With the proposed system, both the good error correcting capability of TPC and the concurrent large diversity gain characteristic of STBC can be achieved. The BER upper bound has been derived taking BPSK modulation as an example. The simulation results show that the proposed system with the concatenated codes outperforms the one with only TPC or STBC and other reported schemes that concatenate STBC with convolutional Turbo codes or trellis codes.     

Concatenated combined modulation and coding of frequency hoppingmultiaccess systems

A spread-spectrum system that does not have a separate state for initial code acquisition is presented. A uniform random variate selects one of several Gold codes for transmission, thus removing the notion of pseudorandom codes from spread-spectrum systems, making the effective code length infinite, and leading to acquisitionless systems. Because coding is critical to the proposed multiaccess frequency-hopping (FH) system, more powerful codes are needed. The performance of the proposed multiaccess system using the combined modulation and coding technique (trellis) concatenated with Reed-Solomon codes in partial-band jamming is investigated. The FH multiaccess performance of noncoherent soft detection of MFSK in association with trellis coding is introduced and the performance compared to that using RS outer/RS inner concatenated codes     

Concatenated codes for fading channels based on recursive space-time trellis codes

We propose a class of codes which combine the principles of turbo coding and space-time trellis codes. It is first shown that several classes of space-time codes have an equivalent recursive realization. This fact is then exploited to design serial concatenated coding schemes with an outer code, interleaver, and an inner recursive space-time encoder. Two solutions are proposed in this paper - the use of convolutional outer codes aimed mainly to improve the power efficiency and the use of very high-rate outer codes to obtain significant improvement in power efficiency with a marginal decrease in spectral efficiency. We show that single parity check based turbo product codes are a good candidate for very high-rate outer codes. Finally, we propose an automatic repeat request scheme based on recursive realizations of space-time codes and show that the proposed scheme provides significant reduction in frame error rate.     

Assembled space-time turbo trellis codes

A novel full rate space-time turbo trellis code, referred to as an assembled space-time turbo trellis code (ASTTTC), is presented in this paper. For this scheme, input information binary sequences are first encoded using two parallel concatenated convolutional encoders. The encoder outputs are split into four parallel streams and each of them is modulated by a QPSK modulator. The modulated symbols are assembled by a predefined linear function rather than punctured as in the standard schemes. This results in a lower code rate and a higher coding gain over time-varying fading channels. An extended two-dimensional (2-D) log-MAP (maximum a posteriori probability) decoding algorithm, which simultaneously calculates two a posteriori probabilities (APP), is developed to decode the proposed scheme. Simulation results show that, under the same conditions, the proposed code considerably outperforms the conventional space-time turbo codes over time-varying fading channels.     

Performance of concatenated channel codes and orthogonal space-time block codes

In this paper we analyze the performance of an important class of MIMO systems that of orthogonal space-time block codes concatenated with channel coding. This system configuration has an attractive combination of simplicity and performance. We study this system under spatially independent fading as well as correlated fading that may arise from the proximity of transmit or receive antennas or unfavorable scattering conditions. We consider the effects of time correlation and present a general analysis for the case where both spatial and temporal correlations exist in the system. We present simulation results for a variety of channel codes, including convolutional codes, turbo codes, trellis coded modulation (TCM), and multiple trellis coded modulation (MTCM), under quasi-static and block-fading Rayleigh as well as Rician fading. Simulations verify the validity of our analysis.     

Space-Time Trellis Code Design Based on Super Quasi-Orthogonal Block Codes With Minimum Decoding Complexity

In this letter, we propose a new family of space-time trellis codes, which are constructed by combining a super set of quasi-orthogonal space-time block codes with minimum decoding complexity with an outer multiple trellis coded modulation encoder. A systematic set-partitioning method for quadratic amplitude modulation constellations is given. The proposed scheme can be used for systems with four or more than four transmit antennas. Furthermore, its decoding complexity is low because its branch metric calculation can be implemented in a symbolwise way. Simulation results demonstrate that the proposed scheme has a comparable performance as super quasi-orthogonal space-time trellis codes proposed by Jafarkhani and Hassanpour while providing a lower decoding complexity.     

Space-time trellis-coded transmissions with parallel sequences over time-varying channels

In this letter, we investigate the performance of space-time trellis codes in a time-varying channel of a multiple-access wireless system where symbols of a user are transmitted using parallel sequences. Using rank and determinant criteria, it is shown that space-time trellis codes originally designed for quasi-static channels are efficient codes for this system as well. Simulation results demonstrate that the proposed transmission scheme can exploit spatial and temporal diversities to achieve performance gains at practical decoding complexity levels.     

交织的空时分组码级联不对称网格编码调制方法

根据交织的空时分组码级联TCM编码设计标准,提出了一种空时分组码级联不对称网格编码调制(A-TCM)的优化设计方案,并得到了在空时分组码级联不对称8PSK调制的TCM情况下最优的星座图旋转角度.仿真和分析结果表明,在相同的频谱效益和译码复杂度的情况下,相比传统空时分组码级联TCM的方法,新方法可进一步提高系统性能.     

Space-time MSK Codes for Quasi-Static Fading Channels

In this paper, 4-state and 8-state space-time trellis codes with full rate, full diversity and high coding gain are proposed for MSK modulation, based on a technique similar to the super-orthogonal space-time trellis code (SOSTTC) design. Since the phase continuity requirement of MSK is the main constraint in space-time MSK code design not all the signal matrices corresponding to the trellis branches are orthogonal. The paper shows that the SOSTTC design technique can be extended to nonorthogonal coding structures. The new space-time MSK codes have frame error performances very close to those of their space-time QPSK counterparts given in [1]     

An efficient space-frequency coded OFDM system for broadband wireless communications

We propose an efficient space-frequency coded orthogonal frequency-division multiplexing (OFDM) system for high-speed transmission over wireless links. The analytical expression for the pairwise probability of the proposed space-frequency coded OFDM system is derived in slow, space- and frequency-selective fading channels. The design criteria of trellis codes used in the proposed system are then developed and discussed. It is shown that the proposed space-frequency coded OFDM can efficiently achieve the full diversity provided by the fading channel with low trellis complexity, while for traditional space-frequency coded OFDM systems, we need to design space-time trellis codes with high trellis complexity to exploit the maximum achievable diversity order. The capacity properties of space-frequency coded OFDM over multipath fading channels are also studied. Numerical results are provided to demonstrate the significant performance improvement obtained by the proposed space-frequency coded OFDM scheme, as well as the excellent outage capacity properties.     

Performance evaluation of super-orthogonal space-time trellis codes using a moment generating function-based approach

A new class of space-time codes called super-orthogonal trellis codes was introduced that combine set-partitioning with a super set of orthogonal space-time block codes in such a way as to provide full diversity with increased rate and improved coding gain over previous space-time trellis code (STTC) constructions. Here, we extend the moment generating function-based method, which was previously applied to analyzing the performance of space-time block orthogonal and trellis codes, to the above-mentioned super-orthogonal codes. It is shown that the maximum-likelihood metric and expressions for the pairwise error probability previously developed for the Alamouti (1998) space-time block code combined with multidimensional trellis-coded modulation can be readily extended to the super-orthogonal case. As such, the evaluation of the pairwise error probability for the latter can be performed in a similar manner to that previously described with the specific results depending on the particular trellis code design.     

Effect of shadowing on the performance of space-time trellis-coded systems

We analyze the performance of space-time trellis codes over shadowed Rician fading channels. The shadowed Rician channel is a generalization of the Rician model, where the line-of-sight path is subjected to a lognormal transformation due to foliage attenuation, also referred to as shadowing. Using the moment generating function method, we derive an exact expression for the pairwise error probability (PEP) of space-time trellis coded systems operating over this channel. The asymptotic analysis of PEP shows that the design criteria of space-time trellis codes proposed for Rayleigh fading still hold when used over shadowed Rician channels. We also present simulation results for bit-error rate performance under various degrees of shadowing.     

A Family of Distributed Space-Time Trellis Codes With Asynchronous Cooperative Diversity

In current cooperative communication schemes, to achieve cooperative diversity, synchronization between terminals is usually assumed, which may not be practical since each terminal has its own local oscillator. In this paper, based on the stack construction proposed by Hammons and El Gamal, we first construct a family of space-time trellis codes for BPSK modulation scheme that is characterized to possess the full cooperative diversity order without the synchronization assumption. We then generalize this family of the space-time trellis codes from BPSK to higher order QAM and PSK modulation schemes based on the unified construction proposed by Lu and Kumar. Some diversity product properties of space-time trellis codes are studied and simplified decoding methods are discussed. Simulation results are given to illustrate the performance of the newly proposed codes     

Shift-full-rank matrices and applications in space-time trellis codes for relay networks with asynchronous cooperative diversity

To achieve full cooperative diversity in a relay network, most of the existing space-time coding schemes require the synchronization between terminals. A family of space-time trellis codes that achieve full cooperative diversity order without the assumption of synchronization has been recently proposed. The family is based on the stack construction by Hammons and El Gamal and its generalizations by Lu and Kumar. It has been shown that the construction of such a family is equivalent to the construction of binary matrices that have full row rank no matter how their rows are shifted, where a row corresponds to a terminal (or transmit antenna) and its length corresponds to the memory size of the trellis code on that terminal. We call such matrices as shift-full-rank (SFR) matrices. A family of SFR matrices has been also constructed, but the memory sizes of the corresponding space-time trellis codes (the number of columns of SFR matrices) grow exponentially in terms of the number of terminals (the number of rows of SFR matrices), which may cause a high decoding complexity when the number of terminals is not small. In this paper, we systematically study and construct SFR matrices of any sizes for any number of terminals. Furthermore, we construct shortest (square) SFR (SSFR) matrices that correspond to space-time trellis codes with the smallest memory sizes and asynchronous full cooperative diversity. We also present some simulation results to illustrate the performances of the space-time trellis codes associated with SFR matrices in asynchronous cooperative communications.