Channel Coding in the Presence of Side Information
Foundations and Trends in Communications and Information Theory
Code design for MIMO broadcast channels
IEEE Transactions on Communications
Near-capacity dirty-paper code design: a source-channel coding approach
IEEE Transactions on Information Theory
On the designs and challenges of practical binary dirty paper coding
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Joint Wyner-Ziv/dirty-paper coding by modulo-lattice modulation
IEEE Transactions on Information Theory
Wyner-Ziv coding based on TCQ and LDPC codes
IEEE Transactions on Communications
Practical dirty paper coding with nested binary LDGM-LDPC codes
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Multiuser MIMO achievable rates with downlink training and channel state
IEEE Transactions on Information Theory
Interior point decoding for linear vector channels based on convex optimization
IEEE Transactions on Information Theory
Flow-level performance of proportional fairness with hierarchical modulation in OFDMA-based networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Achieving high data rates in a distributed MIMO system
Proceedings of the 18th annual international conference on Mobile computing and networking
A Soft Demodulation Algorithm with Low Complexity for One-dimensional DPC System
Wireless Personal Communications: An International Journal
| Hi-index | 755.08 |
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.