DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models

The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive maximum-likelihood (ML) receiver. Specifically, the work establishes the DMT optimality of a class of regularized lattice decoders, and more importantly the DMT optimality of their lattice-reduction (LR)-aided linear counterparts. The results hold for all channel statistics, for all channel dimensions, and most interestingly, irrespective of the particular lattice-code applied. As a special case, it is established that the LLL-based LR-aided linear implementation of the MMSE-GDFE lattice decoder facilitates DMT optimal decoding of any lattice code at a worst-case complexity that grows at most linearly in the data rate. This represents a fundamental reduction in the decoding complexity when compared to ML decoding whose complexity is generally exponential in rate. The results' generality lends them applicable to a plethora of pertinent communication scenarios such as quasi-static MIMO, MIMO-OFDM, ISI, cooperative-relaying, and MIMO-ARQ channels, in all of which the DMT optimality of the LR-aided linear decoder is guaranteed. The adopted approach yields insight, and motivates further study, into joint transceiver designs with an improved SNR gap to ML decoding.Comment: 16 pages, 1 figure (3 subfigures), submitted to the IEEE Transactions on Information Theor

A universal space-time architecture for multiple-antenna aided systems

In this tutorial, we first review the family of conventional multiple-antenna techniques, and then we provide a general overview of the recent concept of the powerful Multiple-Input Multiple-Output (MIMO) family based on a universal Space-Time Shift Keying (STSK) philosophy. When appropriately configured, the proposed STSK scheme has the potential of outperforming conventional MIMO arrangements

Fundamental Limits in Correlated Fading MIMO Broadcast Channels: Benefits of Transmit Correlation Diversity

We investigate asymptotic capacity limits of the Gaussian MIMO broadcast channel (BC) with spatially correlated fading to understand when and how much transmit correlation helps the capacity. By imposing a structure on channel covariances (equivalently, transmit correlations at the transmitter side) of users, also referred to as \emph{transmit correlation diversity}, the impact of transmit correlation on the power gain of MIMO BCs is characterized in several regimes of system parameters, with a particular interest in the large-scale array (or massive MIMO) regime. Taking the cost for downlink training into account, we provide asymptotic capacity bounds of multiuser MIMO downlink systems to see how transmit correlation diversity affects the system multiplexing gain. We make use of the notion of joint spatial division and multiplexing (JSDM) to derive the capacity bounds. It is advocated in this paper that transmit correlation diversity may be of use to significantly increase multiplexing gain as well as power gain in multiuser MIMO systems. In particular, the new type of diversity in wireless communications is shown to improve the system multiplexing gain up to by a factor of the number of degrees of such diversity. Finally, performance limits of conventional large-scale MIMO systems not exploiting transmit correlation are also characterized.Comment: 29 pages, 8 figure

Unequal error protection for MIMO systems with a hybrid structure

We propose a hybrid multiple-input-multiple-output (MIMO) architecture to implement unequal error protection (UEP) for video delivery in MIMO systems. On the transmitter side, some of the transmit antennas are used to implement transmit diversity for delivering video data with high priority, while others are employed for spatial multiplexing to transmit video data with low priority. On the receiver side, a hybrid signal detection mechanism is adopted to separate and decode the mixed data. The goal is to exploit the diversity gain to provide better protection to the high priority data, while transmitting the low priority data with spatial multiplexing to achieve high data rate. Analysis and simulation results demonstrate that the proposed UEP mechanism significantly enhances the quality of video reception with a high spectrum efficiency. © 2006 IEEE.published_or_final_versio

Low Complexity Maximum-Likelihood Detector for DSTTD Architecture Based on the QRD-M Algorithm

This paper presents a new decoder algorithm for the double space-time transmit diversity (DSTTD) system. The decoder is based on the QRD-M algorithm, which performs a breadth-first search of possible solutions tree. The search is simplified by skipping unlikely candididates, and it is stopped when no promising candidates are left. Furthermore, the search is divided into three concurrent iterations, making possible a fast, parallel implementation either in hardware or software. After presenting an analysis of the capacity and diversity of DSTTD, we present performance results showing that the proposed decoder is capable of achieving near maximum likelihood performance. We also show that the proposed algorithm exhibits lower computational complexity than other existing maximum likelihood detectors

Distributed space-time coding including the golden code with application in cooperative networks

