## Convergence of Linear Interference Cancellation Multiuser Receivers (2001)

Citations: | 16 - 3 self |

### BibTeX

@MISC{Grant01convergenceof,

author = {Alex Grant and Christian Schlegel},

title = {Convergence of Linear Interference Cancellation Multiuser Receivers},

year = {2001}

}

### Years of Citing Articles

### OpenURL

### Abstract

We consider the convergence in norm of several iterative implementations of linear multiuser receivers, under the assumption of long random spreading sequences. We find that asymptotically, linear parallel interference cancellation diverges for systems loads of greater than about 17%. Using known results from the theory of iterative solutions for linear systems we derive optimal or near optimal relaxation parameters for parallel (first and second order stationary, Chebyshev) and serial cancellation (successive relaxation) methods. An analytic comparison of the asymptotic convergence factor for the various methods is given. Simulations are used to verify results for finite size systems. Keywords--- Interference cancellation, iterative methods, multi-stage receivers, multi-user receivers, CDMA, random sequences I.

### Citations

4660 | Matrix analysis - Horn, Johnson - 1986 |

1020 | Multiuser Detection
- Verdu
- 1998
(Show Context)
Citation Context ...nterference, whereas nonlinear methods have no such restriction. We mainly restrict our attention to linear schemes, previously considered in [1]–[19]. For an introduction to multiuser detection, see =-=[20]-=-. It is known that iterated linear interference cancellation for the detection of linear multiple access channels is equivalent to well-known iterative methods for the solution of systems of linear eq... |

702 |
Linear Algebra and its Applications
- Strang
- 1976
(Show Context)
Citation Context ... Furthermore, for any initial guess , it is easy to show that the iteration converges in any given norm to the true solution if and only if the spectral radius of the iteration matrix satisfies . See =-=[21]-=-, [23] for details. For a useful iteration we require that be easily invertible (resulting in low complexity iteration steps) and be as small as possible (increasing the rate of convergence). For line... |

494 |
Iterative Solution Methods
- Axelsson
- 1994
(Show Context)
Citation Context ...ermore, for any initial guess , it is easy to show that the iteration converges in any given norm to the true solution if and only if the spectral radius of the iteration matrix satisfies . See [21], =-=[23]-=- for details. For a useful iteration we require that be easily invertible (resulting in low complexity iteration steps) and be as small as possible (increasing the rate of convergence). For linear mul... |

491 | der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 2nd Edition - Berry, Demmel, et al. - 1994 |

315 | MMSE Interference Suppression for Direct-Sequence Spread-Spectrum CDMA - Madhow, Honig - 1994 |

309 | Linear multiuser detectors for synchronous code-division multiple-access channels
- Lupas, Verdu
- 1989
(Show Context)
Citation Context ...]–[38]. Of theoretical and practical interest are the class of linear detectors which form decisions based on the output of various linear filters . We are particularly interested in the decorrelator =-=[39]-=- and the linear minimum mean squared error (LMMSE) [40]–[43] filters. We shall consider the synchronous case. The asynchronous extension is not difficult [20]. The decorrelator may be derived by relax... |

264 | Linear multiuser receivers: effective interference, effective bandwidth and user capacity
- Tse, Hanly
- 1999
(Show Context)
Citation Context ...eral authors to prove asymptotic results concerning the capacity and spectral efficiency of the random-sequence CDMA channel, both for optimal joint decoding [56] and using the decorrelator and LMMSE =-=[57]-=-, [58]. A stronger result than Lemma 2 is in fact true, namely that in the limit, with probability 1, there are no eigenvalues outside the support of the limiting spectral distribution [59].GRANT AND... |

253 |
Multistage Detection in Asynchronous Code-Division Multiple Access Communications
- Varanasi, Aazhang
- 1990
(Show Context)
Citation Context ...ced in the iteration loop (or between decoder stages), their signal flow structure is identical to the well-known iterative linear algorithms described in this paper. The original multistage detector =-=[25]-=-, [26] corresponds to the Jacobi iteration while the fine tuned successive interference canceler discussed by Divsalar et al. [27]–[29] is in fact a minor modification of the successive relaxation met... |

