By Topic

Linear sum capacity for Gaussian multiple access channel with feedback

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ardestanizadeh, E. ; Dept. of Electr. & Comput. Eng., Univ. of California, San Diego, La Jolla, CA, USA ; Wigger, M.A. ; Young-Han Kim ; Javidi, T.

This paper studies the class of generalized linear feedback codes for additive white Gaussian noise multiple access channel. This class includes (nonlinear) nonfeedback codes at one extreme and linear feedback codes by Schalkwijk and Kailath, Ozarow, and Kramer at the other extreme. The linear sum capacity CL(P), the maximum sum-rate achieved by the generalized linear feedback codes, is characterized under symmetric block power constraints P for all the senders. In particular, it is shown that the Kramer linear code achieves CL(P). Based on the properties of the conditional maximal correlation, an extension of the Hirschfeld-Gebelein-Renyi maximal correlation, it is conjectured that Kramer's linear code achieves not only the linear sum capacity, but also the general sum capacity, i.e., the maximum sum-rate achieved by arbitrary feedback codes.

Published in:

Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on

Date of Conference:

13-18 June 2010