DocumentCode
1728261
Title
Achieving gaussian multiple access channel capacity with spatially coupled sparse graph multi-user modulation
Author
Truhachev, Dmitri
Author_Institution
Dept. of Comput. Sci., Univ. of Alberta, Edmonton, AB, Canada
fYear
2012
Firstpage
331
Lastpage
337
Abstract
Communication over a Gaussian multiple access channel (GMAC) is considered. Each user modulates his data as a superposition of redundant data streams. The interconnection of the modulated data symbols can be described by means of a sparse graph. The transmitted modulation graphs couple at the receiver, which performs joint detection based on iterative interference cancellation. We prove that the GMAC capacity can be achieved by such a system even for the case when all the users access the channel with equal power and transmit with equal rate.
Keywords
Gaussian channels; channel capacity; graph theory; interference suppression; iterative methods; multi-access systems; radio receivers; radiofrequency interference; sparse matrices; GMAC capacity; Gaussian multiple access channel capacity; iterative interference cancellation; modulated data symbols interconnection; redundant data streams superposition; spatially coupled sparse graph multiuser modulation; transmitted modulation graphs; Error correction codes; Interference cancellation; Iterative decoding; Modulation; Receivers; Signal to noise ratio;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Applications Workshop (ITA), 2012
Conference_Location
San Diego, CA
Print_ISBN
978-1-4673-1473-2
Type
conf
DOI
10.1109/ITA.2012.6181781
Filename
6181781
Link To Document