E303: Communication Systems
|
|
- Damian Lewis
- 5 years ago
- Views:
Transcription
1 E303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London Principles of PCM Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17 1 / 49
2 Table of Contents 1 Introduction 2 PCM: Bandwidth & Bandwidth Expansion Factor 3 The Quantization Process (output point-a2) Uniform Quantizers Comments on Uniform Quantiser Non-Uniform Quantizers max(snr) Non-Uniform Quantisers Companders (non-uniform Quantizers) Compression Rules (A and mu) The 6dB Law Differential Quantizers 4 Noise Effects in a Binary PCM Threshold Effects in a Binary PCM Comments on Threshold Effects 5 CCITT Standards: Differential PCM (DPCM) 6 Core and Access Networks Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17 2 / 49
3 Introduction Introduction Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17 3 / 49
4 Introduction PCM = sampled quantized values of an analogue signal are transmitted via a sequence of codewords. i.e. after sampling & quantization, a Source Encoder is used to map the quantized levels (i.e. o/p of quantizer) to codewords of γ bits i.e. quantized level codeword of γ bits and, then a digital modulator is used to transmit the bits, i.e. PCM system There are three popular PCM source encoders (or, in other words, Quantization-levels Encoders). Binary Coded Decimal (BCD) source encoder Folded BCD source encoder Gray Code (GC) source encoder Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17 4 / 49
5 Introduction g(input) g q (output) g q : occurs at a rate F s (N.B: F s 2 F g ) Q = quantizer levels; γ = log 2 (Q) bits level samples sec Note: codeword rate (point B) γ bit codewords sec = quant. levels rate levels sec = sampling rate samples sec = F s = 2F g (1) Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17 5 / 49
6 Introduction bit rate: r b = bits sec γ bits level F s levels sec e.g. for Q = 16 levels then r b = γ=4 γ=4 {}}{{}}{ (e.g. transmitted sequ. = }{{} ) γ=4 4 γ F s versions of PCM: Differential PCM (DPCM) PCM with differential Quant. Delta Modulation (DM): PCM with diff. quants having 2 levels i.e. + or are encoded using a single binary digit Note: DM DPCM Others Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17 6 / 49
7 PCM: Bandwidth & Bandwidth Expansion Factor PCM: Bandwidth & Bandwidth Expansion Factor we transmit several digits for each quantizer s o/p level B PCM > F g { BPCM denotes the channel bandwidth where represents the message bandwidth F g PCM Bandwidth baseband bandwidth: bandpass bandwidth: B PCM B PCM channel symbol rate 2 Hz (2) channel symbol rate 2 2 Hz (3) Note that, by default, the Lower bound of the baseband bandwidth is assumed and used in this course Bandwidth expansion factor β : β channel bandwidth message bandwidth Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17 7 / 49 (4)
8 PCM: Bandwidth & Bandwidth Expansion Factor Example - Binary PCM Bandwidth: B PCM = channel symbol rate 2 = bit rate 2 = γf s 2 = γ log 2 Q F g Hz B PCM = γf g (5) Bandwidth Expansion Factor: B PCM = γf g B PCM F g = γ β = γ (6) Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17 8 / 49
9 The Quantization Process (output point-a2) at point A2 : a signal discrete in amplitude and discrete in time. The blocks up to the point A2, combined, can be considered as a discrete information source where a discrete message at its output is a level selected from the output levels of the quantizer. Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17 9 / 49
10 analogue samples finite set of levels where the symbol denotes a map In our case this mapping is called quantizing i.e. Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
11 quantizer parameters: Q : number of levels b i : input levels of the quantizer, with i = 0, 1,..., Q (b 0 = lowest level): known as quantizer s end-points m i : outputs levels of the quantizer (sampled values after quantization) with i = 1,..., Q; known as output-levels rule: connects the input of the quantizer to m i RULE: the sampled values g(kt s ) of an analogue signal g(t) are converted to one of Q allowable output-levels m 1, m 2,..., m Q according to the rule: g(kt s ) m i (or equivalently g q (kt s ) = m i ) iff b i 1 g(kt s ) b i with b 0 =, b Q = + Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
12 quantization noise at each sample instance: n q (kt s ) = g q (kt s ) g s (kt s ) (7) If the power of the quantization noise is small, i.e. P nq = E { nq(kt 2 s ) } = small, then the quantized signal (i.e. signal at the output of the quantizer) is a good approximation of the original signal. quality of approximation may be improved by the careful choice of b i s and m i s and such as a measure of performance is optimized. e.g. measure of performance: Signal to quantization Noise power Ratio (SNR q ) signal power SNR q = quant. noise power = P g P nq Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
13 Types of quantization: Transfer Function: uniform quantizer uniform non-uniform { differential = uniform, or non-uniform plus a differential circuit non-uniform quantizer for signals with CF = small for signals with CF = large Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
14 The following figure illustrates the main characteristics of different types of quantizers Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
15 Uniform Quantizers Uniform Quantizers Uniform quantizers are appropriate for uncorrelated samples let us change our notation: g q (kt s ) to g q and g(kt s ) to g the range of the continuous random variable g is divided into Q intervals of equal length (value of g) (midpoint of the quantizing interval in which the value of g falls) or equivalently m i = b i 1 + b i 2 for i = 1, 2,..., Q (8) Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
16 Uniform Quantizers step size : rule: = b Q b 0 Q { bi = b 0 + i rule: g q = m i iff b i 1 < g b i where m i = b i 1+b i 2 for i = 1, 2,..., Q (9) (10) Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
17 Comments on Uniform Quantiser Comments on Uniform Quantiser Since, in general, Q = large P gq P g E { g 2} Furthermore, large Q implies that Fidelity of Quantizer = g q q Q = 8 16 are just suffi cient for good intelligibility of speech; (but quantizing noise can be easily heard at the background) voice telephony: minimum 128 levels; (i.e. SNR q 42dB) N.B.: 128 levels 7-bits to represent each level transmission bandwidth = Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
18 Comments on Uniform Quantiser { Quantizer = UNIFORM if pdf of the input signal = UNIFORM then SNR q = Q 2 = 2 2γ (11) Quantisation Noise Power P nq : rms value of Quant. Noise: Quantization Noise Power: P nq = 2 12 rms value of Quant. Noise = fixed = (12) 12 = f {g} (13) if g(t) = small for extended period of time SNR q < the design value this phenomenon is obvious if the signal waveform has a large CREST FACTOR (14) Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
19 Comments on Uniform Quantiser SNRq as a function of the Crest Factor Remember: CREST FACTOR peak rms (15) By using variable spacing }{{} small spacing near 0 and large spacing at the extremes CREST FACTOR effects = = this leads to NON-UNIFORM QUANTIZERS Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
20 Non-Uniform Quantizers Non-Uniform Quantizers Non-Uniform quantizers are (like unif. quants) appropriate for uncorrelated samples step size = variable = i if pdf i/p = uniform then non-uniform quants yield higher SNR q than uniform quants rms value of n q is not constant but depends on the sampled value g(kt s ) of g(t) Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
21 Non-Uniform Quantizers rule: g q = m i iff b i 1 < g b i where b 0 =, b Q = + i = b i b i 1 = variable example: Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
22 max(snr) Non-Uniform Quantisers max(snr) Non-Uniform Quantisers b i, m i are chosen to maximize SNR q as follows: since Q = large P gq P g E { g 2} SNR q = max if P nq = min where Q bi P nq = (g m i ) 2 pdf g dg (16) i =1 b i 1 Therefore: min P nq m i,b i (17) dp nq db (17) j = 0 dp nq dm j = 0 (18) { (bj m j ) 2 pdf g (b j ) (b j m j+1 ) 2 pdf g (b j ) = 0 for j = 1, 2,..., Q 2 b j b j 1 (g m j ) pdf g (g) dg = 0 for j = 1, 2,..., Q (19) Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
23 max(snr) Non-Uniform Quantisers Note: the above set of equations (i.e. (19)) cannot be solved in closed form for a general pdf. Therefore for a specific pdf an appropriate method is given below in a step-form: METHOD: 1. choose a m 1 2. calculate b i s, m i s 3. check if m Q is the mean of the interval [b Q 1, b Q = ] if yes STOP else choose a new m 1 and then goto step-2 Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
24 max(snr) Non-Uniform Quantisers A SPECIAL CASE max(snr) Non-Uniform Quantizer of a Gaussian Input Signal if the input signal has a Gaussian amplitude pdf, that is pdf q = N(0, σ g ) then it can be proved that: P nq = 2.2σ 2 g Q 1.96 not easy to derive (12) In this case the Signal-to-quantization Noise Ratio becomes: SNR q = P gq P nq = σ 2 g 2.2σ 2 g Q 1.96 = 0.45Q 1.96 (13) Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
25 Companders (non-uniform Quantizers) Companders (non-uniform Quantizers) Their performance independent of CF Non-unif. Quant = SAMPLE COMPRESSION Compressor + Expander Compander g f g c i.e. g c =f{g} + : means such that" UNIFORM QUANTIZER + SAMPLE EXPANDER pdf gc = uniform f 1 g c Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
26 Companders (non-uniform Quantizers) Popular companders: use log compression Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
27 Companders (non-uniform Quantizers) Two compression rules (A-law and µ-law) which are used in PSTN and provide a SNR q independent of signal statistics are given below: µ-law (USA) A-law (Europe) In practice { A 87.6 µ 100 Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
28 Companders (non-uniform Quantizers) Compression-Rules (PCM systems) The µ and A laws µ-law g c = ln(1+µ g gmax ) g ln(1+µ) max g c = A-law g A gmax 1+ln(A) g max 0 g g max < 1 A g 1+ln(A gmax ) 1 g 1+ln(A) max A g g max < 1 where g c = compressor s output signal (i.e. input to uniform quantiser) g = compressor s input signal g max = maximum value of the signal g Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
29 Companders (non-uniform Quantizers) The 6dB LAW uniform quantizer: µ-law: A-law: SNR q = γ 20 log(cf) db (20) remember CF = peak rms SNR q = γ 20 log(ln(1 + µ)) db (21) SNR q = γ 20 log(1 + ln A) db (22) Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
30 Companders (non-uniform Quantizers) REMEMBER the following figure (illustrates the main characteristics of different types of quantizers) Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
31 Companders (non-uniform Quantizers) COMMENTS uniform & non-uniform quantizers: use them when samples are uncorrelated with each other (i.e. the sequence is quantized independently of the values of the preceding samples) practical situation: the sequence {g(kt s )} consists of samples which are correlated with each other. In such a case use differential quantizer. Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
32 Companders (non-uniform Quantizers) Examples PSTN F s = 8kHz, Q = 2 8 (A = 87.6 or µ = 100), γ = 8 bits/level i.e. bit rate: r b = F s γ = 8k 8 = 64 kbits/sec Mobile-GSM F s = 8kHz, Q = 2 13 uniform γ = 13 bits/level, i.e. bit rate: r b = F s γ = 8k 13 = 104 kbits/sec which, with a differential circuit, is reduced to r b = 13 kbits/sec Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
33 Differential Quantizers Differential Quantizers Differential quantizers are appropriate for correlated samples namely they take into account the sample to sample correlation in the quantizing process; e.g. Transmitter (Tx) Receiver (Rx) input current message symbol The weights w are estimated based on autocorr. function of the input The Tx & Rx predictors should be identical. Therefore, the Tx transmits also its weights to the Rx (i.e. weights w are transmitted together with the data) Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
34 Differential Quantizers In practice, the variable being quantized is not g(kt s ) but the variable d(kt s ) i.e. where d(kt s ) = g(kt s ) ĝ(kt s ) (14) Because d(kt s ) has small variations, to achieve a certain level of performance, fewer bits are required. This implies that DPCM can achieve PCM performance levels with lower bit rates. 6dB law: SNR q = γ a in db (15) where 10dB < a < 7.77dB Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
35 Differential Quantizers A Better Differential Quantiser: mse Diff. Quant. the largest error reduction occurs when the differential quantizer operates on the differences between g(kt s ) and the minimum mean square error (min-mse) estimator ĝ(kt s ) of g(kt s ) - (N.B.: but more hardware) Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
36 Differential Quantizers ĝ(kt s ) = w T g where { g = [ g((k 1)T s ), g((k 2)T s ),..., g((k L)T s )] T w = [w 1, w 2,..., w L ] T rule: { choose w to minimize E { (g(kts ) ĝ(kt s )) 2}... for the Transmitter choose w to minimize E { (d q (kt s ) + ĝ(kt s )) 2}... for the Receiver Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
37 Differential Quantizers Differential Quantisers: Examples The power of d(kt s ) can be found as follows: σ 2 d = E { d 2} = E { g 2 (kt s ) } + E { g 2 ((k 1)T s ) } 2E {g(kt s )g((k 1)T s )} }{{}}{{}}{{} =σ 2 g =σ 2 g 2 R gg (T s ) σ 2 d = 2 σ 2 g 2 R gg (T s ) = 2 σ 2 g (1 R gg (T s ) ) (23) σ 2 g Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
38 Differential Quantizers e.g. disadvantages : unrecoverable degradation is introduced by the quantization process. (Designer s task is to keep this to a subjective acceptable level) Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
39 Differential Quantizers Remember 1 σ 2 g = R gg (0) 2 R gg (τ) σ 2 g = is known as the normalized autocorrelation function 3 DPCM with the same No of bits/sample generally gives better results than PCM with the same number of bits. Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
40 Differential Quantizers Example of mse DPCM assume a 4-level quantizer: I/P O/P +5 input input input input 5 7 Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
41 Differential Quantizers Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
42 Differential Quantizers From the last 2 figures we can see that small variation to the i/p signal (25V 26V) large variations to o/p waveforms Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
43 Noise Effects in a Binary PCM Noise Effects in a Binary PCM It can be proved that the Signal-to-Noise Ratio at the output of a binary Pulse Code Modulation (PCM) system, which employs a BCD encoder/decoder and operates in the presence of noise, is given by the following expression SNR out = E { g 0 (t) 2} E {n 0 (t) 2 } + E {n q0 (t) 2 } = 2 2γ p e 2 2γ (24) where p e = f(type of digital modulator) { } p e = T (1 ρ) EUE e.g. if the digital modulator is a PSK-mod. then { } p e = T 2 EUE Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
44 Noise Effects in a Binary PCM Threshold Effects in a Binary PCM Threshold Effects in a Binary PCM We have seen that: SNR out = 2 2γ 1+4 p e 2 2γ Let us examine the following two cases: SNR in = high and SNR in = low i) SNR in = HIGH ii) SNR in = LOW SNR in = high p e = small SNR in = low p e = large p e 2 2γ 1 SNR out = 2 2γ p e 2 2γ 4 p e 2 2γ SNR out 6γ db SNR out 1 4 p e Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
45 Noise Effects in a Binary PCM Threshold Effects in a Binary PCM Threshold Point - Definition Threshold point is arbitrarily defined as the SNR in at which the SNR out, i.e. 2 SNR out = 2γ p e 2 2γ falls 1dB below the maximum SNR out (i.e. 1dB below the value 2 2γ ). By using the above definition it can be shown (... for you... ) that the threshold point occurs when p e = γ where γ is the number of bits per level. Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
46 Noise Effects in a Binary PCM Comments on Threshold Effects The onset of threshold in PCM will result in a sudden in the output noise power. P signal = SNR in = SNR out reaches 6γ db and becomes independent of P signal above threshold: increasing signal power no further improvement in SNR out The limiting value of SNR out depends only on the number of bits γ per quantization levels Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49 Threshold Effects Comments
47 CCITT Standards: Differential PCM (DPCM) CCITT Standards: Differential PCM (DPCM) DPCM = PCM which employs a differential quantizer i.e. DPCM reduces the correlation that often exists between successive PCM samples The CCITT standards 32 kbits DPCM The CCITT standards 64 kbits sec sec speech signal - F g = 3.2kHz audio signal - F g = 7kHz F s = 8 ksamples sec Q = 16 levels (i.e. γ = 4 bits ) level F s = 16 ksamples sec bits Q = 16 levels (i.e. γ = 4 level ) DPCM Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
48 CCITT Standards: Differential PCM (DPCM) Problems of DPCM: 1 slope overload noise: occurs when outer quantization level is too small for large input transitions and has to be used repeatedly 2 Oscillation or granular noise: occurs when the smallest Q-level is not zero. Then, for constant input, the coder output oscillates with amplitude equal to the smallest Q-level. 3 Edge Busyness noise: occurs when repetitive edge waveform is contaminated by noise which causes it to be coded by different sequences of Q-levels. Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
49 Core and Access Networks Core and Access Networks Prof. A. Manikas (Imperial College) E303: Principles of PCM v / 49
Pulse-Code Modulation (PCM) :
PCM & DPCM & DM 1 Pulse-Code Modulation (PCM) : In PCM each sample of the signal is quantized to one of the amplitude levels, where B is the number of bits used to represent each sample. The rate from
More informationEE303: Communication Systems
EE303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London Introductory Concepts Prof. A. Manikas (Imperial College) EE303: Introductory Concepts
More informationPCM Reference Chapter 12.1, Communication Systems, Carlson. PCM.1
PCM Reference Chapter 1.1, Communication Systems, Carlson. PCM.1 Pulse-code modulation (PCM) Pulse modulations use discrete time samples of analog signals the transmission is composed of analog information
More informationCommunication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi
Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 41 Pulse Code Modulation (PCM) So, if you remember we have been talking
More informationInformation Sources. Professor A. Manikas. Imperial College London. EE303 - Communication Systems An Overview of Fundamentals
Information Sources Professor A. Manikas Imperial College London EE303 - Communication Systems An Overview of Fundamentals Prof. A. Manikas (Imperial College) EE303: Information Sources 24 Oct. 2011 1
More informationModule 3. Quantization and Coding. Version 2, ECE IIT, Kharagpur
Module Quantization and Coding ersion, ECE IIT, Kharagpur Lesson Logarithmic Pulse Code Modulation (Log PCM) and Companding ersion, ECE IIT, Kharagpur After reading this lesson, you will learn about: Reason
More informationEE401: Advanced Communication Theory
EE401: Advanced Communication Theory Professor A. Manikas Chair of Communications and Array Processing Imperial College London Introductory Concepts Prof. A. Manikas (Imperial College) EE.401: Introductory
More informationFinite Word Length Effects and Quantisation Noise. Professors A G Constantinides & L R Arnaut
Finite Word Length Effects and Quantisation Noise 1 Finite Word Length Effects Finite register lengths and A/D converters cause errors at different levels: (i) input: Input quantisation (ii) system: Coefficient
More informationAudio Coding. Fundamentals Quantization Waveform Coding Subband Coding P NCTU/CSIE DSPLAB C.M..LIU
Audio Coding P.1 Fundamentals Quantization Waveform Coding Subband Coding 1. Fundamentals P.2 Introduction Data Redundancy Coding Redundancy Spatial/Temporal Redundancy Perceptual Redundancy Compression
More informationMultimedia Communications. Differential Coding
Multimedia Communications Differential Coding Differential Coding In many sources, the source output does not change a great deal from one sample to the next. This means that both the dynamic range and
More informationCompression methods: the 1 st generation
Compression methods: the 1 st generation 1998-2017 Josef Pelikán CGG MFF UK Praha pepca@cgg.mff.cuni.cz http://cgg.mff.cuni.cz/~pepca/ Still1g 2017 Josef Pelikán, http://cgg.mff.cuni.cz/~pepca 1 / 32 Basic
More informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #3 Wednesday, September 10, 2003 1.4 Quantization Digital systems can only represent sample amplitudes with a finite set of prescribed values,
More informationChapter 10 Applications in Communications
Chapter 10 Applications in Communications School of Information Science and Engineering, SDU. 1/ 47 Introduction Some methods for digitizing analog waveforms: Pulse-code modulation (PCM) Differential PCM
More informationPrinciples of Communications
Principles of Communications Weiyao Lin, PhD Shanghai Jiao Tong University Chapter 4: Analog-to-Digital Conversion Textbook: 7.1 7.4 2010/2011 Meixia Tao @ SJTU 1 Outline Analog signal Sampling Quantization
More informationMultimedia Communications. Scalar Quantization
Multimedia Communications Scalar Quantization Scalar Quantization In many lossy compression applications we want to represent source outputs using a small number of code words. Process of representing
More informationScalar and Vector Quantization. National Chiao Tung University Chun-Jen Tsai 11/06/2014
Scalar and Vector Quantization National Chiao Tung University Chun-Jen Tsai 11/06/014 Basic Concept of Quantization Quantization is the process of representing a large, possibly infinite, set of values
More informationVID3: Sampling and Quantization
Video Transmission VID3: Sampling and Quantization By Prof. Gregory D. Durgin copyright 2009 all rights reserved Claude E. Shannon (1916-2001) Mathematician and Electrical Engineer Worked for Bell Labs
More informationC.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University
Quantization C.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University http://www.csie.nctu.edu.tw/~cmliu/courses/compression/ Office: EC538 (03)5731877 cmliu@cs.nctu.edu.tw
More informationDigital Image Processing Lectures 25 & 26
Lectures 25 & 26, Professor Department of Electrical and Computer Engineering Colorado State University Spring 2015 Area 4: Image Encoding and Compression Goal: To exploit the redundancies in the image
More informationExample: for source
Nonuniform scalar quantizer References: Sayood Chap. 9, Gersho and Gray, Chap.'s 5 and 6. The basic idea: For a nonuniform source density, put smaller cells and levels where the density is larger, thereby
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Lesson 7 Delta Modulation and DPCM Instructional Objectives At the end of this lesson, the students should be able to: 1. Describe a lossy predictive coding scheme.
More informationClass of waveform coders can be represented in this manner
Digital Speech Processing Lecture 15 Speech Coding Methods Based on Speech Waveform Representations ti and Speech Models Uniform and Non- Uniform Coding Methods 1 Analog-to-Digital Conversion (Sampling
More informationEE 121: Introduction to Digital Communication Systems. 1. Consider the following discrete-time communication system. There are two equallly likely
EE 11: Introduction to Digital Communication Systems Midterm Solutions 1. Consider the following discrete-time communication system. There are two equallly likely messages to be transmitted, and they are
More informationE303: Communication Systems
E303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London An Overview of Fundamentals: PN-codes/signals & Spread Spectrum (Part B) Prof. A. Manikas
More informationDigital Band-pass Modulation PROF. MICHAEL TSAI 2011/11/10
Digital Band-pass Modulation PROF. MICHAEL TSAI 211/11/1 Band-pass Signal Representation a t g t General form: 2πf c t + φ t g t = a t cos 2πf c t + φ t Envelope Phase Envelope is always non-negative,
More informationDigital Signal Processing 2/ Advanced Digital Signal Processing Lecture 3, SNR, non-linear Quantisation Gerald Schuller, TU Ilmenau
Digital Signal Processing 2/ Advanced Digital Signal Processing Lecture 3, SNR, non-linear Quantisation Gerald Schuller, TU Ilmenau What is our SNR if we have a sinusoidal signal? What is its pdf? Basically
More informationCODING SAMPLE DIFFERENCES ATTEMPT 1: NAIVE DIFFERENTIAL CODING
5 0 DPCM (Differential Pulse Code Modulation) Making scalar quantization work for a correlated source -- a sequential approach. Consider quantizing a slowly varying source (AR, Gauss, ρ =.95, σ 2 = 3.2).
More informationEE4512 Analog and Digital Communications Chapter 4. Chapter 4 Receiver Design
Chapter 4 Receiver Design Chapter 4 Receiver Design Probability of Bit Error Pages 124-149 149 Probability of Bit Error The low pass filtered and sampled PAM signal results in an expression for the probability
More informationMobile Communications (KECE425) Lecture Note Prof. Young-Chai Ko
Mobile Communications (KECE425) Lecture Note 20 5-19-2014 Prof Young-Chai Ko Summary Complexity issues of diversity systems ADC and Nyquist sampling theorem Transmit diversity Channel is known at the transmitter
More information7.1 Sampling and Reconstruction
Haberlesme Sistemlerine Giris (ELE 361) 6 Agustos 2017 TOBB Ekonomi ve Teknoloji Universitesi, Guz 2017-18 Dr. A. Melda Yuksel Turgut & Tolga Girici Lecture Notes Chapter 7 Analog to Digital Conversion
More informationObjectives of Image Coding
Objectives of Image Coding Representation of an image with acceptable quality, using as small a number of bits as possible Applications: Reduction of channel bandwidth for image transmission Reduction
More informationencoding without prediction) (Server) Quantization: Initial Data 0, 1, 2, Quantized Data 0, 1, 2, 3, 4, 8, 16, 32, 64, 128, 256
General Models for Compression / Decompression -they apply to symbols data, text, and to image but not video 1. Simplest model (Lossless ( encoding without prediction) (server) Signal Encode Transmit (client)
More informationCS578- Speech Signal Processing
CS578- Speech Signal Processing Lecture 7: Speech Coding Yannis Stylianou University of Crete, Computer Science Dept., Multimedia Informatics Lab yannis@csd.uoc.gr Univ. of Crete Outline 1 Introduction
More informationLloyd-Max Quantization of Correlated Processes: How to Obtain Gains by Receiver-Sided Time-Variant Codebooks
Lloyd-Max Quantization of Correlated Processes: How to Obtain Gains by Receiver-Sided Time-Variant Codebooks Sai Han and Tim Fingscheidt Institute for Communications Technology, Technische Universität
More informationGaussian source Assumptions d = (x-y) 2, given D, find lower bound of I(X;Y)
Gaussian source Assumptions d = (x-y) 2, given D, find lower bound of I(X;Y) E{(X-Y) 2 } D
More informationBasic information theory
Basic information theory Communication system performance is limited by Available signal power Background noise Bandwidth limits. Can we postulate an ideal system based on physical principles, against
More informationEE 5345 Biomedical Instrumentation Lecture 12: slides
EE 5345 Biomedical Instrumentation Lecture 1: slides 4-6 Carlos E. Davila, Electrical Engineering Dept. Southern Methodist University slides can be viewed at: http:// www.seas.smu.edu/~cd/ee5345.html EE
More informationBASICS OF COMPRESSION THEORY
BASICS OF COMPRESSION THEORY Why Compression? Task: storage and transport of multimedia information. E.g.: non-interlaced HDTV: 0x0x0x = Mb/s!! Solutions: Develop technologies for higher bandwidth Find
More information1. Probability density function for speech samples. Gamma. Laplacian. 2. Coding paradigms. =(2X max /2 B ) for a B-bit quantizer Δ Δ Δ Δ Δ
Digital Speech Processing Lecture 16 Speech Coding Methods Based on Speech Waveform Representations and Speech Models Adaptive and Differential Coding 1 Speech Waveform Coding-Summary of Part 1 1. Probability
More informationTime-domain representations
Time-domain representations Speech Processing Tom Bäckström Aalto University Fall 2016 Basics of Signal Processing in the Time-domain Time-domain signals Before we can describe speech signals or modelling
More informationETSF15 Analog/Digital. Stefan Höst
ETSF15 Analog/Digital Stefan Höst Physical layer Analog vs digital Sampling, quantisation, reconstruction Modulation Represent digital data in a continuous world Disturbances Noise and distortion Synchronization
More informationMultimedia Systems Giorgio Leonardi A.A Lecture 4 -> 6 : Quantization
Multimedia Systems Giorgio Leonardi A.A.2014-2015 Lecture 4 -> 6 : Quantization Overview Course page (D.I.R.): https://disit.dir.unipmn.it/course/view.php?id=639 Consulting: Office hours by appointment:
More informationImage Compression using DPCM with LMS Algorithm
Image Compression using DPCM with LMS Algorithm Reenu Sharma, Abhay Khedkar SRCEM, Banmore -----------------------------------------------------------------****---------------------------------------------------------------
More informationPhysical Layer and Coding
Physical Layer and Coding Muriel Médard Professor EECS Overview A variety of physical media: copper, free space, optical fiber Unified way of addressing signals at the input and the output of these media:
More informationEE5713 : Advanced Digital Communications
EE5713 : Advanced Digital Communications Week 12, 13: Inter Symbol Interference (ISI) Nyquist Criteria for ISI Pulse Shaping and Raised-Cosine Filter Eye Pattern Equalization (On Board) 20-May-15 Muhammad
More informationImage and Multidimensional Signal Processing
Image and Multidimensional Signal Processing Professor William Hoff Dept of Electrical Engineering &Computer Science http://inside.mines.edu/~whoff/ Image Compression 2 Image Compression Goal: Reduce amount
More informationSPEECH ANALYSIS AND SYNTHESIS
16 Chapter 2 SPEECH ANALYSIS AND SYNTHESIS 2.1 INTRODUCTION: Speech signal analysis is used to characterize the spectral information of an input speech signal. Speech signal analysis [52-53] techniques
More informationLecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments
Lecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments Dr. Jian Zhang Conjoint Associate Professor NICTA & CSE UNSW COMP9519 Multimedia Systems S2 2006 jzhang@cse.unsw.edu.au
More informationPrinciples of Communications
Principles of Communications Weiyao Lin Shanghai Jiao Tong University Chapter 10: Information Theory Textbook: Chapter 12 Communication Systems Engineering: Ch 6.1, Ch 9.1~ 9. 92 2009/2010 Meixia Tao @
More informationQuantization 2.1 QUANTIZATION AND THE SOURCE ENCODER
2 Quantization After the introduction to image and video compression presented in Chapter 1, we now address several fundamental aspects of image and video compression in the remaining chapters of Section
More informationRandom Signal Transformations and Quantization
York University Department of Electrical Engineering and Computer Science EECS 4214 Lab #3 Random Signal Transformations and Quantization 1 Purpose In this lab, you will be introduced to transformations
More informationLecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments. Tutorial 1. Acknowledgement and References for lectures 1 to 5
Lecture : Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments Dr. Jian Zhang Conjoint Associate Professor NICTA & CSE UNSW COMP959 Multimedia Systems S 006 jzhang@cse.unsw.edu.au Acknowledgement
More informationReview of Quantization. Quantization. Bring in Probability Distribution. L-level Quantization. Uniform partition
Review of Quantization UMCP ENEE631 Slides (created by M.Wu 004) Quantization UMCP ENEE631 Slides (created by M.Wu 001/004) L-level Quantization Minimize errors for this lossy process What L values to
More informationDigital Communications: An Overview of Fundamentals
IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING. COMPACT LECTURE NOTES on COMMUNICATION THEORY. Prof Athanassios Manikas, Spring 2001 Digital Communications:
More informationBasic Principles of Video Coding
Basic Principles of Video Coding Introduction Categories of Video Coding Schemes Information Theory Overview of Video Coding Techniques Predictive coding Transform coding Quantization Entropy coding Motion
More information3F1: Signals and Systems INFORMATION THEORY Examples Paper Solutions
Engineering Tripos Part IIA THIRD YEAR 3F: Signals and Systems INFORMATION THEORY Examples Paper Solutions. Let the joint probability mass function of two binary random variables X and Y be given in the
More informationLATTICE VECTOR QUANTIZATION FOR IMAGE CODING USING EXPANSION OF CODEBOOK
LATTICE VECTOR QUANTIZATION FOR IMAGE CODING USING EXPANSION OF CODEBOOK R. R. Khandelwal 1, P. K. Purohit 2 and S. K. Shriwastava 3 1 Shri Ramdeobaba College Of Engineering and Management, Nagpur richareema@rediffmail.com
More informationEE-597 Notes Quantization
EE-597 Notes Quantization Phil Schniter June, 4 Quantization Given a continuous-time and continuous-amplitude signal (t, processing and storage by modern digital hardware requires discretization in both
More informationSource Coding. Scalar Quantization
Source Coding Source Coding The Communications Toolbox includes some basic functions for source coding. Source coding, also known as quantization or signal formatting, includes the concepts of analog-to-digital
More informationSummary: SER formulation. Binary antipodal constellation. Generic binary constellation. Constellation gain. 2D constellations
TUTORIAL ON DIGITAL MODULATIONS Part 8a: Error probability A [2011-01-07] 07] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello 1 Part 8a: Error
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationCS6304 / Analog and Digital Communication UNIT IV - SOURCE AND ERROR CONTROL CODING PART A 1. What is the use of error control coding? The main use of error control coding is to reduce the overall probability
More informationFACULTY OF ENGINEERING MULTIMEDIA UNIVERSITY LAB SHEET
FACULTY OF ENGINEERING MULTIMEDIA UNIVERSITY LAB SHEET ETM 3136 Digital Communications Trimester 1 (2010/2011) DTL1: Pulse Code Modulation (PCM) Important Notes: Students MUST read this lab sheet before
More informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING Final Examination - Fall 2015 EE 4601: Communication Systems
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING Final Examination - Fall 2015 EE 4601: Communication Systems Aids Allowed: 2 8 1/2 X11 crib sheets, calculator DATE: Tuesday
More informationMultimedia Networking ECE 599
Multimedia Networking ECE 599 Prof. Thinh Nguyen School of Electrical Engineering and Computer Science Based on lectures from B. Lee, B. Girod, and A. Mukherjee 1 Outline Digital Signal Representation
More informationA Practical Application of Wave-Pipelining Theory on a Adaptive Differential Pulse Code Modulation Coder-Decoder Design
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 5-2016 A Practical Application of Wave-Pipelining Theory on a Adaptive Differential Pulse Code Modulation Coder-Decoder
More informationρ = sin(2π ft) 2π ft To find the minimum value of the correlation, we set the derivative of ρ with respect to f equal to zero.
Problem 5.1 : The correlation of the two signals in binary FSK is: ρ = sin(π ft) π ft To find the minimum value of the correlation, we set the derivative of ρ with respect to f equal to zero. Thus: ϑρ
More information16.36 Communication Systems Engineering
MIT OpenCourseWare http://ocw.mit.edu 16.36 Communication Systems Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.36: Communication
More information8 PAM BER/SER Monte Carlo Simulation
xercise.1 8 PAM BR/SR Monte Carlo Simulation - Simulate a 8 level PAM communication system and calculate bit and symbol error ratios (BR/SR). - Plot the calculated and simulated SR and BR curves. - Plot
More informationDigital Baseband Systems. Reference: Digital Communications John G. Proakis
Digital Baseband Systems Reference: Digital Communications John G. Proais Baseband Pulse Transmission Baseband digital signals - signals whose spectrum extend down to or near zero frequency. Model of the
More informationEE5356 Digital Image Processing
EE5356 Digital Image Processing INSTRUCTOR: Dr KR Rao Spring 007, Final Thursday, 10 April 007 11:00 AM 1:00 PM ( hours) (Room 111 NH) INSTRUCTIONS: 1 Closed books and closed notes All problems carry weights
More informationthat efficiently utilizes the total available channel bandwidth W.
Signal Design for Band-Limited Channels Wireless Information Transmission System Lab. Institute of Communications Engineering g National Sun Yat-sen University Introduction We consider the problem of signal
More informationThe Secrets of Quantization. Nimrod Peleg Update: Sept. 2009
The Secrets of Quantization Nimrod Peleg Update: Sept. 2009 What is Quantization Representation of a large set of elements with a much smaller set is called quantization. The number of elements in the
More informationOverview. Analog capturing device (camera, microphone) PCM encoded or raw signal ( wav, bmp, ) A/D CONVERTER. Compressed bit stream (mp3, jpg, )
Overview Analog capturing device (camera, microphone) Sampling Fine Quantization A/D CONVERTER PCM encoded or raw signal ( wav, bmp, ) Transform Quantizer VLC encoding Compressed bit stream (mp3, jpg,
More informationChannel capacity. Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5.
Channel capacity Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5. Exercices Exercise session 11 : Channel capacity 1 1. Source entropy Given X a memoryless
More informationLOW COMPLEX FORWARD ADAPTIVE LOSS COMPRESSION ALGORITHM AND ITS APPLICATION IN SPEECH CODING
Journal of ELECTRICAL ENGINEERING, VOL. 62, NO. 1, 2011, 19 24 LOW COMPLEX FORWARD ADAPTIVE LOSS COMPRESSION ALGORITHM AND ITS APPLICATION IN SPEECH CODING Jelena Nikolić Zoran Perić Dragan Antić Aleksandra
More informationData Detection for Controlled ISI. h(nt) = 1 for n=0,1 and zero otherwise.
Data Detection for Controlled ISI *Symbol by symbol suboptimum detection For the duobinary signal pulse h(nt) = 1 for n=0,1 and zero otherwise. The samples at the output of the receiving filter(demodulator)
More informationTHE dictionary (Random House) definition of quantization
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 6, OCTOBER 1998 2325 Quantization Robert M. Gray, Fellow, IEEE, and David L. Neuhoff, Fellow, IEEE (Invited Paper) Abstract The history of the theory
More informationLecture 5b: Line Codes
Lecture 5b: Line Codes Dr. Mohammed Hawa Electrical Engineering Department University of Jordan EE421: Communications I Digitization Sampling (discrete analog signal). Quantization (quantized discrete
More informationSignal Design for Band-Limited Channels
Wireless Information Transmission System Lab. Signal Design for Band-Limited Channels Institute of Communications Engineering National Sun Yat-sen University Introduction We consider the problem of signal
More informationSample Problems for the 9th Quiz
Sample Problems for the 9th Quiz. Draw the line coded signal waveform of the below line code for 0000. (a Unipolar nonreturn-to-zero (NRZ signaling (b Polar nonreturn-to-zero (NRZ signaling (c Unipolar
More informationImage Data Compression
Image Data Compression Image data compression is important for - image archiving e.g. satellite data - image transmission e.g. web data - multimedia applications e.g. desk-top editing Image data compression
More informationTopic 3. Design of Sequences with Low Correlation
Topic 3. Design of Sequences with Low Correlation M-sequences and Quadratic Residue Sequences 2 Multiple Trace Term Sequences and WG Sequences 3 Gold-pair, Kasami Sequences, and Interleaved Sequences 4
More informationScilab Textbook Companion for Digital Telephony by J. C. Bellamy 1
Scilab Textbook Companion for Digital Telephony by J. C. Bellamy Created by Harish Shenoy B.Tech Electronics Engineering NMIMS, MPSTME College Teacher Not decided Cross-Checked by TechPassion May 0, 06
More informationCompression. Encryption. Decryption. Decompression. Presentation of Information to client site
DOCUMENT Anup Basu Audio Image Video Data Graphics Objectives Compression Encryption Network Communications Decryption Decompression Client site Presentation of Information to client site Multimedia -
More informationCoding for Discrete Source
EGR 544 Communication Theory 3. Coding for Discrete Sources Z. Aliyazicioglu Electrical and Computer Engineering Department Cal Poly Pomona Coding for Discrete Source Coding Represent source data effectively
More informationDigital Communications
Digital Communications Chapter 9 Digital Communications Through Band-Limited Channels Po-Ning Chen, Professor Institute of Communications Engineering National Chiao-Tung University, Taiwan Digital Communications:
More informationat Some sort of quantization is necessary to represent continuous signals in digital form
Quantization at Some sort of quantization is necessary to represent continuous signals in digital form x(n 1,n ) x(t 1,tt ) D Sampler Quantizer x q (n 1,nn ) Digitizer (A/D) Quantization is also used for
More information2016 Spring: The Final Exam of Digital Communications
2016 Spring: The Final Exam of Digital Communications The total number of points is 131. 1. Image of Transmitter Transmitter L 1 θ v 1 As shown in the figure above, a car is receiving a signal from a remote
More informationCommunication constraints and latency in Networked Control Systems
Communication constraints and latency in Networked Control Systems João P. Hespanha Center for Control Engineering and Computation University of California Santa Barbara In collaboration with Antonio Ortega
More informationELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization
ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)
More informationPredictive Coding. Prediction Prediction in Images
Prediction Prediction in Images Predictive Coding Principle of Differential Pulse Code Modulation (DPCM) DPCM and entropy-constrained scalar quantization DPCM and transmission errors Adaptive intra-interframe
More informationEE5356 Digital Image Processing. Final Exam. 5/11/06 Thursday 1 1 :00 AM-1 :00 PM
EE5356 Digital Image Processing Final Exam 5/11/06 Thursday 1 1 :00 AM-1 :00 PM I), Closed books and closed notes. 2), Problems carry weights as indicated. 3), Please print your name and last four digits
More informationPredictive Coding. Prediction
Predictive Coding Prediction Prediction in Images Principle of Differential Pulse Code Modulation (DPCM) DPCM and entropy-constrained scalar quantization DPCM and transmission errors Adaptive intra-interframe
More information5. Pilot Aided Modulations. In flat fading, if we have a good channel estimate of the complex gain gt, ( ) then we can perform coherent detection.
5. Pilot Aided Modulations In flat fading, if we have a good channel estimate of the complex gain gt, ( ) then we can perform coherent detection. Obtaining a good estimate is difficult. As we have seen,
More informationMODULATION AND CODING FOR QUANTIZED CHANNELS. Xiaoying Shao and Harm S. Cronie
MODULATION AND CODING FOR QUANTIZED CHANNELS Xiaoying Shao and Harm S. Cronie x.shao@ewi.utwente.nl, h.s.cronie@ewi.utwente.nl University of Twente, Faculty of EEMCS, Signals and Systems Group P.O. box
More information2. SPECTRAL ANALYSIS APPLIED TO STOCHASTIC PROCESSES
2. SPECTRAL ANALYSIS APPLIED TO STOCHASTIC PROCESSES 2.0 THEOREM OF WIENER- KHINTCHINE An important technique in the study of deterministic signals consists in using harmonic functions to gain the spectral
More informationBINARY CODES. Binary Codes. Computer Mathematics I. Jiraporn Pooksook Department of Electrical and Computer Engineering Naresuan University
Binary Codes Computer Mathematics I Jiraporn Pooksook Department of Electrical and Computer Engineering Naresuan University BINARY CODES: BCD Binary Coded Decimal system is represented by a group of 4
More informationChapter 9 Fundamental Limits in Information Theory
Chapter 9 Fundamental Limits in Information Theory Information Theory is the fundamental theory behind information manipulation, including data compression and data transmission. 9.1 Introduction o For
More informationELECTRONICS & COMMUNICATIONS DIGITAL COMMUNICATIONS
EC 32 (CR) Total No. of Questions :09] [Total No. of Pages : 02 III/IV B.Tech. DEGREE EXAMINATIONS, APRIL/MAY- 207 Second Semester ELECTRONICS & COMMUNICATIONS DIGITAL COMMUNICATIONS Time: Three Hours
More information