Computation over Gaussian Multiple-Access Channels
Proceedings of the IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, 2007.
The version of the paper here is a corrected version of the
paper that appeared in the Proceedings.
Adobe Portable Document Format - [PDF]
Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
We consider the problem of computing the sum of independent Gaussian sources over a Gaussian multiple-access channel (MAC) with respect to a mean-squared error criterion. When the source and channel bandwidths are equal, the best separation-based solution to this problem performs exponentially worse in a distortion sense compared to the optimal solution: uncoded transmission. In this paper, we develop lattice codes for exploiting the structure of the Gaussian MAC when there are more channel uses than source symbols. We also demonstrate the usefulness of these codes for multicasting over a simple AWGN network. This version corrects an error that appears in the published version.
B. Nazer and M. Gastpar, Computation over Gaussian Multiple-Access Channels, Proceedings of the 2007 International Symposium on Information Theory (ISIT 2007), Seattle, WA, June, 2007.