Capacity Bounds for the Discrete Superposition Model of the Gaussian Multiple-Access Channel
2011 (English)In: Proc. IEEE Wireless Communications and Networking Conference 2011, IEEE conference proceedings, 2011, 1590-1595 p.Conference paper (Refereed)
Recently, it has been shown that the capacity of certain Gaussian networks can be approximated by the capacity of the corresponding network in the discrete superposition model (DSM) , . The gap between the capacities is an additive constant only depending on the number of nodes in the network. Hence, the capacity in the DSM is a good approximation in the high SNR regime. Finding this capacity involves optimizing over a finite set of coding strategies. However, the problem space grows with both the number of nodes and with SNR, rendering the optimization infeasible.
In this paper we find upper and lower bounds on the capacity in the DSM. We start with the point-to-point channel, and we extend our strategy to the multiple-access channel. We show that the gap between our bounds is at most an additive constant independent of the channel gains. Hence, combining our results with the results of , , we find closed form bounds on the Gaussian capacity to within an additive constant.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2011. 1590-1595 p.
IdentifiersURN: urn:nbn:se:kth:diva-43398DOI: 10.1109/WCNC.2011.5779401ISI: 000297160200272ScopusID: 2-s2.0-79959307982OAI: oai:DiVA.org:kth-43398DiVA: diva2:448219
2011 IEEE Wireless Communications and Networking Conference, WCNC 2011. Cancun. 28 March 2011 through 31 March 2011
FunderICT - The Next Generation
QC 201111142013-02-082011-10-142013-02-08Bibliographically approved