215 | Spectral efficiency of CDMA with random spreading
- Verdu, Shamai
- 1999
(Show Context)
Citation Context ...uthors to prove asymptotic results concerning the capacity and spectral efficiency of the random-sequence CDMA channel, both for optimal joint decoding [56] and using the decorrelator and LMMSE [57], =-=[58]-=-. A stronger result than Lemma 2 is in fact true, namely that in the limit, with probability 1, there are no eigenvalues outside the support of the limiting spectral distribution [59].GRANT AND SCHLE... |

190 | Introduction to Linear Algebra - Strang - 1998 |

159 |
A Family of Suboptimum Detectors for Coherent Multiuser Communications
- Xie, Short, et al.
- 1990
(Show Context)
Citation Context ...lass of linear detectors which form decisions based on the output of various linear filters . We are particularly interested in the decorrelator [39] and the linear minimum mean squared error (LMMSE) =-=[40]-=-–[43] filters. We shall consider the synchronous case. The asynchronous extension is not difficult [20]. The decorrelator may be derived by relaxing the constraints on the minimization (1). Instead of... |

157 | Analysis of a Simple Successive Interference Cancellation Scheme in a DS/CDMA Systems - Patel, Holtzman - 1994 |

155 | On the empirical distribution of eigenvalues of a class of large dimensional random matrices
- Silverstein, Bai
- 1995
(Show Context)
Citation Context .... The proof for this lemma can be found in [50] (smallest eigenvalue) and [51] for the largest eigenvalue. In fact the distribution of the eigenvalues tends to a deterministic limit [52], [53], [50], =-=[54]-=-, [55], a phenomenon exploited by several authors to prove asymptotic results concerning the capacity and spectral efficiency of the random-sequence CDMA channel, both for optimal joint decoding [56] ... |

117 | Improved parallel interference cancellation for CDMA
- Divsalar, Simon, et al.
- 1998
(Show Context)
Citation Context ... algorithms described in this paper. The original multistage detector [25], [26] corresponds to the Jacobi iteration while the fine tuned successive interference canceler discussed by Divsalar et al. =-=[27]-=-–[29] is in fact a minor modification of the successive relaxation method discussed in Section III-E. Iterative methods have also been successfully applied to coded multiuser systems [30]–[32]. We res... |

104 | No eigenvalues outside the support of the limiting spectral distribution of large-dimensional sample covariance matrices
- Bai, Silverstein
- 1998
(Show Context)
Citation Context ... and LMMSE [57], [58]. A stronger result than Lemma 2 is in fact true, namely that in the limit, with probability 1, there are no eigenvalues outside the support of the limiting spectral distribution =-=[59]-=-.GRANT AND SCHLEGEL: LINEAR INTERFERENCE CANCELLATION MULTIUSER RECEIVERS 1833 TABLE I SUMMARY: ITERATIVE IMPLEMENTATIONS OF THE DECORRELATOR In order to derive results for the LMMSE filter, we shall... |

82 | Adaptive receiver structures for asynchronous CDMA systems - Rapajic, Vucetic - 1994 |

82 | Strong convergence of the empirical distribution of eigenvalues of large dimensional random matrices
- Silverstein
- 1995
(Show Context)
Citation Context ...proof for this lemma can be found in [50] (smallest eigenvalue) and [51] for the largest eigenvalue. In fact the distribution of the eigenvalues tends to a deterministic limit [52], [53], [50], [54], =-=[55]-=-, a phenomenon exploited by several authors to prove asymptotic results concerning the capacity and spectral efficiency of the random-sequence CDMA channel, both for optimal joint decoding [56] and us... |

80 | An iterative multiuser decoder for near-capacity communications - Moher - 1998 |

79 | Near-optimum detection in synchronous code-division multiple-access systems - Varanasi, Aazhang - 1991 |

68 |
An adaptive direct-sequence code-division multiple-access receiver for multiuser interference rejection
- Miller
- 1995
(Show Context)
Citation Context ...of linear detectors which form decisions based on the output of various linear filters . We are particularly interested in the decorrelator [39] and the linear minimum mean squared error (LMMSE) [40]–=-=[43]-=- filters. We shall consider the synchronous case. The asynchronous extension is not difficult [20]. The decorrelator may be derived by relaxing the constraints on the minimization (1). Instead of a co... |

67 |
Limit of the smallest eigenvalue of a large dimensional sample covariance matrix
- Bai, Yin
- 1993
(Show Context)
Citation Context ...tively, of the complex positive semidefinite matrix , where is chosen randomly according to Definition 1. Then, holding constant, and sending , almost surely. The proof for this lemma can be found in =-=[50]-=- (smallest eigenvalue) and [51] for the largest eigenvalue. In fact the distribution of the eigenvalues tends to a deterministic limit [52], [53], [50], [54], [55], a phenomenon exploited by several a... |

59 | Iterative detection in code-division multiple-access with error control coding
- Alexander, Grant, et al.
- 1998
(Show Context)
Citation Context ... et al. [27]–[29] is in fact a minor modification of the successive relaxation method discussed in Section III-E. Iterative methods have also been successfully applied to coded multiuser systems [30]–=-=[32]-=-. We restrict our scope to detection of uncoded data. We analyze the convergence properties of several linear iterative implementations of both the decorrelator and the minimum mean squared error filt... |

58 |
A note on the largest eigenvalue of a large dimensional sample covariance matrix
- Bai, Silverstein, et al.
- 1998
(Show Context)
Citation Context ... semidefinite matrix , where is chosen randomly according to Definition 1. Then, holding constant, and sending , almost surely. The proof for this lemma can be found in [50] (smallest eigenvalue) and =-=[51]-=- for the largest eigenvalue. In fact the distribution of the eigenvalues tends to a deterministic limit [52], [53], [50], [54], [55], a phenomenon exploited by several authors to prove asymptotic resu... |

44 | Analysis of the limiting spectral distribution of large-dimensional random matrices
- Silverstein, Choi
- 1995
(Show Context)
Citation Context ...he nonequal power case, there is a little more work to do. For large , chosen according to Definition 1, we can find the support of the limiting spectral distribution of using the method described in =-=[60]-=-, [59]. Suppose that for large systems, the spectral distribution of converges to a fixed distribution , and let (26) (according to [59, Equation (1.2)]). The support of the limiting spectral distribu... |

43 |
Suboptimum multiuser receivers for convolutionally coded asynchronous DS-CDh4A systems
- Giallorenzi, Wilson
- 1996
(Show Context)
Citation Context ...salar et al. [27]–[29] is in fact a minor modification of the successive relaxation method discussed in Section III-E. Iterative methods have also been successfully applied to coded multiuser systems =-=[30]-=-–[32]. We restrict our scope to detection of uncoded data. We analyze the convergence properties of several linear iterative implementations of both the decorrelator and the minimum mean squared error... |

42 | Multistage linear receivers for DS-CDMA systems - Moshavi, Kanterakis, et al. - 1996 |

34 | Random sequence multisets for synchronous code-division multiple-access channels
- Grant, Alexander
- 1998
(Show Context)
Citation Context ... [54], [55], a phenomenon exploited by several authors to prove asymptotic results concerning the capacity and spectral efficiency of the random-sequence CDMA channel, both for optimal joint decoding =-=[56]-=- and using the decorrelator and LMMSE [57], [58]. A stronger result than Lemma 2 is in fact true, namely that in the limit, with probability 1, there are no eigenvalues outside the support of the limi... |

30 | A matrix-algebraic approach to linear parallel interference cancellation in CDMA
- Guo, Rasmussen, et al.
- 2000
(Show Context)
Citation Context ...onlinear. Linear methods use linear estimates of the interference, whereas nonlinear methods have no such restriction. We mainly restrict our attention to linear schemes, previously considered in [1]–=-=[19]-=-. For an introduction to multiuser detection, see [20]. It is known that iterated linear interference cancellation for the detection of linear multiple access channels is equivalent to well-known iter... |

26 | A matrixalgebraic approach to successive interference cancellation in CDMA - Rasmussen, Lim, et al. - 2000 |

