Computer Science – Information Theory
Scientific paper
2010-09-26
Computer Science
Information Theory
9 pages, 7 figures
Scientific paper
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.
Ling Clifton C.
Maria~Estela
Ning Haishi
No associations
LandOfFree
Noncoherent Interference Alignment: Trade Signal Power for Diversity Towards Multiplexing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Noncoherent Interference Alignment: Trade Signal Power for Diversity Towards Multiplexing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Noncoherent Interference Alignment: Trade Signal Power for Diversity Towards Multiplexing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-517052