Turbo Packet Combining for Broadband Space-Time BICM Hybrid-ARQ Systems with Co-Channel Interference

In this paper, efficient turbo packet combining for single carrier (SC) broadband multiple-input--multiple-output (MIMO) hybrid--automatic repeat request (ARQ) transmission with unknown co-channel interference (CCI) is studied. We propose a new frequency domain soft minimum mean square error (MMSE)-based signal level combining technique where received signals and channel frequency responses (CFR)s corresponding to all retransmissions are used to decode the data packet. We provide a recursive implementation algorithm for the introduced scheme, and show that both its computational complexity and memory requirements are quite insensitive to the ARQ delay, i.e., maximum number of ARQ rounds. Furthermore, we analyze the asymptotic performance, and show that under a sum-rank condition on the CCI MIMO ARQ channel, the proposed packet combining scheme is not interference-limited. Simulation results are provided to demonstrate the gains offered by the proposed technique.Comment: 12 pages, 7 figures, and 2 table

Transmission and detection for space-time block coding and v-blast systems

This dissertation focuses on topics of data transmission and detection of space -time block codes (STBC). The STBCs can be divided into two main categories, namely, the orthogonal space-time block codes (OSTBC) and the quasi-orthogonal space-time codes (Q-OSTBC). The space-time block coded systems from transceiver design perspective for both narrow-band and frequency selective wireless environment are studied. The dissertation also processes and studies a fast iterative detection scheme for a high-rate space-time transmission system, the V-BLAST system. In Chapter 2, a new OSTBC scheme with full-rate and full-diversity, which can be used on QPSK transceiver systems with four transmit antennas and any number of receivers is studied. The newly proposed coding scheme is a non-linear coding. Compared with full-diversity QOSTBC, an obvious advantage of our proposed new OSTBC is that the coded signals transmitted through all four transmit antennas do not experience any constellation expansion. In Chapter 3, a new fast coherent detection algorithm is proposed to provide maximum likelihood (ML) detection for Q-OSTBC. The new detection scheme is also very useful to analysis the diversity property of Q-OSTBC and design full diversity Q-OSTBC codes. The complexity of the new proposed detection algorithm can be independent to the modulation order and is especially suitable for high data rate transmission. In Chapter 4, the space-time coding schemes in frequency selective channels are studied. Q-OSTC transmission and detection schemes are firstly extended for frequency selective wireless environment. A new block based quasi-orthogonal space-time block encoding and decoding (Q-OSTBC) scheme for a wireless system with four transmit antennas is proposed in frequency selective fading channels. The proposed MLSE detection scheme effectively combats channel dispersion and frequency selectivity due to multipath, yet still provides full diversity gain. However, since the computational complexity of MLSE detection increases exponentially with the maximum delay of the frequency selective channel, a fast sub-optimal detection scheme using MMSE equalizer is also proposed, especially for channels with large delays. The Chapter 5 focuses on the V-BLAST system, an important high-rate space-time data transmission scheme. A reduced complexity ML detection scheme for VBLAST systems, which uses a pre-decoder guided local exhaustive search is proposed and studied. A polygon searching algorithm and an ordered successive interference cancellation (O-SIC) sphere searching algorithm are major components of the proposed multi-step ML detectors. At reasonable high SNRs, our algorithms have low complexity comparable to that of O-SIC algorithm, while they provide significant performance improvement. Another new low complexity algorithm termed ordered group-wise interference cancellation (O-GIC) is also proposed for the detection of high dimensional V-BLAST systems. The O-GIC based detection scheme is a sub-optimal detection scheme, however, it outperforms the O-SIC

Cyclic Prefix-Free MC-CDMA Arrayed MIMO Communication Systems

