Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1406.5108

Study on Downlink Spectral Efficiency in Orthogonal Frequency Division Multiple Access Systems

Qiang Huo·Meng Ma·Bingli Jiao
View original source ↗Read source document ↗Export metadata ↓

Abstract

In previous studies on the capacity of orthogonal frequency division multiple access (OFDMA) systems, it is usually assumed that co-channel interference (CCI) from adjacent cells is a Gaussian-distributed random variable. However, very-little work shows that the Gaussian assumption does not hold true in OFDMA systems. In this paper, the statistical property of CCI in downlink OFDMA systems is studied, and spectral efficiency of downlink OFDMA system is analyzed based on the derived statistical model. First, the probability density function (PDF) of CCI in downlink OFDMA cellular systems is studied with the considerations of path loss, multipath fading and Gaussian-like transmit signals. Moreover, some closed-form expressions of the PDF are obtained for special cases. The derived results show that the PDFs of CCI are with a heavy tail, and significantly deviate from the Gaussian distribution. Then, based on the derived statistical properties of CCI, the downlink spectral efficiency is derived. Numerical and simulation results justify the derived statistical CCI model and spectral efficiency.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qiang Huo, Meng Ma, Bingli Jiao. 2014-06-19. Study on Downlink Spectral Efficiency in Orthogonal Frequency Division Multiple Access Systems. https://doi.org/10.1049/iet-com.2013.0972

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↗