A Practical Dirty Paper Coding Applicable for Broadcast Channel
Srikanth Pai Bantwal, B. Sundar Rajan

TL;DR
This paper introduces a practical dirty paper coding scheme using trellis coded modulation for broadcast channels, enabling interference pre-cancellation with finite constellations and demonstrating effective performance through simulations.
Contribution
It presents a novel practical implementation of dirty paper coding with trellis coded modulation suitable for broadcast channels, ensuring interference remains distinguishable at the receiver.
Findings
Effective interference pre-cancellation demonstrated
Simulation results show promising performance with QAM-based codes
Scheme applicable to broadcast channels with Gaussian interference
Abstract
In this paper, we present a practical dirty paper coding scheme using trellis coded modulation for the dirty paper channel , where is white Gaussian noise with power , is the average transmit power and is the Gaussian interference with power that is non-causally known at the transmitter. We ensure that the dirt in our scheme remains distinguishable to the receiver and thus, our designed scheme is applicable to broadcast channel. Following Costa's idea, we recognize the criteria that the transmit signal must be as orthogonal to the dirt as possible. Finite constellation codes are constructed using trellis coded modulation and by using a Viterbi algorithm at the encoder so that the code satisfies the design criteria and simulation results are presented with codes constructed via trellis coded modulation using QAM…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · DNA and Biological Computing · graph theory and CDMA systems
