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

Slides:



Advertisements
Similar presentations
McGraw-Hill©The McGraw-Hill Companies, Inc., 2003 Chapter 3 Data Transmission.
Advertisements

1 Chapter 3 Digital Communication Fundamentals for Cognitive Radio Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski,
Physical Layer: Signals, Capacity, and Coding
OFDM Transmission over Gaussian Channel
Wireless Communication
Communication System Overview
and M-ary Quadrature Amplitude Modulation (M-QAM)
Digital Communication
The Impact of Channel Estimation Errors on Space-Time Block Codes Presentation for Virginia Tech Symposium on Wireless Personal Communications M. C. Valenti.
Submission May, 2000 Doc: IEEE / 086 Steven Gray, Nokia Slide Brief Overview of Information Theory and Channel Coding Steven D. Gray 1.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Chapter 6 Information Theory
Digital Communications (디지털 통신)
Digital Data Transmission ECE 457 Spring Information Representation Communication systems convert information into a form suitable for transmission.
Digital Communications I: Modulation and Coding Course
Modern Digital and Analog Communication Systems Lathi Copyright © 2009 by Oxford University Press, Inc. C H A P T E R 11 PERFORMANCE ANALYSIS OF DIGITAL.
4.2 Digital Transmission Pulse Modulation (Part 2.1)
64-QAM Communications System Design and Characterization Project #1 EE283
1/21 Chapter 5 – Signal Encoding and Modulation Techniques.
Pulse Modulation 1. Introduction In Continuous Modulation C.M. a parameter in the sinusoidal signal is proportional to m(t) In Pulse Modulation P.M. a.
4.1 Why Modulate? 이번 발표자료는 연구배경 연구복적 제안시스템 시뮬레이션 향후 연구방향으로 구성되어 있습니다.
INFORMATION THEORY BYK.SWARAJA ASSOCIATE PROFESSOR MREC.
Formatting and Baseband Modulation
Coding No. 1  Seattle Pacific University Modulation Kevin Bolding Electrical Engineering Seattle Pacific University.
Wireless Communication Elec 534 Set IV October 23, 2007
Lecture 3-1: Coding and Error Control
Digital Communication I: Modulation and Coding Course
Physical Layer (2). Goal Physical layer design goal: send out bits as fast as possible with acceptable low error ratio Goal of this lecture – Review some.
Course Review for Final ECE460 Spring, Common Fourier Transform Pairs 2.
ECE 283 Digital Communication Systems Course Description –Digital modulation techniques. Coding theory. Transmission over bandwidth constrained channels.
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.
Wireless Communication Elec 534 Set I September 9, 2007 Behnaam Aazhang.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Performance of Digital Communications System
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Chapter 4: Baseband Pulse Transmission Digital Communication Systems 2012 R.Sokullu1/46 CHAPTER 4 BASEBAND PULSE TRANSMISSION.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
CHAPTER 5 SIGNAL SPACE ANALYSIS
CELLULAR COMMUNICATIONS MIDTERM REVIEW. Representing Oscillations   w is angular frequency    Need two variables to represent a state  Use a single.
EE 3220: Digital Communication
Digital Communications Chapeter 3. Baseband Demodulation/Detection Signal Processing Lab.
EE 3220: Digital Communication
ECE 4710: Lecture #31 1 System Performance  Chapter 7: Performance of Communication Systems Corrupted by Noise  Important Practical Considerations: 
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Physical layer continued. Limited Bandwidth Bandwidth is limited because of many reasons – The wire itself, if too long, is a capacitor and slows down.
CHAPTER 6 PASS-BAND DATA TRANSMISSION
Source Encoder Channel Encoder Noisy channel Source Decoder Channel Decoder Figure 1.1. A communication system: source and channel coding.
Performance of Digital Communications System
Digital Communications I: Modulation and Coding Course Spring Jeffrey N. Denenberg Lecture 3c: Signal Detection in AWGN.
Information Theory & Coding for Digital Communications Prof JA Ritcey EE 417 Source; Anderson Digital Transmission Engineering 2005.
Chapter 4: Information Theory. Learning Objectives LO 4.1 – Understand discrete and continuous messages, message sources, amount of information and its.
CHAPTER 4. OUTLINES 1. Digital Modulation Introduction Information capacity, Bits, Bit Rate, Baud, M- ary encoding ASK, FSK, PSK, QPSK, QAM 2. Digital.
Chapter 7 Performance of QAM
Chapter 4: Second generation Systems-Digital Modulation
Advanced Wireless Networks
Principios de Comunicaciones EL4005
Analog to digital conversion
64-QAM Communications System Design and Characterization
Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband.
Principios de Comunicaciones EL4005
Coding for Noncoherent M-ary 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.
Chapter 6.
Quadrature Amplitude Modulation (QAM) Transmitter
Sampling Theorems- Nyquist Theorem and Shannon-Hartley Theorem
EE 6332, Spring, 2017 Wireless Telecommunication
Analog to Digital Encoding
INTRODUCTION TO DIGITAL COMMUNICATION
Presentation transcript:

Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization (Chapter 6) (week 5) Channel Capacity (Chapter 7) (week 6) Error Correction Codes (Chapter 8) (week 7 and 8) Equalization (Bandwidth Constrained Channels) (Chapter 10) (week 9) Adaptive Equalization (Chapter 11) (week 10 and 11) Spread Spectrum (Chapter 13) (week 12) Fading and multi path (Chapter 14) (week 12)

