Search arXivSearch

arXiv · 1611.01525

Diversity Pulse Shaped Transmission in Ultra-Dense Small Cell Networks

Abstract

In ultra-dense small cell networks, spatial multiplexing gain is a challenge because of the different propagation conditions. The channels associated with different transmitreceive pairs can be highly correlated due to the i) high probability of line-of-sight (LOS) communication between user equipment (UE) and base station (BS), and ii) insufficient spacing between antenna elements at both UE and BS. In this paper, we propose a novel transmission technique titled Diversity Pulse Shaped Transmission (DPST) to enhance the throughput over the correlated MIMO channels in an ultra-dense small cell network. The fundamental of DPST is to shape transmit signals at adjacent antennas with distinct interpolating filters, introducing pulse shaping diversity. In DPST, each antenna transmits its own data stream with a relative deterministic time offset-which must be a fraction of the symbol period-with respect to the adjacent antenna. The delay is interpolated with the pulse shaped signal generating a virtual MIMO channel that benefits from increased diversity from the receiver perspective. To extract the diversity, the receiver must operate in an over-sampled domain and hence a fractionally spaced equaliser (FSE) is proposed. The joint impact of DPST and FSE helps the receiver to sense a less correlated channel, eventually enhancing the UE's throughput. Moreover, in order to minimise the spatial correlation, we aim to optimise the deterministic fractional delay. Simulation results show that applying DPST to a correlated channel can approximately enhance the UE throughput by 1.93x and 3.76x in 2x2 and 4x4 MIMO systems, respectively.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amir H. Jafari, Vijay Venkateswaran, David Lopez-Perez, Jie Zhang. 2016-11-04. Diversity Pulse Shaped Transmission in Ultra-Dense Small Cell Networks. https://arxiv.org/abs/1611.01525

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