Impact of Channel Estimation Errors on Multiuser Detection via the Replica Method

For practical wireless DS-CDMA systems, channel estimation is imperfect due to noise and interference. In this paper, the impact of channel estimation errors on multiuser detection (MUD) is analyzed under the framework of the replica method. System performance is obtained in the large system limit for optimal MUD, linear MUD and turbo MUD, and is validated by numerical results for finite systems.Comment: To appear in the EURASIP Journal on Wireless Communication and Networking - Special Issue on Advanced Signal Processing Algorithms for Wireless Communication

Fractionally sampled decorrelating detectors for time-varying rayleigh fading CDMA channels

In this dissertation, we propose novel decorrelating multiuser detectors in DSCDMA time-varying frequency-nonselective and frequency-selective fading channels and analyze their performance. We address the common shortcomings of existing multiuser detectors in a mobile environment, such as detector complexity and the error floor. An analytical approach is employed almost exclusively and Monte Carlo simulation is used to confirm the theoretical results. Practical channel models, such as Jakes\u27 and Markovian, are adopted in the numerical examples. The proposed detectors are of the decorrelating type and utilize fractional sampling to simultaneously achieve two goals: (1) the novel realization of a decorrelator with lower computational complexity and shorter processing latency; and (2) the significant reduction of the probability of error floor associated with time-varying fading. The analysis of the impact of imperfect power control on IS-95 multiple access interference is carried out first and the ineffectiveness of IS-95 power control in a mobile radio environment is demonstrated. Fractionally-spaced bit-by-bit decorrelator structures for the frequency-nonselective and frequency-selective channels are then proposed. The matrix singularity problem associated with decorrelation is also addressed, and its solution is suggested. A decorrelating receiver employing differentially coherent detection for an asynchronous CDMA, frequency-nonselective time-varying Rayleigh fading channel is proposed. A maximum likelihood detection principle is applied at the fractionally spaced decorrelator output, resulting in a significantly reduced error floor. For coherent detection, a novel single-stage and two-stage decision feedback (DF) maximum a posteriori (MAP) channel estimator is proposed. These estimators are applicable to a channel with an arbitrary spaced-time correlation function. The fractionally-spaced decorrelating detector is then modified and extended to a frequency-selective time-varying fading channel, and is shown to be capable of simultaneously eliminating MAI, ISI, and path cross-correlation interference. The implicit equivalent frequency diversity is exploited through multipath combining, and the effective time diversity is achieved by fractional sampling for significant performance improvement. The significance of the outcome of this research is in the design of new lower complexity multiuser detectors that do not exhibit the usual deficiencies and limitations associated with a time-varying fading and multipath CDMA mobile environment

Timing and Carrier Synchronization in Wireless Communication Systems: A Survey and Classification of Research in the Last 5 Years

Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last 5 years (2010–2014) and present a comprehensive literature review and classification of the recent research progress in achieving timing and carrier synchronization in single-input single-output (SISO), multiple-input multiple-output (MIMO), cooperative relaying, and multiuser/multicell interference networks. Considering both single-carrier and multi-carrier communication systems, we survey and categorize the timing and carrier synchronization techniques proposed for the different communication systems focusing on the system model assumptions for synchronization, the synchronization challenges, and the state-of-the-art synchronization solutions and their limitations. Finally, we envision some future research directions

Iterative Detection for Overloaded Multiuser MIMO OFDM Systems

Inspired by multiuser detection (MUD) and the ‘Turbo principle’, this thesis deals with iterative interference cancellation (IIC) in overloaded multiuser multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Linear detection schemes, such as zero forcing (ZF) and minimum mean square error (MMSE) cannot be used for the overloaded system because of the rank deficiency of channel matrix, while the optimal approach, the maximum likelihood (ML) detection has high computational complexity. In this thesis, an iterative interference cancellation (IIC) multiuser detection scheme with matched filter and convolutional codes is considered. The main idea of this combination is a low complexity receiver. Parallel interference cancellation (PIC) is employed to improve the multiuser receiver performance for overloaded systems. A log-likelihood ratio (LLR) converter is proposed to further improve the reliability of the soft value converted from the output of the matched filter. Simulation results show that the bit error rate (BER) performance of this method is close to the optimal approach for a two user system. However, for the four user or more user system, it has an error floor of the BER performance. For this case, a channel selection scheme is proposed to distinguish whether the channel is good or bad by using the mutual information based on the extrinsic information transfer (EXIT) chart. The mutual information can be predicted in a look-up table which greatly reduces the complexity. For those ‘bad’ channels identified by the channel selection, we introduce two adaptive transmission methods to deal with such channels: one uses a lower code rate, and the other is multiple transmissions. The use of an IIC receiver with the interleave-division multiple access (IDMA) to further improve the BER performance without any channel selection is also investigated. It has been shown that this approach can remove the error floor. Finally, the influence of channel accuracy on the IIC is investigated. Pilot-based Wiener filter channel estimation is used to test and verify how much the IIC is influenced by the channel accuracy

