Search arXivSearch

arXiv · 1009.5121

Noncoherent Interference Alignment: Trade Signal Power for Diversity Towards Multiplexing

Abstract

This paper proposes the first known universal interference alignment scheme for general $(1\times{}1)^K$ interference networks, either Gaussian or deterministic, with only 2 symbol extension. While interference alignment is theoretically powerful to increase the total network throughput tremendously, no existing scheme can achieve the degree of freedom upper bound exactly with finite complexity. This paper starts with detailed analysis of the diagonality problem of naive symbol extension in small $(1\times1)^3$ networks, a technique widely regarded as necessary to achieve interference alignment with insufficient diversity. Then, a joint bandpass noncoherent demodulation and interference alignment scheme is proposed to solve the diagonality problem by trading signal power for increased system diversity, which is further traded for multiplexing improvement. Finally, the proposed noncoherent interference alignment scheme is extended to general $(1\times{}1)^K$ cases and is proven to achieve the degree of freedom upper bound exactly. Simulation results verify the correctness and powerfulness of the proposed scheme and show significant degree of freedom improvement compared to the conventional orthogonal transmission scheme.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haishi Ning, Maria~Estela, Cong Ling. 2012-12-28. Noncoherent Interference Alignment: Trade Signal Power for Diversity Towards Multiplexing. https://arxiv.org/abs/1009.5121

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