Layered Steered Space–Time-Spreading-Aided Generalized MC DS-CDMA

Abstract—We present a novel trifunctional multiple-input– multiple-output (MIMO) scheme that intrinsically amalgamates space–time spreading (STS) to achieve a diversity gain and a Vertical Bell Labs layered space–time (V-BLAST) scheme to attain a multiplexing gain in the context of generalized multicarrier direct-sequence code-division multiple access (MC DS-CDMA), as well as beamforming. Furthermore, the proposed system employs both time- and frequency-domain spreading to increase the number of users, which is also combined with a user-grouping technique to reduce the effects of multiuser interference

Successive interference cancellation schemes for time-reversal space-time block codes

In this paper, we propose two simple signal detectors that are based on successive interference cancellation (SIC) for time-reversal space-time block codes to combat intersymbol interference in frequency-selective fading environments. The main idea is to treat undetected symbols and noise together as Gaussian noise with matching mean and variance and use the already-detected symbols to help current signal recovery. The first scheme is a simple SIC signal detector whose ordering is based on the channel powers. The second proposed SIC scheme, which is denoted parallel arbitrated SIC (PA-SIC), is a structure that concatenates in parallel a certain number of SIC detectors with different ordering sequences and then combines the soft output of each individual SIC to achieve performance gains. For the proposed PA-SIC, we describe the optimal ordering algorithm as a combinatorial problem and present a low-complexity ordering technique for signal decoding. Simulations show that the new schemes can provide a performance that is very close to maximum-likelihood sequence estimation (MLSE) decoding under time-invariant conditions. Results for frequency-selective and doubly selective fading channels show that the proposed schemes significantly outperform the conventional minimum mean square error-(MMSE) like receiver and that the new PA-SIC performs much better than the proposed conventional SIC and is not far in performance from the MLSE. The computational complexity of the SIC algorithms is only linear with the number of transmit antennas and transmission rates, which is very close to the MMSE and much lower than the MLSE. The PA-SIC also has a complexity that is linear with the number of SIC components that are in parallel, and the optimum tradeoff between performance and complexity can be easily determined according to the number of SIC detectors

Receiver Multiuser Diversity Aided Multi-Stage MMSE Multiuser Detection for DS-CDMA and SDMA Systems Employing I-Q Modulation

The so-called receiver multiuser diversity aided multistage minimum mean-square error multiuser detector (RMD/MS-MMSE MUD), which was proposed previously by the author, is investigated in the context of the direct-sequence code-division multiple-access (DS- CDMA) and space-division multiple-access (SDMA) systems that employ in- and quadrature-phase (I-Q) modulation schemes. A detection scheme is studied, which is operated in real domain in the principles of successive interference cancellation (SIC). The concept of noise recognition factor (NRF) is proposed for explaining the efficiency of SIC-type detectors and also for motivating to design other high-efficiency detectors. The achievable bit error rate (BER) performance of the RMD/MS-MMSE MUD is investigated for DS-CDMA and SDMA systems of either full-load or overload, when communicating over Rayleigh fading channels for the SDMA and over either additive white Gaussian noise (AWGN) or Rayleigh fading channels for the DS-CDMA. The studies and performance results show that the RMD/MS-MMSE MUD is a highly promising MUD. It has low implementation complexity and good error performance. Furthermore, it is a high-flexibility detector suitable for various communication systems operated in different communication environments

Space-Time-Frequency Shift Keying for Dispersive Channels

Inspired by the concept of the Space-Time Shift Keying (STSK) modulation, in this paper we proposed the Space-Frequency Shift Keying (SFSK) modulation as well as the Space-Time-Frequency Shift Keying (STFSK) concept which spreads the transmit signal not only across the space and time domains, but also the frequency domain. The performance of STSK modulation is degraded by about 2 dB, when the channel changes from uncorrelated frequency-flat fading to the frequency-selective environment of the 6-tap COST207 model. By contrast, as a benefit of Frequency Shift keying, the SFSK and STFSK schemes are capable of maintaining their performance also in frequency-selective fading environments. Finally, we demonstrate that the STSK and SFSK schemes constitute special cases of the STFSK modulatio

Iterative channel estimation techniques for multiple input multiple output orthogonal frequency division multiplexing systems

