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. Reports, Documentation, and Standards
  4. RAYLEIGH FADING MULTIPLE ACCESS CHANNEL WITHOUT CHANNEL STATE INFORMATION
 
Loading...
Thumbnail Image
report

RAYLEIGH FADING MULTIPLE ACCESS CHANNEL WITHOUT CHANNEL STATE INFORMATION

Marina, Ninoslav  
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. Equivalently their amplitudes are Rayleigh-distributed and their phases are uniform. We are interested in cases in which 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). As a measure of the tightness we use the volume of the capacity region. 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.

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

IC_TECH_REPORT_200419.pdf

Access type

openaccess

Size

170.01 KB

Format

Adobe PDF

Checksum (MD5)

e2c7d41a2931cca4a9394e644f002c11

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