Iterative joint channel and data estimation for rank-deficient MIMO-OFDM

In this paper we propose a turbo-detected multi-antenna-multi-carrier receiver scheme. Following the philosophy of the turbo processing, our turbo MIMO-OFDM receiver comprises a succession of detection modules, namely the channel estimator, the space-time detector and the decoder, which iteratively exchange soft bit-related information and thus facilitate a substantial improvement of the overall system performance. In this paper we analyze the achievable performance of the iterative system proposed with the aim of documenting the various design trade-offs, such as the achievable error-rate performance, the attainable data-rate as well as the associated computational complexity. Specifically, we report a virtually error-free performance for a rate-1/2 turbo-coded 8x8-QPSK-OFDM system, exhibiting an effective throughput of 8*2/2=8 bits/sec/Hz and having a pilot overhead of only 10%, at SNR of 7.5dB and normalized Doppler frequency of 0.003, which corresponds to a mobile terminal speed of about 65 km/h

Soft-Decision-Driven Channel Estimation for Pipelined Turbo Receivers

We consider channel estimation specific to turbo equalization for multiple-input multiple-output (MIMO) wireless communication. We develop a soft-decision-driven sequential algorithm geared to the pipelined turbo equalizer architecture operating on orthogonal frequency division multiplexing (OFDM) symbols. One interesting feature of the pipelined turbo equalizer is that multiple soft-decisions become available at various processing stages. A tricky issue is that these multiple decisions from different pipeline stages have varying levels of reliability. This paper establishes an effective strategy for the channel estimator to track the target channel, while dealing with observation sets with different qualities. The resulting algorithm is basically a linear sequential estimation algorithm and, as such, is Kalman-based in nature. The main difference here, however, is that the proposed algorithm employs puncturing on observation samples to effectively deal with the inherent correlation among the multiple demapper/decoder module outputs that cannot easily be removed by the traditional innovations approach. The proposed algorithm continuously monitors the quality of the feedback decisions and incorporates it in the channel estimation process. The proposed channel estimation scheme shows clear performance advantages relative to existing channel estimation techniques.Comment: 11 pages; IEEE Transactions on Communications 201

Near-Instantaneously Adaptive HSDPA-Style OFDM Versus MC-CDMA Transceivers for WIFI, WIMAX, and Next-Generation Cellular Systems

Burts-by-burst (BbB) adaptive high-speed downlink packet access (HSDPA) style multicarrier systems are reviewed, identifying their most critical design aspects. These systems exhibit numerous attractive features, rendering them eminently eligible for employment in next-generation wireless systems. It is argued that BbB-adaptive or symbol-by-symbol adaptive orthogonal frequency division multiplex (OFDM) modems counteract the near instantaneous channel quality variations and hence attain an increased throughput or robustness in comparison to their fixed-mode counterparts. Although they act quite differently, various diversity techniques, such as Rake receivers and space-time block coding (STBC) are also capable of mitigating the channel quality variations in their effort to reduce the bit error ratio (BER), provided that the individual antenna elements experience independent fading. By contrast, in the presence of correlated fading imposed by shadowing or time-variant multiuser interference, the benefits of space-time coding erode and it is unrealistic to expect that a fixed-mode space-time coded system remains capable of maintaining a near-constant BER

Efficient low-complexity data detection for multiple-input multiple-output wireless communication systems

The tradeoff between the computational complexity and system performance in multipleinput multiple-output (MIMO) wireless communication systems is critical to practical applications. In this dissertation, we investigate efficient low-complexity data detection schemes from conventional small-scale to recent large-scale MIMO systems, with the targeted applications in terrestrial wireless communication systems, vehicular networks, and underwater acoustic communication systems. In the small-scale MIMO scenario, we study turbo equalization schemes for multipleinput multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) and multipleinput multiple-output single-carrier frequency division multiple access (MIMO SC-FDMA) systems. For the MIMO-OFDM system, we propose a soft-input soft-output sorted QR decomposition (SQRD) based turbo equalization scheme under imperfect channel estimation. We demonstrate the performance enhancement of the proposed scheme over the conventional minimum mean-square error (MMSE) based turbo equalization scheme in terms of system bit error rate (BER) and convergence performance. Furthermore, by jointly considering channel estimation error and the a priori information from the channel decoder, we develop low-complexity turbo equalization schemes conditioned on channel estimate for MIMO systems. Our proposed methods generalize the expressions used for MMSE and MMSE-SQRD based turbo equalizers, where the existing methods can be viewed as special cases. In addition, we extend the SQRD-based soft interference cancelation scheme to MIMO SC-FDMA systems where a multi-user MIMO scenario is considered. We show an improved system BER performance of the proposed turbo detection scheme over the conventional MMSE-based detection scheme. In the large-scale MIMO scenario, we focus on low-complexity detection schemes because computational complexity becomes critical issue for massive MIMO applications. We first propose an innovative approach of using the stair matrix in the development of massive MIMO detection schemes. We demonstrate the applicability of the stair matrix through the study of the convergence conditions. We then investigate the system performance and demonstrate that the convergence rate and the system BER are much improved over the diagonal matrix based approach with the same system configuration. We further investigate low-complexity and fast processing detection schemes for massive MIMO systems where a block diagonal matrix is utilized in the development. Using a parallel processing structure, the processing time can be much reduced. We investigate the convergence performance through both the probability that the convergence conditions are satisfied and the convergence rate, and evaluate the system performance in terms of computational complexity, system BER, and the overall processing time. Using our proposed approach, we extend the block Gauss-Seidel method to large-scale array signal detection in underwater acoustic (UWA) communications. By utilizing a recently proposed computational efficient statistic UWA channel model, we show that the proposed scheme can effectively approach the system performance of the original Gauss-Seidel method, but with much reduced processing delay