Ergodic Fading MIMO Dirty Paper and Broadcast Channels: Capacity Bounds and Lattice Strategies

A multiple-input multiple-output (MIMO) version of the dirty paper channel is studied, where the channel input and the dirt experience the same fading process, and the fading channel state is known at the receiver. This represents settings where signal and interference sources are co-located, such a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on wireless communications Ročník 16; číslo 8; s. 5525 - 5536
Hlavní autoři: Hindy, Ahmed, Nosratinia, Aria
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.08.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1536-1276, 1558-2248
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract A multiple-input multiple-output (MIMO) version of the dirty paper channel is studied, where the channel input and the dirt experience the same fading process, and the fading channel state is known at the receiver. This represents settings where signal and interference sources are co-located, such as in the broadcast channel. First, a variant of Costa's dirty paper coding is presented, whose achievable rates are within a constant gap to capacity for all signal and dirt powers. In addition, a lattice coding and decoding scheme is proposed, whose decision regions are independent of the channel realizations. Under Rayleigh fading, the gap to capacity of the lattice coding scheme vanishes with the number of receive antennas, even at finite Signal-to-Noise Ratio (SNR). Thus, although the capacity of the fading dirty paper channel remains unknown, this paper shows it is not far from its dirt-free counterpart. The insights from the dirty paper channel directly lead to transmission strategies for the two-user MIMO broadcast channel, where the transmitter emits a superposition of desired and undesired (dirt) signals with respect to each receiver. The performance of the lattice coding scheme is analyzed under different fading dynamics for the two users, showing that high-dimensional lattices achieve rates close to capacity.
AbstractList A multiple-input multiple-output (MIMO) version of the dirty paper channel is studied, where the channel input and the dirt experience the same fading process, and the fading channel state is known at the receiver. This represents settings where signal and interference sources are co-located, such as in the broadcast channel. First, a variant of Cost’s dirty paper coding is presented, whose achievable rates are within a constant gap to capacity for all signal and dirt powers. In addition, a lattice coding and decoding scheme is proposed, whose decision regions are independent of the channel realizations. Under Rayleigh fading, the gap to capacity of the lattice coding scheme vanishes with the number of receive antennas, even at finite Signal-to-Noise Ratio (SNR). Thus, although the capacity of the fading dirty paper channel remains unknown, this paper shows it is not far from its dirt-free counterpart. The insights from the dirty paper channel directly lead to transmission strategies for the two-user MIMO broadcast channel, where the transmitter emits a superposition of desired and undesired (dirt) signals with respect to each receiver. The performance of the lattice coding scheme is analyzed under different fading dynamics for the two users, showing that high-dimensional lattices achieve rates close to capacity.
A multiple-input multiple-output (MIMO) version of the dirty paper channel is studied, where the channel input and the dirt experience the same fading process, and the fading channel state is known at the receiver. This represents settings where signal and interference sources are co-located, such as in the broadcast channel. First, a variant of Costa's dirty paper coding is presented, whose achievable rates are within a constant gap to capacity for all signal and dirt powers. In addition, a lattice coding and decoding scheme is proposed, whose decision regions are independent of the channel realizations. Under Rayleigh fading, the gap to capacity of the lattice coding scheme vanishes with the number of receive antennas, even at finite Signal-to-Noise Ratio (SNR). Thus, although the capacity of the fading dirty paper channel remains unknown, this paper shows it is not far from its dirt-free counterpart. The insights from the dirty paper channel directly lead to transmission strategies for the two-user MIMO broadcast channel, where the transmitter emits a superposition of desired and undesired (dirt) signals with respect to each receiver. The performance of the lattice coding scheme is analyzed under different fading dynamics for the two users, showing that high-dimensional lattices achieve rates close to capacity.
Author Hindy, Ahmed
Nosratinia, Aria
Author_xml – sequence: 1
  givenname: Ahmed
  surname: Hindy
  fullname: Hindy, Ahmed
  email: ahmed.hindy@utdallas.edu
  organization: Dept. of Electr. Eng., Univ. of Texas at Dallas, Richardson, TX, USA
– sequence: 2
  givenname: Aria
  surname: Nosratinia
  fullname: Nosratinia, Aria
  email: aria@utdallas.edu
  organization: Dept. of Electr. Eng., Univ. of Texas at Dallas, Richardson, TX, USA
BookMark eNp9kEtPGzEURq0qSIWUfaVuLHU9wY_xi10zhBIpCCSouuvoxo9glHpS21nw7ztpEAsWXd27OOd-ut8ZmqQheYQ-UzKjlJiLx5_djBGqZkxRJjn9gE6pELphrNWTw85lQ5mSH9FZKc9kJKUQp-jXIm8GFy2-BhfTBt8ub-_wVcz1Bd_DzmcMyeF5HsBZKBV3T5CS35ZL3MEObByx-bBPrvzjVlBrtB4_1AzVb6Ivn9BJgG3x569zin5cLx67m2Z1933ZfVs1lgtVGw_SWe2tJVaYdcuVMYxwF_Qa2iDE2ikIyjnT-mCsVkQG0JIChJYHAlrxKfp6vLvLw5-9L7V_HvY5jZE9NUxrI5kUI0WOlM1DKdmHfpfjb8gvPSX9ocV-bLE_tNi_tjgq8p0yPg01Dmn8MW7_J345itF7_5ajTMsI4_wvKQGBFQ
CODEN ITWCAX
CitedBy_id crossref_primary_10_1109_LWC_2018_2825443
crossref_primary_10_1109_TWC_2019_2919292
crossref_primary_10_20535_S0021347020050015
crossref_primary_10_1002_dac_4436
crossref_primary_10_1109_JSAC_2023_3273769
crossref_primary_10_1109_TVT_2020_2965540
crossref_primary_10_1109_TWC_2018_2866841
crossref_primary_10_3103_S0735272720050015
crossref_primary_10_1109_JSAC_2024_3413950
Cites_doi 10.1017/CBO9781139030687
10.1109/18.915665
10.1109/SPAWC.2014.6941718
10.1109/GLOCOM.2014.7037019
10.1017/CBO9780511804441
10.1109/TIT.1983.1056659
10.1109/TIT.2005.855591
10.1109/TIT.2012.2191471
10.1307/mmj/1029003816
10.1109/ISIT.2003.1228360
10.1090/S0002-9939-06-08296-7
10.1109/18.641543
10.1109/TIT.2004.842621
10.1109/ISIT.2016.7541804
10.1109/TIT.2007.911268
10.1109/TIT.2005.856935
10.1109/ISIT.2011.6034121
10.1049/ip-rsn:20000493
10.1109/18.508838
10.1017/CBO9781139045520
10.1109/TIT.2004.834787
10.1017/CBO9780511977770
10.1109/TIT.2004.828067
10.1109/ISIT.2015.7282863
10.1109/ITW.2007.4313053
10.1109/TIT.2006.880064
10.1109/GLOCOM.2016.7842054
10.1109/ACSSC.2008.5074421
10.1109/ISIT.2007.4557255
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TWC.2017.2712631
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Xplore (IEEE/IET Electronic Library - IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore (IEEE/IET Electronic Library - IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2248
EndPage 5536
ExternalDocumentID 10_1109_TWC_2017_2712631
7942023
Genre orig-research
GrantInformation_xml – fundername: National Science Foundation
  grantid: ECCS1546969
  funderid: 10.13039/100000001
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AIBXA
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IES
IFIPE
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
RIG
ID FETCH-LOGICAL-c357t-ea6dc8ecc0c59b43799203df8ba4f55bd7af7dd94ef9c8706fa861aaf43f0a873
IEDL.DBID RIE
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000407726200048&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1536-1276
IngestDate Fri Jul 25 12:21:25 EDT 2025
Sat Nov 29 06:23:43 EST 2025
Tue Nov 18 22:04:51 EST 2025
Wed Aug 27 02:52:39 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 8
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c357t-ea6dc8ecc0c59b43799203df8ba4f55bd7af7dd94ef9c8706fa861aaf43f0a873
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-2376-624X
0000-0002-3751-0165
PQID 1928896265
PQPubID 105736
PageCount 12
ParticipantIDs crossref_citationtrail_10_1109_TWC_2017_2712631
ieee_primary_7942023
proquest_journals_1928896265
crossref_primary_10_1109_TWC_2017_2712631
PublicationCentury 2000
PublicationDate 2017-Aug.
2017-8-00
20170801
PublicationDateYYYYMMDD 2017-08-01
PublicationDate_xml – month: 08
  year: 2017
  text: 2017-Aug.
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on wireless communications
PublicationTitleAbbrev TWC
PublicationYear 2017
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
tulino (ref26) 2004; 1
ref15
ref31
ref30
ref11
abramowitz (ref32) 1972
ref10
ref2
ref1
ref17
ref16
ref19
ref18
etemadi (ref27) 2006; 134
ref24
ref23
ref25
ref20
li (ref14) 2001; 47
ref22
ref21
ref28
ref29
ref8
ref7
ref9
ref4
ref3
ref5
gelfand (ref6) 1980; 9
References_xml – ident: ref24
  doi: 10.1017/CBO9781139030687
– volume: 1
  start-page: 1
  year: 2004
  ident: ref26
  article-title: Random matrix theory and wireless communications
  publication-title: Commun Inf Theory
– volume: 47
  start-page: 1083
  year: 2001
  ident: ref14
  article-title: Capacity and optimal resource allocation for fading broadcast channels. I. Ergodic capacity
  publication-title: IEEE Trans Inf Theory
  doi: 10.1109/18.915665
– volume: 9
  start-page: 19
  year: 1980
  ident: ref6
  article-title: Coding for channel with random parameters
  publication-title: Problems Control Inf Theory
– ident: ref12
  doi: 10.1109/SPAWC.2014.6941718
– ident: ref25
  doi: 10.1109/GLOCOM.2014.7037019
– ident: ref30
  doi: 10.1017/CBO9780511804441
– ident: ref3
  doi: 10.1109/TIT.1983.1056659
– ident: ref21
  doi: 10.1109/TIT.2005.855591
– ident: ref16
  doi: 10.1109/TIT.2012.2191471
– ident: ref28
  doi: 10.1307/mmj/1029003816
– ident: ref15
  doi: 10.1109/ISIT.2003.1228360
– volume: 134
  start-page: 2739
  year: 2006
  ident: ref27
  article-title: Convergence of weighted averages of random variables revisited
  publication-title: Proc Amer Math Soc
  doi: 10.1090/S0002-9939-06-08296-7
– ident: ref20
  doi: 10.1109/18.641543
– ident: ref18
  doi: 10.1109/TIT.2004.842621
– ident: ref1
  doi: 10.1109/ISIT.2016.7541804
– ident: ref8
  doi: 10.1109/TIT.2007.911268
– ident: ref5
  doi: 10.1109/TIT.2005.856935
– ident: ref17
  doi: 10.1109/ISIT.2011.6034121
– ident: ref31
  doi: 10.1049/ip-rsn:20000493
– ident: ref22
  doi: 10.1109/18.508838
– ident: ref23
  doi: 10.1017/CBO9781139045520
– ident: ref19
  doi: 10.1109/TIT.2004.834787
– ident: ref29
  doi: 10.1017/CBO9780511977770
– ident: ref11
  doi: 10.1109/TIT.2004.828067
– ident: ref13
  doi: 10.1109/ISIT.2015.7282863
– ident: ref10
  doi: 10.1109/ITW.2007.4313053
– ident: ref4
  doi: 10.1109/TIT.2006.880064
– year: 1972
  ident: ref32
  publication-title: Handbook of Mathematical Functions with Formulas Graphs and Mathematical Tables
– ident: ref2
  doi: 10.1109/GLOCOM.2016.7842054
– ident: ref7
  doi: 10.1109/ACSSC.2008.5074421
– ident: ref9
  doi: 10.1109/ISIT.2007.4557255
SSID ssj0017655
Score 2.3046424
Snippet A multiple-input multiple-output (MIMO) version of the dirty paper channel is studied, where the channel input and the dirt experience the same fading process,...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 5525
SubjectTerms Antennas
broadcast channels
Broadcasting
channels with state
Coding
Communication channels
Decoding
Dirt
Dirty paper channel
Encoding
Ergodic capacity
Ergodic processes
Fading
Fading channels
lattice codes
Lattices
MIMO
Receivers
Superposition (mathematics)
Transmitters
Title Ergodic Fading MIMO Dirty Paper and Broadcast Channels: Capacity Bounds and Lattice Strategies
URI https://ieeexplore.ieee.org/document/7942023
https://www.proquest.com/docview/1928896265
Volume 16
WOSCitedRecordID wos000407726200048&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Xplore (IEEE/IET Electronic Library - IEL)
  customDbUrl:
  eissn: 1558-2248
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017655
  issn: 1536-1276
  databaseCode: RIE
  dateStart: 20020101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS9xAFH_o0oMequ1WurqWOfRS6LrZZJLJeLOLi4LaPay4J8N8giBRNlHwv_e9STZULIVCDjm8CcP8Zua9l_fxA_ieog0r-SQf8Rh9E04ZYspSb7w01pY7nHtTKHwhrq7y5VLON-BnVwvjnAvJZ-6IXkMs3z6YJ_pVNsa9Q2zfm7ApRNbUanURA5EFhlM8wMQrI7qQZCTHi5sp5XCJo1hM4iyZvFFBgVPl3UUctMts5__mtQsfWyuSnTSwf4INV36G7T96C_bh9nSFLuedYbOQJc8uzy9_M7zg6hc2V49uxVRpGTrhyhpV1YyqDErUk8dsiurToG3OfhHjUhXkLlRNSXJs3cvWVV_gena6mJ6NWjKFkUlSUY-cyqzJEbDIpFJTF0IZR4n1uVbcp6m2QnlhreTOS0PBT6_ybKKU54mPVC6SPeiVD6X7Ckxz5bUgGL3iwnGNXpA2KnH46ETHAxiv17cwbadxIry4L4LHEckCESkIkaJFZAA_uhGPTZeNf8j2CYFOrl38AQzXEBbtMawKNF_zXKLPlu7_fdQBbNG3m4y-IfTq1ZM7hA_mub6rVt_CDnsFaSrOhg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB4BRaI9lPKoujyKD1yQWDabOOuYW1mxArG75bAVnIj8lJBQQJtQqf-eGScbgYoqVcrBB1u2_NmemczjAzhMUYeVvJ91eYy2CacIMWWpNl4aa8sdrr1OFB6L6TS7vZXXS3Dc5sI450LwmTuhZvDl20fzTL_Kenh2iO17GT6kHFt1tlbrMxCDwHGKV5iYZUTrlIxkb3YzpCgucRKLfjxI-m-EUGBV-espDvJltP5_K_sCnxs9kv2ogd-AJVdswqdX1QW34O58jkbnvWGjECfPJpeTnwyfuOoPu1ZPbs5UYRma4coaVVaM8gwKlJSnbIgC1KB2zs6Ic6kM_caqojA5tqhm68pt-DU6nw0vug2dQtckqai6Tg2syRCyyKRSUx1CGUeJ9ZlW3KeptkJ5Ya3kzktD7k-vskFfKc8TH6lMJF9hpXgs3DdgmiuvBQHpFReOa7SDtFGJw08nOu5Ab7G_uWlqjRPlxUMebI5I5ohITojkDSIdOGpHPNV1Nv7Rd4sQaPs1m9-BvQWEeXMRyxwV2CyTaLWlO--POoC1i9lknI8vp1e78JHmqeP79mClmj-7fVg1v6v7cv49nLYXTn3RzQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Ergodic+Fading+MIMO+Dirty+Paper+and+Broadcast+Channels%3A+Capacity+Bounds+and+Lattice+Strategies&rft.jtitle=IEEE+transactions+on+wireless+communications&rft.au=Hindy%2C+Ahmed&rft.au=Nosratinia%2C+Aria&rft.date=2017-08-01&rft.pub=IEEE&rft.issn=1536-1276&rft.volume=16&rft.issue=8&rft.spage=5525&rft.epage=5536&rft_id=info:doi/10.1109%2FTWC.2017.2712631&rft.externalDocID=7942023
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1536-1276&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1536-1276&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1536-1276&client=summon