Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Approximate Ergodic Capacity of a Class of Fading Two-User Two-Hop Networks
 
research article

Approximate Ergodic Capacity of a Class of Fading Two-User Two-Hop Networks

Jeon, Sang-Woon
•
Wang, Chien-Yi  
•
Gastpar, Michael C.  
2014
IEEE Transactions on Information Theory

The fading AWGN two-user two-hop network is considered where the channel coefficients are independent and identically distributed (i.i.d.) according to a continuous distribution and vary over time. For a broad class of channel distributions, the ergodic sum capacity is characterized to within a constant number of bits/second/hertz, independent of the signal-to-noise ratio. The achievability follows from the analysis of an interference neutralization scheme where the relays are partitioned into M pairs, and interference is neutralized separately by each pair of relays. When M = 1, the proposed ergodic interference neutralization characterizes the ergodic sum capacity to within 4 bits/sec/Hz for i.i.d. uniform phase fading and approximately 4.7 bits/sec/Hz for i.i.d. Rayleigh fading. It is further shown that this gap can be tightened to 4 log pi-4 bits/sec/Hz (approximately 2.6) for i.i.d. uniform phase fading and 4-4 log(3 pi/8) bits/sec/Hz (approximately 3.1) for i.i.d. Rayleigh fading in the limit of large M.(1)

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

1210.2182.pdf

Type

Preprint

Version

Submitted version (Preprint)

Access type

openaccess

Size

340.35 KB

Format

Adobe PDF

Checksum (MD5)

b89ba9e2f6d1b9f74477e5b7e09d4fac

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés