On the Achievable Rate of Stationary Fading Channels
Virtually all mobile communications systems face the problem that transmission takes place over a time-varying fading channel whose realization is unknown to the receiver. For the design of communication systems it is important to know performance limits for communication over such channels. Therefo...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2011.
|
Σειρά: | Foundations in Signal Processing, Communications and Networking,
6 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Introduction
- Discrete-Time Flat-Fading System Model
- Bounds on the Achievable Rate of a Flat-Fading Channel
- Bounds on the Achievable Rate of a Flat-Fading Channel Based on Prediction
- Pilot Based Synchronized Detection
- Iterative Code-Aided Synchronized Detection
- Joint Processing of Pilot and Data Symbols
- MIMO Flat-Fading Channels
- Frequency-Selective Channels
- Optimum Discrete Signaling
- Conclusion
- Mathematical Derivations and Proofs.