25 | Eigenvalues and eigenvectors of large dimensional sample covariance matrices
- Silverstein
- 1986
(Show Context)
Citation Context ...ng , almost surely. The proof for this lemma can be found in [50] (smallest eigenvalue) and [51] for the largest eigenvalue. In fact the distribution of the eigenvalues tends to a deterministic limit =-=[52]-=-, [53], [50], [54], [55], a phenomenon exploited by several authors to prove asymptotic results concerning the capacity and spectral efficiency of the random-sequence CDMA channel, both for optimal jo... |

20 |
Cancellation techniques of co-channel interference in asynchronous spread spectrum multiple access systems,” Trans
- Kohno, Imai, et al.
- 1983
(Show Context)
Citation Context ...or nonlinear. Linear methods use linear estimates of the interference, whereas nonlinear methods have no such restriction. We mainly restrict our attention to linear schemes, previously considered in =-=[1]-=-–[19]. For an introduction to multiuser detection, see [20]. It is known that iterated linear interference cancellation for the detection of linear multiple access channels is equivalent to well-known... |

19 |
Efficient implementation of linear multiuser detectors for asynchronous CDMA systems by linear interference cancellation
- Elders-Boll, Schotten, et al.
- 1998
(Show Context)
Citation Context ...that iterated linear interference cancellation for the detection of linear multiple access channels is equivalent to well-known iterative methods for the solution of systems of linear equations [10], =-=[16]-=-, [17]. In particular, parallel interference cancellation is equivalent to the method of Jacobi, while serial cancellation corresponds to the Gauss–Seidel method. Our research was motivated by the rea... |

14 | Analytic Limits on the Performance of Adaptive Multistage Interference Cancellation - Kaul, Woerner - 1994 |

