Learning to Write on Dirty Paper

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Ozyilkan, Ezgi, Ülger, Oğuzhan Kubilay, Erkip, Elza
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916858854113280
author Ozyilkan, Ezgi
Ülger, Oğuzhan Kubilay
Erkip, Elza
author_facet Ozyilkan, Ezgi
Ülger, Oğuzhan Kubilay
Erkip, Elza
contents Dirty paper coding (DPC) is a classical problem in information theory that considers communication in the presence of channel state known only at the transmitter. While the theoretical impact of DPC has been substantial, practical realizations of DPC, such as Tomlinson-Harashima precoding (THP) or lattice-based schemes, often rely on specific modeling assumptions about the input, state and channel. In this work, we explore whether modern learning-based approaches can offer a complementary path forward by revisiting the DPC problem. We propose a data-driven solution in which both the encoder and decoder are parameterized by neural networks. Our proposed model operates without prior knowledge of the state (also referred to as "interference"), channel or input statistics, and recovers nonlinear mappings that yield effective interference pre-cancellation. To the best of our knowledge, this is the first interpretable proof-of-concept demonstrating that learning-based DPC schemes can recover characteristic features of well-established solutions, such as THP and lattice-based precoding, and outperform them in several regimes.
format Preprint
id arxiv_https___arxiv_org_abs_2507_17427
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Learning to Write on Dirty Paper
Ozyilkan, Ezgi
Ülger, Oğuzhan Kubilay
Erkip, Elza
Information Theory
Dirty paper coding (DPC) is a classical problem in information theory that considers communication in the presence of channel state known only at the transmitter. While the theoretical impact of DPC has been substantial, practical realizations of DPC, such as Tomlinson-Harashima precoding (THP) or lattice-based schemes, often rely on specific modeling assumptions about the input, state and channel. In this work, we explore whether modern learning-based approaches can offer a complementary path forward by revisiting the DPC problem. We propose a data-driven solution in which both the encoder and decoder are parameterized by neural networks. Our proposed model operates without prior knowledge of the state (also referred to as "interference"), channel or input statistics, and recovers nonlinear mappings that yield effective interference pre-cancellation. To the best of our knowledge, this is the first interpretable proof-of-concept demonstrating that learning-based DPC schemes can recover characteristic features of well-established solutions, such as THP and lattice-based precoding, and outperform them in several regimes.
title Learning to Write on Dirty Paper
topic Information Theory
url https://arxiv.org/abs/2507.17427