Combined array processing and space-time coding

The information capacity of wireless communication systems may be increased dramatically by employing multiple transmit and receive antennas. The goal of system design is to exploit this capacity in a practical way. An effective approach to increasing data rate over wireless channels is to employ space-time coding techniques appropriate to multiple transmit antennas. These space-time codes introduce temporal and spatial correlation into signals transmitted from different antennas, so as to provide diversity at the receiver, and coding gain over an uncoded system. For large number of transmit antennas and at high bandwidth efficiencies, the receiver may become too complex whenever correlation across transmit antennas is introduced. This paper dramatically reduces encoding and decoding complexity by partitioning antennas at the transmitter into small groups, and using individual space-time codes, called the component codes, to transmit information from each group of antennas. At the receiver, an individual space-time code is decoded by a novel linear processing technique that suppresses signals transmitted by other groups of antennas by treating them as interference. A simple receiver structure is derived that provides diversity and coding gain over uncoded systems. This combination of array processing at the receiver and coding techniques for multiple transmit antennas can provide reliable and very high data rate communication over narrowband wireless channels. A refinement of this basic structure gives rise to a multilayered space-time architecture that both generalizes and improves upon the layered space-time architecture proposed by Foschini (see Bell Labs Tech. J., vol.1, no.2, 1996)     

Turbo processing in systems with high-efficient space-time coding

Construction principles for algorithms intended to perform space-time and turbo processing of signals and to improve the qualitative characteristics of high-rate data transmission systems have been discussed. The algorithm for space—time processing of signals transmitted by the system with several transmitting and several receiving antennas—which relies on the analysis of principles applied to the construction of known transmission systems with high spectral efficiencies and makes it possible to enhance the reliability of information transmission without deteriorating the system throughput—is proposed. A new iterative algorithm for signal processing at the receiver has been developed to implement the advantages of the proposed method of space—time processing of signals. The results of computer simulation that confirm the great potentiality of proposed algorithms are presented.     

空时码概述

在第三代移动通信系统中,空时编码(space-time coding)技术是抗信道衰落和提高系统容量的一种新的编码方式.本文介绍了空时编码技术的由来和分类,并着重介绍了空时分组码的基本编解码算法.最后在SPW下对2发1收的正交空时分组码的编解码算法进行了仿真并给出了仿真结果.     

An efficient detector for combined space-time coding and layered processing

Group layered space-time architecture (GLST) combines space-time block coding and layered space-time processing, where the transmit stream is partitioned into different groups, and in each group, space-time block coding is applied. In the traditional receiver of GLST, group detection is applied first to suppress the interference from other groups, and then decoding is performed for the desired group. In this letter, a novel detector is proposed in which the entire groups are decoded first, and then group detection is performed next. Theoretical analysis will demonstrate that the new detector can achieve a significant capacity gain compared with the traditional one. Simulation results will further show that the proposed detector can obtain at least 4 dB gain at a frame-error rate of 10/sup -2/, for instance.     

A new approach to layered space-time coding and signal processing

