Search arXivSearch

arXiv · 1212.4034

5GNOW: Challenging the LTE Design Paradigms of Orthogonality and Synchronicity

Abstract

LTE and LTE-Advanced have been optimized to deliver high bandwidth pipes to wireless users. The transport mechanisms have been tailored to maximize single cell performance by enforcing strict synchronism and orthogonality within a single cell and within a single contiguous frequency band. Various emerging trends reveal major shortcomings of those design criteria: 1) The fraction of machine-type-communications (MTC) is growing fast. Transmissions of this kind are suffering from the bulky procedures necessary to ensure strict synchronism. 2) Collaborative schemes have been introduced to boost capacity and coverage (CoMP), and wireless networks are becoming more and more heterogeneous following the non-uniform distribution of users. Tremendous efforts must be spent to collect the gains and to manage such systems under the premise of strict synchronism and orthogonality. 3) The advent of the Digital Agenda and the introduction of carrier aggregation are forcing the transmission systems to deal with fragmented spectrum. 5GNOW is an European research project supported by the European Commission within FP7 ICT Call 8. It will question the design targets of LTE and LTE-Advanced having these shortcomings in mind and the obedience to strict synchronism and orthogonality will be challenged. It will develop new PHY and MAC layer concepts being better suited to meet the upcoming needs with respect to service variety and heterogeneous transmission setups. Wireless transmission networks following the outcomes of 5GNOW will be better suited to meet the manifoldness of services, device classes and transmission setups present in envisioned future scenarios like smart cities. The integration of systems relying heavily on MTC into the communication network will be eased. The per-user experience will be more uniform and satisfying. To ensure this 5GNOW will contribute to upcoming 5G standardization.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gerhard Wunder, Martin Kasparick, Stephan ten Brink, Frank Schaich, Thorsten Wild, Ivan Gaspar, Eckhard Ohlmer, Stefan Krone, Nicola Michailow, Ainoa Navarro, Gerhard Fettweis, Dimitri Ktenas, Vincent Berg, Marcin Dryjanski, Slawomir Pietrzyk, Bertalan Eged. 2012-12-17. 5GNOW: Challenging the LTE Design Paradigms of Orthogonality and Synchronicity. https://doi.org/10.1109/vtcspring.2013.6691814

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

KEEP EXPLORING

Related papers

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

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

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