Emergent Mind
Achieving AWGN Channel Capacity with Sparse Graph Modulation and "In the Air" Coupling
(1111.3696)
Published Nov 16, 2011
in
cs.IT
and
math.IT
Abstract
Communication over a multiple access channel is considered. Each user modulates his signal as a superposition of redundant data streams where interconnection of data bits can be represented by means of a sparse graph. The receiver observes a signal resulting from the coupling of the sparse modulation graphs. Iterative interference cancellation decoding is analyzed. It is proved that spatial graph coupling allows to achieve the AWGN channel capacity with equal power transmissions.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.