Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1110.1519

Comparison of Radio Propagation Models for Long Term Evolution (LTE) Network

Noman Shabbir·Muhammad T. Sadiq·Hasnain Kashif·Rizwan Ullah
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper concerns about the radio propagation models used for the upcoming 4th Generation (4G) of cellular networks known as Long Term Evolution (LTE). The radio wave propagation model or path loss model plays a very significant role in planning of any wireless communication systems. In this paper, a comparison is made between different proposed radio propagation models that would be used for LTE, like Stanford University Interim (SUI) model, Okumura model, Hata COST 231 model, COST Walfisch-Ikegami & Ericsson 9999 model. The comparison is made using different terrains e.g. urban, suburban and rural area.SUI model shows the lowest path lost in all the terrains while COST 231 Hata model illustrates highest path loss in urban area and COST Walfisch-Ikegami model has highest path loss for suburban and rural environments.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Noman Shabbir, Muhammad T. Sadiq, Hasnain Kashif, Rizwan Ullah. 2011-10-07. Comparison of Radio Propagation Models for Long Term Evolution (LTE) Network. https://arxiv.org/abs/1110.1519

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↗