Channel Capacity (Chapter 7) (week 6) Discrete Memoryless Channels Random Codes Block Codes Trellis Codes

Channel Models Discrete Memoryless Channel –Discrete-discrete Binary channel, M-ary channel –Discrete-continuous M-ary channel with soft-decision (analog) –Continuous-continuous Modulated waveform channels (QAM)

Discrete Memoryless Channel Discrete-discrete –Binary channel, M-ary channel Probability transition matrix

Discrete Memoryless Channel Discrete-continuous –M-ary channel with soft-decision (analog) output x 0 x 1 x 2. x q-1 y AWGN

Discrete Memoryless Channel Continuous-continuous –Modulated waveform channels (QAM) –Assume Band limited waveforms, bandwidth = W Sampling at Nyquist = 2W sample/s –Then over interval of N = 2WT samples use an orthogonal function expansion:

Discrete Memoryless Channel Continuous-continuous –Using orthogonal function expansion:

Discrete Memoryless Channel Continuous-continuous –Using orthogonal function expansion get an equivalent discrete time channel: Gaussian noise

Capacity of binary symmetric channel BSC

Capacity of binary symmetric channel Average Mutual Information

Capacity of binary symmetric channel Channel Capacity is Maximum Information – earlier showed:

Capacity of binary symmetric channel Channel Capacity –When p=1 bits are inverted but information is perfect if invert them back!

Capacity of binary symmetric channel Effect of SNR on Capacity –Binary PAM signal (digital signal amplitude 2A) AGWN

Capacity of binary symmetric channel Effect of SNR –Binary PAM signal (digital signal amplitude 2A)

Capacity of binary symmetric channel Effect of SNR –Binary PAM signal (digital signal amplitude 2A)

Capacity of binary symmetric channel Effect of SNR –Binary PAM signal (digital signal amplitude 2A) Not sure about this Does it depend on bandwidth?

Capacity of binary symmetric channel Effect of SNR –Binary PAM signal (digital signal amplitude 2A)

Capacity of binary symmetric channel Effect of SNR –Binary PAM signal (digital signal amplitude 2A)

Capacity of binary symmetric channel Effect of SNR –Binary PAM signal (digital signal amplitude 2A) At capacity SNR = 7, so waste lots of SNR to get low BER!!!

Capacity of binary symmetric channel Effect of SNR b –Binary PAM signal (digital signal amplitude 2A)

Channel Capacity of Discrete Memoryless Channel Discrete-discrete –Binary channel, M-ary channel Probability transition matrix

Channel Capacity of Discrete Memoryless Channel Average Mutual Information

Channel Capacity of Discrete Memoryless Channel Channel Capacity is Maximum Information Occurs for only if Otherwise must work out max

Channel Capacity Discrete Memoryless Channel Discrete-continuous Channel Capacity x 0 x 1 x 2. x q-1 y

Channel Capacity Discrete Memoryless Channel Discrete-continuous Channel Capacity with AWGN x 0 x 1 x 2. x q-1 y

Channel Capacity Discrete Memoryless Channel Binary Symmetric PAM-continuous Maximum Information when: x 0 x 1 x 2. x q-1 y

Channel Capacity Discrete Memoryless Channel Binary Symmetric PAM-continuous Maximum Information when:

Channel Capacity Discrete Memoryless Channel Binary Symmetric PAM-continuous Versus Binary Symmetric discrete

Discrete Memoryless Channel Continuous-continuous –Modulated waveform channels (QAM) –Assume Band limited waveforms, bandwidth = W Sampling at Nyquist = 2W sample/s –Then over interval of N = 2WT samples use an orthogonal function expansion:

Discrete Memoryless Channel Continuous-continuous –Using orthogonal function expansion get an equivalent discrete time channel: Gaussian noise

Discrete Memoryless Channel Continuous-continuous Capacity is (Shannon)

Discrete Memoryless Channel Continuous-continuous Maximum Information when: Statistically independent zero mean Gaussian inputs then

Discrete Memoryless Channel Continuous-continuous Constrain average power in x(t):

Discrete Memoryless Channel Continuous-continuous Thus Capacity is:

Discrete Memoryless Channel Continuous-continuous Thus Normalized Capacity is: