II. Modulation & Coding.

Slides:



Advertisements
Similar presentations
Iterative Equalization and Decoding
Advertisements

Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Logarithms Log Review. Logarithms For example Logarithms.
II. Modulation & Coding. © Tallal Elshabrawy Design Goals of Communication Systems 1.Maximize transmission bit rate 2.Minimize bit error probability 3.Minimize.
Coherent phase shift keying In coherent phase shift keying different phase modulation schemes will be covered i.e. binary PSK, quadrature phase shift keying.
Information Theory EE322 Al-Sanie.
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
TELIN Estimation and detection from coded signals Presented by Marc Moeneclaey, UGent - TELIN dept. Joint research : - UGent.
TELIN Estimation and detection from coded signals Presented by Marc Moeneclaey, UGent - TELIN dept. Joint research : - UGent.
Digital Data Transmission ECE 457 Spring Information Representation Communication systems convert information into a form suitable for transmission.
Multiple-input multiple-output (MIMO) communication systems
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 13.
1 Today, we are going to talk about: Shannon limit Comparison of different modulation schemes Trade-off between modulation and coding.
4.1 Why Modulate? 이번 발표자료는 연구배경 연구복적 제안시스템 시뮬레이션 향후 연구방향으로 구성되어 있습니다.
林茂昭 教授 台大電機系 個人專長 錯誤更正碼 數位通訊
Formatting and Baseband Modulation
Institute for Experimental Mathematics Ellernstrasse Essen - Germany DATA COMMUNICATION 2-dimensional transmission A.J. Han Vinck May 1, 2003.
1 INF244 Textbook: Lin and Costello Lectures (Tu+Th ) covering roughly Chapter 1;Chapters 9-19? Weekly exercises: For your convenience Mandatory.
EE 3220: Digital Communication Dr Hassan Yousif1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
Fundamentals of Digital Communication 2 Digital communication system Low Pass Filter SamplerQuantizer Channel Encoder Line Encoder Pulse Shaping Filters.
Channel Coding Part 1: Block Coding
I. Previously on IET.
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
3-2008UP-Copyrights reserved1 ITGD4103 Data Communications and Networks Lecture-11:Data encoding techniques week 12- q-2/ 2008 Dr. Anwar Mousa University.
Factors in Digital Modulation
Introduction of Low Density Parity Check Codes Mong-kai Ku.
Coding Theory. 2 Communication System Channel encoder Source encoder Modulator Demodulator Channel Voice Image Data CRC encoder Interleaver Deinterleaver.
Dept. of EE, NDHU 1 Chapter Four Bandpass Modulation and Demodulation.
ECE 4710: Lecture #31 1 System Performance  Chapter 7: Performance of Communication Systems Corrupted by Noise  Important Practical Considerations: 
1 Lecture 7 System Models Attributes of a man-made system. Concerns in the design of a distributed system Communication channels Entropy and mutual information.
Combined Linear & Constant Envelope Modulation
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 9.
Bandpass Modulation & Demodulation Detection
Turbo Codes. 2 A Need for Better Codes Designing a channel code is always a tradeoff between energy efficiency and bandwidth efficiency. Lower rate Codes.
Noise and Data Errors Nominal Observation for “1” Nominal Observation for “0” Probability density for “0” with Noise Probability density for “1” with Noise.
Source Encoder Channel Encoder Noisy channel Source Decoder Channel Decoder Figure 1.1. A communication system: source and channel coding.
EE354 : Communications System I
Coding No. 1  Seattle Pacific University Digital Coding Kevin Bolding Electrical Engineering Seattle Pacific University.
Performance of Digital Communications System
Digital Communications I: Modulation and Coding Course Spring Jeffrey N. Denenberg Lecture 3c: Signal Detection in AWGN.
Lecture 26,27,28: Digital communication Aliazam Abbasfar.
Information Theory & Coding for Digital Communications Prof JA Ritcey EE 417 Source; Anderson Digital Transmission Engineering 2005.
Block Coded Modulation Tareq Elhabbash, Yousef Yazji, Mahmoud Amassi.
UNIT I. Entropy and Uncertainty Entropy is the irreducible complexity below which a signal cannot be compressed. Entropy is the irreducible complexity.
Institute for Experimental Mathematics Ellernstrasse Essen - Germany DATA COMMUNICATION introduction A.J. Han Vinck May 10, 2003.
CHAPTER 4. OUTLINES 1. Digital Modulation Introduction Information capacity, Bits, Bit Rate, Baud, M- ary encoding ASK, FSK, PSK, QPSK, QAM 2. Digital.
© Tallal Elshabrawy Trellis Coded Modulation. © Tallal Elshabrawy Trellis Coded Modulation: Introduction Increases the constellation size compared to.
Modulation and Coding Trade Offs Ramesh Kumar Lama.
Báo cáo đồ án Thông Tin Số (CT386) Nhóm 2: 1.Cao Kim Loan Lâm Quốc Sự Bộ môn Điện Tử Viễn Thông GVHD : TS.Lương Vinh Quốc Danh.
Chapter 7 Performance of QAM
Shannon’s Theorem.
Principios de Comunicaciones EL4005
Space Time Codes.
Chapter 4: Second generation Systems-Digital Modulation
I. Previously on IET.
Advanced Wireless Networks
Advanced Wireless Networks
Modulation and Coding Schemes
Chapter 6.
Coding for Noncoherent M-ary Modulation
Coding and Interleaving
2018/9/16 Distributed Source Coding Using Syndromes (DISCUS): Design and Construction S.Sandeep Pradhan, Kannan Ramchandran IEEE Transactions on Information.
Trellis Coded Modulation
Chapter 6.
Digital Communication Chapter 1: Introduction
CT-474: Satellite Communications
EE 6332, Spring, 2017 Wireless Telecommunication
Logarithms Log Review.
Presentation transcript:

