Shannon’s Theorem.

Slides:



Advertisements
Similar presentations
Logarithms Log Review. Logarithms For example Logarithms.
Advertisements

Wireless Communication
II. Modulation & Coding. © Tallal Elshabrawy Design Goals of Communication Systems 1.Maximize transmission bit rate 2.Minimize bit error probability 3.Minimize.
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.
Pensinyalan (2) Perbandingan antara sinyal analog dan digital.
CMP206 – Introduction to Data Communication & Networks Lecture 3 – Bandwidth.
TRANSMISSION FUNDAMENTALS Recap Questions/Solutions
Cellular Communications
1/15 KLKSK Pertemuan III Analog & Digital Data Shannon Theorem xDSL.
Digital to Analog Many carrier facilities are analog Many transmission media are also analog (microwave, radio) We can carry digital values over analog.
Sampling and quantization Seminary 2. Problem 2.1 Typical errors in reconstruction: Leaking and aliasing We have a transmission system with f s =8 kHz.
Lab 2 COMMUNICATION TECHNOLOGY II. Capacity of a System The bit rate of a system increases with an increase in the number of signal levels we use to denote.
Three Lessons Learned Never discard information prematurely Compression can be separated from channel transmission with no loss of optimality Gaussian.
Chapter 15: Data Transmission Business Data Communications, 5e.
3F4 Optimal Transmit and Receive Filtering Dr. I. J. Wassell.
1 Today, we are going to talk about: Shannon limit Comparison of different modulation schemes Trade-off between modulation and coding.
Information Capacity and Communication Systems By : Mr. Gaurav Verma Asst. Prof. ECE Dept. NIEC.
Noise, Information Theory, and Entropy
Net 222: Communications and networks fundamentals (Practical Part)
Noise and SNR. Noise unwanted signals inserted between transmitter and receiver is the major limiting factor in communications system performance 2.
Page 1 of 37 Density Evolution, Capacity Limits, and the "5k" Code Result (L. Schirber 11/22/11) The Density Evolution (DE) algorithm calculates a "threshold.
4/11/40 page 1 Department of Computer Engineering, Kasetsart University Introduction to Computer Communications and Networks CONSYL Transmission.
Chapter 15: Data Transmission Business Data Communications, 6e.
On the Optimal SINR in Random Access Networks with Spatial Re-Use Navid Ehsan and R. L. Cruz UCSD.
CE 4228 Data Communications and Networking
© H. Heck 2008Section 6.11 Module 6:Advanced Issues Topic 1:Projections, Limits, Barriers OGI EE564 Howard Heck.
Fundamentals of Digital Communication 2 Digital communication system Low Pass Filter SamplerQuantizer Channel Encoder Line Encoder Pulse Shaping Filters.
IT-101 Section 001 This is an addition to lecture 8 Lecture #14 Introduction to Information Technology.
10/6/2015 3:12 AM1 Data Encoding ─ Analog Data, Digital Signals (5.3) CSE 3213 Fall 2011.
1 Analog/Digital Modulation Analog Modulation The input is continuous signal Used in first generation mobile radio systems such as AMPS in USA. Digital.
Baseband Demodulation/Detection
1 Information in Continuous Signals f(t) t 0 In practice, many signals are essentially analogue i.e. continuous. e.g. speech signal from microphone, radio.
The Physical Layer Lowest layer in Network Hierarchy. Physical transmission of data. –Various flavors Copper wire, fiber optic, etc... –Physical limits.
GMSK - Gaussian Minimum Shift Keying
Factors in Digital Modulation
Shannon Theory Risanuri Hidayat Reference L L Peterson and B S Davie,
CS Spring 2009 CS 414 – Multimedia Systems Design Lecture 3 – Digital Audio Representation Klara Nahrstedt Spring 2009.
1 Composite Signals and Fourier Series To approximate a square wave with frequency f and amplitude A, the terms of the series are as follows: Frequencies:
Digital Communications Chapeter 3. Baseband Demodulation/Detection Signal Processing Lab.
ECE 4710: Lecture #31 1 System Performance  Chapter 7: Performance of Communication Systems Corrupted by Noise  Important Practical Considerations: 
Channel capacity A very important consideration in data communications is how fast we can send data, in bits per second, over a channel.
When a signal is transmitted over a channel, the frequency band and bandwidth of the channel must match the signal frequency characteristics. Usually,
Combined Linear & Constant Envelope Modulation
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Baseband Receiver Receiver Design: Demodulation Matched Filter Correlator Receiver Detection Max. Likelihood Detector Probability of Error.
Noise and Data Errors Nominal Observation for “1” Nominal Observation for “0” Probability density for “0” with Noise Probability density for “1” with Noise.
Transmission Media. Quiz: ANGEL->Lessons->Quiz 2 Figure 1Figure 2 Figure 3Figure 4.
Digital Modulation Basics
Performance of Digital Communications System
Institute for Experimental Mathematics Ellernstrasse Essen - Germany DATA COMMUNICATION introduction A.J. Han Vinck May 10, 2003.
Binary data to transmit The faster the bit rate, the more energy is spread on the spectrum + a - a a2T0a2T0 s(t) T0T0 1/T 0 2/T 0 Frequency Time.
1587: COMMUNICATION SYSTEMS 1 Digital Signals, modulation and noise Dr. George Loukas University of Greenwich,
Lifecycle from Sound to Digital to Sound. Characteristics of Sound Amplitude Wavelength (w) Frequency ( ) Timbre Hearing: [20Hz – 20KHz] Speech: [200Hz.
Channel Capacity Bandwidth – In cycles per second of Hertz – Constrained by transmitter and medium Data rate – In bits per second – Rate at which data.
Fundamental Dynamics of Digital Communications
EE359 – Lecture 8 Outline Capacity of Flat-Fading Channels
Advanced Wireless Networks
CSE 5345 – Fundamentals of Wireless Networks
Advanced Wireless Networks
Trellis Coded Modulation
Wireless NETWORKS NET 434 Topic # 3 Wireless Transmission and Channel
CSE 5345 – Fundamentals of Wireless Networks
Nyquist’s theorem: D = 2BLog2K
Nyquist and Shannon Capacity
II. Modulation & Coding.
Sampling Theorems- Nyquist Theorem and Shannon-Hartley Theorem
EE 6332, Spring, 2017 Wireless Telecommunication
Topics discussed in this section:
Logarithms Log Review.
Chapter Three: Signals and Data Transmission
Presentation transcript:

Shannon’s Theorem

Shannon Hartley Theorem This is a measure of the capacity on a channel; it is impossible to transmit information at a faster rate without error. C = capacity (in bit/s) B = bandwidth of channel (Hz) S = signal power (in W) N = noise power (in W) It is more usual to use SNR (in dB) instead of power ratio. If (as with terrestrial and commercial communications systems) S/N >> 1, then rewriting in terms of log10.

More accurate approximation S/N >1 Write S/N as x and rewriting Shannon 𝐶=𝐵 𝑙𝑜𝑔 2 𝑥 1/𝑥+1 1/𝑥+1 or 𝐶=𝐵 𝑙𝑜𝑔 2 𝑥 +𝐵 𝑙𝑜𝑔 2 1/𝑥+1 Since 1 𝑥 <1 a Pade expression can be used ln 1+𝑦 =y(6+y)/(6+4y) where 𝑦<1 𝐶=𝐵 𝑙𝑜𝑔 2 𝑥 + 𝐵 ln 2 ln 1+ 1 𝑥 = 𝐵 𝑙𝑜𝑔 2 𝑥 + 𝐵 ln 2 ( 1 𝑥 )(6+1/x)/(6+4/x) Rearranging: 𝐶= 𝐵×10 𝑙𝑜𝑔 10 𝑥 10 𝑙𝑜𝑔 10 (2) + 𝐵 ln 2 6x+1 𝑥(6x+4) =B× SNR 3.01 + 𝐵 ln 2 6x+1 x(6x+4)

S/N<1 Using a similar approach: 𝐶=𝐵 𝑙𝑜𝑔 2 1+𝑥 = 𝐵 ln 2 𝑥(6+x)/(6+4x)

Overall effect

AWGN Strictly Shannon Hartley is for AWGN (Additive White Gaussian Noise) Linear addition of white noise with a constant spectral density (expressed as watts per hertz of bandwidth) and a Gaussian distribution of amplitude. Does not account for fading, frequency selectivity, interference, nonlinearity or dispersion.

Shannon and AWGN (energy/bit) * (bit/s) gives (energy/s), i.e. power For AWGN N=N0B Also S=EbC (Eb is energy/bit) So we can rewrite We often use C/B as a measure of how good the transmission is – bit/s/Hz – spectral efficiency

Usable region Note – minimum value of Eb/No is -1.6dB – this is the Shannon limit for communication to take place. The value for C/W does continue to climb slowly

Multi-level transmission 1 1111 11 10 01 00 0000 2 bits/cycle 4 bits/cycle 8 bits/cycle 1 1 0 0 1 0 0 Not necessarily done like this – but modulation aims to get the maximum no of bits/cycle

Error margin less with multilevel Noise changes level but does not cause error Same noise now can cause an error depending on the sampling