Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1210.3667

A New Analysis of the DS-CDMA Cellular Downlink Under Spatial Constraints

Matthew C. Valenti·Don Torrieri·Salvatore Talarico
View original source ↗Read source document ↗Export metadata ↓

Abstract

The direct-sequence code-division multiple access (DS-CDMA) cellular downlink is modeled by a constrained random spatial model involving a fixed number of base stations placed over a finite area with a minimum separation. The analysis is driven by a new closed-form expression for the conditional outage probability at each mobile, where the conditioning is with respect to the network realization. The analysis features a flexible channel model, accounting for path loss, Nakagami fading, and shadowing. By generating many random networks and applying a given resource allocation policy, the distribution of the rates provided to each user is obtained. In addition to determining the average rate, the analysis can determine the transmission capacity of the network and can characterize fairness in terms of the fraction of users that achieve a specified rate. The analysis is used to compare a rate-control policy against a power-control policy and investigate the influence of the minimum base-station separation.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew C. Valenti, Don Torrieri, Salvatore Talarico. 2012-10-13. A New Analysis of the DS-CDMA Cellular Downlink Under Spatial Constraints. https://arxiv.org/abs/1210.3667

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