EELE 6333: Wireless Commuications

Similar documents
EELE 6333: Wireless Commuications

Degrees of Freedom in Adaptive Modulation: A Unified View

Adaptive Modulation and Coding

Information Theory: A Lighthouse for Understanding Modern Communication Systems. Ajit Kumar Chaturvedi Department of EE IIT Kanpur

ELEC E7210: Communication Theory. Lecture 7: Adaptive modulation and coding

Capacity and Optimal Resource Allocation for Fading Broadcast Channels Part I: Ergodic Capacity

RECEIVER TRANSMITTER CHANNEL. n[i] g[i] Decoder. y[i] Channel Estimator. x[i] w Encoder. Power Control S[i] g[i]

Wireless Communication: Concepts, Techniques, and Models. Hongwei Zhang

Spring 2017 MIMO Communication Systems Solution of Homework Assignment #5

Joint Source-Channel Coding for Image Transmission over Flat Fading Channels

EECS 380: Wireless Technologies Week 7-8

PERFORMANCE ANALYSIS OF DIFFERENT M-ARY MODULATION TECHNIQUES IN FADING CHANNELS USING DIFFERENT DIVERSITY

3432 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 10, OCTOBER 2007

Lecture 4 Diversity and MIMO Communications

Performance of wireless Communication Systems with imperfect CSI

Written Exam Channel Modeling for Wireless Communications - ETIN10

Frequency-Hopped Spread-Spectrum

Multiple Antennas. Mats Bengtsson, Björn Ottersten. Basic Transmission Schemes 1 September 8, Presentation Outline


6 Multiuser capacity and

ISSN Vol.07,Issue.01, January-2015, Pages:

Communication Theory II

Unit 8 - Week 7 - Computer simulation of Rayleigh fading, Antenna Diversity

CHAPTER 4 ADAPTIVE BIT-LOADING WITH AWGN FOR PLAIN LINE AND LINE WITH BRIDGE TAPS

WIRELESS COMMUNICATIONS PRELIMINARIES

Transmit Power Allocation for BER Performance Improvement in Multicarrier Systems

Communications Theory and Engineering

Optimal Power Allocation over Fading Channels with Stringent Delay Constraints

Notes 15: Concatenated Codes, Turbo Codes and Iterative Processing

Study of Turbo Coded OFDM over Fading Channel

Exam 3 is two weeks from today. Today s is the final lecture that will be included on the exam.

Channel Capacity Estimation in MIMO Systems Based on Water-Filling Algorithm

CHAPTER 8 MIMO. Xijun Wang

Combined Phase Compensation and Power Allocation Scheme for OFDM Systems

Efficient Diversity Technique for Hybrid Narrowband-Powerline/Wireless Smart Grid Communications

Joint Source-Channel Coding for Image Transmission over Flat Fading Channels

ENERGY EFFICIENT WATER-FILLING ALGORITHM FOR MIMO- OFDMA CELLULAR SYSTEM

Diversity Techniques

Optimal Power Allocation for Type II H ARQ via Geometric Programming

Opportunistic Beamforming Using Dumb Antennas

Physical Layer: Outline

CHAPTER 5 DIVERSITY. Xijun Wang

Power Control and Scheduling for Guaranteeing Quality of Service in Cellular Networks

Chapter 2: Signal Representation

Module 10 : Receiver Noise and Bit Error Ratio

Optimum Power Allocation in Cooperative Networks

MULTICARRIER communication systems are promising

Research Collection. Multi-layer coded direct sequence CDMA. Conference Paper. ETH Library

Superposition Coding in the Downlink of CDMA Cellular Systems

#8 Adaptive Modulation Coding

Chapter 2 Channel Equalization

On the Average Rate Performance of Hybrid-ARQ in Quasi-Static Fading Channels

CHAPTER 3 ADAPTIVE MODULATION TECHNIQUE WITH CFO CORRECTION FOR OFDM SYSTEMS

On the Capacity Region of the Vector Fading Broadcast Channel with no CSIT

Lecture 3: Data Transmission

Opportunistic Communication in Wireless Networks

Sergio Verdu. Yingda Chen. April 12, 2005

Space-Time Coded Cooperative Multicasting with Maximal Ratio Combining and Incremental Redundancy

EE359 Discussion Session 8 Beamforming, Diversity-multiplexing tradeoff, MIMO receiver design, Multicarrier modulation

NONCOHERENT COMMUNICATION THEORY FOR COOPERATIVE DIVERSITY IN WIRELESS NETWORKS. A Thesis. Submitted to the Graduate School

Capacity and Mutual Information of Wideband Multipath Fading Channels

Fractional Cooperation and the Max-Min Rate in a Multi-Source Cooperative Network

FREQUENCY DOMAIN POWER ADAPTATION SCHEME FOR MULTI-CARRIER SYSTEMS

Performance of Single-tone and Two-tone Frequency-shift Keying for Ultrawideband

Course 2: Channels 1 1

Introduction to Communications Part Two: Physical Layer Ch3: Data & Signals

ECEn 665: Antennas and Propagation for Wireless Communications 131. s(t) = A c [1 + αm(t)] cos (ω c t) (9.27)

Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior

Maximising Average Energy Efficiency for Two-user AWGN Broadcast Channel

Lecture 5: Antenna Diversity and MIMO Capacity Theoretical Foundations of Wireless Communications 1

Power and Bandwidth Allocation in Cooperative Dirty Paper Coding

Problem Sheet 1 Probability, random processes, and noise

Revision of Wireless Channel

Transmit Power Adaptation for Multiuser OFDM Systems

Source and Channel Coding for Quasi-Static Fading Channels

Problem Sheets: Communication Systems

Unit 7 - Week 6 - Wide Sense Stationary Uncorrelated Scattering (WSSUS) Channel Model

We have dened a notion of delay limited capacity for trac with stringent delay requirements.

SNR Estimation in Nakagami-m Fading With Diversity Combining and Its Application to Turbo Decoding

Implementation of a MIMO Transceiver Using GNU Radio

CT111 Introduction to Communication Systems Lecture 9: Digital Communications

ECE 4400:693 - Information Theory

Optimum Threshold for SNR-based Selective Digital Relaying Schemes in Cooperative Wireless Networks

CT-516 Advanced Digital Communications

arxiv: v2 [cs.it] 29 Mar 2014

HY448 Sample Problems

MULTIPLE ANTENNA WIRELESS SYSTEMS AND CHANNEL STATE INFORMATION

Digital Modulation Schemes

Adaptive Wireless. Communications. gl CAMBRIDGE UNIVERSITY PRESS. MIMO Channels and Networks SIDDHARTAN GOVJNDASAMY DANIEL W.

CHAPTER 4 PERFORMANCE ANALYSIS OF THE ALAMOUTI STBC BASED DS-CDMA SYSTEM

Recursive Power Allocation in Gaussian Layered Broadcast Coding with Successive Refinement

Solutions to Information Theory Exercise Problems 5 8

On Using Channel Prediction in Adaptive Beamforming Systems

Color of Interference and Joint Encoding and Medium Access in Large Wireless Networks

Wireless Networks (PHY): Design for Diversity

Dynamic Subchannel and Bit Allocation in Multiuser OFDM with a Priority User

The Acoustic Channel and Delay: A Tale of Capacity and Loss

TO motivate the setting of this paper and focus ideas consider

COMMUNICATION SYSTEMS

ECE 476/ECE 501C/CS Wireless Communication Systems Winter Lecture 6: Fading

Transcription:

EELE 6333: Wireless Commuications Chapter # 4 : Capacity of Wireless Channels Spring, 2012/2013 EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 1 / 18

Outline 1 Capacity in AWGN 2 Capacity of Flat-Fading Channels 3 Capacity of Frequency-Selective Fading Channels EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 2 / 18

Capacity in AWGN... 1 System Capacity: The maximum data rates that can be transmitted over wireless channels with asymptotically small error probability, assuming no constraints on delay or complexity of the encoder and decoder. Consider a discrete-time additive white Gaussian noise (AWGN) channel with channel input/output relationship y[i] = x[i] + n[i]. x[i] is the channel input at time i. y[i] is the corresponding channel output. n[i] is a white Gaussian noise random process. The capacity of this channel is given by Shannon s well-known formula C = B log 2 (1 + γ) bits/second (bps) B is the channel bandwidth. γ is the channel SNR, the ratio between the transmitted power P and the power of the noise, i.e. γ = P/(N 0 B) where N 0 is the power spectral density of the noise. EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 3 / 18

Capacity in AWGN... 2 Shannon s coding theorem proves that a code exists that achieves data rates arbitrarily close to capacity with arbitrarily small probability of bit error. The converse theorem shows that any code with rate R > C has a probability of error bounded away from zero. Shannon capacity is generally used as an upper bound on the data rates that can be achieved under real system constraints. On AWGN radio channels, turbo codes have come within a fraction of a db of the Shannon capacity limit. EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 4 / 18

