The Algorithm for Blind Multi-user Detector Based on Subspace Tracking

Abstract: Multi-user detection (MUD) is an efficient technique for interference suppression that reduces the Multiple access interference (MAI) and improves the performance and increases the capacity of the system. Nowadays most of the research to MUD focuses on the blind multi-user detector because it does not require training sequences and can save the spectrum resource. By applying an improved subspace tracking algorithm to a modified subspace-based linear MMSE multi-user detector, a blind multi-user detector is presented. For the improved subspace tracking algorithm can reduce considerably computational complexity while keeping satisfactory convergence speed and stability and the modified MMSE multi-user detector doesn’t require the estimation of eigenvalue matrix, there can be significant elevation in the detection performance. Simulation results demonstrate preliminarily the conclusions above. Copyright © 2014 IFSA Publishing, S. L

Multiuser detection in CDMA using blind techniques

Thesis (Master)--Izmir Institute of Technology, Electronics and Communication Engineering, Izmir, 2004Includes bibliographical references (leaves: 63-65)Text in English; Abstract: Turkish and Englishxiv, 69 leavesIn code division multiple access (CDMA) systems, blind multiuser detection (MUD) techniques are of great importance, especially for downlinks, since in practice, it may be unrealistic for a mobile user to know the spreading codes of other active users in the channel. Furthermore, blind methods remove the need for training sequences which leads to a gain in the channel bandwidth. Subspace concept in blind MUD is an alternative process to classical and batch blind MUD techniques based on principle component analysis, or independent component analysis (ICA) and ICA-like algorithms, such as joint approximate diagonalization of eigen-matrices (JADE), blind source separation algorithm with reference system, etc. Briefly, the desired signal is searched in the signal subspace instead of the whole space, in this type of detectors. A variation of the subspace-based MUD is reduced-rank MUD in which a smaller subspace of the signal subspace is tracked where the desired signal is contained in. This latter method leads to a performance gain compared to a standard subspace method. In this thesis, blind signal subspace and reduced-rank MUD techniques are investigated, and applied to minimum mean square error (MMSE) detectors with two different iterative subspace tracking algorithms. The performances of these detectors are compared in different scenarios for additive white Gaussian noise and for multipath fading channels as well. With simulation results the superiority of the reduced-rank detector to the signal subspace detector is shown. Additionally, as a new remark for both detectors, it is shown that, using minimum description length criterion in subspace tracking algorithm results in an increase in rank-tracking ability and correspondingly in the final performance. Finally, the performances of these two detectors are compared with MMSE, adaptive MMSE and JADE detectors

Constant Modulus Algorithms via Low-Rank Approximation

We present a novel convex-optimization-based approach to the solutions of a family of problems involving constant modulus signals. The family of problems includes the constant modulus and the constrained constant modulus, as well as the modified constant modulus and the constrained modified constant modulus. The usefulness of the proposed solutions is demonstrated for the tasks of blind beamforming and blind multiuser detection. The performance of these solutions, as we demonstrate by simulated data, is superior to existing methods.This work was supported by the Center for Brains, Minds and Machines (CBMM), funded by NSF STC award CCF-1231216

Sensor array signal processing : two decades later

Caption title.Includes bibliographical references (p. 55-65).Supported by Army Research Office. DAAL03-92-G-115 Supported by the Air Force Office of Scientific Research. F49620-92-J-2002 Supported by the National Science Foundation. MIP-9015281 Supported by the ONR. N00014-91-J-1967 Supported by the AFOSR. F49620-93-1-0102Hamid Krim, Mats Viberg

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

Channel estimation techniques for next generation mobile communication systems

