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. Conferences, Workshops, Symposiums, and Seminars
  4. Rayleigh Fading Multiple Access Channel without Channel State Information
 
conference paper

Rayleigh Fading Multiple Access Channel without Channel State Information

Marina, Ninoslav  
2004
Telecommunications and Networking - ICT 2004
IEEE International Conference on Telecommunications (ICT 2004)

In this paper we determine bounds of the capacity region of a two-user multiple-access channel with Rayleigh fading when neither the transmitters nor the receiver has channel state information (CSI). We assume that the fading coefficients as well as the additive noise are zero-mean complex Gaussian and there is an average power constraint at the channel input for both senders. Results that we get show that the lower (inner) and the upper (outer) bound of the capacity region are quite close for low and high signal-to-noise ratio (SNR). Surprisingly, the boundary of the capacity region is achieved by time sharing among users, which is not the case for fading channels with perfect CSI at the receiver. As an additional result we derive a closed form expression for the mutual information if the input is on-off binary. Index Terms− Multiple-access channel, capacity region, Rayleigh fading, channel state information, volume of the capacity region.

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

05_ICT2004.pdf

Access type

openaccess

Size

115.93 KB

Format

Adobe PDF

Checksum (MD5)

cc6b1388ee3c956a0e98fa3e861a3ab9

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