نیمسال اوّل 93-92 افشین همّت یار دانشکده مهندسی کامپیوتر مخابرات سیّار (626-40) ظرفیت انتقال اطلاعات.

Slides:



Advertisements
Similar presentations
1 Chapter 3 Digital Communication Fundamentals for Cognitive Radio Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski,
Advertisements

Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 11 Information.
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 10 User.
6: Opportunistic Communication and Multiuser Diversity
1. Introduction.
Iterative Equalization and Decoding
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Chapter 3: PCM Noise and Companding
Control and Feedback Introduction Open-loop and Closed-loop Systems
MIMO Broadcast Scheduling with Limited Feedback Student: ( ) Director: 2008/10/2 1 Communication Signal Processing Lab.
Pole Placement.
Detection Chia-Hsin Cheng. Wireless Access Tech. Lab. CCU Wireless Access Tech. Lab. 2 Outlines Detection Theory Simple Binary Hypothesis Tests Bayes.
ABC Technology Project
Doc.: IEEE /0015r2 Submission January 2004 Yang-Seok Choi et al., ViVATOSlide 1 Comments on Ergodic and Outage Capacity Yang-Seok Choi,
On the Capacity of a cellular CDMA system. - Anshul Popat.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
1 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. On the Capacity of Wireless CSMA/CA Multihop Networks Rafael Laufer and Leonard Kleinrock Bell.
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Doc.: IEEE /0018r0 Submission May 2004 Steve Shellhammer, Intel CorporationSlide 1 IEEE Wireless Coexistence TAG Steve Shellhammer
©2005, The Aerospace Corporation, All Rights Reserved 1 Satellite TT&C Denial, Electronic Counter Measure and Mitigation.
1 S Digital Communication Systems Advanced Modulation and Random Access Techniques.
25 seconds left…...
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.
Wireless Modulation Schemes
Prakshep Mehta ( ) Guided By: Prof. R.K. Shevgaonkar
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.
Three Lessons Learned Never discard information prematurely Compression can be separated from channel transmission with no loss of optimality Gaussian.
Modeling OFDM Radio Channel Sachin Adlakha EE206A Spring 2001.
ECE 776 Information Theory Capacity of Fading Channels with Channel Side Information Andrea J. Goldsmith and Pravin P. Varaiya, Professor Name: Dr. Osvaldo.
Coded Modulation in Fading Channels Ryan Aures Matthew Holland ECE 492 Mobile Communications.
5: Capacity of Wireless Channels Fundamentals of Wireless Communication, Tse&Viswanath 1 5. Capacity of Wireless Channels.
Capacity of Wireless Channels – A brief discussion of some of the point-to-point capacity results and their design implications Alhussein Abouzeid.
Space Time Block Codes Poornima Nookala.
How to Turn on The Coding in MANETs Chris Ng, Minkyu Kim, Muriel Medard, Wonsik Kim, Una-May O’Reilly, Varun Aggarwal, Chang Wook Ahn, Michelle Effros.
Capacity of multi-antenna Gaussian Channels, I. E. Telatar By: Imad Jabbour MIT May 11, 2006.
EE359 – Lecture 12 Outline Announcements Midterm announcements No HW next week (practice MTs) Maximal Ratio Combining MGF Approach to MRC Performance Transmit.
1 Lecture 9: Diversity Chapter 7 – Equalization, Diversity, and Coding.
ECE 480 Wireless Systems Lecture 14 Problem Session 26 Apr 2006.
MULTIPLE INPUT MULTIPLE OUTPUT SYSTEMS (MIMO)
Wireless Communication Elec 534 Set IV October 23, 2007
مخابرات سیّار (626-40) چند مسیری
Wireless Mobile Communication and Transmission Lab. Chapter 8 Application of Error Control Coding.
نیمسال اوّل افشین همّت یار دانشکده مهندسی کامپیوتر مخابرات سیّار (626-40) ارتباطات همکارانه.
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.
Space-Time and Space-Frequency Coded Orthogonal Frequency Division Multiplexing Transmitter Diversity Techniques King F. Lee.
Adaphed from Rappaport’s Chapter 5
EE359 – Lecture 13 Outline Adaptive MQAM: optimal power and rate Finite Constellation Sets Practical Constraints Update rate Estimation error Estimation.
Part 3: Channel Capacity
EE359 – Lecture 12 Outline Combining Techniques
5: Capacity of Wireless Channels Fundamentals of Wireless Communication, Tse&Viswanath 1 5. Capacity of Wireless Channels.
A Simple Transmit Diversity Technique for Wireless Communications -M
Lecture 2-3: Multi-channel Communication Aliazam Abbasfar.
EE359 – Lecture 9 Outline Linear Modulation Review
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Midterm Review Midterm only covers material from lectures and HWs
Channel Capacity.
Diversity.
EE359 – Lecture 8 Outline Capacity of Flat-Fading Channels
Space-Time and Space-Frequency Coded Orthogonal Frequency Division Multiplexing Transmitter Diversity Techniques King F. Lee.
6. Opportunistic Communication and Multiuser Diversity
Advanced Wireless Networks
Wireless Communication Channel Capacity
Wireless Communication Channel Capacity
EE359 – Lecture 10 Outline Announcements: MGF approach for average Ps
EE359 – Lecture 7 Outline Announcements: Shannon Capacity
EE359 – Lecture 8 Outline Announcements Capacity of Fading channels
EE359 – Lecture 7 Outline Shannon Capacity
Presentation transcript:

نیمسال اوّل افشین همّت یار دانشکده مهندسی کامپیوتر مخابرات سیّار (626-40) ظرفیت انتقال اطلاعات

Introduction So far we have only looked at uncoded schemes. Information theory provides a fundamental characterization of coded performance. It identifies the impact of channel resources on performance as well as suggests new ways to communicate over the wireless channel. It provides the basis for the modern development of wireless communication. 2

AWGN Channel Capacity Capacity of AWGN channel is: C = B log 2 (1+S/N) bps or C = log 2 (1+S/N) bps/Hz If Average Power is P av and Power Spectral Density (PSD) of Noise is N 0 (W/Hz) then: C = B log 2 (1+P av /N 0 B) bps 3

Extensions of Basic AWGN Channel In practice, wireless channels may differ from the basic AWGN model in two aspects: Frequency Selectivity Time Varaitions The question is: How to incorporate these two aspects in capacity analysis? 4

Extension for H(f) How should we transfer information when channel is frequency selective: H(f)? Of course, in this case if we want to improve transmission, the transmitter should know channel variations. We need Channel State Information at Transmitter (CSIT). But then, the question is, how should the transmitter allocate power over frequency in an optimum way? 5

Water-filling Algorithm (1) Use of channel information at TX side widely employed for wire-line modems (DMT in ADSL systems) where channel variations is manageable. More applications coming forward for wireless as well. For n parallel channels with channel amplitude h n, how should we allocate power in each channel, P n to maximize overall rate For N c sub-channels the maximum rate using this scheme is: And the optimization problem will be: s.t. 6

Use Lagrange multipliers to find the optimum solution: The power allocation: is the optimal solution with Lagrange multiplier λ chosen such that the power constraint is met. Water-filling Algorithm (2) 7

Extension for Fading When we want to extend channel capacity to flat fading scenarios, we have to differentiate between two scenarios: Slow fading Fast fading Slow fading channels show Non-Ergodic characteristics, as we might get into a deep fade and stay there for a long time. However, fast fading is somehow easier to handle, because on the average we can code over many channel variations and get a good overall transmission. Fast fading channels in this respect are also known as Ergodic channels, and all channel scenarios are almost similar. 8

Capacity of Non-Ergodic Slow Flat-Fading Channels (1) For an AWGN channel of bandwidth B and known SNR= γ we have: C = B log 2 (1+ γ ) bps But problem arises when we do not know the channel information at the transmitter and have an unknown fading channel: If transmitter sends at rate R>Blog(1+γ) then error can not be made arbitrary small. Worst-case channel capacity decoding data without error is almost impossible due to random deep fading. By definition, near zero capacity for ideal Rayleigh fading channel is: C = B log 2 (1+ γ min ) and γ min 0 9

Capacity of Non-Ergodic Slow Flat-Fading Channels (2) Outage Capacity (1) So, we need a more meaningful definition of capacity for such scenarios. Transmitter selects a minimum value for received γ min and encodes for a data rate C = B log 2 (1+ γ min ). The data is correctly received if the instantaneous received γ is greater than or equal to γ min. If the received γ is below γ min then the bits received over that transmission burst cannot be decoded correctly, and the receiver declares an outage. 10

Capacity of Non-Ergodic Slow Flat-Fading Channels (3) Outage Capacity (2) The probability of outage is thus ε = p( γ < γ min ). The average rate correctly received over many transmission bursts is (1 ε )B log 2 (1+ γ min ), since data is only correctly received on (1 ε ) transmissions. Can define an ε -Outage Capacity: The largest rate of transmission R such that the outage probability is less than ε. 11

Capacity of Non-Ergodic Slow Flat-Fading Channels (4) Outage Capacity (3) y[m] = h.x[m] +w[m] (h is random) There is no definitive capacity: for any target rate R, there is a probability that the channel can not support that rate no matter how much coding is done. Outage Probability: P out ( R ) = p { log 2 ( 1+ h 2 γ ) < R} ε -Outage Capacity: C ε = P out -1 (ε ) 12

