Employing LSF at Transmitter Eases MMSE Adaptation at Receiver in Asynchronous CDMA Systems (original) (raw)
Related papers
Fast convergence adaptive MMSE receiver for asynchronous DS-CDMA systems
2007
This paper reconsiders the Minimum Mean-Squared Error (MMSE) single user adaptive receiver for the asynchronous Direct Sequence–Code Division Multiple Access (DS-CDMA) system. During the training period the classical MMSE receiver adapts the tap weights once every data bit interval. Our aim is to reduce the overhead introduced during the training period. This will be achieved by adapting the tap weights several times during each bit interval, in an iterative manner.
Signature sequence optimization in asynchronous CDMA systems
ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 2000
We characterize the user capacity, i.e., the maximum number of supportable users at a common SIR target level for a fixed processing gain, of a single-cell symbol asynchronous CDMA system. We show that the user capacity of an asynchronous system is the same as the user capacity of a synchronous system; that is there is no loss in user capacity due to asynchrony. Optimum signature sequences are those that minimize the total squared asynchronous correlation (TSAC) among the users, and depend on users' delay profile. Optimum received powers of the users are equal, and the optimum linear receiver filters in any observation window of size M ≥ 1 symbols (i.e., M-shot MMSE filters) are one-shot matched filters. We present iterative and distributed signature adaptation algorithms where, at each iteration, only one user updates its signature sequence to decrease the TSAC of the set.
Impact of the spreading sequences on the performance of forward link MC-CDMA systems
In this paper, we investigate the impact of the spreading sequences on the performance of forward link MC-CDMA systems. We show that between the extreme cases of uncorrelated and highly correlated channels, the spreading sequences have a great influence on the mutual interference power. This is true for Walsh-Hadamard and Fourier orthogonal sequences where the aperiodic correlation function varies drastically with respect to the spreading sequences. Thus, in this context, selecting the subset of less mutually interfering sequences for a given system load can significantly improve the system performance. Based on this observation, we propose a recursive algorithm that at a given recursion selects the sequence which has the less mutual interference powers with the already selected sequences. This algorithm is shown to provide significant gains up to 3.5 dB in terms of minimum achieved SINR when comparing to bad sequence selection. This algorithm requires knowledge of the equalized channel correlations for all active users, which may be difficult to provide in practice. To overcome this difficulty, we show that by making some assumptions on the channel correlation model, one can greatly reduce the algorithm knowledge requirements without significant loss in performance.
Coded asynchronous CDMA and its efficient detection
IEEE Transactions on Information Theory, 1998
In this paper, receiver design and performance analysis for coded asynchronous code-division multiple access (CDMA) systems is considered. The receiver front-end consists of the near-far resistant multiuser detector known as the projection receiver (PR). The PR performs multiple-access interference resolution and is followed by error-control decoding. The output of the projection receiver yields the appropriate metric (i.e., soft information) for decoding of the coded sequences. An expression for the metric is derived that allows the use of a standard sequence decoder (e.g., Viterbi algorithm, M-algorithm) for the error-control code. It is then shown that the metric computer has an elegant adaptive implementation based on an extension of the familiar recursive least squares (RLS) algorithm. The adaptive PR operates on a single sample per chip and achieves a performance virtually identical to the algebraic PR, but with significantly less complexity. The receiver performance is studied for CDMA systems with fixed and random spreading sequences, and theoretical performance degradations with regard to the single-user bound are derived. The near-far resistance of the PR is also proven, and demonstrated by simulation.
IEEE Journal on Selected Areas in Communications, 1998
We present order-recursive structures for implementing the linear decorrelating and linear minimum mean square error (MMSE) detectors in a computationally efficient manner. These infinite memory length, linear time invariant, noncausal systems can be approximated by implementing them as K-input K-output finite impulse response (FIR) filters. We developed a linear multiuser receiver architecture called a recursive linear multiuser detector which has lower computational and memory requirements then an equivalent tap delay line FIR filter implementation. We establish the tradeoff between window length and bit error rate and find that relatively small window size yields performance indistinguishable from the ideal decorrelating detector and the ideal MMSE detector.
An Overview of Code-Spread CDMA
Code-division multiple-access (CDMA) has gained a lot of attention recently when the third generation mobile communication systems are developed. In this paper we discuss how using low-rate channel coding instead of direct sequence spreading can more efficiently use the available spectrum. This leads to large capacity improvements.
Fast Convergence Least-Mean-Square Algorithms for MMSE Receivers in DS-CDMA Systems
2009
Abstract: This paper considers a minimum mean-squared error (MMSE) single user adaptive receiver for the asynchronous direct-sequence code-division multiple-access (DS-CDMA) system, based on the least-mean-square (LMS) algorithm. It is known that in this context the adaptive algorithm can be iterated several times during the same bit interval in order to achieve a faster convergence rate, which further reduces the length of the training sequence. The objective of this paper is twofold.
Adaptive Rate DS-CDMA Systems Using Variable Spreading Factors
IEEE Transactions on Vehicular Technology, 2004
In this contribution, adaptive rate transmissions are investigated in the context of direct-sequence code-division multiple-access (DS-CDMA) systems using variable spreading factors (VSFs). In the context of the recently established family of adaptive rate-transmission schemes, the transmission rate is typically adapted in response to the channel's fading-induced quality fluctuation. By contrast, in this contribution the transmission rate is adapted in response to the multiuser interference fluctuations encountered. We present the philosophy of the proposed adaptive rate-transmission scheme and analyze the effective throughput as well as the achievable bit error rate (BER) performance, when communicating over additive white Gaussian noise channels. Our study shows that by employing the proposed VSF-assisted adaptive rate-transmission scheme, the effective throughput may be increased by up to 40%, when compared to that of DS-CDMA systems using constant spreading factors. This increased throughput is achieved without wasting power, without imposing extra interference upon other users, and without increasing the BER.