Turbo processing in transmit antenna diversity systems

We consider turbo-trellis-coded transmission over fading multiple-input-multiple-output (M1M0) channels with transmit diversity using space-time block codes. We give a new view on space-time block codes as a transformation of the fading MIMO channel towards a Gaussian single-input-single-output (siso) channel and provide analytical results on the BER of space-time block codes. Furthermore, we describe the concatenation of Turbo-TCM with a space-time block code and show that in addition to the transmit diversity substantial benefits can be obtained by turbo iterations as long as the channel is time-varying during transmission of a coded block or frequency hopping is applied. Finally, a double iterative scheme for turbo equalization and turbo decoding of the concatenation of Turbo-TCM and space-time block code in frequency-selective MIMO channels is described.     

Performance of trellis-coded modulation for equalized multipathfading ISI channels

The performance of TCM on equalized multipath fading ISI channels with different equalization schemes is examined. Trellis codes that are effective for AWGN channels and flat fading channels with interleaving are evaluated for equalized multipath fading channels. For joint MLSE equalization and decoding the equivalent uncoded system outperforms all the trellis-coded systems that are examined. Trellis codes that are designed for flat fading channels with interleaving perform well if interleaving is used and an MLSE equalizer is used before deinterleaving. An effective interleaver-deinterleaver is identified that allows joint DDFSE equalization and decoding to be used without the need for equalization before decoding     

Efficient adaptive receivers for joint equalization and interference cancellation in multiuser space-time block-coded systems

This paper develops low-complexity adaptive receivers for space-time block-coded (STBC) transmissions over frequency-selective fading channels. The receivers are useful for equalization purposes for single user transmissions and for joint equalization and interference cancellation for multiuser transmissions. The receivers exploit the rich code structure of STBC codes in order to deliver recursive-least-squares (RLS) performance at least-mean-squares (LMS) complexity. Besides reduced complexity, the proposed adaptive receivers also lower system overhead requirements.     

Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels

This paper considers communication over coherent multiple-input multiple-output (MIMO) flat-fading channels where the channel is only known at the receiver. For this setting, we introduce the class of LAttice Space-Time (LAST) codes. We show that these codes achieve the optimal diversity-multiplexing tradeoff defined by Zheng and Tse under generalized minimum Euclidean distance lattice decoding. Our scheme is based on a generalization of Erez and Zamir mod-/spl Lambda/ scheme to the MIMO case. In our construction the scalar "scaling" of Erez-Zamir and Costa Gaussian "dirty-paper" schemes is replaced by the minimum mean-square error generalized decision-feedback equalizer (MMSE-GDFE). This result settles the open problem posed by Zheng and Tse on the construction of explicit coding and decoding schemes that achieve the optimal diversity-multiplexing tradeoff. Moreover, our results shed more light on the structure of optimal coding/decoding techniques in delay-limited MIMO channels, and hence, open the door for novel approaches for space-time code constructions. In particular, 1) we show that MMSE-GDFE plays a fundamental role in approaching the limits of delay-limited MIMO channels in the high signal-to-noise ratio (SNR) regime, unlike the additive white Gaussian noise (AWGN) channel case and 2) our random coding arguments represent a major departure from traditional space-time code designs based on the rank and/or mutual information design criteria.     

Cooperative Transmission Using Quasi-Orthogonal Space-Time Block Codes with Adaptive Decode-and-Forward Relaying Protocol

In this paper, we propose a cooperative transmission scheme using quasi-orthogonal space-time block codes (QOSTBCs) for multiple-input multiple-output (MIMO) relay networks. Comparing with the conventional cooperative transmission scheme using orthogonal space-time block codes (OSTBCs), the proposed scheme can achieve higher bandwidth efficiency with the same decoding complexity. Moreover, an adaptive decode-and-forward (ADF) relaying protocol is proposed based on one-bit channel state information (CSI) feedback. According to the CSI feedback, a better transmission mode can be selected between the direct transmission and decode-and-forward (DF) cooperative transmission. In addition, the outage performance of the proposed scheme is investigated and a closed-form upper bound on the outage probability is derived. The performance analysis shows that the proposed scheme can achieve a full diversity order, which is higher than that of the direct and DF cooperative transmissions.     

Serial Concatenation of Space‐Time and Recursive Convolutional Codes

We propose a new serial concatenation scheme for space‐time and recursive convolutional codes, in which a space‐time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi‐static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.     

Simplified receiver design for STBC binary continuous phase modulation

Existing space-time codes have focused on multiple- antenna systems with linear modulation schemes such as phase- shift keying and quadrature amplitude modulation. Continuous phase modulation (CPM) is an attractive scheme for digital transmission because of its constant envelope which is needed for power efficient transmitters. Recent research has shown that space-time coded CPM can achieve transmit diversity to improve performance while maintaining the compact spectrum of CPM signals. However, these efforts mainly combine space- time coding (STC) with CPM to achieve spatial diversity at the cost of a high decoding complexity. In this paper, we design space-time block codes (STBC) for binary CPM with modulation index h = 1/2 and derive low-complexity receivers for these systems. The proposed scheme has a much lower decoding complexity than STC CPM with the Viterbi decoder and still achieves near-optimum error performances.     

Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks

Distributed space-time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver. It achieves the maximal diversity when the transmit power is infinitely large. This paper is on the design of practical distributed space-time codes (DSTCs). We use orthogonal and quasi-orthogonal designs which are originally used in the design of space-time codes for multiple-antenna systems. It is well known that orthogonal space-time codes have full diversity and linear decoding complexity. They are particularly suitable for transmissions in the network setting using distributed space-time coding since their ldquoscale-freerdquo property leads to good performance. Our simulations show that they achieve lower error rates than the random code. We also compare distributed space-time coding to selection decode-and-forward using the same orthogonal designs. Simulations show that distributed space-time coding achieves higher diversity than selection decode-and-forward (DF) when there is more than one relay. We also generalize the distributed space-time coding scheme to wireless relay networks with channel information at the relays. Although our analysis and simulations show that there is no improvement in the diversity, in some networks, having channel information at the relays saves both the transmission power and the transmission time.     

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     

Prefiltered space-time M-BCJR equalizer for frequency-selectivechannels

This paper addresses the problem of soft equalization for space-time-coded transmissions over frequency-selective fading channels. The structure of the space-time code is embedded in the channel impulse response for efficient joint equalization and decoding. The proposed equalization/decoding approach uses a prefilter to concentrate the effective channel power in a small number of taps followed by a reduced-complexity maximum a posteriori probability (MAP) equalizer/decoder to produce soft decisions. The prefilter introduces residual intersymbol interference which degrades the performance of MAP when applied to the trellis of the shortened channel. However, the shape of the overall shortened channel impulse response allows the M-algorithm to approximate the prefiltered MAP performance with a small number of states. Based on this general framework, we investigate several enhancements such as using different prefilters for the forward and backward recursions, concatenating two trellis steps during decoding, and temporal oversampling. The performance is evaluated through simulations over the EDGE typical urban channel     

Performance of joint source–channel decoding with iterative bit combining and detection

A joint source–channel decoding scheme (JSCD) with iterative bit combining (IBC) is proposed, which exploits two types of a priori information. The first one is the a priori bit probabilities obtained from source statistics, and the second is the channel a priori probabilities obtained from saved extrinsic information of previous transmissions. The JSCD-IBC scheme also incorporates iterative detection as both a stopping criteria and mechanism for triggering retransmissions. This adds an implicit adaptivity to the system and prevents excess iterations/retransmissions from being effected. The performance of the JSCD-IBC scheme is evaluated with four different iterative detection schemes and also two different types of variable length codes, Huffman and reversible variable length codes. Simulation results show that a significant performance gain in terms of bit error rate, throughput, and number of iterations can be achieved with the JSCD-IBC scheme as compared to a separate decoding scheme.     

MIMO MAP equalization and turbo decoding in interleaved space-time coded systems

Decoding of space-time codes in frequency-selective fading channels is considered. The approach is based on iterative soft-in soft-out equalization and decoding. It is applicable to space-time coded systems that deploy symbol/bit interleavers. We focus on the equalization stage by extending the Ungerboeck equalizer formulation to a multiple-input multiple-output time-variant channel. The resulting structure comprises a bank of matched filters, followed by an a posteriori probabilities calculator that runs the Bahl-Cocke-Jelinek-Raviv/maximum a posteriori algorithm with an appropriate metric. Simulation results are reported for space-time bit-interleaved codes designed over the enhanced data rates for GSM evolution (EDGE) air interface.     

Rayleigh信道多天线系统的酉空时信号识别技术

针对衰落信道中酉空时调制的识别问题,提出两种酉空时信号与传统空时码的识别方案。最大似然识别法利用信道转移概率密度构造平均似然比和广义似然比分类函数,依据不同码字似然比的差异完成分类,在对数域处理从而降低计算复杂度。高阶统计特性识别法利用随机矩阵的矩生成函数产生高阶联合矩和高阶联合累积量,依据酉空时信号特殊的高阶统计特性实现识别。最大似然识别法可在无信道状态信息的条件下完成识别,当已知信道状态信息时识别性能可大幅提高;高阶统计特性识别法需要信道状态信息,同样条件下与最大似然法相比其性能较差,且其准确性会受信道估计的影响,但实现的复杂度低。通过增加接收天线数量在各种方案中均可改善识别性能,4根接收天线相对2根接收天线的增益,无CSI的最大似然法为7-10dB,有CSI的高阶统计特性法可达45dB。仿真结果验证了所提方案的有效性。      

A New ML Based Interference Cancellation Technique for Layered Space-Time Codes