Thesis (Master)--Izmir Institute of Technology, Electronics and Communication Engineering, Izmir, 2007Includes bibliographical references (leaves: 77-78)Text in English; Abstract: Turkish and Englishxii, 78 leavesOrthogonal frequency division multiplexing (OFDM) is well-known for its efficient high speed transmission and robustness to frequency-selective fading channels. On the other hand, multiple-input multiple-output (MIMO) antenna systems have the ability to increase capacity and reliability of a wireless communication system compared to single-input single-output (SISO) systems. Hence, the integration of the two technologies has the potential to meet the ever growing demands of future communication systems. In these systems, channel estimation is very crucial to demodulate the data coherently. For a good channel estimation, spectral efficiency and lower computational complexity are two important points to be considered. In this thesis, we explore different channel estimation techniques in order to improve estimation performance by increasing the bandwidth efficiency and reducing the computational complexity for both SISO-OFDM and MIMO-OFDM systems. We first investigate pilot and Expectation-Maximization (EM)-based channel estimation techniques and compare their performances. Next, we explore different pilot arrangements by reducing the number of pilot symbols in one OFDM frame to improve bandwidth efficiency. We obtain the bit error rate and the channel estimation performance for these pilot arrangements. Then, in order to decrase the computational complexity, we propose an iterative channel estimation technique, which establishes a link between the decision block and channel estimation block using virtual subcarriers. We compare this proposed technique with EM-based channel estimation in terms of performance and complexity. These channel estimation techniques are also applied to STBC-OFDM and V-BLAST structured MIMO-OFDM systems. Finally, we investigate a joint EM-based channel estimation and signal detection technique for V-BLAST OFDM system

Joint data detection and channel estimation for OFDM systems

We develop new blind and semi-blind data detectors and channel estimators for orthogonal frequency-division multiplexing (OFDM) systems. Our data detectors require minimizing a complex, integer quadratic form in the data vector. The semi-blind detector uses both channel correlation and noise variance. The quadratic for the blind detector suffers from rank deficiency; for this, we give a low-complexity solution. Avoiding a computationally prohibitive exhaustive search, we solve our data detectors using sphere decoding (SD) and V-BLAST and provide simple adaptations of the SD algorithm. We consider how the blind detector performs under mismatch, generalize the basic data detectors to nonunitary constellations, and extend them to systems with pilots and virtual carriers. Simulations show that our data detectors perform well

Generalized feedback detection for spatial multiplexing multi-antenna systems

We present a unified detection framework for spatial multiplexing multiple-input multiple-output (MIMO) systems by generalizing Heller’s classical feedback decoding algorithm for convolutional codes. The resulting generalized feedback detector (GFD) is characterized by three parameters: window size, step size and branch factor. Many existing MIMO detectors are turned out to be special cases of the GFD. Moreover, different parameter choices can provide various performance-complexity tradeoffs. The connection between MIMO detectors and tree search algorithms is also established. To reduce redundant computations in the GFD, a shared computation technique is proposed by using a tree data structure. Using a union bound based analysis of the symbol error rates, the diversity order and signal-to-noise ratio (SNR) gain are derived analytically as functions of the three parameters; for example, the diversity order of the GFD varies between 1 and N. The complexity of the GFD varies between those of the maximum-likelihood (ML) detector and the zero-forcing decision feedback detector (ZFDFD). Extensive computer simulation results are also provided

Semiblind Channel Estimation and Data Detection for OFDM Systems With Optimal Pilot Design

This paper considers semiblind channel estimation and data detection for orthogonal frequency-division multiplexing (OFDM) over frequency-selective fading channels. We show that the samples of an OFDM symbol are jointly complex Gaussian distributed, where the mean and covariance are determined by the locations and values of fixed pilot symbols. We exploit this distribution to derive a novel maximum-likelihood (ML) semiblind gradient-descent channel estimator. By exploiting the channel impulse response (CIR) statistics, we also derive a semiblind data detector for both Rayleigh and Ricean fading channels. Furthermore, we develop an enhanced data detector, which uses the estimator error statistics to mitigate the effect of channel estimation errors. Efficient implementation of both the semiblind and the improved data detectors is provided via sphere decoding and nulling-canceling detection. We also derive the Cramér-Rao bound (CRB) and design optimal pilots by minimizing the CRB. Our proposed channel estimator and data detector exhibit high bandwidth efficiency (requiring only a few pilot symbols), achieve the CRB, and also nearly reach the performance of an ideal reference receiver