Skip to main content

Rayleigh Fading Multiple Access Channel Without Channel State Information

  • Conference paper
Telecommunications and Networking - ICT 2004 (ICT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3124))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Marina, N.: Successive Decoding, Ph.D. thesis, School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne (2004)

    Google Scholar 

  2. Marina, N.: On successive decoding without channel state information. In: Proc. IEEE Int. Symp. Telecommunications, Tehran (2001)

    Google Scholar 

  3. Abou-Faycal, I.C., Trott, M.D., Shamai (Shitz), S.: The capacity of discrete-time memoryless Rayleigh-fading channels. IEEE Trans. on Information Theory 47(4) (May 2001)

    Google Scholar 

  4. Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions. Dover, New York (1965)

    Google Scholar 

  5. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)

    Book  MATH  Google Scholar 

  6. Lapidoth, A., Moser, S.M.: Capacity bounds via duality with applications to multi-antenna systems on flat fading channels. IEEE Trans. on Information Theory 49(10) (October 2003)

    Google Scholar 

  7. Marzetta, T., Hochwald, B.: Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading. IEEE Trans. on Information Theory 45(1) (January 1999)

    Google Scholar 

  8. Shamai (Shitz), S., Marzetta, T.L.: Multiuser capacity in block fading with no channel state information. IEEE Trans. on Information Theory 48(4) (April 2002)

    Google Scholar 

  9. Taricco, G., Elia, M.: Capacity of fading channel with no side information. Electronic Letters 33(16) (July 1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marina, N. (2004). Rayleigh Fading Multiple Access Channel Without Channel State Information. In: de Souza, J.N., Dini, P., Lorenz, P. (eds) Telecommunications and Networking - ICT 2004. ICT 2004. Lecture Notes in Computer Science, vol 3124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27824-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27824-5_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22571-3

  • Online ISBN: 978-3-540-27824-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics