Various signal sampling and reconstruction methods
|
|
- Ralph Heath
- 6 years ago
- Views:
Transcription
1 Various signal sampling and reconstruction methods Rolands Shavelis, Modris Greitans 14 Dzerbenes str., Riga LV-1006, Latvia Contents Classical uniform sampling and reconstruction Advanced sampling and reconstruction methods Signal-dependent sampling and reconstruction Conclusions seminar, 1 1
2 Classical uniform sampling Data acquisition systems capture real-world signals and convert them to digital signals Shannon's sampling theorem: if a function s t contains no frequencies higher than f max (in cycles per second), it is completely determined by giving its ordinates at a series of points spaced T =1/ 2 f max seconds apart The corresponding reconstruction formula t sin t s t = s nt sinc n, sinc t = T t n Z seminar, 2 2
3 Classical uniform sampling When the input signal s t L 2 is not band-limited, the standard procedure is to apply a low-pass filter prior to sampling in order to suppress aliasing In the traditional approach h t = t =sinc t, but in general the analysis and synthesis functions h t and t are not identical seminar, 3 3
4 Classical uniform sampling Every band-limited signal s t V with T =1 can be expressed as s t = s n sinc t n n Z If sinc t is replaced by a more general template t, the generalization to other classes of functions is achieved The basic approximation space V ={s t = c n t n : c l 2 } n Z In order to represent a signal s t L 2 in the space V the minimum-error approximation of s t into V is made s t = c n t n, n Z where the coefficients c n ensure the minimum error 2 s t s t dt seminar, 4 4
5 Classical uniform sampling Examples of generating functions Band-limited functions t =sinc t Piecewise-constant functions { 0 t = t = 1, t 1/ 2 0, t 1/2 Polynomial splines of degree n 1 t = n t = 0 t n 1 t seminar, 5 5
6 Advanced sampling and reconstruction methods: Amplitude encoding (information is carried by signal samples s n): Digital alias-free signal processing Compressive sensing Finite rate of innovation Time encoding (information is carried by sampling instants t n ): Time encoding machines (signal-dependent sampling) seminar, 6 6
7 Digital Alias-free Signal Processing Digital Alias-free Signal Processing (DASP) is a set of methodologies that use non-uniform sampling and specialised signal processing algorithms that allow processing signals with unknown spectral support in the frequency ranges exceeding half the average sampling rate seminar, 7 7
8 Digital Alias-free Signal Processing A priori information: signal consists of one or more discrete spectral M components s t = Am sin 2 f m t m m=1 The task is to estimate the parameters of components using signal samples {s t n }={s n }n=0,1,, N 1 An effective approach is sequential component extraction method (SECOEX), which is cyclic and based on the extraction of one discrete spectral component Ai sin 2 f i t n i in each cycle i=1,2, Starting with the initial sampling values {s1, n }={s n } the algorithm is N 1 n=0 2 si, n Ai sin 2 f i t n i =min {s i 1, n }={si, n Ai sin 2 f i t n i } Cycles are continued until the predefined limits (number of components or residual power) are reached. seminar, 8 8
9 Digital Alias-free Signal Processing Example of SECOEX seminar, 9 9
10 Digital Alias-free Signal Processing In order to analyze periodic signals or signals with limited bandwidth not exceeding half the average sampling rate, the least mean squares (LMS) method can be used Given the frequencies { f m }m=1,2,, M the amplitudes {Am } and phases { m } are found to ensure the minimum error N 1 n=0 M s n Am sin 2 f m t n m m=1 2 N The total number of frequencies M should not exceed half the 2 number of samples seminar, 10 10
11 Digital Alias-free Signal Processing Example of LMS seminar, 11 11
12 Signal-dependent transform Signal-dependent transform (SDT) is based on application of Minimum variance (MV) filter, the frequency response of which adapts to the spectral components of the input signal on each frequency of interest f 0 R 1 e f 0 Filter coefficients a MV f 0 = H ensures e f 0 R 1 e f 0 the sinusoidal signal with frequency f 0 passes through the filter designed for this frequency without distortion the minimum variance of the output signal 2 Square value of output signal p f 0 = s a MV f 0 indicates the power of spectral components of the input signal at frequency f 0 The frequency band of spectral analysis is covered by a set of such MV filters seminar, 12 12
13 Signal-dependent transform Example of SDT seminar, 13 13
14 Compressive sensing The sampling theorem specifies that to avoid losing information when capturing the signal, the sampling rate must be at least twice the signal bandwidth In many applications the Nyquist rate is so high that too many samples result, making compression a necessity prior to storage or transmission s=ψ c Sample-then-compress framework has three inefficiencies: large N, all N coefficients must be computed, and the locations of large coefficients must be encoded In other applications due to large signal bandwidth it is difficult to sample at Nyquist rate seminar, 14 14
15 Compressive sensing Compressive sensing is a method to capture and represent compressible signals at a rate significantly below the Nyquist rate Samples are replaced by few nonadaptive linear projections y=φ s=φ Ψ c=θ c that preserve the structure of the signal Φ measurement matrix (random Gaussian), Ψ orthonormal basis, Θ compressed sensing reconstruction matrix, K M N, M =a K log N / K The signal is recovered from these projections using an optimization process c =arg min Nn=1 c n such that seminar, Θ c =y 15 15
16 Finite rate of innovation Another compressive acquisition scheme is developed for signals with finite rate of innovation (FROI), e.g., streams of Dirac pulses, nonuniform splines, and piecewise polynomials Even though these signals are not band-limited, they can be sampled uniformly at (or above) the rate of innovation using an appropriate kernel, and then perfectly reconstructed by solving systems of linear equations K 1 For a stream of K Diracs periodized with period, s t = c k t t k n, k =0 n Z the rate of innovation is =2 K / After filtering the signal with h t = B sinc B t, B the samples at N 2M 1 uniform locations are taken, M = B /2 The Fourier coefficients S [ m], m M are found, and the estimation of the annihilating filter A[m ] follows A[m ] S [m]=0 which lead to the K locations {t k } and weights {c k } seminar, 16 16
17 Finite rate of innovation An example = 2K =0.7 B=1.3 N =27 S [ m] seminar, 17 17
18 Advanced sampling and reconstruction methods: Amplitude encoding (information is carried by signal samples s n): Digital alias-free signal processing Compressive sensing Finite rate of innovation Time encoding (information is carried by sampling instants t n ): Time encoding machines (signal-dependent sampling) seminar, 18 18
19 Time encoding Time encoding is a real-time, asynchronous mechanism for encoding the amplitude information of an analog band-limited signal into a time sequence, or time codes, based on which the signal can be reconstructed Time codes can be generated by simple nonlinear asynchronous analog circuits (time encoding machines) with low power consumption seminar, 19 19
20 Time decoding For a given time sequence {t n }n Z a possible representation of the signal is given s t = c n h t t n, h t =sinc 2 f max t n Z The unknown coefficients can be calculated from equation s=h c, [s ]m =s t m, [c]m=c m, [H]mn=h t m t n Unknown c for perfect recovery is possible if max t n 1 t n 1/ 2 f max n In practice, a limited number of samples is available, therefore N 1 s t = c n h t t n, n=0 where c=h + s seminar, 20 20
21 Asynchronous sigma-delta modulator Time encoding machine: asynchronous sigma-delta modulator The integrator output is a strictly increasing or decreasing function n for t [t n, t n 1 ] so that y t n = 1 and t n 1 t n s t dt= 1 n 2 b t n 1 t n The difference between the neighboring time codes is bounded by circuit parameters, and b,and the amplitude bound of the input c 2 2 t n 1 t n b c b c seminar, 21 21
22 Time encoding Other time encoding methods: zero crossing reference signal crossing level-crossing send-on-delta seminar, 22 22
23 Signal-dependent sampling and reconstruction Level-crossing sampling Mini-max sampling Adaptive level-crossing sampling seminar, 23 23
24 Signal-dependent sampling It is important to reduce energy consumption of wireless sensor networks Most of the energy is consumed by data transmission, thus the option is to reduce the amount of data to be transferred by using event-driven, signal-dependent sampling In result information about signal is transferred only when events occur Two different schemes for data transmission: In signal-dependent sampling case event-driven ADC is driven by signal being sampled seminar, 24 24
25 Sampling by local maximum frequency Bandlimited signal s t with frequency f F max traditionally is sampled uniformly with sampling frequency f d 2 F max Given the discrete signal samples s t n the original analogue signal can be calculated by formula s t = s t n h t, t n, n= h1 t,t n =sinc 2 F max t t n, seminar, t n= n 2 F max 25 25
26 Sampling by local maximum frequency Bandlimited signal s t with frequency f F max traditionally is sampled uniformly with sampling frequency f d 2 F max Given the discrete signal samples s t n the original analogue signal can be calculated by formula s t = s t n h t, t n, n= h1 t,t n =sinc 2 F max t t n, seminar, t n= n 2 F max 26 26
27 Sampling by local maximum frequency In signal-dependent sampling case the capturing of signal samples depends on time-varying properties of the signal t s t = s t n h2 t, t n, n=0 h2 t, t n =sinc t t n, t =2 f max t dt t0 t n =n seminar, 27 27
28 Sampling by local maximum frequency In signal-dependent sampling case the capturing of signal samples depends on time-varying properties of the signal t s t = s t n h2 t, t n, n=0 h2 t, t n =sinc t t n, t =2 f max t dt t0 t n =n seminar, 28 28
29 Sampling by local maximum frequency Example seminar, 29 29
30 Sampling by local maximum frequency Example seminar, 30 30
31 Sampling by local maximum frequency Example n t n=, N 1 =396 2 F max 1 T 2 s t dt=0.028 V T 0 1 T 2 s t dt=0.022 V T 0 N 1 1 s t = s t n h1 t, t n n=0 s t =s t s t t t =2 f max t dt 0 t n =n, N 2=239 N 2 1 s t = s t n h 2 t, t n n=0 seminar, 31 31
32 Signal reconstruction from levelcrossing samples In practice no information about instantaneous maximum frequency f max t of the signal is usually provided, thus an alternative choice is level-crossing sampling The locations {t m } of level-crossing samples depend on time-varying frequency properties of the signal t s t = s t k h t,t k, k =0 h t, t k =sinc t t k, t =2 f max t dt, t0 t k =k The signal is reconstructed as N 1,t n, s t = s t n h t n=0 t, t n =sinc t t n, h t =2 f max t dt, t t0 n =n t Unknown s t n and f max t are estimated from level-crossing samples seminar, 32 32
33 Signal reconstruction from levelcrossing samples To estimate the frequency f max t from level-crossing samples s t m, starting with the initial index value m=0 Two pairs of successive level-crossing samples are found 1) s t m ' =s t m' 1 j j 2) s t m ' ' =s t m' ' 1 j j such, that the distance m' ' j m ' j 1 is minimal From t m ', t m ' 1, t m ' ' and t m ' ' 1 the value j j j j f t j is calculated t j= t m ' ' t m ' ' 1 t m ' t m ' 1 j j j 4 j, t j= t m ' ' t m ' ' 1 j j 2 t m ' t m' 1 j j 2, f t j = 1 2 t j Thereafter the next pairs j 1, are found to calculate f t j 1, seminar, 33 33
34 Signal reconstruction from levelcrossing samples For a single sinusoid all f t j values are similar and equal the frequency of the sinusoid J 1 f j is close to For a multicomponent signal the mean f t j value J j=1 the frequency of the highest component Thus, the estimate of function of instantaneous maximum frequency f max t can be obtained by f t j approximation with piecewise polynomials of order or seminar, 34 34
35 Signal reconstruction from levelcrossing samples Example seminar, 35 35
36 Signal reconstruction from levelcrossing samples Reconstruction by interpolation and filtering method s 0 t n = s s t t n ; m s 0 t =C [ s 0 t n ]; N 1 C [ s t n ]= s t n h t, t n s i t n = si 1 t n s s s n=0 i 1 t m t n ; s i t =C [ s i t n ] Reconstruction by LMS method s =H + s, [ s ]n = s t n, [s]m= s t m, [H]mn=h t m, t n Reconstruction by finding a minimum min = st H T H s 2 H T s T s s such that a n s t n b n Reconstruction result depends on the lengths of the sampling intervals t m 1 t m seminar, 36 36
37 Signal reconstruction from levelcrossing samples Reconstruction by interpolation and filtering method s 0 t n = s s t t n ; m s 0 t =C [ s 0 t n ]; N 1 C [ s t n ]= s t n h t, t n s i t n = si 1 t n s s s n=0 i 1 t m t n ; s i t =C [ s i t n ] Reconstruction by LMS method s =H + s, [ s ]n = s t n, [s]m= s t m, [H]mn=h t m, t n Reconstruction by finding a minimum min = st H T H s 2 H T s T s s such that a n s t n b n Reconstruction result depends on the lengths of the sampling intervals t m 1 t m seminar, 37 37
38 Adaptive level-crossing sampling Sampling intervals t m 1 t m depend on the signal and the locations of quantization levels LvCr M =35 LvCr M =119 Mini - max M =47 Too sparsely placed levels lead to information loss about signal changes occurring between the levels, and this can reduce signal reconstruction quality If the levels are placed more densely, less significant information is lost, however, high sampling density is created in places where it is not necessary seminar, 38 38
39 Adaptive level-crossing sampling Adaptive level-crossing sampling allows to keep sparse placement of the levels and at the same time not to lose significant information about signal waveform changes between the levels It takes into account the signal derivative value to change the corresponding quantization level U up, and samples close to local maximums and minimums are captured in addition to level-crossing samples For signal reconstruction purpose pulses down, up and alarm are used seminar, 39 39
40 Adaptive level-crossing sampling Example M =47 Mini - max seminar, M =49 AdLvCr 40 40
41 Adaptive level-crossing sampling Speech signal of length 3.82 s Uniform sampling at 8 khz provides samples Level-crossing sampling based on SoD scheme with du=0.01 V provides samples (11959 pulses) Mini-max sampling provides samples, if condition s n 1 sn 6 mv is set, the number decreases to 6209 samples Adaptive level-crossing sampling with du=0.15 V provides samples (37804 pulses), if condition s n 1 sn 6 mv is set, the number decreases to 6076 samples (12120 pulses) seminar, 41 41
42 Adaptive level-crossing sampling Adaptive level-crossing sampling block scheme seminar, 42 42
43 Conclusions There are different sampling schemes for different applications The classical is uniform sampling with sampling rate determined by signal bandwidth Due to inefficiencies and limitations of uniform sampling alternative solutions for various applications are developed Signal-dependent sampling can be efficiently used in wireless sensor networks since the data acquisition activity depends on signal itself... seminar, 43 43
ELEN 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 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 informationRECENT results in sampling theory [1] have shown that it
2140 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 54, NO 6, JUNE 2006 Oversampled A/D Conversion and Error-Rate Dependence of Nonbandlimited Signals With Finite Rate of Innovation Ivana Jovanović, Student
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 informationOPPORTUNISTIC SAMPLING BY LEVEL-CROSSING KAREN GUAN DISSERTATION
OPPORTUNISTIC SAMPLING BY LEVEL-CROSSING BY KAREN GUAN DISSERTATION Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Electrical and Computer Engineering in
More information18th European Signal Processing Conference (EUSIPCO-2010) Aalborg, Denmark, August 23-27, University of Pittsburgh Pittsburgh, PA, USA
8th European Signal Processing Conference (EUSIPCO-) Aalborg, Denmar, August 3-7, ADAPTIVE LEVEL-CROSSING SAMPLING AND RECONSTRUCTION Seda Senay, Luis F. Chaparro, Mingui Sun and Robert J. Sclabassi, Department
More informationCMPT 889: Lecture 3 Fundamentals of Digital Audio, Discrete-Time Signals
CMPT 889: Lecture 3 Fundamentals of Digital Audio, Discrete-Time Signals Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 6, 2005 1 Sound Sound waves are longitudinal
More informationIB Paper 6: Signal and Data Analysis
IB Paper 6: Signal and Data Analysis Handout 5: Sampling Theory S Godsill Signal Processing and Communications Group, Engineering Department, Cambridge, UK Lent 2015 1 / 85 Sampling and Aliasing All of
More informationarxiv: v1 [cs.it] 20 Jan 2018
1 Analog-to-Digital Compression: A New Paradigm for Converting Signals to Bits Alon Kipnis, Yonina C. Eldar and Andrea J. Goldsmith fs arxiv:181.6718v1 [cs.it] Jan 18 X(t) sampler smp sec encoder R[ bits
More informationImage Acquisition and Sampling Theory
Image Acquisition and Sampling Theory Electromagnetic Spectrum The wavelength required to see an object must be the same size of smaller than the object 2 Image Sensors 3 Sensor Strips 4 Digital Image
More informationSignals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters
Signals, Instruments, and Systems W5 Introduction to Signal Processing Sampling, Reconstruction, and Filters Acknowledgments Recapitulation of Key Concepts from the Last Lecture Dirac delta function (
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 informationChapter 5 Frequency Domain Analysis of Systems
Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this
More informationA Survey of Compressive Sensing and Applications
A Survey of Compressive Sensing and Applications Justin Romberg Georgia Tech, School of ECE ENS Winter School January 10, 2012 Lyon, France Signal processing trends DSP: sample first, ask questions later
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 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 informationChapter 5 Frequency Domain Analysis of Systems
Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this
More informationModern Digital Communication Techniques Prof. Suvra Sekhar Das G. S. Sanyal School of Telecommunication Indian Institute of Technology, Kharagpur
Modern Digital Communication Techniques Prof. Suvra Sekhar Das G. S. Sanyal School of Telecommunication Indian Institute of Technology, Kharagpur Lecture - 15 Analog to Digital Conversion Welcome to the
More informationSistemas de Aquisição de Dados. Mestrado Integrado em Eng. Física Tecnológica 2016/17 Aula 3, 3rd September
Sistemas de Aquisição de Dados Mestrado Integrado em Eng. Física Tecnológica 2016/17 Aula 3, 3rd September The Data Converter Interface Analog Media and Transducers Signal Conditioning Signal Conditioning
More informationAmplitude Adaptive ASDM without Envelope Encoding
Amplitude Adaptive ASDM without Envelope Encodin Kaspars Ozols and Rolands Shavelis Institute of Electronics and Computer Science 14 Dzerbenes Str., LV-16, Ria, Latvia Email: kaspars.ozols@edi.lv, shavelis@edi.lv
More informationSEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis
SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some
More informationSampling Signals from a Union of Subspaces
1 Sampling Signals from a Union of Subspaces Yue M. Lu and Minh N. Do I. INTRODUCTION Our entire digital revolution depends on the sampling process, which converts continuousdomain real-life signals to
More informationA Nonuniform Quantization Scheme for High Speed SAR ADC Architecture
A Nonuniform Quantization Scheme for High Speed SAR ADC Architecture Youngchun Kim Electrical and Computer Engineering The University of Texas Wenjuan Guo Intel Corporation Ahmed H Tewfik Electrical and
More informationCOMPRESSED SENSING IN PYTHON
COMPRESSED SENSING IN PYTHON Sercan Yıldız syildiz@samsi.info February 27, 2017 OUTLINE A BRIEF INTRODUCTION TO COMPRESSED SENSING A BRIEF INTRODUCTION TO CVXOPT EXAMPLES A Brief Introduction to Compressed
More informationSparse Sampling: Theory and Applications
November 24, 29 Outline Problem Statement Signals with Finite Rate of Innovation Sampling Kernels: E-splines and -splines Sparse Sampling: the asic Set-up and Extensions The Noisy Scenario Applications
More informationAnalog to Digital Converters (ADCs)
Analog to Digital Converters (ADCs) Note: Figures are copyrighted Proakis & Manolakis, Digital Signal Processing, 4 th Edition, Pearson Publishers. Embedded System Design A Unified HW Approach, Vahid/Givargis,
More informationSampling. Alejandro Ribeiro. February 8, 2018
Sampling Alejandro Ribeiro February 8, 2018 Signals exist in continuous time but it is not unusual for us to process them in discrete time. When we work in discrete time we say that we are doing discrete
More informationAnalog Digital Sampling & Discrete Time Discrete Values & Noise Digital-to-Analog Conversion Analog-to-Digital Conversion
Analog Digital Sampling & Discrete Time Discrete Values & Noise Digital-to-Analog Conversion Analog-to-Digital Conversion 6.082 Fall 2006 Analog Digital, Slide Plan: Mixed Signal Architecture volts bits
More informationChapter 2: Problem Solutions
Chapter 2: Problem Solutions Discrete Time Processing of Continuous Time Signals Sampling à Problem 2.1. Problem: Consider a sinusoidal signal and let us sample it at a frequency F s 2kHz. xt 3cos1000t
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 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 informationExperimental Fourier Transforms
Chapter 5 Experimental Fourier Transforms 5.1 Sampling and Aliasing Given x(t), we observe only sampled data x s (t) = x(t)s(t; T s ) (Fig. 5.1), where s is called sampling or comb function and can be
More informationEE 230 Lecture 40. Data Converters. Amplitude Quantization. Quantization Noise
EE 230 Lecture 40 Data Converters Amplitude Quantization Quantization Noise Review from Last Time: Time Quantization Typical ADC Environment Review from Last Time: Time Quantization Analog Signal Reconstruction
More informationTIME ENCODING AND PERFECT RECOVERY OF BANDLIMITED SIGNALS
TIME ENCODING AND PERFECT RECOVERY OF BANDLIMITED SIGNALS Aurel A. Lazar Department of Electrical Engineering Columbia University, New York, NY 27 aurel@ee.columbia.edu László T. Tóth Department of Telecommunications
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 informationEE123 Digital Signal Processing
EE23 Digital Signal Processing Lecture 7B Sampling What is this Phenomena? https://www.youtube.com/watch?v=cxddi8m_mzk Sampling of Continuous ime Signals (Ch.4) Sampling: Conversion from C. (not quantized)
More informationFROM ANALOGUE TO DIGITAL
SIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 7. Dr David Corrigan 1. Electronic and Electrical Engineering Dept. corrigad@tcd.ie www.mee.tcd.ie/ corrigad FROM ANALOGUE TO DIGITAL To digitize signals it is necessary
More informationAn Information Theoretic Approach to Analog-to-Digital Compression
1 An Information Theoretic Approach to Analog-to-Digital Compression Processing, storing, and communicating information that originates as an analog phenomenon involve conversion of the information to
More informationAn Information Theoretic Approach to Analog-to-Digital Compression
1 An Information Theoretic Approach to Analog-to-Digital Compression Processing, storing, and communicating information that originates as an analog phenomenon involve conversion of the information to
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 information1 Understanding Sampling
1 Understanding Sampling Summary. In Part I, we consider the analysis of discrete-time signals. In Chapter 1, we consider how discretizing a signal affects the signal s Fourier transform. We derive the
More informationData representation and approximation
Representation and approximation of data February 3, 2015 Outline 1 Outline 1 Approximation The interpretation of polynomials as functions, rather than abstract algebraic objects, forces us to reinterpret
More informationMultichannel Sampling of Signals with Finite. Rate of Innovation
Multichannel Sampling of Signals with Finite 1 Rate of Innovation Hojjat Akhondi Asl, Pier Luigi Dragotti and Loic Baboulaz EDICS: DSP-TFSR, DSP-SAMP. Abstract In this paper we present a possible extension
More informationCambridge University Press The Mathematics of Signal Processing Steven B. Damelin and Willard Miller Excerpt More information
Introduction Consider a linear system y = Φx where Φ can be taken as an m n matrix acting on Euclidean space or more generally, a linear operator on a Hilbert space. We call the vector x a signal or input,
More informationDigital Object Identifier /MSP
DIGITAL VISION Sampling Signals from a Union of Subspaces [A new perspective for the extension of this theory] [ Yue M. Lu and Minh N. Do ] Our entire digital revolution depends on the sampling process,
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 informationL. Yaroslavsky. Fundamentals of Digital Image Processing. Course
L. Yaroslavsky. Fundamentals of Digital Image Processing. Course 0555.330 Lec. 6. Principles of image coding The term image coding or image compression refers to processing image digital data aimed at
More informationTime Delay Estimation from Low Rate Samples: A Union of Subspaces Approach
1 ime Delay Estimation from Low Rate Samples: A Union of Subspaces Approach Kfir Gedalyahu and Yonina C. Eldar, Senior Member, IEEE arxiv:0905.2429v3 [cs.i] 20 Nov 2009 Abstract ime delay estimation arises
More informationChannel Capacity under General Nonuniform Sampling
202 IEEE International Symposium on Information Theory Proceedings Channel Capacity under General Nonuniform Sampling Yuxin Chen EE, Stanford University Email: yxchen@stanford.edu Yonina C. Eldar EE, Technion
More informationDigital Signal Processing
Digital Signal Processing Introduction Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Czech Republic amiri@mail.muni.cz prenosil@fi.muni.cz February
More informationL-statistics based Modification of Reconstruction Algorithms for Compressive Sensing in the Presence of Impulse Noise
L-statistics based Modification of Reconstruction Algorithms for Compressive Sensing in the Presence of Impulse Noise Srdjan Stanković, Irena Orović and Moeness Amin 1 Abstract- A modification of standard
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 informationMultiresolution schemes
Multiresolution schemes Fondamenti di elaborazione del segnale multi-dimensionale Multi-dimensional signal processing Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Elaborazione
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 informationPulse-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 informationMultiresolution schemes
Multiresolution schemes Fondamenti di elaborazione del segnale multi-dimensionale Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Elaborazione dei Segnali Multi-dimensionali e
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 informationSignal Processing COS 323
Signal Processing COS 323 Digital Signals D: functions of space or time e.g., sound 2D: often functions of 2 spatial dimensions e.g. images 3D: functions of 3 spatial dimensions CAT, MRI scans or 2 space,
More informationGaussian Processes for Audio Feature Extraction
Gaussian Processes for Audio Feature Extraction Dr. Richard E. Turner (ret26@cam.ac.uk) Computational and Biological Learning Lab Department of Engineering University of Cambridge Machine hearing pipeline
More informationSuper-resolution via Convex Programming
Super-resolution via Convex Programming Carlos Fernandez-Granda (Joint work with Emmanuel Candès) Structure and Randomness in System Identication and Learning, IPAM 1/17/2013 1/17/2013 1 / 44 Index 1 Motivation
More informationDistortion-Rate Function for Undersampled Gaussian Processes
Distortion-Rate Function for Undersampled Gaussian Processes Iñaki Estella Aguerri, Deniz Gündüz, Andrea J. Goldsmith 3 and Yonina Eldar 4 Centre Tecnològic de Telecomunicacions de Catalunya (CTTC), Barcelona,
More informationDigital Signal 2 N Most Significant Bit (MSB) Least. Bit (LSB)
1 Digital Signal Binary or two stages: 0 (Low voltage 0-3 V) 1 (High voltage 4-5 V) Binary digit is called bit. Group of bits is called word. 8-bit group is called byte. For N-bit base-2 number = 2 N levels
More informationINTRODUCTION TO DELTA-SIGMA ADCS
ECE37 Advanced Analog Circuits INTRODUCTION TO DELTA-SIGMA ADCS Richard Schreier richard.schreier@analog.com NLCOTD: Level Translator VDD > VDD2, e.g. 3-V logic? -V logic VDD < VDD2, e.g. -V logic? 3-V
More informationEE 435. Lecture 30. Data Converters. Spectral Performance
EE 435 Lecture 30 Data Converters Spectral Performance . Review from last lecture. INL Often Not a Good Measure of Linearity Four identical INL with dramatically different linearity X OUT X OUT X REF X
More informationContinuous Fourier transform of a Gaussian Function
Continuous Fourier transform of a Gaussian Function Gaussian function: e t2 /(2σ 2 ) The CFT of a Gaussian function is also a Gaussian function (i.e., time domain is Gaussian, then the frequency domain
More informationA523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011
A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 Lecture 6 PDFs for Lecture 1-5 are on the web page Problem set 2 is on the web page Article on web page A Guided
More informationEE 435. Lecture 28. Data Converters Linearity INL/DNL Spectral Performance
EE 435 Lecture 8 Data Converters Linearity INL/DNL Spectral Performance Performance Characterization of Data Converters Static characteristics Resolution Least Significant Bit (LSB) Offset and Gain Errors
More informationHomework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, Signals & Systems Sampling P1
Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, 7.49 Signals & Systems Sampling P1 Undersampling & Aliasing Undersampling: insufficient sampling frequency ω s < 2ω M Perfect
More informationCompressed Sensing: Lecture I. Ronald DeVore
Compressed Sensing: Lecture I Ronald DeVore Motivation Compressed Sensing is a new paradigm for signal/image/function acquisition Motivation Compressed Sensing is a new paradigm for signal/image/function
More informationPart IV Compressed Sensing
Aisenstadt Chair Course CRM September 2009 Part IV Compressed Sensing Stéphane Mallat Centre de Mathématiques Appliquées Ecole Polytechnique Conclusion to Super-Resolution Sparse super-resolution is sometime
More informationSensors. Chapter Signal Conditioning
Chapter 2 Sensors his chapter, yet to be written, gives an overview of sensor technology with emphasis on how to model sensors. 2. Signal Conditioning Sensors convert physical measurements into data. Invariably,
More informationFigure 1.1 (a) Model of a communication system, and (b) signal processing functions.
. Introduction to Signals and Operations Model of a Communication System [] Figure. (a) Model of a communication system, and (b) signal processing functions. Classification of Signals. Continuous-time
More informationA Nonlinear Dynamic S/H-ADC Device Model Based on a Modified Volterra Series: Identification Procedure and Commercial CAD Tool Implementation
IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, VOL. 52, NO. 4, AUGUST 2003 1129 A Nonlinear Dynamic S/H-ADC Device Model Based on a Modified Volterra Series: Identification Procedure and Commercial
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 informationChap 4. Sampling of Continuous-Time Signals
Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion
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 informationFourier Transforms For additional information, see the classic book The Fourier Transform and its Applications by Ronald N. Bracewell (which is on the shelves of most radio astronomers) and the Wikipedia
More informationECE 425. Image Science and Engineering
ECE 425 Image Science and Engineering Spring Semester 2000 Course Notes Robert A. Schowengerdt schowengerdt@ece.arizona.edu (520) 62-2706 (voice), (520) 62-8076 (fa) ECE402 DEFINITIONS 2 Image science
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 informationDigital Filter Design Using Non-Uniform Sampling
Proceedings of the 6th WSEAS International Conference on Applications of Electrical Engineering, Istanbul, Turkey, May 27-29, 2007 120 Digital Filter Design Using Non-Uniform Sampling K. BUSAWON, WAI-PANG
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 informationDCSP-2: Fourier Transform
DCSP-2: Fourier Transform Jianfeng Feng Department of Computer Science Warwick Univ., UK Jianfeng.feng@warwick.ac.uk http://www.dcs.warwick.ac.uk/~feng/dcsp.html Data transmission Channel characteristics,
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 informationOrder Tracking Analysis
1. Introduction Order Tracking Analysis Jaafar Alsalaet College of Engineering-University of Basrah Mostly, dynamic forces excited in a machine are related to the rotation speed; hence, it is often preferred
More informationExample: Bipolar NRZ (non-return-to-zero) signaling
Baseand Data Transmission Data are sent without using a carrier signal Example: Bipolar NRZ (non-return-to-zero signaling is represented y is represented y T A -A T : it duration is represented y BT. Passand
More informationThe Sampling Theorem for Finite Duration Signals
The Sampling Theorem for Finite Duration Signals Subhendu Das, CCSI, West Hills, California, subhendu.das@ccsi-ca.com Nirode Mohanty, Fellow-IEEE, CCSI, West Hills, California, nirode.mohanty@ccsi-ca.com
More informationDesign of Spectrally Shaped Binary Sequences via Randomized Convex Relaxations
Design of Spectrally Shaped Binary Sequences via Randomized Convex Relaxations Dian Mo Department of Electrical and Computer Engineering University of Massachusetts Amherst, MA 3 mo@umass.edu Marco F.
More informationSAMPLING DISCRETE-TIME PIECEWISE BANDLIMITED SIGNALS
SAMPLIG DISCRETE-TIME PIECEWISE BADLIMITED SIGALS Martin Vetterli,, Pina Marziliano and Thierry Blu 3 LCAV, 3 IOA, Ecole Polytechnique Fédérale de Lausanne, Switzerland EECS Dept., University of California
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 informationsine wave fit algorithm
TECHNICAL REPORT IR-S3-SB-9 1 Properties of the IEEE-STD-57 four parameter sine wave fit algorithm Peter Händel, Senior Member, IEEE Abstract The IEEE Standard 57 (IEEE-STD-57) provides algorithms for
More informationTime and Spatial Series and Transforms
Time and Spatial Series and Transforms Z- and Fourier transforms Gibbs' phenomenon Transforms and linear algebra Wavelet transforms Reading: Sheriff and Geldart, Chapter 15 Z-Transform Consider a digitized
More informationELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform
Department of Electrical Engineering University of Arkansas ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Introduction Fourier Transform Properties of Fourier
More informationAccurate Fourier Analysis for Circuit Simulators
Accurate Fourier Analysis for Circuit Simulators Kenneth S. Kundert Cadence Design Systems (Based on Presentation to CICC 94) Abstract A new approach to Fourier analysis within the context of circuit simulation
More informationDigital Transmission Methods S
Digital ransmission ethods S-7.5 Second Exercise Session Hypothesis esting Decision aking Gram-Schmidt method Detection.K.K. Communication Laboratory 5//6 Konstantinos.koufos@tkk.fi Exercise We assume
More informationMULTIRATE DIGITAL SIGNAL PROCESSING
MULTIRATE DIGITAL SIGNAL PROCESSING Signal processing can be enhanced by changing sampling rate: Up-sampling before D/A conversion in order to relax requirements of analog antialiasing filter. Cf. audio
More informationA6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2013
A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2013 Lecture 26 Localization/Matched Filtering (continued) Prewhitening Lectures next week: Reading Bases, principal
More informationCompressed Sensing Using Reed- Solomon and Q-Ary LDPC Codes
Compressed Sensing Using Reed- Solomon and Q-Ary LDPC Codes Item Type text; Proceedings Authors Jagiello, Kristin M. Publisher International Foundation for Telemetering Journal International Telemetering
More informationCorrelator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi
Chapter 8 Correlator I. Basics D. Anish Roshi 8.1 Introduction A radio interferometer measures the mutual coherence function of the electric field due to a given source brightness distribution in the sky.
More informationEE 521: Instrumentation and Measurements
Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA September 23, 2009 1 / 18 1 Sampling 2 Quantization 3 Digital-to-Analog Converter 4 Analog-to-Digital Converter
More informationChapter 12 Variable Phase Interpolation
Chapter 12 Variable Phase Interpolation Contents Slide 1 Reason for Variable Phase Interpolation Slide 2 Another Need for Interpolation Slide 3 Ideal Impulse Sampling Slide 4 The Sampling Theorem Slide
More information