Large deviations for code division multiple access systems

DOI10.1137/S003613999936372XMaRDI QIDQ2783746zbMATH OpenFDO

Authors Remco van der Hofstad, Gerard Hooghiemstra, Marten J. Klok

Publication date 17 April 2002

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S003613999936372X

zbMATH Keywords

Bahadur-Rao asymptoticscancellationCDMAcode division multiple accesslarge deviation theorysoft decision parallel interference

Mathematics Subject Classification ID

General theory of distribution modulo (1) (11K06) Large deviations (60F10) Functional limit theorems; invariance principles (60F17) Communication theory (94A05) Application of orthogonal and other special functions (94A11) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Review text

Let us consider a problem from telecommunications. Suppose that a system has \(k\) users and that all users transmit data simultaneously. In oder to do so, each user multiplies his data signal by an individual coding sequence. At the receiver, the signal of the \(m\)th \((1\leq m\leq k)\) user can be retrieved by taking the inner product of the transformed total signal and the \(m\)th coding sequence. In the case in which the coding sequences are orthogonal, all data that do not originate from the \(m\)th user will be annihilated. This technique is known as code division multiple access (CDMA); cf. \textit{R. K. Morrow} and \textit{J. S. Lehnert} [IEEE Trans. Commun. 37, 1052-1061 (1989).NEWLINENEWLINENEWLINEIn the paper, approximations for the probability of a bit error for a CDMA system with one-stage soft decision parallel interference cancellation are derived. More precisely, the exponential rates, \(J_k\) with cancellation and \(I_k\) without cancellation, of a CDMA system with \(k\) users and processing gain equal to \(n\) as \(n\to\infty\) are derived. Whereas the rates \(I_k\) follow explicitly from Cramér's theorem, the rates \(J_k\) are given in terms of an optimization problem that can be evaluated numerically. For \(k\geq 3\) the inequality \(J_k>I_k\) is proved. This shows that interference cancellation is effective. In special cases the second order (Bahadur-Rao) asymptotics is investigated. The references contain 9 bibliographical hints.

Recommendations

• Performance of ds-cdma systems with optimal hard-decision parallel interference cancellation
• Capacity bounds for the CDMA system and a neural network: a moderate deviations approach
• Large deviations for eigenvalues of sample covariance matrices, with applications to mobile communication systems
• Large sample properties of the SIR in CDMA with matched filter receivers
• Asymptotic error rates in third generation wireless systems

Cited in

(10)

• Moderate deviations for extreme eigenvalues of real-valued sample covariance matrices
• scientific article; zbMATH DE number 2127758 (Why is no real title available?)
• Performance of ds-cdma systems with optimal hard-decision parallel interference cancellation
• Large deviations for eigenvalues of sample covariance matrices, with applications to mobile communication systems
• Large Deviations of the Interference in a Wireless Communication Model
• Gradient estimation for sensitivity analysis and adaptive multiuser interference rejection in code-division multiple-access systems
• scientific article; zbMATH DE number 1977211 (Why is no real title available?)
• Improving the performance of third-generation wireless communication systems
• Capacity bounds for the CDMA system and a neural network: a moderate deviations approach
• Asymptotic error rates in third generation wireless systems

This page was built for publication: Large deviations for code division multiple access systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783746)