The information-theoretic capacity of multiple antenna systems has been shown to be significantly higher than that of single antenna systems in Rayleigh-fading channels. In an attempt to realize this capacity, Foschini (1996) proposed the layered space-time architecture. This scheme was argued to asymptotically achieve a lower bound on the capacity. Another line of work has focused on the design of channel codes that exploit the spatial diversity provided by multiple transmit antennas (Tarokh et al. 1998, Hammons and Gamal 2000). In this paper, we take a fresh look at the problem of designing multiple-input-multiple-output (MIMO) wireless systems. First, we develop a generalized framework for the design of layered space-time systems. Then, we present a novel layered architecture that combines efficient algebraic code design with iterative signal processing techniques. This novel layered system is referred to as the threaded space-time (TST) architecture. The TST architecture provides more flexibility in the tradeoff between power efficiency, bandwidth efficiency, and receiver complexity. It also allows for exploiting the temporal diversity provided by time-varying fading channels. Simulation results are provided for the various techniques that demonstrate the superiority of the proposed TST architecture over both the diagonal layered space-time architecture in Foschini (1996) and the multilayering approach (Tarokh et al. (1999).     

Universal space-time coding

A universal framework is developed for constructing full-rate and full-diversity coherent space-time codes for systems with arbitrary numbers of transmit and receive antennas. The proposed framework combines space-time layering concepts with algebraic component codes optimized for single-input-single-output (SISO) channels. Each component code is assigned to a "thread" in the space-time matrix, allowing it thus full access to the channel spatial diversity in the absence of the other threads. Diophantine approximation theory is then used in order to make the different threads "transparent" to each other. Within this framework, a special class of signals which uses algebraic number-theoretic constellations as component codes is thoroughly investigated. The lattice structure of the proposed number-theoretic codes along with their minimal delay allow for polynomial complexity maximum-likelihood (ML) decoding using algorithms from lattice theory. Combining the design framework with the Cayley transform allows to construct full diversity differential and noncoherent space-time codes. The proposed framework subsumes many of the existing codes in the literature, extends naturally to time-selective and frequency-selective channels, and allows for more flexibility in the tradeoff between power efficiency, bandwidth efficiency, and receiver complexity. Simulation results that demonstrate the significant gains offered by the proposed codes are presented in certain representative scenarios.     

Optimal transmitter eigen-beamforming and space-time block coding based on channel correlations

Optimal transmitter designs obeying the water-filling principle are well-documented, and widely applied, when the propagation channel is deterministically known and regularly updated at the transmitter. Because channel state information (CSI) may be costly or impossible to acquire in rapidly varying wireless environments, we develop in this paper statistical water-filling approaches for stationary random fading channels. These approaches require only knowledge of the channel correlations that do not necessitate frequent updates, and can be easily acquired. Applied to a multiple transmit-antenna paradigm, our optimal transmitter design turns out to be an eigen-beamformer with multiple beams pointing to orthogonal directions along the eigenvectors of the channel's correlation matrix, and with proper power loading across the beams. The optimality pertains to minimizing a tight bound on the symbol error rate. The resulting loaded eigen-beamforming outperforms not only the equal-power allocation across all antennas, but also the conventional beamformer that transmits the available power along the strongest direction. Coupled with orthogonal space-time block codes, two-dimensional (2-D) eigen-beamforming emerges as a more attractive choice than conventional one-dimensional (1-D) beamforming with uniformly better performance, without rate reduction, and without complexity increase.     

Optimal transmitter eigen-beamforming and space-time block coding based on channel mean feedback

Optimal transmitter designs obeying the water-filling principle are well-documented; they are widely applied when the propagation channel is deterministically known and regularly updated at the transmitter. Because channel state information is impossible to be known perfectly at the transmitter in practical wireless systems, we design, in this paper, an optimal multiantenna transmitter based on the knowledge of mean values of the underlying channels. Our optimal transmitter design turns out to be an eigen-beamformer with multiple beams pointing to orthogonal directions along the eigenvectors of the correlation matrix of the estimated channel at the transmitter and with proper power loading across beams. The optimality pertains to minimizing an upper bound on the symbol error rate, which leads to better performance than maximizing the expected signal-to-noise ratio (SNR) at the receiver. Coupled with orthogonal space-time block codes, two-directional eigen-beamforming emerges as a more attractive choice than conventional one-directional beamforming with uniformly improved performance, without rate reduction, and without essential increase in complexity. With multiple receive antennas and reasonably good feedback quality, the two-directional eigen-beamformer is also capable of achieving the best possible performance in a large range of transmit-power-to-noise ratios, without a rate penalty.     

PIC detector for distributed space-time block coding under imperfect synchronisation

A parallel interference cancellation (PIC) detection scheme is proposed to suppress the impact of imperfect synchronisation. By treating as interference the extra components in the received signal caused by timing misalignment, the PIC detector not only offers much improved performance but also retains a low structural and computational complexity     

Near-optimum detection for distributed space-time block coding under imperfect synchronization

Significant performance gain can potentially be achieved by employing distributed space-time block coding (DSTBC) in ad hoc or mesh networks. So far, however, most research on D-STBC has assumed that cooperative relay nodes are perfectly synchronized. Considering the difficulty in meeting such an assumption in many practical systems, this paper proposes a simple and near-optimum detection scheme for the case of two relay nodes, which proves to be able to handle far greater timing misalignment than the conventional STBC detector.     

Distributed space-time block coding

In this paper, a new class of distributed space-time block codes (DSTBCs) is introduced. These DSTBCs are designed for wireless networks which have a large set of single-antenna relay nodes /spl Nscr/, but at any given time only a small, a priori unknown subset of nodes S/spl sube//spl Nscr/ can be active. In the proposed scheme, the signal transmitted by an active relay node is the product of an information-carrying code matrix and a unique node signature vector of length N/sub c/. It is shown that existing STBCs designed for N/sub c/2 co-located antennas are favorable choices for the code matrix, guaranteeing a diversity order of d=min{N/sub S/,N/sub c/} if N/sub S/ nodes are active. For the most interesting case, N/sub S//spl ges/N/sub c/, the performance loss entailed by the distributed implementation is analytically characterized. Furthermore, efficient methods for the optimization of the set of signature vectors are provided. Depending on the chosen design, the proposed DSTBCs allow for low-complexity coherent, differential, and noncoherent detection, respectively. Possible applications include ad hoc and sensor networks employing decode-and-forward relaying.     

Full-diversity full-rate complex-field space-time coding

Exciting developments in wireless multiantenna communications have led to designs aiming mainly at one of two objectives: either high-performance by enabling the diversity provided by multi-input multi-output (MIMO) channels or high-rates by capitalizing on space-time multiplexing gains to realize the high capacity of MIMO fading channels. By concatenating a linear complex-field coder (a.k.a. linear precoder) with a layered space-time mapper, we design systems capable of achieving both goals: full-diversity and full-rate (FDFR), with any number of transmit- and receive-antennas. We develop FDFR designs not only for flat-fading but for frequency-selective, or, time-selective fading MIMO channels as well. Furthermore, we establish the flexibility of our FDFR designs in striking desirable performance-rate-complexity tradeoffs. Our theoretical claims are confirmed by simulations.     

Generalized PSK in space-time coding

A wireless communication system using multiple antennas promises reliable transmission under Rayleigh flat fading assumptions. Design criteria and practical schemes have been presented for both coherent and noncoherent communication channels. In this paper, we generalize one-dimensional (1-D) phase-shift keying (PSK) signals and introduce space-time constellations from generalized PSK (GPSK) signals based on the complex and real orthogonal designs. The resulting space-time constellations reallocate the energy for each transmitting antenna and feature good diversity products; consequently, their performances are better than some of the existing comparable codes. Moreover, since the maximum-likelihood (ML) decoding of our proposed codes can be decomposed to 1-D PSK signal demodulation, the ML decoding of our codes can be implemented in a very efficient way.     

A low-complexity noncoherent iterative space-time demodulator

Turbo coded unitary space-time modulation (USTM) can provide large coding gain as compared to uncoded USTM. Because the noncoherent space-time maximum a posteriori demodulator is very complicated, in this letter, we propose a new low-complexity noncoherent iterative space-time demodulator for the USTM constructed from pilot symbol-assisted modulation. The proposed demodulator utilizes both hard and soft decisions from the turbo decoder to simplify the computational task as well as produce reliable soft outputs. Several examples demonstrate that this demodulator has both low complexity and good error performance.     

Optimal antenna subset selection and blind detection approach applied to orthogonal space-time block coding

An approach combining optimal antenna subset selection with blind detection scheme for Orthogonal Space-Time Block Coding （OSTBC） is proposed in this paper. The optimal antenna subset selection is taken into account at transmitter and/or receiver sides, which chooses the optimal antennas to increase the diversity order of OSTBC and improve further its performance. In order to enhance the robustness of the detection used in the conventional OSTBC scheme, a blind detection scheme based on Independent Component Analysis （ICA） is exploited which can directly extract transmitted signals without channel estimation. Performance analysis shows that the proposed approach can achieve the full diversity and the flexibility of system design by using the antenna selection and the ICA based blind detection schemes.     

Bit-interleaved space-time coded modulation with iterative decoding

Bit-interleaved space-time coded modulation (BI-STC), which combines serial concatenation of bit-interleaved coded modulation (BICM) with space-time block codes, can effectively exploit the available diversity in space and time under various fading conditions. In this letter, we propose to use iterative decoding to further improve the performance of BI-STC by exploiting the concatenating structure of the codes. The decoding metric is therefore modified to fit for the iterative process, and the derived error bounds suggest that set-partition labeling instead of gray labeling should be used when considering iterative decoding.     

Performance comparison of space-time coding techniques

Simulation results for the comparative performance of a number of space-time coding (STC) schemes in a multiple-input-multiple-output (MIMO) channel are presented and compared with a single-antenna benchmark and two-antenna space-time transit diversity (STTD) scheme. Both the space-time trellis coding (STTC) and BLAST approaches offer high spectral efficiencies, but STTC outperforms BLAST in terms of its power efficiency     

On the robustness of space-time coding

Space-time (ST) coding has emerged as one of the most promising technologies for meeting the challenges imposed by the wireless channel. This technology is primarily concerned with two-dimensional (2-D) signal design for multitransmit antenna wireless systems. Despite the progress in ST coding, several important questions remain unanswered. In a practical multiuser setting, one would expect different users to experience different channel conditions. This motivates the design of robust ST codes that exhibit satisfactory performance in various environments. In this paper, we investigate the robustness of ST codes in line-of-sight and correlated Rayleigh fading channels. We develop the design criteria that govern the performance of ST codes in these environments. Our analysis demonstrates that full-diversity ST codes are essential to achieving satisfactory performance in line-of-sight channels. We further show that a simple phase randomization approach achieves significant performance gains in the line-of-sight case without affecting the performance in Rayleigh fading channels. In the correlated fading environments, we characterize the achievable diversity order based on the number of diversity degrees of freedom in the channel. This characterization supports experimental observations that suggest that the quasistatic model is not a worst-case scenario and establishes the necessary tradeoff between the transmission rate and performance robustness. Finally, we consider the design of ST codes using some prior knowledge about the channel spatio-temporal correlation function.     

FSO-MIMO中的自适应多层空时编码

为了根据信道的时变特性来选择合适的空时编码方式,结合正交空时分组码与分层空时码的优点,并借鉴天线分组的多层空时编码原理,提出了一种在自由空间光通信多输入多输出中4×4的自适应多层空时编码方案,并用Monte Carlo法进行仿真研究。结果表明,在一定的信噪比范围内,采用自适应多层空时,编码方案在保证一定误比特率的条件下,能使数据传输速率达到最大化;采用自适应调制方式能更有效地利用资源并提高数据的传输速率。     

Cooperative space-time coding for wireless networks

We consider a cooperative transmission scheme in which the collaborating nodes may have multiple antennas. We present the performance analysis and design of space-time codes that are capable of achieving the full diversity provided by user cooperation. Our codes use the principle of overlays in time and space, and ensure that cooperation takes place as often as possible. We show how cooperation among nodes with different numbers of antennas can be accomplished, and how the quality of the interuser link affects the cooperative performance. We illustrate that space-time cooperation can greatly reduce the error rates of all the nodes involved, even for poor interuser channel quality.