Achieving the Dirty Paper Channel Capacity With Scalar Lattices and Probabilistic Shaping

M. Yusuf Sener, Ronald Bohnke, Wen Xu, Gerhard Kramer

Research output: Contribution to journalArticlepeer-review

Abstract

Reliable communication rates are derived for a dirty paper coding scheme with scalar lattices and probabilistic shaping. The scheme is shown to achieve the capacity of additive white Gaussian noise (AWGN) channels with additive interference. Rate bounds are computed as a function of the block length under the simplifying assumption of perfect constellation shaping. A normal approximation (NA) for the rates approaches a NA for standard AWGN channels at high signal-to-noise ratio (SNR), but the interference degrades performance at low SNR.

Original languageEnglish
Pages (from-to)29-33
Number of pages5
JournalIEEE Communications Letters
Volume28
Issue number1
DOIs
StatePublished - 1 Jan 2024

Keywords

  • Capacity
  • dirty paper coding
  • frame error rate
  • information rate
  • lattices

Fingerprint

Dive into the research topics of 'Achieving the Dirty Paper Channel Capacity With Scalar Lattices and Probabilistic Shaping'. Together they form a unique fingerprint.

Cite this