This paper presents a new and simple decoding algorithm for layered space time block codes such as the two independent Alamouti's codes which are also called the double space-time transmit diversity (DSTTD) system. By using group interference suppression and successive interference cancellation, we can treat DSTTD as two independent space-time block codes (STBC). We can then decode both of these STBC's through a simple maximum likelihood (ML) detector with null space-based interference cancellation. We also compare the proposed interference cancellation (IC) scheme with the conventional MMSE IC scheme. The performance of the proposed IC scheme is comparable to that of the MMSE IC scheme while the complexity reduction factor of the proposed scheme can be up to 5 compared to the MMSE IC scheme.     

Differential spatial modulation scheme based on orthogonal space-time block coded

Focusing on the problem that differential spatial modulation (DSM) couldn’t obtain transmit diversity and has high decoding complexity,a new differential spatial modulation scheme based on the orthogonal space-time block code was proposed and the proposed scheme is called OSTBC-DSM.There were two matrices in this scheme:the spatial modulation matrix and the symbol matrix.The former was aimed to activate different transmit antennas by setting the position of nonzero elements,and the latter structured symbolic matrix by using orthogonal space-time block codes (OSTBC) as the basic code block.The proposed scheme could obtain full transmit diversity and higher spectral efficiency compared with the conventional DSM schemes.Moreover,the OSTBC-DSM supported linear maximum likelihood (ML) decoding.The simulation results show that under different spectral efficiencies,the proposed OSTBC-DSM scheme has better bit error rate (BER) performance than other schemes.     

Differential Detection Based on Space-Time Block Codes

In this paper we consider the use of differential detection when there aremultiple transmitter and receiver antennas. Our differential scheme is based on the theory ofSpace-Time Block Codes that are used to achieve space-time diversity. Compared to the existingdifferential schemes for multiple antennas our scheme has a much smaller computationalcomplexity. It has the same encoding and decoding complexities as the coherent detection based on space-time block codes and achieves the same rate for up-to 8 transmitterantennas. The performance of the differential detector (which assumes no knowledge of the flat fading channel) is 3 dB less than that of the coherent detector (which uses exact channelstate information for reception). We also show that the proposed receiver is a Maximum Likelihood detector.     

Single-carrier space-time block-coded transmissions over frequency-selective fading channels

We study space-time block coding for single-carrier block transmissions over frequency-selective multipath fading channels. We propose novel transmission schemes that achieve a maximum diversity of order N/sub t/N/sub r/(L+1) in rich scattering environments, where N/sub t/ (N/sub r/) is the number of transmit (receive) antennas, and L is the order of the finite impulse response (FIR) channels. We show that linear receiver processing collects full antenna diversity, while the overall complexity remains comparable to that of single-antenna transmissions over frequency-selective channels. We develop transmissions enabling maximum-likelihood optimal decoding based on Viterbi's ( 1998) algorithm, as well as turbo decoding. With single receive and two transmit antennas, the proposed transmission format is capacity achieving. Simulation results demonstrate that joint exploitation of space-multipath diversity leads to significantly improved performance in the presence of frequency-selective fading channels.     

Blind equalization for an application of unitary space-time modulation in ISI channels

Transmit diversity schemes have gained attention due to the promise of increased capacity and improved performance. Among these schemes, unitary space-time modulation and differentially encoded unitary space-time modulation allow for simple noncoherent decoding for flat-fading channels. In this paper, a new blind equalization algorithm for these transmission schemes in intersymbol interference (ISI) channels is proposed. A matrix-type constant modulus algorithm that exploits the unitary structure of the space-time codes is developed. The equalizer is paired with a noncoherent decoder, resulting in a completely blind, low-complexity method for decoding in the presence of ISI. A noiseless convergence analysis is conducted and verified via simulation in both noiseless and noisy cases. The performance of the overall system is evaluated via simulation and semi-analytically, and the achieved performance is between that of the ideal zero-forcing and the minimum-mean squared-error equalizers.     

High-rate concatenated space-time block code M-TCM designs

In this paper, a new technique to design improved high-rate space-time (ST) codes is proposed based on the concept of concatenated ST block code (STBC) and outer trellis-coded modulation (M-TCM) encoder constructions. Unlike the conventional rate-lossy STBC-MTCM schemes, the proposed designs produce higher rate ST codes by expanding the codebook of the inner orthogonal STBC. The classic set partitioning concept is adopted to realize the STBC-MTCM designs with large coding gains. The proposed expanded STBC-MTCM designs for the two-, three-, and four-transmitter cases are illustrated. Simulation results show the proposed STBC-MTCM designs significantly outperform the traditional ST-TCM schemes. Furthermore, decoding complexity of the proposed scheme is low because signal orthogonality is exploited to ease data decoding.     

A subspace detection method of analog space-time codes for multiantenna ultra-wideband transmissions

In this letter, we propose a subspace based detection method for space-time block codes (STBC) wedded with ultra-wideband (UWB) transmissions. Without the need of channel information, the proposed algorithm yields the estimation of transmitted symbols by minimizing some quadratic form built on the orthogonality between signal and noise subspaces. Simulations in flat-faded application scenarios show that the subspace method can achieve the same diversity and a loss of about 2 dB at the 10/sup -3/ level with more than four successive space-time codes being decoded jointly, compared to the coherent decoding algorithm.