The objective of this thesis is to investigate MC-CDMA MIMO systems where the antenna array geometry is taken into consideration. In most MC-CDMA systems, cyclic pre xes, which reduce the spectral e¢ ciency, are used. In order to improve the spectral efficiency, this research study is focused on cyclic pre x- free MC-CDMA MIMO architectures. Initially, space-time wireless channel models are developed by considering the spatio-temporal mechanisms of the radio channel, such as multipath propaga- tion. The spatio-temporal channel models are based on the concept of the array manifold vector, which enables the parametric modelling of the channel. The array manifold vector is extended to the multi-carrier space-time array (MC-STAR) manifold matrix which enables the use of spatio-temporal signal processing techniques. Based on the modelling, a new cyclic pre x-free MC- CDMA arrayed MIMO communication system is proposed and its performance is compared with a representative existing system. Furthermore, a MUSIC-type algorithm is then developed for the estimation of the channel parameters of the received signal. This proposed cyclic pre x-free MC-CDMA arrayed MIMO system is then extended to consider the effects of spatial diffusion in the wireless channel. Spatial diffusion is an important channel impairment which is often ignored and the failure to consider such effects leads to less than satisfactory performance. A subspace-based approach is proposed for the estimation of the channel parameters and spatial spread and reception of the desired signal. Finally, the problem of joint optimization of the transmit and receive beam- forming weights in the downlink of a cyclic pre x-free MC-CDMA arrayed MIMO communication system is investigated. A subcarrier-cooperative approach is used for the transmit beamforming so that there is greater flexibility in the allocation of channel symbols. The resulting optimization problem, with a per-antenna transmit power constraint, is solved by the Lagrange multiplier method and an iterative algorithm is proposed

Turbo Packet Combining Strategies for the MIMO-ISI ARQ Channel

This paper addresses the issue of efficient turbo packet combining techniques for coded transmission with a Chase-type automatic repeat request (ARQ) protocol operating over a multiple-input--multiple-output (MIMO) channel with intersymbol interference (ISI). First of all, we investigate the outage probability and the outage-based power loss of the MIMO-ISI ARQ channel when optimal maximum a posteriori (MAP) turbo packet combining is used at the receiver. We show that the ARQ delay (i.e., the maximum number of ARQ rounds) does not completely translate into a diversity gain. We then introduce two efficient turbo packet combining algorithms that are inspired by minimum mean square error (MMSE)-based turbo equalization techniques. Both schemes can be viewed as low-complexity versions of the optimal MAP turbo combiner. The first scheme is called signal-level turbo combining and performs packet combining and multiple transmission ISI cancellation jointly at the signal-level. The second scheme, called symbol-level turbo combining, allows ARQ rounds to be separately turbo equalized, while combining is performed at the filter output. We conduct a complexity analysis where we demonstrate that both algorithms have almost the same computational cost as the conventional log-likelihood ratio (LLR)-level combiner. Simulation results show that both proposed techniques outperform LLR-level combining, while for some representative MIMO configurations, signal-level combining has better ISI cancellation capability and achievable diversity order than that of symbol-level combining.Comment: 13 pages, 7 figures, and 2 table

Polynomial matrix decomposition techniques for frequency selective MIMO channels

For a narrowband, instantaneous mixing multi-input, multi-output (MIMO) communications system, the channel is represented as a scalar matrix. In this scenario, singular value decomposition (SVD) provides a number of independent spatial subchannels which can be used to enhance data rates or to increase diversity. Alternatively, a QR decomposition can be used to reduce the MIMO channel equalization problem to a set of single channel equalization problems. In the case of a frequency selective MIMO system, the multipath channel is represented as a polynomial matrix. Thus conventional matrix decomposition techniques can no longer be applied. The traditional solution to this broadband problem is to reduce it to narrowband form by using a discrete Fourier transform (DFT) to split the broadband channel into N narrow uniformly spaced frequency bands and applying scalar decomposition techniques within each band. This describes an orthogonal frequency division multiplexing (OFDM) based system. However, a novel algorithm has been developed for calculating the eigenvalue decomposition of a para-Hermitian polynomial matrix, known as the sequential best rotation (SBR2) algorithm. SBR2 and its QR based derivatives allow a true polynomial singular value and QR decomposition to be formulated. The application of these algorithms within frequency selective MIMO systems results in a fundamentally new approach to exploiting spatial diversity. Polynomial matrix decomposition and OFDM based solutions are compared for a wide variety of broadband MIMO communication systems. SVD is used to create a robust, high gain communications channel for ultra low signal-to-noise ratio (SNR) environments. Due to the frequency selective nature of the channels produced by polynomial matrix decomposition, additional processing is required at the receiver resulting in two distinct equalization techniques based around turbo and Viterbi equalization. The proposed approach is found to provide identical performance to that of an existing OFDM scheme while supporting a wider range of access schemes. This work is then extended to QR decomposition based communications systems, where the proposed polynomial approach is found to not only provide superior bit-error-rate (BER) performance but significantly reduce the complexity of transmitter design. Finally both techniques are combined to create a nulti-user MIMO system that provides superior BER performance over an OFDM based scheme. Throughout the work the robustness of the proposed scheme to channel state information (CSI) error is considered, resulting in a rigorous demonstration of the capabilities of the polynomial approach