Capacity of Flat-Fading Channels Channel and System Model... 1 Assume a discrete-time channel with stationary and ergodic (its statistical properties (such as its mean and variance) can be deduced from a single, sufficiently long sample (realization) of the process) time-varying gain g i and AWGN n[i]. The channel power gain g[i] follows a given distribution p(g), e.g. for Rayleigh fading p(g) is exponential. In a block fading channel, g[i] is constant over some blocklength T after which time g[i] changes to a new independent value based on the distribution p(g). Let P denote the average transmit signal power, N 0 /2 denote the noise power spectral density of n[i], and B denote the received signal bandwidth. The instantaneous received signal-to-noise ratio (SNR): γ[i] = Pg[i] N 0 B. The distribution of g[i] determines the distribution of γ[i] and vice versa. EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 5 / 18

Capacity of Flat-Fading Channels Channel and System Model... 2 The channel gain g[i], also called the channel side information (CSI). The capacity of this channel depends on what is known about g[i] at the transmitter and receiver. Channel Distribution Information (CDI): The distribution of g[i] is known to the transmitter and receiver. Receiver CSI: The value of g[i] is known at the receiver at time i, and both the transmitter and receiver know the distribution of g[i]. Transmitter and Receiver CSI: The value of g[i] is known at the transmitter and receiver at time i, and both the transmitter and receiver know the distribution of g[i]. EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 6 / 18

Capacity of Flat-Fading Channels Channel Side Information at Receiver... 1 Consider the case where the CSI g[i] is known at the receiver at time i γ[i] is known at the receiver at time i. Also assume that both the transmitter and receiver know the distribution of g[i]. In this case there are two channel capacity definitions that are relevant to system design: Shannon capacity, also called ergodic capacity, and capacity with outage. Capacity with outage is defined as the maximum rate that can be transmitted over a channel with some outage probability corresponding to the probability that the transmission cannot be decoded with negligible error probability. The probability of outage characterizes the probability of data loss or, equivalently, of deep fading. EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 7 / 18

Capacity of Flat-Fading Channels Channel Side Information at Receiver/Shannon (Ergodic) Capacity... 1 Shannon capacity is equal to Shannon capacity for an AWGN channel with SNR γ, given by Blog2(1 + γ), averaged over the distribution of γ (probabilistic average). Since the probabilistic average E[x] is given by E[x] = xp(x)dx, hence, C = 0 B log 2 (1 + γ)p(γ)dγ By Jensens inequality E(ϕ(x)) ϕ(e(x)), Hence, E(B log 2 (1 + γ)) B log 2 (1 + E(γ)) = B log 2 (1 + γ) where γ is the average SNR on the channel. The Shannon capacity of a fading channel with receiver CSI only is less than the Shannon capacity of an AWGN channel with the same average SNR. Fading reduces Shannon capacity when only the receiver has CSI. EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 8 / 18

Capacity of Flat-Fading Channels Channel Side Information at Receiver/Shannon (Ergodic) Capacity... 2 Ex. 4.2: Consider a flat-fading channel with i.i.d. channel gain g[i] which can take on three possible values: g 1 =.05 with probability p 1 =.1, g 2 =.5 with probability p 2 =.5, and g 3 = 1 with probability p 3 =.4. The transmit power is 10 mw, the noise spectral density is N 0 = 10 9 W/Hz, and the channel bandwidth is 30 khz. Assume the receiver has knowledge of the instantaneous value of g[i] but the transmitter does not. Find the Shannon capacity of this channel and compare with the capacity of an AWGN channel with the same average SNR. The channel has 3 possible received SNRs γ 1 = P t g 1 /(N 0 B) = (0.01 (0.05) 2 )/(30000 10 9 ) = 0.8333 By the same way: γ 2 = 83.333 and γ 3 = 333.33 The Shannon capacity is given by C = 3 i=1 B log 2(1 + γ i )p(γ i ) = 199.26 Kbps The average SNR for this channel is γ =.1(.8333) +.5(83.33) +.4(333.33) = 175.08 The capacity of an AWGN channel with this SNR is C = B log 2 (1 + 175.08) = 223.8 Kbps EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 9 / 18