Reduced Complexity Sequential Monte Carlo Algorithms for Blind Receivers

Monte Carlo algorithms can be used to estimate the state of a system given relative observations. In this dissertation, these algorithms are applied to physical layer communications system models to estimate channel state information, to obtain soft information about transmitted symbols or multiple access interference, or to obtain estimates of all of these by joint estimation. Initially, we develop and analyze a multiple access technique utilizing mutually orthogonal complementary sets (MOCS) of sequences. These codes deliberately introduce inter-chip interference, which is naturally eliminated during processing at the receiver. However, channel impairments can destroy their orthogonality properties and additional processing becomes necessary. We utilize Monte Carlo algorithms to perform joint channel and symbol estimation for systems utilizing MOCS sequences as spreading codes. We apply Rao-Blackwellization to reduce the required number of particles. However, dense signaling constellations, multiuser environments, and the interchannel interference introduced by the spreading codes all increase the dimensionality of the symbol state space significantly. A full maximum likelihood solution is computationally expensive and generally not practical. However, obtaining the optimum solution is critical, and looking at only a part of the symbol space is generally not a good solution. We have sought algorithms that would guarantee that the correct transmitted symbol is considered, while only sampling a portion of the full symbol space. The performance of the proposed method is comparable to the Maximum Likelihood (ML) algorithm. While the computational complexity of ML increases exponentially with the dimensionality of the problem, the complexity of our approach increases only quadratically. Markovian structures such as the one imposed by MOCS spreading sequences can be seen in other physical layer structures as well. We have applied this partitioning approach with some modification to blind equalization of frequency selective fading channel and to multiple-input multiple output receivers that track channel changes. Additionally, we develop a method that obtains a metric for quantifying the convergence rate of Monte Carlo algorithms. Our approach yields an eigenvalue based method that is useful in identifying sources of slow convergence and estimation inaccuracy.Ph.D.Committee Chair: Douglas B. Williams; Committee Member: Brani Vidakovic; Committee Member: G. Tong zhou; Committee Member: Gordon Stuber; Committee Member: James H. McClella

Advanced low-complexity multiuser receivers

It tema centrale di questa tesi è la rivelazione multi-utente per sistemi di comunicazione wireless ad elevata efficienza spettrale. Lo scopo del lavoro è quello di proporre nuovi ricevitori multi-utente a bassa complessità con elevate prestazioni. Sono considerati sistemi satellitari basati su FDM (Frequency Division Multiplexing), in cui ogni utente adotta una modulazione CPM (Continuous Phase Modulation) concatenata serialmente con un codificatore tramite un interlacciatore e decodifica iterativa. Si considerano, inoltre, canali lineari in presenza di AWGN (additive white Gaussian noise). In particolare, si studiano sistemi FDM, in cui i canali adiacenti possono sovrapporsi in frequenza per aumentere l'efficienza spettrale, e sistemi CDMA (code division multiple access). Per gli scenari presi in esame, proponiamo schemi di rivelazione con un eccellente compromesso tra prestazioni e complessità computazionale, che permettono di implementare schemi di trasmissione con straordinaria efficienza spettrale, al prezzo di un limitato aumento di complessità rispetto ad un classico ricevitore singolo-utente che ignora l'interferenza.This thesis deals with multiuser detection (MUD) for spectrally-efficient wireless communication systems. The aim of this work is to propose new advanced low-complexity multiuser receivers with near-optimal detection performance. We consider frequency division multiplexing (FDM) satellite systems where each user employs a continuous phase modulation (CPM), serially concatenated with an outer code through an interleaver, and iterative detection/decoding. We also consider linear channels impaired by additive white Gaussian noise (AWGN), focusing on FDM systems where adjacent channels are allowed to overlap in frequency, and on code division multiple access systems (CDMA). For the considered scenarios, we propose detection schemes with an excel- lent performance/complexity tradeoff which allow us to implement transmission schemes with unprecedented spectral efficiency at a price of a limited complexity increase with respect to a classical single-user receiver which neglects the interference

Modern Random Access for Satellite Communications

The present PhD dissertation focuses on modern random access (RA) techniques. In the first part an slot- and frame-asynchronous RA scheme adopting replicas, successive interference cancellation and combining techniques is presented and its performance analysed. The comparison of both slot-synchronous and asynchronous RA at higher layer, follows. Next, the optimization procedure, for slot-synchronous RA with irregular repetitions, is extended to the Rayleigh block fading channel. Finally, random access with multiple receivers is considered.Comment: PhD Thesis, 196 page