Spatial diversity in MIMO communication systems with distributed or co-located antennas

The use of multiple antennas in wireless communication systems has gained much attention during the last decade. It was shown that such multiple-input multiple-output (MIMO) systems offer huge advantages over single-antenna systems. Typically, quite restrictive assumptions are made concerning the spacing of the individual antenna elements. On the one hand, it is typically assumed that the antenna elements at transmitter and receiver are co-located, i.e., they belong to some sort of antenna array. On the other hand, it is often assumed that the antenna spacings are sufficiently large, so as to justify the assumption of independent fading. In this thesis, the above assumptions are relaxed. In the first part, it is shown that MIMO systems with distributed antennas and MIMO systems with co-located antennas can be treated in a single, unifying framework. In the second part this fact is utilized, in order to develop appropriate transmit power allocation strategies for co-located and distributed MIMO systems. Finally, the third part focuses on specific synchronization problems that are of interest for distributed MIMO systems

Smart antennas: state of the art

Aim of this contribution is to illustrate the state of the art of smart antenna research from several perspectives. The bow is drawn from transmitter issues via channel measurements and modeling, receiver signal processing, network aspects, technological challenges towards first smart antenna applications and current status of standardization. Moreover, some future prospects of different disciplines in smart antenna research are given.Peer Reviewe

A low-complexity time-domain MMSE channel estimator for space-time/frequency block-coded OFDM systems

Focusing on transmit diversity orthogonal frequency-division multiplexing (OFDM) transmission through frequency-selective channels, this paper pursues a channel estimation approach in time domain for both space-frequency OFDM (SF-OFDM) and space-time OFDM(ST-OFDM) systems based on AR channel modelling. The paper proposes a computationally efficient, pilot-aided linear minimum mean-square-error (MMSE) time-domain channel estimation algorithm for OFDM systems with transmitter diversity in unknown wireless fading channels. The proposed approach employs a convenient representation of the channel impulse responses based on the Karhunen-Loeve (KL) orthogonal expansion and finds MMSE estimates of the uncorrelated KL series expansion coefficients. Based on such an expansion, no matrix inversion is required in the proposed MMSE estimator. Subsequently, optimal rank reduction is applied to obtain significant taps resulting in a smaller computational load on the proposed estimation algorithm. The performance of the proposed approach is studied through the analytical results and computer simulations. In order to explore the performance, the closed-form expression for the average symbol error rate (SER)probability is derived for the maximum ratio receive combiner(MRRC). We then consider the stochastic Cramer-Rao lower bound(CRLB) and derive the closed-form expression for the random KL coefficients, and consequently exploit the performance of the MMSE channel estimator based on the evaluation of minimum Bayesian MSE. We also analyze the effect of a modelling mismatch on the estimator performance. Simulation results confirm our theoretical analysis and illustrate that the proposed algorithms are capable of tracking fast fading and improving overall performance. Copyright © 2006 Hindawi Publishing Corporation. All rights reserved