Capacity of Flat-Fading Channels Channel Side Information at Receiver/Capacity with Outage Capacity with outage allows bits sent over a given transmission burst to be decoded at the end of the burst with some probability that these bits will be decoded incorrectly. The transmitter fixes a minimum received SNR γ min and encodes for a data rate C = B log 2 (1 + γ min ). The data is correctly received if the instantaneous received SNR is greater than or equal to γ min. If the received SNR is below γ min then the bits received over that transmission burst cannot be decoded correctly with probability approaching one, and the receiver declares an outage. The probability of outage is thus p out = p(γ < γ min ). The average rate correctly received over many transmission bursts is C o = (1 p out )B log 2 (1 + γ min ) since data is only correctly received on 1 p out transmissions. The value of γ min is a design parameter based on the acceptable outage probability. EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 10 / 18

Capacity of Flat-Fading Channels Channel Side Information at Transmitter and Receiver When both the transmitter and receiver have CSI, the transmitter can adapt its transmission strategy relative to this CSI. Since the transmitter knows the channel and thus will not send bits unless they can be decoded correctly. The transmitter side information does not increase capacity unless power is also adapted. The maximizing power adaptation policy under the average power constraint is a water-filling. WHAT!! EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 11 / 18

Capacity of Flat-Fading Channels Channel Side Information at Transmitter and Receiver... 2 Zero-Outage Capacity and Channel Inversion The transmitter can use the CSI 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. This power adaptation is called channel inversion. Fading channel capacity with channel inversion is just the capacity of an AWGN channel with constant SNR σ C = B log 2 [1 + σ] What is the advantage and disadvantage of this scheme?. The channel capacity of this scheme is called zero-outage capacity, since the data rate is fixed under all channel conditions and there is no channel outage. Truncated channel inversion: can be achieved by suspending transmission in particularly bad fading states. EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 12 / 18

Capacity of Flat-Fading Channels Capacity Comparisons EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 13 / 18

Capacity of Frequency-Selective Fading Channels Time-Invariant Channels... 1 Consider a time-invariant channel with frequency response H(f ) and assume a total transmit power constraint P. Assume that H(f ) is block-fading, so that frequency is divided into subchannels of bandwidth B, where H(f ) = H j is constant over each block. The frequency-selective fading channel thus consists of a set of AWGN channels in parallel with SNR Hj 2 P j /(N 0 B) on the j th channel, where P j is the power allocated to the j th channel. EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 14 / 18

Capacity of Frequency-Selective Fading Channels Time-Invariant Channels... 2 The capacity of this parallel set of channels is the sum of rates associated with each channel with power optimally allocated over all channels ( ) C = B log 2 1 + H i 2 P j max P j : j P j <P N 0 B The optimal power allocation is found via the same Lagrangian technique used in the flat-fading case, which leads to the water-filling power allocation. [ ] + P j = λ N 0B H i 2 λ = 1 K 0 [P T + ] K 0 j=1 N 0B H i 2 EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 15 / 18

Capacity of Frequency-Selective Fading Channels Time-Invariant Channels... 3 Ex. 4.7: Consider a time-invariant frequency-selective block fading channel consisting of three subchannels of bandwidth B = 1 MHz. The frequency response associated with each channel is H 1 = 1, H 2 = 2 and H 3 = 3. The transmit power constraint is P = 10 mw and the noise PSD is N 0 = 10 9 W/Hz. Find the Shannon capacity of this channel and the optimal power allocation that achieves this capacity. Assume [ that all the channel are working, λ = 1 3 0.01 + ] 3 j=1 1 10 3 = 0.0037867 H i 2 P 1 = [0.003787 1 10 3 ] = 2.787 mw, P 2 = 3.538 mw, and P 3 = 3.675 mw C = 10 6 [log 2 (1 + 2.786) + log 2 (1 + 3.536 4) + log 2 (1 + 2.786 9)] C = 10.93 Mbps Homework: Repeat the Ex. with P = 4 W, H j = {1.64, 2.02, 1.22, 0.3}, B = 1 MHz and N 0 = 0.4 10 6 and check your answer by a computer simulation EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 16 / 18

Capacity of Frequency-Selective Fading Channels Time-Varying Channels It is difficult to determine the capacity of time-varying frequency-selective fading channels, even when the instantaneous channel H(f, i) is known perfectly at the transmitter and receiver. We can approximate channel capacity in time-varying frequency-selective fading by taking the channel bandwidth B of interest and divide it up into subchannels the size of the channel coherence bandwidth B c. Then, the waterfilling is the optimal solution. EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 17 / 18

Homework The homework assignment will be available tomorrow s night on the course webpage. The homework is due in one week. EELE 6333: Wireless Commuications - Ch.4 Dr. Musbah Shaat 18 / 18