ECE 776 Information Theory Capacity of Fading Channels with Channel Side Information Andrea J. Goldsmith and Pravin P. Varaiya, Professor Name: Dr. Osvaldo.

Slides:



Advertisements
Similar presentations
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Advertisements

نیمسال اوّل افشین همّت یار دانشکده مهندسی کامپیوتر مخابرات سیّار (626-40) ظرفیت انتقال اطلاعات.
EE359 – Lecture 8 Outline Capacity of Fading channels Fading Known at TX and RX Optimal Rate and Power Adaptation Channel Inversion with Fixed Rate Capacity.
Information Theory EE322 Al-Sanie.
The Impact of Channel Estimation Errors on Space-Time Block Codes Presentation for Virginia Tech Symposium on Wireless Personal Communications M. C. Valenti.
Capacity of Wireless Channels
EE359 – Lecture 7 Outline Multipath Intensity Profile Doppler Power Spectrum Shannon Capacity Capacity of Flat-Fading Channels Fading Statistics Known.
Enhancing Secrecy With Channel Knowledge
Noise on Analog Systems
Diversity techniques for flat fading channels BER vs. SNR in a flat fading channel Different kinds of diversity techniques Selection diversity performance.
Submission May, 2000 Doc: IEEE / 086 Steven Gray, Nokia Slide Brief Overview of Information Theory and Channel Coding Steven D. Gray 1.
Chapter 6 Information Theory
Optimization of pilot Locations in Adaptive M-PSK Modulation in a Rayleigh Fading Channel Khaled Almustafa Information System Prince Sultan University.
Capacity of Multi-antenna Guassian Channels Introduction: Single user with multiple antennas at transmitter and receiver. Higher data rate Limited bandwidth.
Three Lessons Learned Never discard information prematurely Compression can be separated from channel transmission with no loss of optimality Gaussian.
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
Modeling OFDM Radio Channel Sachin Adlakha EE206A Spring 2001.
EE360: Lecture 6 Outline MAC Channel Capacity in AWGN
Coded Modulation in Fading Channels Ryan Aures Matthew Holland ECE 492 Mobile Communications.
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
HKUST Combined Cross-Layer Design and HARQ for TDD Multiuser systems with Outdated CSIT Rui Wang & Vincent K. N. Lau Dept. of ECE The Hong Kong University.
1 Designing Pilot-Symbol-Assisted Modulation (PSAM) Schemes for Time- Varying Fading Channels Tharaka Lamahewa Research School of Information Sciences.
Capacity of multi-antenna Gaussian Channels, I. E. Telatar By: Imad Jabbour MIT May 11, 2006.
12- OFDM with Multiple Antennas. Multiple Antenna Systems (MIMO) TX RX Transmit Antennas Receive Antennas Different paths Two cases: 1.Array Gain: if.
1 Lecture 9: Diversity Chapter 7 – Equalization, Diversity, and Coding.
ECE 480 Wireless Systems Lecture 14 Problem Session 26 Apr 2006.
Noise and SNR. Noise unwanted signals inserted between transmitter and receiver is the major limiting factor in communications system performance 2.
For 3-G Systems Tara Larzelere EE 497A Semester Project.
Wireless Communication Elec 534 Set IV October 23, 2007
An algorithm for dynamic spectrum allocation in shadowing environment and with communication constraints Konstantinos Koufos Helsinki University of Technology.
Optimization of adaptive coded modulation schemes for maximum average spectral efficiency H. Holm, G. E. Øien, M.-S. Alouini, D. Gesbert, and K. J. Hole.
Coded Transmit Macrodiversity: Block Space-Time Codes over Distributed Antennas Yipeng Tang and Matthew Valenti Lane Dept. of Comp. Sci. & Elect. Engg.
1 Techniques to control noise and fading l Noise and fading are the primary sources of distortion in communication channels l Techniques to reduce noise.
A New Algorithm for Improving the Remote Sensing Data Transmission over the LEO Satellite Channels Ali Payandeh and Mohammad Reza Aref Applied Science.
Doc.: IEEE /0330r2 SubmissionSameer Vermani, QualcommSlide 1 PHY Abstraction Date: Authors: March 2014.
مخابرات سیّار (626-40) چند مسیری
Wireless Mobile Communication and Transmission Lab. Chapter 8 Application of Error Control Coding.
Fairness-Aware Cooperative Resource Allocation for Self-Healing in SON-based Indoor System Kisong Lee, Student Member, IEEE, Howon Lee, Associate Member,
EE 6332, Spring, 2014 Wireless Communication Zhu Han Department of Electrical and Computer Engineering Class 11 Feb. 19 th, 2014.
Cross-Layer Optimization in Wireless Networks under Different Packet Delay Metrics Chris T. K. Ng, Muriel Medard, Asuman Ozdaglar Massachusetts Institute.
Communication System A communication system can be represented as in Figure. A message W, drawn from the index set {1, 2,..., M}, results in the signal.
Real-Time Signal-To-Noise Ratio Estimation Techniques for Use in Turbo Decoding Javier Schlömann and Dr. Noneaker.
Multiple Antennas Have a Big Multi- User Advantage in Wireless Communications Bertrand Hochwald (Bell Labs)
1 Quantization Error Analysis Author: Anil Pothireddy 12/10/ /10/2002.
CHAPTER 3 DELTA MODULATION
Transmission over composite channels with combined source-channel outage: Reza Mirghaderi and Andrea Goldsmith Work Summary STATUS QUO A subset Vo (with.
University of Houston Cullen College of Engineering Electrical & Computer Engineering Capacity Scaling in MIMO Wireless System Under Correlated Fading.
Wireless Multiple Access Schemes in a Class of Frequency Selective Channels with Uncertain Channel State Information Christopher Steger February 2, 2004.
Part 3: Channel Capacity
Name Iterative Source- and Channel Decoding Speaker: Inga Trusova Advisor: Joachim Hagenauer.
EE359 – Lecture 12 Outline Combining Techniques
Professors: Eng. Diego Barral Eng. Mariano Llamedo Soria Julian Bruno
A Simple Transmit Diversity Technique for Wireless Communications -M
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
Raptor Codes Amin Shokrollahi EPFL. BEC(p 1 ) BEC(p 2 ) BEC(p 3 ) BEC(p 4 ) BEC(p 5 ) BEC(p 6 ) Communication on Multiple Unknown Channels.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Channel Capacity.
Multiple Antennas.
Adv. Wireless Comm. Systems - CDMA-
EE359 – Lecture 8 Outline Capacity of Flat-Fading Channels
Techniques to control noise and fading
Advanced Wireless Networks
Advanced Wireless Networks
Howard Huang, Sivarama Venkatesan, and Harish Viswanathan
Wireless Communication Channel Capacity
Wireless Communication Channel Capacity
CT-474: Satellite Communications
EE359 – Lecture 8 Outline Announcements Capacity of Fading channels
EE359 – Lecture 7 Outline Shannon Capacity
Lihua Weng Dept. of EECS, Univ. of Michigan
Presentation transcript:

ECE 776 Information Theory Capacity of Fading Channels with Channel Side Information Andrea J. Goldsmith and Pravin P. Varaiya, Professor Name: Dr. Osvaldo Simeone Student Name: Intehaa Aljarrah Date: May

Capacity of Fading Channels with channel side information Obtain the Shannon capacity of a single user fading channel with an average power constraint under different channel side information conditions:  Fading channel with channel side information at the transmitter and the receiver.  Fading channel with channel side information at the receiver alone.

System Model   Fading Channel   Block Encoder   Power Control   Possible Feedback Channel

System Model  The system model in figure 1 is a discrete-time channel with Stationary ergodic time-varying gain=  AWGN = n[i]  Channel power gain = g[i] is independent of the channel input and has an expected value of unity.  Average transmit signal power =S  Noise density = №  Received signal bandwidth =B  The instantaneous received signal-to-noise ratio (SNR),  S=(№B).  The system model, which sends an input message w from the transmitter to the receiver. transmitter to the receiver.  The message is encoded into the codeword x, which is transmitted over the time-varying channel as x[i] at time i.  The channel gain g[i] changes over the transmission of the codeword.  We assume perfect instantaneous channel estimation so that the channel power gain g[i] is known to the receiver at time i.  We also consider the case when g[i] is known to both the receiver and transmitter at time i, as might be obtained through an error-free delayless feedback path.  This allows the transmitter to adapt x[i] to the channel gain at time i, and is a reasonable model for a slowly varying channel with channel estimation and transmitter feedback.

Capacity at the Transmitter and Receiver Capacity Capacity Analysis Side Information at the Transmitter and Receiver Capacity

Capacity Channel capacity varies with the channel state (SNR). The capacity of the fading channel is the sum of the capacities in each fading state weighted by the probability of that state. The log function is concave (down), so Jensen’s inequality tells us that the expected capacity of the fading channel is less than or equal to the capacity of an AWGN channel with the same average SNR.

Optimal Power Control “Water-filling”or “water-pouring” Above a certain cutoff SNR the systems allocates some power More power is allocated to better channels If the channel stays bad for a long time, the system will just wait until it gets better (essential assumption of ergodic capacity proofs).

CODING

CODING The optimal encoder adjusts its rate according to the channel state: better rates for better channels. The rate adjustment is made in discrete steps by specifying a codebook of a particular size for quantized SNR intervals. Coding works in conjunction with optimal power control.

Optimal Adaptive Technique  The fading-channel capacity with channel side information at the receiver and transmitter is achieved when the transmitter adapt its power, data rate, and coding scheme to the channel variation.  The optimal power allocation is a “water-pouring”.  They required a feedback path between the transmitter and receiver and some complexity in the transmitter.  It uses variable-rate and power transmission, and the complexity of its decoding technique is comparable to the complexity of decoding a sequence of additive white Gaussian noise( AWGN) channels in parallel.  The optimal adaptive technique has the highest capacity.

Nonadaptive Technique   If g[i] is known at the decoder then by scaling, the fading channel with power gain g[i] is equivalent to an AWGN channel with noise power N0B/g[i].   If the transmit power is fixed at S and g[i] is i.i.d. then the input distribution at time i which achieves capacity is an i.i.d. Gaussian distribution with average power S.   The channel capacity with i.i.d. fading and receiver side information only is given by:

Suboptimal adaptive techniques 1. Channel inversion. 2. Truncated channel inversion. For the suboptimal techniques : For the suboptimal techniques :  They adapt the transmit power and keep the transmission rate constant.  They have very simple encoder and decoder designs, but they exhibit a capacity penalty in sever fading.   The suboptimal power control schemes selected for comparison are not really comparable. They’re designed for completely different purposes.

Channel Inversion (SubOptimal)   We now consider a suboptimal transmitter adaptation scheme where the transmitter uses the channel side information to maintain a constant received power, i.e., it inverts the channel fading.   The channel then appears to the encoder and decoder as a time- invariant AWGN channel.   Channel inversion is common in spread-spectrum systems with near– far interference imbalances.   It is also very simple to implement, since the encoder and decoder are designed for an AWGN channel, independent of the fading statistics.   It can exhibit a large capacity penalty in extreme fading environments.

Truncated channel inversion.   A truncated inversion policy can only compensates for fading above a certain cutoff fade depth of SNR:

Numerical Results

Numerical Result

Numerical Results

Conclusions   The difference between the capacity curves (4) and (8) are negligible   It also indicates that for i.i.d. fading, transmitter adaptation yields a negligible capacity gain relative to using only receiver side information.   We can view these results as a tradeoff between capacity and complexity.   The adaptive policy with transmitter side information   requires more complexity in the transmitter (and it typically also requires a feedback path between the receiver and transmitter to obtain the side information). However, the decoder in the receiver is relatively simple.   The nonadaptive policy has a relatively simple transmission scheme, but its code design must use the channel correlation statistics (often unknown), and the decoder complexity is proportional to the channel decorrelation time.   The channel inversion and truncated inversion policies use codes designed for AWGN channels, and are therefore the least complex to implement, but in severe fading conditions they exhibit large capacity losses relative to the other techniques.