ArticlePDF Available

Simplified polynomial-expansion linear detectors for DS-CDMA systems

Authors:

Abstract

The multistage linear receiver of Moshavi et al. (1996) was designed to approximate the decorrelating detector and the MMSE detector without calculating the inverse of the cross-correlation matrix R of the spreading codes directly. However, it is complicated by the need to calculate a set of weights using a procedure involving the inverting of a large matrix. A modified structure is proposed to accomplish the same task without the need for computationally intensive procedures such as matrix inversion
0 1 2 3 4 5 6 7 8 9 10
10
−4
10
−3
10
−2
10
−1
E
b
/ N
o
(dB)
Bit−error probability
conventional
MMSE
1 stage
2 stages
3 stages
4 stages
5 stages
0 1 2 3 4 5 6 7 8 9 10
10
−3
10
−2
10
−1
E
b
/ N
o
(dB)
Bit−error probability
conventional
MMSE
1 stage
2 stages
3 stages
4 stages
5 stages
... h H + n [38]. For a given V and constant symbol energy, MSE PE−MMSE reaches its limit the high E s ∕N 0 region. ...
Article
Full-text available
In this paper, low-complexity channel estimators and precoders are proposed for massive multiple-input multiple-output generalized frequency division multiplexing (MIMO-GFDM) systems. In order to combat the effect of non-orthogonality in GFDM, interference-free pilots are used in frequency-domain minimum mean square error (MMSE) channel estimation. Polynomial expansion is used to approximately compute the matrix inverses in the conventional MMSE estimation and precoding, consequently reducing the cubic computational complexity to square order. The degree of the matrix polynomial can be properly selected to get a required trade-off between complexity and estimation/precoding performance. Different weights can be assigned to the terms in the polynomial expansion and be optimized to achieve a minimal mean square error (MSE). Derived limits on the MSE of the proposed estimators can predict their performance in the high Es/N0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_s/N_0$$\end{document} region. Then, we derive a Cramér-Rao lower bound (CRLB) and use it as a benchmark for the estimators. In addition, the related computational complexity and the impacts of the polynomial degree are also investigated. Numerical results show the accuracy of the proposed channel estimators and precoders.
... Via the choice of α the eigenvalues of Q and thus the convergence of the series in (13) can be controlled; for stability [21] α < α max def = 2/(σ 2 S λ max (AA T ) + σ 2 N ) is required. Please note that this type of approximation is well-known from the field of code-division multiple access (CDMA) schemes, e.g., [19], [16], [21]. Since the equalization result can be written as a linear combination of the receive vector y and Qy, Q 2 y, . . ...
Article
We consider iterative (`turbo') algorithms for compressed sensing. First, a unified exposition of the different approaches available in the literature is given, thereby enlightening the general principles and main differences. In particular we discuss i) the estimation step (matched filter vs. optimum MMSE estimator), ii) the unbiasing operation (implicitly or explicitly done and equivalent to the calculation of extrinsic information), and iii) thresholding vs. the calculation of soft values. Based on these insights we propose a low-complexity but well-performing variant utilizing a Krylov space approximation of the optimum linear MMSE estimator. The derivations are valid for any probability density of the signal vector. However, numerical results are shown for the discrete case. The novel algorithms shows very good performance and even slightly faster convergence compared to approximative message passing.
Article
Drawing on the notion of parallel interference cancellation, this paper formulates a one-shot linear receiver for the uplink of centralized, possibly cloud-based, radio access networks (C-RANs) operating in a cell-free fashion. This receiver exhibits substantial interference rejection abilities, yet it does not involve any matrix inversions; rather, its structure hinges on the pairwise projections of the users’ channel vectors. Its performance is markedly superior to that of matched-filter beamforming, while the computational cost is decidedly inferior to that of an MMSE filter, altogether constituting an attractive alternative in terms of performance vs cost. Furthermore, with a proper sparsification of the channel matrix that it estimates and processes, the proposed receiver can be rendered scalable in the sense of its computational cost per access point not growing with size of the network. Uplink power control is also readily accommodated.
Article
Full-text available
Massive multiple-input multiple-output (MIMO) is one of the most promising technologies for the next generation of wireless communication networks because it has the potential to provide game-changing improvements in spectral efficiency (SE) and energy efficiency (EE). This monograph summarizes many years of research insights in a clear and self-contained way and provides the reader with the necessary knowledge and mathematical tools to carry out independent research in this area. Starting from a rigorous definition of Massive MIMO, the monograph covers the important aspects of channel estimation, SE, EE, hardware efficiency (HE), and various practical deployment considerations. From the beginning, a very general, yet tractable, canonical system model with spatial channel correlation is introduced. This model is used to realistically assess the SE and EE, and is later extended to also include the impact of hardware impairments. Owing to this rigorous modeling approach, a lot of classic "wisdom" about Massive MIMO, based on too simplistic system models, is shown to be questionable.
Conference Paper
Currently 5G is research hotspot in communication field, and one of the most promising wireless transmission technologies for 5G is massive multiple input multiple output (MIMO) which provides high data rate and energy efficiency. The main challenge of massive MIMO is the channel estimation due to the complexity and pilot contamination. Some improvement of traditional channel estimation methods to solve the problem in massive MIMO have been introduced in this paper. Besides, the hardware acceleration is useful for massive MIMO channel estimation algorithm. We discuss the relate work about hardware accelerator of matrix inversion and singular value decomposition which are the main complex operations of channel estimation. We find that the memory system, network of processing elements and the precision will be the main research directions for the hardware design of large-scale data size.
Chapter
With 3G revolution unfolding, the hottest question being asked at present is what lies beyond 3G. It is always difficult to make predictions on future events because these can turn out to be embarrassing wrong as happened many times in the past to several giants among the members of the scientific community. To forecast on the development of future events on scientific grounds, it is required that the history of the past events be examined. We can examine the past and the current status of wireless systems and try to establish the direction or the trend in which this rapidly changing technology will follow. If forecast on the trend is reasonably accurate then it is possible to open a window through which one can future events unfolding.
Article
Full-text available
A new family of multistage low-complexity linear receivers for direct sequence code division multiple access (DS-CDMA) communications is introduced. The objective of the proposed design is to mitigate the effect of multiple access interference (MAI), the most significant limiting factor of user capacity in the conventional DS-CDMA channel. The receivers presented here employ joint detection of multiple users and therefore require knowledge of all the signature codes and their timing. In addition, for a multipath environment, reliable estimates of the received powers and phases are assumed available for maximal ratio RAKE combining. Each stage of the underlying design recreates the overall modulation, noiseless channel, and demodulation process. The outputs of these stages are then linearly combined. The combining weights can be chosen to implement different linear detectors, including the decorrelating and minimum mean square error (MMSE) detectors. In this paper, we focus on implementing the MMSE detector. Simulation results illustrate that significant performance gains can be achieved in both synchronous and asynchronous systems.
Article
This chapter shows how a simple linear model can be used to describe the signal received over a multiple-antenna, time-dispersive, fading code-division multiple-access (CDMA) channel. The realization that each of these channel effects can be absorbed into a general linear model validates the abstraction of the CDMA problem into a linear algebra problem which opens up mathematically elegant and powerful techniques to solve common problems such as detection and channel estimation. Based on the structural principles of practical systems, where all baseband processing is normally done in discrete time, we develop a corresponding matrix algebraic model. The model leads to the known convenient interpretation of the CDMA system as a time-varying convolutional encoder which allows for insight into the structure of the inherent interference. The model unifies many related models previously suggested in the literature. The novelty of this model is that it follows the structural principles of practical systems and leads to a convenient algebraic form which allows for powerful receiver design.
Article
Consideration is given to a class of suboptimum detectors for data transmitted asynchronously by K users employing direct-sequence spread-spectrum multiple access (DS/SSMA) on the additive white Gaussian noise (AWGN) channel. The general structure of these detectors consists of a bank of matched filters, a linear transformation that operates on the matched-filter outputs, and a set of threshold devices. The linear transformations are chosen to minimize either a mean-squared-error or a weighted-squared-error performance criterion. Each detector can be implemented using a tapped delay line. The number of computations performed per detected bit is linear in K in each case, and the resulting detectors are thus much simpler than the optimum detector. Under typical operating conditions, these detectors will perform much better than the conventional receiver and often nearly as well as the optimum detector
Article
We consider interference suppression for direct-sequence spread-spectrum code-division multiple-access (CDMA) systems using the minimum mean squared error (MMSE) performance criterion. The conventional matched filter receiver suffers from the near-far problem, and requires strict power control (typically involving feedback from receiver to transmitter) for acceptable performance. Multiuser detection schemes previously proposed mitigate the near-far problem, but are complex and require explicit knowledge or estimates of the interference parameters. In this paper, we present and analyze several new MMSE interference suppression schemes, which have the advantage of being near-far resistant (to varying degrees, depending on their complexity), and can be implemented adaptively when interference parameters are unknown and/or time-varying, Numerical results are provided that show that these schemes offer significant performance gains relative to the matched filter receiver. We conclude that MMSE detectors can alleviate the need for stringent power control. In CDMA systems, and may be a practical alternative to the matched filter receiver
Article
Under the assumptions of symbol-synchronous transmissions and white Gaussian noise, the authors analyze the detection mechanism at the receiver, comparing different detectors by their bit error rates in the low-background-noise region and by their worst-case behavior in a near-far environment where the received energies of the users are not necessarily similar. Optimum multiuser detection achieves important performance gains over conventional single-user detection at the expense of computational complexity that grows exponentially with the number of users. It is shown that in the synchronous case the performance achieved by linear multiuser detectors is similar to that of optimum multiuser detection. Attention is focused on detectors whose linear memoryless transformation is a generalized inverse of the matrix of signature waveform crosscorrelations, and on the optimum linear detector. It is shown that the generalized inverse detectors exhibit the same degree of near-far resistance as the optimum multiuser detectors. The optimum linear detector is obtained