2000 character limit reached
Achieving AWGN Channel Capacity with Sparse Graph Modulation and "In the Air" Coupling (1111.3696v2)
Published 16 Nov 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.