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

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

doi:10.1109/LCOMM.2023.3339252

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

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

Chair of Communications Engineering

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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 language	English
Pages (from-to)	29-33
Number of pages	5
Journal	IEEE Communications Letters
Volume	28
Issue number	1
DOIs	https://doi.org/10.1109/LCOMM.2023.3339252
State	Published - 1 Jan 2024

Keywords

Capacity
dirty paper coding
frame error rate
information rate
lattices

Access to Document

10.1109/LCOMM.2023.3339252

Cite this

@article{a2c84679e7d34785a5ad68f1df3128e3,

title = "Achieving the Dirty Paper Channel Capacity With Scalar Lattices and Probabilistic Shaping",

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.",

keywords = "Capacity, dirty paper coding, frame error rate, information rate, lattices",

author = "Sener, {M. Yusuf} and Ronald Bohnke and Wen Xu and Gerhard Kramer",

note = "Publisher Copyright: {\textcopyright} 1997-2012 IEEE.",

year = "2024",

month = jan,

day = "1",

doi = "10.1109/LCOMM.2023.3339252",

language = "English",

volume = "28",

pages = "29--33",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

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

AU - Sener, M. Yusuf

AU - Bohnke, Ronald

AU - Xu, Wen

AU - Kramer, Gerhard

PY - 2024/1/1

Y1 - 2024/1/1

N2 - 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.

AB - 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.

KW - Capacity

KW - dirty paper coding

KW - frame error rate

KW - information rate

KW - lattices

UR - http://www.scopus.com/inward/record.url?scp=85179797628&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2023.3339252

DO - 10.1109/LCOMM.2023.3339252

M3 - Article

AN - SCOPUS:85179797628

SN - 1089-7798

VL - 28

SP - 29

EP - 33

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this