14 | Analysis of an Approximate Decorrelating Detector
- Mandayam, Verdu
- 1995
(Show Context)
Citation Context ...r research was motivated by the realization that parallel interference cancellation converges to the decorrelator [4], [5], [8], [9]. Related to these receivers are the approximate decorrelators [1], =-=[15]-=-, [20], based on the viewpoint of series expansions for the linear filters. Given the mathematical literature devoted to the iterative solution of linear systems (see [21]–[24], for textbook treatment... |

14 | Solving a class of optimum multiuser detection problems with polynomial complexity - Sankaran, Ephremides - 1998 |

12 | Parallel interference cancellation for CDMA systems
- Ghazi-Moghadam, Nelson, et al.
- 1995
(Show Context)
Citation Context ...method of Jacobi, while serial cancellation corresponds to the Gauss–Seidel method. Our research was motivated by the realization that parallel interference cancellation converges to the decorrelator =-=[4]-=-, [5], [8], [9]. Related to these receivers are the approximate decorrelators [1], [15], [20], based on the viewpoint of series expansions for the linear filters. Given the mathematical literature dev... |

12 | On the Performance of Linear Parallel Interference Cancellation
- Brown, Motani, et al.
- 2001
(Show Context)
Citation Context ...te that both and are Hermitian, and hence, their spectral radii are equal to their respective spectral norms. From the submultiplicative property 2 This result has since been independently derived in =-=[47]-=-. (7) (8) (9) (10) (11)GRANT AND SCHLEGEL: LINEAR INTERFERENCE CANCELLATION MULTIUSER RECEIVERS 1827 Fig. 1. First-order iterative implementations of the decorrelator, including: Jacobi, = 1, first-o... |

10 |
MMSE-based linear parallel interference cancellation
- Guo, Rasmussen, et al.
- 1998
(Show Context)
Citation Context ... the spectral radius of the iteration matrix, sometimes called the asymptotic convergence factor. The techniques we describe could be applied to the finite case, or for the use of any other norm. See =-=[44]-=-, [45] and [20, Problem 5.12] for optimization of convergence for some finite receivers. Not only is the spectral radius of the iteration matrix of interest, but clearly reduction of the norm of the i... |

9 | Comments on “partial parallel interference cancellation for CDMA
- Buehrer, Nicoloso
- 1999
(Show Context)
Citation Context ...rithms described in this paper. The original multistage detector [25], [26] corresponds to the Jacobi iteration while the fine tuned successive interference canceler discussed by Divsalar et al. [27]–=-=[29]-=- is in fact a minor modification of the successive relaxation method discussed in Section III-E. Iterative methods have also been successfully applied to coded multiuser systems [30]–[32]. We restrict... |

8 | Successive Interference Cancellation in DS-CDMA Systems - Johansson - 1998 |

8 | Aspects on linear parallel interference cancellation
- Rasmussen, Guo, et al.
- 1998
(Show Context)
Citation Context ...pectral radius of the iteration matrix, sometimes called the asymptotic convergence factor. The techniques we describe could be applied to the finite case, or for the use of any other norm. See [44], =-=[45]-=- and [20, Problem 5.12] for optimization of convergence for some finite receivers. Not only is the spectral radius of the iteration matrix of interest, but clearly reduction of the norm of the initial... |

7 |
One-shot filtering equivalence for linear successive interference cancellation in CDMA
- Rasmussen, Johansson, et al.
- 1997
(Show Context)
Citation Context ...i, while serial cancellation corresponds to the Gauss–Seidel method. Our research was motivated by the realization that parallel interference cancellation converges to the decorrelator [4], [5], [8], =-=[9]-=-. Related to these receivers are the approximate decorrelators [1], [15], [20], based on the viewpoint of series expansions for the linear filters. Given the mathematical literature devoted to the ite... |

7 | Low complexity optimal joint detection for oversaturated multiple access communications
- Learned, Willsky, et al.
- 1997
(Show Context)
Citation Context ... is the output of a bank of matched filters. Brute force evaluation of (1) requires the computation of terms. In certain special cases however optimal detection is possible with polynomial complexity =-=[35]-=-–[38]. Of theoretical and practical interest are the class of linear detectors which form decisions based on the output of various linear filters . We are particularly interested in the decorrelator [... |

6 | Spectral efficiency of low-complexity multiuser detectors
- Müller, Verdú
- 2000
(Show Context)
Citation Context ...y the number of users and the length of the spreading sequences. We also consider the convergence speeds of the various methods (with respect to an arbitrary given norm). Related work may be found in =-=[33]-=-, where the authors use random matrix results to find the spectral efficiency of various iterative detectors. In Section II we introduce our discrete-time, synchronous, linear model and describe the o... |

5 |
Spreading sequences for zero-forcing DS-CDMA multiuser detectors
- Elders-Boll, Busboom, et al.
- 1997
(Show Context)
Citation Context ...known that iterated linear interference cancellation for the detection of linear multiple access channels is equivalent to well-known iterative methods for the solution of systems of linear equations =-=[10]-=-, [16], [17]. In particular, parallel interference cancellation is equivalent to the method of Jacobi, while serial cancellation corresponds to the Gauss–Seidel method. Our research was motivated by t... |

5 |
Spectra for large-dimensional random matrices
- Yin, Bai
- 1986
(Show Context)
Citation Context ...lmost surely. The proof for this lemma can be found in [50] (smallest eigenvalue) and [51] for the largest eigenvalue. In fact the distribution of the eigenvalues tends to a deterministic limit [52], =-=[53]-=-, [50], [54], [55], a phenomenon exploited by several authors to prove asymptotic results concerning the capacity and spectral efficiency of the random-sequence CDMA channel, both for optimal joint de... |

4 |
Multi-stage interference cancellation for DS-CDMA
- Jamal, Dahlman
- 1996
(Show Context)
Citation Context ...d of Jacobi, while serial cancellation corresponds to the Gauss–Seidel method. Our research was motivated by the realization that parallel interference cancellation converges to the decorrelator [4], =-=[5]-=-, [8], [9]. Related to these receivers are the approximate decorrelators [1], [15], [20], based on the viewpoint of series expansions for the linear filters. Given the mathematical literature devoted ... |

4 | Adaptive receivers for mobile DS-CDMA communication systems - Elders-Boll, Herper, et al. - 1997 |

4 |
The asymptotic multiuser efficiency of M-stage interference cancellation receivers
- Buehrer, Woerner
- 1997
(Show Context)
Citation Context ...Jacobi, while serial cancellation corresponds to the Gauss–Seidel method. Our research was motivated by the realization that parallel interference cancellation converges to the decorrelator [4], [5], =-=[8]-=-, [9]. Related to these receivers are the approximate decorrelators [1], [15], [20], based on the viewpoint of series expansions for the linear filters. Given the mathematical literature devoted to th... |