This thesis presents new methodologies to improve performance of wireless cooperative networks using the Golden Code. As a form of space-time coding, the Golden Code can achieve diversity-multiplexing tradeoff and the data rate can be twice that of the Alamouti code. In practice, however, asynchronism between relay nodes may reduce performance and channel quality can be degraded from certain antennas. Firstly, a simple offset transmission scheme, which employs full interference cancellation (FIC) and orthogonal frequency division multiplexing (OFDM), is enhanced through the use of four relay nodes and receiver processing to mitigate asynchronism. Then, the potential reduction in diversity gain due to the dependent channel matrix elements in the distributed Golden Code transmission, and the rate penalty of multihop transmission, are mitigated by relay selection based on two-way transmission. The Golden Code is also implemented in an asynchronous one-way relay network over frequency flat and selective channels, and a simple approach to overcome asynchronism is proposed. In one-way communication with computationally efficient sphere decoding, the maximum of the channel parameter means is shown to achieve the best performance for the relay selection through bit error rate simulations. Secondly, to reduce the cost of hardware when multiple antennas are available in a cooperative network, multi-antenna selection is exploited. In this context, maximum-sum transmit antenna selection is proposed. End-to-end signal-to-noise ratio (SNR) is calculated and outage probability analysis is performed when the links are modelled as Rayleigh fading frequency flat channels. The numerical results support the analysis and for a MIMO system maximum-sum selection is shown to outperform maximum-minimum selection. Additionally, pairwise error probability (PEP) analysis is performed for maximum-sum transmit antenna selection with the Golden Code and the diversity order is obtained. Finally, with the assumption of fibre-connected multiple antennas with finite buffers, multiple-antenna selection is implemented on the basis of maximum-sum antenna selection. Frequency flat Rayleigh fading channels are assumed together with a decode and forward transmission scheme. Outage probability analysis is performed by exploiting the steady-state stationarity of a Markov Chain model

Full-Rate, Full-Diversity Adaptive Space Time Block Coding for Transmission over Rayleigh Fading Channels

A full-rate, full-diversity Adaptive Space Time Block Coding (ASTBC) scheme based on Singular Value Decomposition (SVD) is proposed for transmission over Rayleigh fading channels. The ASTBC-SVD scheme advocated is capable of providing both full-rate and full-diversity for any number of transmit antennas, Nt, provided that the number of receive antennas, Nr, equals to Nt. Furthermore, the ASTBC-SVD scheme may achieve an additional coding gain due to its higher product distance with the aid of the block code employed. In conjunction with SVD, the “water-filling” approach can be employed for adaptively distributing the transmitted power to the various antennas transmit according to the channel conditions, in order to further enhance the attainable performance. Since a codeword constituted by Nt symbols is transmitted in a single time slot by mapping the Nt symbols to the Nt transmit antennas in the spatial domain, the attainable performance of the ASTBC-SVD scheme does not degrade, when the channel impulse response values vary from one time slot to the next. Hence, the proposed ASTBC-SVD scheme is attractive in the context of both uncorrelated and correlated Rayleigh fading channels. The performance of the proposed scheme was evaluated, when communicating over uncorrelated Rayleigh fading channels. Explicitly, an Eb/N0 gain of 2.5 dB was achieved by the proposed ASTBC-SVD scheme against Alamouti’s scheme [1], when employing Nt = Nr = 2 in conjunction with 8PSK

Time-Delay Multiplexing of Two Beams in a Terahertz Imaging Radar

We demonstrate a time-delay multiplexing technique that doubles the frame rate of a 660–690-GHz imaging radar with minimal additional instrument complexity. This is done by simultaneously projecting two offset, orthogonally polarized radar beams generated and detected by a common source and receiver. Beam splitting and polarization rotation is accomplished with a custom designed waveguide hybrid coupler and twist. A relative time lag of approximately 2 ns between the beams’ waveforms is introduced using a quasi-optical delay line, followed by spatial recombination using a selectively reflective wire grid. This delay is much longer than the approximately 20-ps time-of-flight resolution of the 30-GHz bandwidth radar, permitting the two beams’ reflected signals from a compact target to be easily distinguished in digital post-processing of the single receiver channel

Wireless transmission protocols using relays for broadcast and information exchange channels

Relays have been used to overcome existing network performance bottlenecks in meeting the growing demand for large bandwidth and high quality of service (QoS) in wireless networks. This thesis proposes several wireless transmission protocols using relays in practical multi-user broadcast and information exchange channels. The main theme is to demonstrate that efficient use of relays provides an additional dimension to improve reliability, throughput, power efficiency and secrecy. First, a spectrally efficient cooperative transmission protocol is proposed for the multiple-input and singleoutput (MISO) broadcast channel to improve the reliability of wireless transmission. The proposed protocol mitigates co-channel interference and provides another dimension to improve the diversity gain. Analytical and simulation results show that outage probability and the diversity and multiplexing tradeoff of the proposed cooperative protocol outperforms the non-cooperative scheme. Second, a two-way relaying protocol is proposed for the multi-pair, two-way relaying channel to improve the throughput and reliability. The proposed protocol enables both the users and the relay to participate in interference cancellation. Several beamforming schemes are proposed for the multi-antenna relay. Analytical and simulation results reveal that the proposed protocol delivers significant improvements in ergodic capacity, outage probability and the diversity and multiplexing tradeoff if compared to existing schemes. Third, a joint beamforming and power management scheme is proposed for multiple-input and multiple-output (MIMO) two-way relaying channel to improve the sum-rate. Network power allocation and power control optimisation problems are formulated and solved using convex optimisation techniques. Simulation results verify that the proposed scheme delivers better sum-rate or consumes lower power when compared to existing schemes. Fourth, two-way secrecy schemes which combine one-time pad and wiretap coding are proposed for the scalar broadcast channel to improve secrecy rate. The proposed schemes utilise the channel reciprocity and employ relays to forward secret messages. Analytical and simulation results reveal that the proposed schemes are able to achieve positive secrecy rates even when the number of users is large. All of these new wireless transmission protocols help to realise better throughput, reliability, power efficiency and secrecy for wireless broadcast and information exchange channels through the efficient use of relays