TY - JOUR
T1 - Superposition coding for side-information channels
AU - Bennatan, Amir
AU - Burshtein, David
AU - Caire, Giuseppe
AU - Shamai, Shlomo
N1 - Funding Information:
Manuscript received April 19, 2004; revised January 1, 2006. The work of A. Bennatan and D. Burshtein was supported by the Israel Science Foundation under Grant 22/01-1, by an equipment grant from the Israel Science Foundation to the school of Computer Science at Tel-Aviv University, and by a fellowship from The Yitzhak and Chaya Weinstein Research Institute for Signal Processing at Tel-Aviv University. The work of G. Caire and S. Shamai (Shitz) was supported by the European Union 6th framework programme, via the NEWCOM network of excellence. The material in this paper was presented in part at the 41st Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, October 2003 and the International Symposium on Information Theory and its Applications, Parma, Italy, October 2004.
PY - 2006/5
Y1 - 2006/5
N2 - We present simple, practical codes designed for the binary and Gaussian dirty-paper channels. We show that the dirty-paper decoding problem can be transformed into an equivalent multiple-access decoding problem, for which we apply superposition coding. Our concept is a generalization of the nested lattices approach of Zamir, Shamai, and Erez. In a theoretical setting, our constructions are capable of achieving capacity using random component codes and maximum-likelihood decoding. We also present practical implementations of the constructions, and simulation results for both dirty-paper channels. Our results for the Gaussian dirty-paper channel are on par with the best known results for nested lattices. We discuss the binary dirty-tape channel, for which we present a simple, effective coding technique. Finally, we propose a framework for extending our approach to general Gel'fand-Pinsker channels.
AB - We present simple, practical codes designed for the binary and Gaussian dirty-paper channels. We show that the dirty-paper decoding problem can be transformed into an equivalent multiple-access decoding problem, for which we apply superposition coding. Our concept is a generalization of the nested lattices approach of Zamir, Shamai, and Erez. In a theoretical setting, our constructions are capable of achieving capacity using random component codes and maximum-likelihood decoding. We also present practical implementations of the constructions, and simulation results for both dirty-paper channels. Our results for the Gaussian dirty-paper channel are on par with the best known results for nested lattices. We discuss the binary dirty-tape channel, for which we present a simple, effective coding technique. Finally, we propose a framework for extending our approach to general Gel'fand-Pinsker channels.
KW - Dirty paper
KW - Dirty tape
KW - Multiple-access channel (MAC)
KW - Side information
KW - Superposition coding
UR - http://www.scopus.com/inward/record.url?scp=33646065637&partnerID=8YFLogxK
U2 - 10.1109/TIT.2006.872985
DO - 10.1109/TIT.2006.872985
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:33646065637
SN - 0018-9448
VL - 52
SP - 1872
EP - 1889
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 5
ER -