Capacity of Non-Ergodic Slow Flat-Fading Channels (5) PDF of log 2 (1+|h| 2 γ ) for γ = 0dB For Rayleigh fading, the outage probability is: P out (R) = 1-exp(-(2 R -1)/ γ) For high γ : P out (R) (2 R -1)/ γ) 13

Capacity of Non-Ergodic Slow Flat-Fading Channels (6) ε -Outage Capacity as a fraction of AWGN capacity For low SNR ( γ ), the ratio is almost equal to ε ! In other words, if we want very good outage scenario (small ε ), will lose a lot of capacity. 14

Capacity of Non-Ergodic Slow Flat-Fading Channels (7) Diversity Gain for ε -Outage Capacity 15

Capacity of Ergodic Fast Flat-Fading Channels (1) In a sense, by going to fast fading channels, we can take advantage of channel variations as a source of time diversity, where code words span many coherence periods. Here, we can model the channel as: y[m] = h[m].x[m] +w[m] where h[m] remains constant over each coherence period. 16

Capacity of Ergodic Fast Flat-Fading Channels (2) This is the so-called block fading model. Now if we code over L such coherence periods, we effectively get L parallel sub-channels that fade independently. 17

Capacity of Ergodic Fast Flat-Fading Channels (3) Channel with L-fold time diversity: P out (R) = p {1/L Σ log 2 ( 1+ h l 2 γ ) < R} as L 1/L Σ log 2 ( 1+ h l 2 γ ) E [log 2 ( 1+ h 2 γ )] Thus fast fading channel has the definite capacity: E [log 2 ( 1+ h 2 γ )] Tolerable Delay >> Coherence Time 18

Channel State Information at Transmitter How can we obtain CSIT? o For TDD, use received signal information. o For non-TDD, use feedback path from RX to TX. So, when we have a varying channel, and know these variations at TX side, how should we adjust our power over time? We can now adapt transmit power S( γ ) for a given SNR of γ and use variable rate and power. Two main approaches: o Traditional: Channel Inversion o Modern: Water filling in time domain 19

Fixed Capacity by Channel Inversion The traditional channel inversion approach is the proper choice for delay-limited transmissions (such as voice), when we have slow fading channels and can not wait for the channel to become better. Similar to CDMA power control approach. Fading inverted to maintain constant SNR at the receiver and fixed rate. Mainly may used for slow-fading scenarios that we may not have i.i.d. channel samples over time. Should use truncating to avoid large transmit powers for very poor channels. Simplifies design: fixed rate 20

Optimal Capacity by Water-Filling in Time Domain (1) However, in fast fading scenario, we can adjust our transmission to get an overall optimum performance. Leads to optimization problem of time-varying channel capacity: In this case we will also get a parallel channel model and so the solution will be similar to traditional water-filling solution. Power Adaptation: γ 0 chosen such that power constraint is met. 21

Optimal Capacity by Water-Filling in Time Domain (2) 22

Optimal Capacity by Water-Filling in Time Domain (3) Variable Rate Coding So, in practice, for each value of γ, we select an encoding scheme, send the codes and at receiver use proper decoding. obviously codes change over time as γ changes: Code simplified since dealing with AWGN subchannels. Optimum time varying rate, so more suitable for data applications, rather than fixed rate voice communications. 23

Optimal Capacity by Water-Filling in Time Domain (4) How important is channel information at TX side for high and low SNRs? Simple approximations to optimal water-filling: o High SNR: Allocating equal powers at all times is almost optimal. o Low SNR: Allocating all the power when the channel is strongest. 24

Optimal Capacity by Water-Filling in Time Domain (5) Water-filling does not provide any gain at high SNR. 25

Optimal Capacity by Water-Filling in Time Domain (6) Water-filling provides a significant gain at low SNR. 26

Capacity of Fading Channel with no CSIT At high SNRs capacity is less sensitive to power distribution over channels. At low SNRs, performance is highly sensitive to received power and we get more degradation due to lack of information at Transmitter. Interesting note: CSI capacity is even higher than AWGN channel at low SNRs, because with fading we can opportunistically transmit at high rates when channel temporarily becomes very good! 27

Main Points Fundamental capacity of flat-fading channels depends on what is known at TX and RX. In full CSI case, for optimum performance both power and rate should be adapted. Capacity with TX/RX knowledge: variable-rate variable-power transmission (water-filling) is optimal. Channel inversion (with truncation) is practical for slow fading fixed rate scenarios. 28