Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1507.03838

Towards Green and Infinite Capacity in Wireless Communication Networks: Beyond The Shannon Theorem

Mohammed Elmusrati
View original source ↗Read source document ↗Export metadata ↓

Abstract

New and novel way for resources allocation in wireless communication has been proposed in this paper. Under this new method, it has been shown that the required power budget becomes independent of the number of served terminals in the downlink. However, the required power depends only of the coverage area, i.e. the channel losses at the cell boarder. Therefore, huge number (theoretically any number) of terminals could be supported concurrently at finite and small downlink power budget. This could be very useful to support the downlink signalling channels in HSPA+, LTE, and 5G. It can be very useful also to support huge D2D communication downlinks. Moreover, and based on the same concept, a new system configuration for a single link point-to-point communication has been presented. With this new configuration, the achieved data rate becomes independent of the required transmit power. This means that any data rate can be achieved at the target BER and with small and finite transmit power. This seems violating with some major results of the Shannon theorem. This issue will be discussed in details in this article.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammed Elmusrati. 2015-07-14. Towards Green and Infinite Capacity in Wireless Communication Networks: Beyond The Shannon Theorem. https://doi.org/10.1049/iet-com.2016.0963

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↗