Mención Internacional en el título de doctorWe are witnessing a revolution in wireless technology, where the society is demanding new services, such as smart cities, autonomous vehicles, augmented reality, etc. These challenging services not only are demanding an enormous increase of data rates in the range of 1000 times higher, but also they are real-time applications with an important delay constraint. Furthermore, an unprecedented number of different machine-type devices will be also connected to the network, known as Internet of Things (IoT), where they will be transmitting real-time measurements from different sensors. In this context, the Third Generation Partnership Project (3GPP) has already developed the new Fifth Generation (5G) of mobile communication systems, which should be capable of satisfying all the requirements. Hence, 5G will provide three key aspects, such as: enhanced mobile broad-band (eMBB) services, massive machine type communications (mMTC) and ultra reliable low latency communications (URLLC). In order to accomplish all the mentioned requirements, it is important to develop new key radio technologies capable of exploiting the wireless environment with a higher efficiency. Orthogonal frequency division multiplexing (OFDM) is the most widely used waveform by the industry, however, it also exhibits high side lobes reducing considerably the spectral efficiency. Therefore, filter-bank multi-carrier combined with offset quadrature amplitude modulation (FBMC-OQAM) is a waveform candidate to replace OFDM due to the fact that it provides extremely low out-ofband emissions (OBE). The traditional spectrum frequencies range is close to saturation, thus, there is a need to exploit higher bands, such as millimeter waves (mm-Wave), making possible the deployment of ultra broad-band services. However, the high path loss in these bands increases the blockage probability of the radio-link, forcing us to use massive multiple-input multiple-output (MIMO) systems in order to increase either the diversity or capacity of the overall link. All these emergent radio technologies can make 5G a reality. However, all their benefits can be only exploited under the knowledge and availability of the channel state information (CSI) in order to compensate the effects produced by the channel. The channel estimation process is a well known procedure in the area of signal processing for communications, where it is a challenging task due to the fact that we have to obtain a good estimator, maintaining at the same time the efficiency and reduced complexity of the system and obtaining the results as fast as possible. In FBMC-OQAM, there are several proposed channel estimation techniques, however, all of them required a high number of operations in order to deal with the self-interference produced by the prototype filter, hence, increasing the complexity. The existing channel estimation and equalization techniques for massive MIMO are in general too complex due to the large number of antennas, where we must estimate the channel response of each antenna of the array and perform some prohibitive matrix inversions to obtain the equalizers. Besides, for the particular case of mm-Wave, the existing techniques either do not adapt well to the dynamic ranges of signal-to-noise ratio (SNR) scenarios or they assume some approximations which reduce the quality of the estimator. In this thesis, we focus on the channel estimation for different emerging techniques that are capable of obtaining a better performance with a lower number of operations, suitable for low complexity devices and for URLLC. Firstly, we proposed new pilot sequences for FBMC-OQAM enabling the use of a simple averaging process in order to obtain the CSI. We show that our technique outperforms the existing ones in terms of complexity and performance. Secondly, we propose an alternative low-complexity way of computing the precoding/postcoding equalizer under the scenario of massive MIMO, keeping the quality of the estimator. Finally, we propose a new channel estimation technique for massive MIMO for mm-Wave, capable of adapting to very variable scenarios in terms of SNR and outperforming the existing techniques. We provide some analysis of the mean squared error (MSE) and complexity of each proposed technique. Furthermore, some numerical results are given in order to provide a better understanding of the problem and solutions.Programa de Doctorado en Multimedia y Comunicaciones por la Universidad Carlos III de Madrid y la Universidad Rey Juan CarlosPresidente: Antonia María Tulino.- Secretario: Máximo Morales Céspedes.- Vocal: Octavia A. Dobr

Sparse Nonlinear MIMO Filtering and Identification

In this chapter system identification algorithms for sparse nonlinear multi input multi output (MIMO) systems are developed. These algorithms are potentially useful in a variety of application areas including digital transmission systems incorporating power amplifier(s) along with multiple antennas, cognitive processing, adaptive control of nonlinear multivariable systems, and multivariable biological systems. Sparsity is a key constraint imposed on the model. The presence of sparsity is often dictated by physical considerations as in wireless fading channel-estimation. In other cases it appears as a pragmatic modelling approach that seeks to cope with the curse of dimensionality, particularly acute in nonlinear systems like Volterra type series. Three dentification approaches are discussed: conventional identification based on both input and output samples, semi–blind identification placing emphasis on minimal input resources and blind identification whereby only output samples are available plus a–priori information on input characteristics. Based on this taxonomy a variety of algorithms, existing and new, are studied and evaluated by simulation