Achieving Gaussian Vector Broadcast Channel Capacity with Scalar Lattices

M. Yusuf Şener, Gerhard Kramer, Shlomo Shamai Shitz, Ronald Böhnke, Wen Xu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A coding scheme with scalar lattices is applied to K-receiver, Gaussian, vector broadcast channels with K independent messages, one for each receiver. The method decomposes each receiver channel into parallel scalar channels with known interference and applies dirty paper coding with a modulo interval, amplitude shift keying (ASK), and probabilistic shaping to each scalar channel. The achievable rate tuples include all points inside the capacity region by choosing truncated Gaussian shaping, large ASK alphabets, and large modulo intervals.

Original languageEnglish
Title of host publication2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1706-1711
Number of pages6
ISBN (Electronic)9798350382846
DOIs
StatePublished - 2024
Event2024 IEEE International Symposium on Information Theory, ISIT 2024 - Athens, Greece
Duration: 7 Jul 202412 Jul 2024

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2024 IEEE International Symposium on Information Theory, ISIT 2024
Country/TerritoryGreece
CityAthens
Period7/07/2412/07/24

Keywords

  • Broadcast channel
  • capacity
  • dirty paper coding
  • lattices
  • multi-input multi-output

Fingerprint

Dive into the research topics of 'Achieving Gaussian Vector Broadcast Channel Capacity with Scalar Lattices'. Together they form a unique fingerprint.

Cite this