II. Modulation & Coding

Design Goals of Communication Systems Maximize transmission bit rate Minimize bit error probability Minimize required transmission power Minimize required system bandwidth Minimize system complexity, computational load & system cost Maximize system utilization

Some Tradeoffs in M-PSK Modulaion 2 1 m=4 m=3 m=1, 2 3 Trades off BER and Energy per Bit Trades off BER and Normalized Rate in b/s/Hz Trades off Normalized Rate in b/s/Hz and Energy per Bit

Shannon-Hartley Capacity Theorem System Capacity for communication over of an AWGN Channel is given by: C: System Capacity (bits/s) W: Bandwidth of Communication (Hz) S: Signal Power (Watt) N: Noise Power (Watt)

Shannon-Hartley Capacity Theorem Unattainable Region Practical Systems

Shannon Capacity in terms of Eb/N0 Consider transmission of a symbol over an AWGN channel

Shannon Limit Let

Shannon Limit Shannon Limit=-1.6 dB

Shannon Limit No matter how much/how smart you decrease the rate by using channel coding, it is impossible to achieve communications with very low bit error rate if Eb/N0 falls below -1.6 dB

Shannon Limit Room for improvement by channel coding 16 PSK Uncoded Pb=10-5 8 PSK Uncoded Pb=10-5 QPSK Uncoded Pb = 10-5 Normalized Channel Capacity b/s/Hz BPSK Uncoded Pb = 10-5 Shannon Limit=-1.6 dB Eb/N0 10

1/3 Repetition Code BPSK Is this really purely a gain? Coding Gain= 3.2 dB Is this really purely a gain? No! We have lost one third of the information transmitted rate

1/3 Repetition Code 8 PSK 1 2 3 4 5 6 7 8 9 10 -6 -5 -4 -3 -2 -1 E b /N P BPSK Uncoded 8 PSK 1/3 Repitition Code Coding Gain= -0.5 dB When we don’t sacrifice information rate 1/3 repetition codes did not help us

Hard Decision Decoding v = [v1 v2 … vi … vn] e = [e1 e2 … ei … en] r = [r1 r2 … ri … rn] x = [x1 x2 … xi … xn] y = [y1 y2 … yi … yn] Channel Encoder Waveform Generator Detection Channel Decoder Channel v r x y T +1 V. -1 V. vi vi=1 vi=0 xi yi>0 yi<0 ri=1 ri=0 ri + zi ]-∞, ∞[ yi The waveform generator converts binary data to voltage levels (1 V., -1 V.) The channel has an effect of altering the voltage that was transmitted Waveform detection performs a HARD DECISION by mapping received voltage back to binary values based on decision zones

Soft Decision Decoding v = [v1 v2 … vi … vn] e = [e1 e2 … ei … en] r = [r1 r2 … ri … rn] x = [x1 x2 … xi … xn] v x r Channel Encoder T +1 V. -1 V. vi vi=1 vi=0 xi Waveform Generator Channel Decoder Channel + zi ]-∞, ∞[ ri The waveform generator converts binary data to voltage levels (1 V., -1 V.) The channel has an effect of altering the voltage that was transmitted The input to the channel decoder is a vector of voltages rather than a vector of binary values

Hard Decision: Example 1/3 Repetition Code BPSK v = [v1 v2 … vi … vn] e = [e1 e2 … ei … en] r = [r1 r2 … ri … rn] x = [x1 x2 … xi … xn] y = [y1 y2 … yi … yn] y r Channel Encoder Waveform Generator Waveform Detection Channel Decoder Channel 0 0 0 -1 -1 -1 0.1 -0.9 0.1 1 0 1 1 Hard Decision Each received bit is detected individually If the voltage is greater than 0 detected bit is 1 If the voltage is smaller than 0 detected bit is 0 Detection information of neighbor bits within the same codeword is lost

Soft Decision: Example 1/3 Repetition Code BPSK v = [v1 v2 … vi … vn] e = [e1 e2 … ei … en] r = [r1 r2 … ri … rn] x = [x1 x2 … xi … xn] y = [y1 y2 … yi … yn] r Channel Encoder Waveform Generator Channel Decoder Channel 0.1 -0.9 0.1 0 0 0 -1 -1 -1 Accumulated Voltage = 0.1-0.9+0.1=-0.7<0 Soft Decision If the accumulated voltage within the codeword is greater than 0 detected bit is 1 If the accumulated voltage within the codeword is smaller than 0 detected bit is 0 Information of neighbor bits within the same codeword contributes to the channel decoding process

1/3 Repetition Code BPSK Soft Decision Channel Coding (1/3 Repetition Code) Waveform Representation Channel r Soft Decision Decoding Important Note

BER Performance Soft Decision 1/3 Repetition Code BPSK Select b*=0 if Note that r0 r1 and r2 are independent and identically distributed. In other words Therefore Similarly

BER Performance Soft Decision 1/3 Repetition Code BPSK Select b*=0 if

BER Performance Soft Decision 1/3 Repetition Code BPSK where n is Gaussian distributed with mean 0 and variance 3N0/2

Hard Vs Soft Decision: 1/3 Repetition Code BPSK Coding Gain= 4.7 dB

1/3 Repetition Code 8 PSK Hard Decision 1 2 3 4 5 6 7 8 9 10 -6 -5 -4 -3 -2 -1 E b /N P BPSK Uncoded 8PSK 1/3 Repetition Code Hard Decision 8PSK 1/3 Repetition Code Soft Decision Coding Gain= 1.5 dB 22

Shannon Limit and BER Performance 8 PSK Uncoded Pb=10-5 16 PSK Uncoded Pb=10-5 QPSK Uncoded Pb = 10-5 8PSK 1/3 Rep. Code Soft Decision Pb = 10-5 8PSK 1/3 Rep. Code Hard Decision Pb = 10-5 Normalized Channel Capacity b/s/Hz BPSK Uncoded Pb = 10-5 1/3 BPSK 1/3 Rep. Code Sodt Decision Pb = 10-5 BPSK 1/3 Rep. Code Hard Decision Pb = 10-5 Shannon Limit=-1.6 dB Eb/N0 23