SAMPLING DISCRETE-TIME PIECEWISE BANDLIMITED SIGNALS
|
|
- Elizabeth Stone
- 5 years ago
- Views:
Transcription
1 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 at Bereley, USA [martin.vetterli,pina.marziliano,thierry.blu]@epfl.ch ABSTRACT We consider sampling discrete-time periodic signals which are piecewise bandlimited, that is, a signal that is the sum of a bandlimited signal with a piecewise polynomial signal containing a finite number of transitions. These signals are not bandlimited and thus the Shannon sampling theorem for bandlimited signals can not be applied. In this paper, we derive sampling and reconstruction schemes based on those developed in [, 6, 7] for piecewise polynomial signals which tae into account the extra degrees of freedom due to the bandlimitedness. belong to a certain class of signals which have a finite rate of innovation ρ, that is, the number of degrees of freedom per unit of time is finite. Discrete-time periodic bandlimited signals of period also have a finite rate of innovation, that is, ρ =(B +)/. In this paper we are interested in signals that would have been bandlimited if it were not for spies or discontinuities in certain locations, see Figure Piecewise bandlimited signal. ITRODUCTIO Sampling of bandlimited signals has been a subject of interest to the sampling community for more than half a century [4]. The well-nown sampling theorem [] states that a continuous-time signal x(t) bandlimited to [ ω m,ω m ] is uniquely represented by a uniform set of samples x[n] =x(nt )taent seconds apart, if the sampling rate is greater or equal to the bandwidth of the signal, that is, π/t ω m. But not all signals are bandlimited. Recall the definition of bandlimited. Definition B bandlimited signal. A discrete-time periodic signal x[n] with period is B bandlimited if the discrete-time Fourier series coefficients X[] are nonzero inside the band [ B,B] and zero outside the band [ B,B], that is, x[n] e X[] = iπn/ [ B,B] n= [ B,B] with Z,B () In [, 6, 7] sampling theorems for particular nonbandlimited signals namely streams of Diracs and piecewise polynomial signals were given. These signals also due to Kotelniov, Whittaer Figure : Bandlimited signal with 4 spies; Bandlimited signal with 3 discontinuities. These signals are defined as being the sum of a bandlimited signal with a stream of Diracs, in the simplest case, or with a piecewise polynomial signal. Formally we have the following Definition Discrete-time piecewise bandlimited signal. Let x B be a discrete-time periodic B bandlimited signal of period with corresponding DTFS coefficients X B such that X B [m] = m [ B,B]. Let x PP be a discrete-time periodic piecewise polynomial signal of period of zero mean and with K pieces each piece of maximum degree R. Then a piecewise bandlimited signal x is defined by x = x B + x PP () with corresponding DTFS coefficients defined by { XB [m]+x X[m] = PP [m] if m [ B,B]. (3) X PP [m] if m [ B,B]
2 The bandlimited signal with 3 discontinuities illustrated in Figure is obtained by adding a piecewise constant signal with 3 discontinuities in Figure (c) to a bandlimited signal in Figure. From Figure (f) the piecewise bandlimited signal is evidently not bandlimited Time domain Bandlimited signal Piecewise constant signal Frequency domain DTFS of bandlimited signal DTFS of piecewise constant signal. SAMPLIG DISCRETE-TIME STREAMS OF DIRACS AD PIECEWISE POLYOMIAL SIGALS Consider a discrete-time piecewise polynomial signal where each piece is of maximum degree R. By differentiating R + times we obtain a stream of Diracs. We begin by recalling the results given in [, 6, 7] on sampling streams of Diracs, followed by those on sampling piecewise polynomial signals... Discrete-time stream of Diracs Consider a discrete-time periodic stream of K weighted Diracs at locations {n,n,...,n K }, with respective weights {c,c,...,c K } and of period x D [n] = K = c δ[n n ], n =,..., (4) where δ[n] is the Kronecer delta and equal to if n = and if n. The corresponding discrete-time Fourier series (DTFS) coefficients are defined by (c) Piecewise bandlimited signal (d) DTFS of piecewise bandlimited signal 5 X D [m] = K = c W n m, m =,..., (5) where W = e iπ/ is the th root of unity. From Figure 3 the stream of K = 5 weighted Diracs with period = 56illustrated in Figure 3 is evidently not bandlimited. Consider filtering the stream (e) (f) Figure : Discrete-time periodic bandlimited signal x B of period = 56; DTFS of bandlimited signal with B = 5 (c) Discrete-time periodic piecewise constant signal with K = 3 pieces of period = 56; (d) DTFS of piecewise constant signal; (e) Discretetime periodic bandlimited piecewise constant signal; (f) DTFS of bandlimited piecewise constant signal. It follows that discrete-time piecewise bandlimited signals also have a finite rate of innovation and sampling methods will be given in Section 3. We begin by introducing sampling theorems for streams of Diracs and piecewise polynomial signals in Section Figure 3: Discrete-time periodic stream of K =5 weighted Diracs; DTFS of stream of Diracs. of Diracs x D [n] with a lowpass filter ϕ K [n] =ϕ K [ n] whose bandwidth is [ K, K] y[n] =x D [n] c ϕ K [n], n =,..., (6 ) and then sample the filtered signal by an integer value M which is also a divisor of. In[,6,7]wehave shown that we can uniquely recover the stream of Diracs from the samples y s [l] =y[lm]. We recall the following
3 Theorem Consider a discrete-time periodic signal x D [n] of period containing K weighted Diracs. Let M be an integer divisor of satisfying /M K +. Consider the discrete-time periodic sinc sampling ernel ϕ K [n] = K m= K W mn, that is, the inverse DTFS of the Rect [ K,K]. Then the /M samples defined by y s [l] =<x D [n],ϕ K [n lm] > circ, l =,...,/M (7) are a sufficient representation of the signal. The proof of Theorem consists in first showing that K contiguous DTFS coefficients X D [m] with m [ K, K] are sufficient to determine the stream of K weighted Diracs and then showing that the /M samples y s [l] are a sufficient representation of the K spectral values X D [m] withm [ K, K]. Here we just summarize the important steps in the proof. The stream of weighted Diracs is determined by its K locations and associated weights. To determine the locations it is sufficient to find an annihilating filter [3], that is, a filter H =(,H[],...,H[K]) such that (H X D )[m] =, m =,...,. (8) The z transform of the annihilating filter is H(z) = K H[l] z l with H[]=andcanbefactoredasfollows l= H(z) = K = ( z W n ). (9) The locations {n } K = of the Diracs are given by the roots of H(z). The weights {c } K = on the other hand are obtained by solving the Vandermonde K K system of equations in (5) with m =,...,K. The K DTFS coefficients X D [m],m [ K, K] ofthe stream of Diracs are given by where Y s [m] = M X D[m], m =,...,/M () Y s [m] = /M l= y s [l] W/M lm, m =,...,/M () are the DTFS coefficients of the sample values y s [l],l=,...,/m with/m K, see Figure 4. Hence we are able to sample and reconstruct a discrete-time periodic stream of Diracs... Discrete-time piecewise polynomial signals Consider a discrete-time periodic piecewise polynomial signal x PP [n] ofperiod with K pieces each of maximum degree R and with zero mean. Suppose a discretetime difference operator d[n] = δ[n] δ[n ] is applied R + times to the piecewise polynomial signal. The DTFS of the differentiated signal x R+ PP [n] is X (R+) PP [m] =(D[m]) R+ X PP [m], m =,..., () where D[m] = W m is the DTFS of the discrete-time difference operator. This results in putting to zero all the polynomial pieces. Suppose there are discontinuities between the pieces, then K transitions can lead to at most K(R + ) weighted Diracs. From Theorem we can uniquely recover the K(R+) Diracs from K(R + ) contiguous DTFS coefficients X (R+) [] of the differentiated signal (which is a stream of Diracs). The piecewise polynomial signal is then reconstructed by applying the inverse discrete-time difference operator R + times on the stream of weighted Diracs. The discrete-time difference operator d[n] is a singular operator (since D[] = ) and so we define the inverse discrete-time difference operator as D [m] = for m =andd [m] =( W m) for m =,...,. Hence instead of using the sinc sampling ernel ϕ K [n] we will use the differentiated sinc sampling ernel defined by ψ[n] =(d } d d {{} ϕ K(R+) )[n] (3) R+ which has at least R + zeros at the origin z =and a larger bandwidth. The DTFS coefficients of ψ[n] are Ψ[m] =( W m )R+ Φ[m], m =,..., (4) where Φ[m] istherect [ K(R+),K(R+)] function. This is summarized in the following Theorem Consider a discrete-time periodic piecewise polynomial signal x PP [n] of period with K pieces of degree R andwithzeromean. LetM be an integer and a divisor of such that /M K(R + ) +. Tae a sampling ernel ψ[n] with DTFS coefficients defined in (4). Then we can recover the signal from the /M samples y s [l] =<x PP [n],ψ[n lm] >, l =,...,/M. (5) The details of the proof can be found in [, 6, 7]. Hence we are able to sample and reconstruct a discretetime periodic piecewise polynomial signal. We are now ready to investigate piecewise bandlimited signals.
4 X D [] Y [] K Y s [] K M M M Figure 4: X[] is the DTFS of stream of Diracs x D, Y [] is the DTFS of filtered signal, y = x D c ϕ K, Y s [] is the DTFS of sample values y s [l] =<x[n],ϕ K [n lm] >, l =,...,/M. 3. SAMPLIG DISCRETE-TIME PIECEWISE BADLIMITED SIGALS In this section we derive a sampling and reconstruction scheme for piecewise bandlimited signals. We show that these are simply applications of the methods described for streams of Diracs and piecewise polynomial signals in Section. We loo in detail the discrete-time case and give the result for the continuous-time case. 3.. Discrete-time periodic piecewise bandlimited signals First we consider sampling a discrete-time periodic B bandlimited signal of period with K weighted Diracs, that is, x = x B + x D. (6) From Section. we can recover the K weighted Diracs from K contiguous frequency values X D. Since the DTFS coefficients of the bandlimited signal, X B,are equal to zero outside of the band [ B,B], we have that the DTFS coefficients of the signal outside of the band [ B,B] are exactly equal to the DTFS coefficients of the stream of Diracs, that is, X[m] =X D [m], m [ B,B]. (7) Therefore in order to recover the stream of Diracs it is sufficient to tae K DTFS coefficients X[m] outside of the band [ B,B], for instance in [B +,B +K] see Figure 5. Suppose we have the DTFS of the signal X[m], with m [K B,B +K] then the DTFS of the bandlimited signal are obtained by subtracting X D [m] fromx[m] form [ B,B] and thus giving the bandlimited signal x B. Corollary Consider a discrete-time periodic B bandlimited signal of period with K weighted Diracs, x = x B + x D. Let ϕ B+K [n] be discrete-time periodic sinc sampling ernel. Let M be an integer divisor of, andlet/m (B +K)+ then the samples y s [l] =<x[n],ϕ B+K [n lm] >, l =,...,/M (8) are a sufficient representation of x. Proof: The proof is done in two steps. First we show that the DTFS coefficients X[m],m [K B,B + K] are sufficient to determine the bandlimited signal with Diracs. Second we must show that /M samples are sufficient to determine the DTFS coefficients X[m],m [K B,B +K].
5 jx[]j XB XD ;B ; K ;B B B +K Figure 5: X B is the DTFS of B-bandlimited signal x B, X D is the DTFS of the discrete-time periodic stream of K weighted Diracs x D.. Consider the following spectral values X[m],m [K B,B +K] then from Definition { XB [m]+x X[m]= D [m] m [,B] (9). X D [m] m [B +,B+K] From Theorem the stream of K weighted Diracs x D are perfectly recovered from K contiguous DTFS X D [m] =X[m],m [B +,B+K]. On the other hand the B + spectral components of the bandlimited signal are given by X B [] =(X[m] X D []), [ B,B]. () giving the bandlimited signal x B. Thus the bandlimited signal with spies is x = x B + x D.. In the same way as Theorem the spectral components of the signal are obtained from the spectral components of the sample values Y s [m], X[m] =MY s [m], m [K B,B +K]. () The result found in Corollary can be generalized to discrete-time periodic piecewise bandlimited signals. Recall that to reconstruct a discrete-time periodic piecewise polynomial signal we needed K(R +)contiguous spectral values. It follows that we can sample the discrete-time periodic piecewise bandlimited signal using a discrete-time periodic differentiated sinc sampling ernel ψ as defined in (3) with bandwidth [K(R +) B,B +K(R +)]. Corollary Consider a piecewise bandlimited signal x as defined in Definition. Let ψ[n] be the (R + )th differentiated sinc sampling ernel with bandwidth [K(R +) B,B+K(R +)].LetM be an integer divisor of, andlet/m (B +K(R +))+ then the samples y s [l] =<x[n],ψ[n lm] >, l =,...,/M () are a sufficient representation of x. Proof: The proof follows from Corollary and Theorem. In this case K(R + ) spectral values X PP [m] =X[m], m [B +,B+K(R +)] (3) are sufficient to recover the piecewise polynomial x PP. The bandlimited signal is recovered from the B + spectral components X B [m] =X[m] X PP [m], m [ B,B]. (4) Thus the piecewise bandlimited signal as defined in Definition is recovered x = x B + x PP. We are able to determine the (B +K(R +))+ spectralvalues of the signal from the DTFS of the sample values since Y s [m] = m ( W M )R+ X[m],m [,B+K(R +)]. (5) Figure 6illustrates the different steps in the sampling and the reconstruction of a bandlimited plus a piecewise constant signal using the following Algorithm Reconstruction of piecewise bandlimited signals. Require:,M,/M,B,R ; Calculate the samples y s [l] =<x[n],ψ[n lm] >, l =,...,/M, with /M (K(R +)+B)+;
6 Piecewise bandlimited signal Sample values Differentiated sinc sampling ernel DTFS of sample values discrete-time periodic streams of Diracs and discretetime periodic piecewise polynomials. We extended these sampling results to discrete-time piecewise bandlimited signals, that is, signals composed of a bandlimited signal with a stream of Diracs and the more general case with a piecewise polynomial signal. Sampling theorems for continuous-time piecewise bandlimited signals will naturally follow and is a topic under investigation REFERECES (c) (d) [] P. Marziliano. Sampling Innovations. PhD thesis, Swiss Federal Institute of Technology, Audiovisual Communications Laboratory, DSC, EPFL, CH-5, Lausanne, Switzerland, April. [] C. E. Shannon. Communications in the presence of noise. Proc. of the IRE, 37:, January 949. Figure 6: Piecewise bandlimited signal, x = x PP + x B, with K = 3, B = 5, R =, = 56; Differentiated sinc sampling ernel, ψ[n] =d[n] ϕ B+K(R+) [n], bandlimited to K(R +)+B = (c) Sample values y s [l] =< x[n],ψ[n lm] >, l =,...,/M, M =4;(d) DTFS of sample values; Reconstruction error is 3. Calculate the DTFS X[m],m [K(R +) B,B +K(R +)] from the DTFS of samples y s [l] X PP [m] =X[m],m [B +,B+K(R +)]; Solve for H the linear system of equations [3] P. Stoica and R. Moses. Introduction to Spectral Analysis. Prentice Hall,. [4] M. Unser. Sampling 5 years after Shannon. Proceedings of the IEEE, 88 4: , April. [5] M. Vetterli. Sampling of piecewise polynomial signals. In LCAV technical report, EPFL, Switzerland, Dec [6] M. Vetterli, P. Marziliano, and T. Blu. A sampling theorem for periodic piecewise polynomial signals. In IEEE Int. Conf. Acoust., Speech, and Signal Proc., Salt Lae City, USA, May. [7] M. Vetterli, P. Marziliano, and T. Blu. Sampling signals with finite rate of innovation. To be submitted. (H X PP )[m] =,m [B +,B+K(R +)]; Find x PP using H; Calculate X B [m] =X[m] X PP [m], m [ B,B]; Find x B from X B ; The reconstruction is x = x B + x PP. 4. COCLUSIO In this paper, we recalled sampling theorems for a specific class of non bandlimited signals in particular,
Sampling Signals of Finite Rate of Innovation*
Sampling Signals of Finite Rate of Innovation* Martin Vetterli http://lcavwww.epfl.ch/~vetterli EPFL & UCBerkeley.15.1.1.5.5.5.5.1.1.15.2 128 128 256 384 512 64 768 896 124 1152.15 128 128 256 384 512
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 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 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 informationSAMPLING plays an essential role in signal processing and
EDIC RESEARCH ROOSAL 1 Robust arametric Signal Estimations Hanjie an LCAV, I&C, EFL Abstract In this research proposal, we generalise the theory of sampling signals with finite rate of innovation FRI)
More informationSignals and Systems. Lecture 14 DR TANIA STATHAKI READER (ASSOCIATE PROFESSOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON
Signals and Systems Lecture 14 DR TAIA STATHAKI READER (ASSOCIATE PROFESSOR) I SIGAL PROCESSIG IMPERIAL COLLEGE LODO Introduction. Time sampling theorem resume. We wish to perform spectral analysis using
More informationVarious signal sampling and reconstruction methods
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
More informationSignal acquisition and reconstruction is at the heart of signal processing, and. Sparse Sampling of Signal Innovations
DIGITAL VISION Sparse Sampling of Signal Innovations PHOTO CREDIT [Theory, algorithms, and performance bounds] [ Thierry Blu, Pier-Luigi Dragotti, Martin Vetterli, Pina Marziliano, and Lionel Coulot ]
More informationQuantization and Compensation in Sampled Interleaved Multi-Channel Systems
Quantization and Compensation in Sampled Interleaved Multi-Channel Systems The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation
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 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 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 informationOptimized Compact-support Interpolation Kernels
Optimized Compact-support Interpolation Kernels Ramtin Madani, Student Member, IEEE, Ali Ayremlou, Student Member, IEEE, Arash Amini, Farrokh Marvasti, Senior Member, IEEE, Abstract In this paper, we investigate
More informationModule 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals
Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals Objectives Scope of this lecture: If a Continuous Time (C.T.) signal is to be uniquely represented
More information5310 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 61, NO. 21, NOVEMBER 1, FRI Sampling With Arbitrary Kernels
5310 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 61, NO 21, NOVEMBER 1, 2013 FRI Sampling With Arbitrary Kernels Jose Antonio Urigüen, Student Member, IEEE, Thierry Blu, Fellow, IEEE, and Pier Luigi Dragotti,
More informationTORWARDS A GENERAL FORMULATION FOR OVER-SAMPLING AND UNDER-SAMPLING
TORWARDS A GEERAL FORMULATIO FOR OVER-SAMPLIG AD UDER-SAMPLIG Aira Hirabayashi 1 and Laurent Condat 2 1 Dept. of Information Science and Engineering, Yamaguchi University, 2-16-1, Toiwadai, Ube 755-8611,
More informationFourier Series Representation of
Fourier Series Representation of Periodic Signals Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline The response of LIT system
More informationWavelet Footprints: Theory, Algorithms, and Applications
1306 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 51, NO. 5, MAY 2003 Wavelet Footprints: Theory, Algorithms, and Applications Pier Luigi Dragotti, Member, IEEE, and Martin Vetterli, Fellow, IEEE Abstract
More informationECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.
ECE 35 Spring - Final Exam 9 May ECE 35 Signals and Systems Spring Final Exam - Solutions Three 8 ½ x sheets of notes, and a calculator are allowed during the exam Write all answers neatly and show your
More informationLecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 8: Signal Reconstruction, D vs C Processing Oct 24, 2001 Prof: J. Bilmes
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationEEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2:
EEM 409 Random Signals Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Consider a random process of the form = + Problem 2: X(t) = b cos(2π t + ), where b is a constant,
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 information2334 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 6, JUNE and X/$ IEEE
2334 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 56, NO 6, JUNE 2008 A Theory for Sampling Signals From a Union of Subspaces Yue M Lu, Member, IEEE, Minh N Do, Senior Member, IEEE Abstract One of the fundamental
More informationVII. Bandwidth Limited Time Series
VII. Bandwidth Limited Time Series To summarize the discussion up to this point: (1) In the general case of the aperiodic time series, which is infinite in time and frequency, both the time series and
More informationDiscrete-Time Signals and Systems. Efficient Computation of the DFT: FFT Algorithms. Analog-to-Digital Conversion. Sampling Process.
iscrete-time Signals and Systems Efficient Computation of the FT: FFT Algorithms r. eepa Kundur University of Toronto Reference: Sections 6.1, 6., 6.4, 6.5 of John G. Proakis and imitris G. Manolakis,
More informationECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are
ECE-7 Review Phil Schniter January 5, 7 ransforms Using x c (t) to denote a continuous-time signal at time t R, Laplace ransform: X c (s) x c (t)e st dt, s C Continuous-ime Fourier ransform (CF): ote that:
More informationSAMPLING JITTER CORRECTION USING FACTOR GRAPHS
19th European Signal Processing Conference EUSIPCO 11) Barcelona, Spain, August 9 - September, 11 SAMPLING JITTER CORRECTION USING FACTOR GRAPHS Lukas Bolliger and Hans-Andrea Loeliger ETH Zurich Dept.
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 informationNAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.
University of California at Berkeley Department of Electrical Engineering and Computer Sciences Professor J. M. Kahn, EECS 120, Fall 1998 Final Examination, Wednesday, December 16, 1998, 5-8 pm NAME: 1.
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 8: February 12th, 2019 Sampling and Reconstruction Lecture Outline! Review " Ideal sampling " Frequency response of sampled signal " Reconstruction " Anti-aliasing
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 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 informationSampling in the Age of Sparsity
Sampling in the Age of Sparsity Martin Vetterli EPFL & UC Berkeley BOAT WAKE Pete Turner Acknowledgements Sponsors and supporters Conference organizers, PinaMarziliano in particular! NSF Switzerland and
More informationEach of these functions represents a signal in terms of its spectral components in the frequency domain.
N INTRODUCTION TO SPECTRL FUNCTIONS Revision B By Tom Irvine Email: tomirvine@aol.com March 3, 000 INTRODUCTION This tutorial presents the Fourier transform. It also discusses the power spectral density
More informationECGR4124 Digital Signal Processing Midterm Spring 2010
ECGR4124 Digital Signal Processing Midterm Spring 2010 Name: LAST 4 DIGITS of Student Number: Do NOT begin until told to do so Make sure that you have all pages before starting Open book, 1 sheet front/back
More informationGeneralized Sidelobe Canceller and MVDR Power Spectrum Estimation. Bhaskar D Rao University of California, San Diego
Generalized Sidelobe Canceller and MVDR Power Spectrum Estimation Bhaskar D Rao University of California, San Diego Email: brao@ucsd.edu Reference Books 1. Optimum Array Processing, H. L. Van Trees 2.
More informationOPTIMUM ANALOG RECEIVE FILTERS FOR DETECTION AND INFERENCE UNDER A SAMPLING RATE CONSTRAINT
04 IEEE International Conference on Acoustic, Speech and Signal Processing (ICASSP) OPTIMUM AALOG RECEIVE FILTERS FOR DETECTIO AD IFERECE UDER A SAMPLIG RATE COSTRAIT Manuel Stein, Andreas Lenz, Amine
More informationCONSTRUCTION OF AN ORTHONORMAL COMPLEX MULTIRESOLUTION ANALYSIS. Liying Wei and Thierry Blu
CONSTRUCTION OF AN ORTHONORMAL COMPLEX MULTIRESOLUTION ANALYSIS Liying Wei and Thierry Blu Department of Electronic Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong ABSTRACT We
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 informationMEDE2500 Tutorial Nov-7
(updated 2016-Nov-4,7:40pm) MEDE2500 (2016-2017) Tutorial 3 MEDE2500 Tutorial 3 2016-Nov-7 Content 1. The Dirac Delta Function, singularity functions, even and odd functions 2. The sampling process and
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 information6.003: Signals and Systems. Sampling and Quantization
6.003: Signals and Systems Sampling and Quantization December 1, 2009 Last Time: Sampling and Reconstruction Uniform sampling (sampling interval T ): x[n] = x(nt ) t n Impulse reconstruction: x p (t) =
More informationIntroduction to Signal Spaces
Introduction to Signal Spaces Selin Aviyente Department of Electrical and Computer Engineering Michigan State University January 12, 2010 Motivation Outline 1 Motivation 2 Vector Space 3 Inner Product
More informationECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.
ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Consider the following periodic signal, depicted below: {, if n t < n +, for any integer n,
More informationEE 225a Digital Signal Processing Supplementary Material
EE 225A DIGITAL SIGAL PROCESSIG SUPPLEMETARY MATERIAL EE 225a Digital Signal Processing Supplementary Material. Allpass Sequences A sequence h a ( n) ote that this is true iff which in turn is true iff
More informationWavelets and Filter Banks
Wavelets and Filter Banks Inheung Chon Department of Mathematics Seoul Woman s University Seoul 139-774, Korea Abstract We show that if an even length filter has the same length complementary filter in
More informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More informationRepresenting a Signal
The Fourier Series Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity and timeinvariance of the system and represents the
More informationLecture 7: Interpolation
Lecture 7: Interpolation ECE 401: Signal and Image Analysis University of Illinois 2/9/2017 1 Sampling Review 2 Interpolation and Upsampling 3 Spectrum of Interpolated Signals Outline 1 Sampling Review
More informationOn the Hilbert Transform of Wavelets
On the Hilbert Transform of Wavelets Kunal Narayan Chaudhury and Michael Unser Abstract A wavelet is a localized function having a prescribed number of vanishing moments. In this correspondence, we provide
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 proposed Optimized Spline Interpolation
1 A proposed Optimized Spline Interpolation Ramtin Madani, Student Member, IEEE, Ali Ayremlou, Student Member, IEEE, Arash Amini, Farrokh Marvasti, Senior Member, IEEE, arxiv:10120397v2 [csmm] 29 Apr 2011
More informationEach problem is worth 25 points, and you may solve the problems in any order.
EE 120: Signals & Systems Department of Electrical Engineering and Computer Sciences University of California, Berkeley Midterm Exam #2 April 11, 2016, 2:10-4:00pm Instructions: There are four questions
More informationPOLYNOMIAL SINGULAR VALUES FOR NUMBER OF WIDEBAND SOURCES ESTIMATION AND PRINCIPAL COMPONENT ANALYSIS
POLYNOMIAL SINGULAR VALUES FOR NUMBER OF WIDEBAND SOURCES ESTIMATION AND PRINCIPAL COMPONENT ANALYSIS Russell H. Lambert RF and Advanced Mixed Signal Unit Broadcom Pasadena, CA USA russ@broadcom.com Marcel
More informationWhich wavelet bases are the best for image denoising?
Which wavelet bases are the best for image denoising? Florian Luisier a, Thierry Blu a, Brigitte Forster b and Michael Unser a a Biomedical Imaging Group (BIG), Ecole Polytechnique Fédérale de Lausanne
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 informationA generalized Prony method for sparse approximation
A generalized Prony method for sparse approximation Gerlind Plonka and Thomas Peter Institute for Numerical and Applied Mathematics University of Göttingen Dolomites Research Week on Approximation September
More informationCo-Prime Arrays and Difference Set Analysis
7 5th European Signal Processing Conference (EUSIPCO Co-Prime Arrays and Difference Set Analysis Usham V. Dias and Seshan Srirangarajan Department of Electrical Engineering Bharti School of Telecommunication
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 informationSector-Disk Codes and Partial MDS Codes with up to Three Global Parities
Sector-Disk Codes and Partial MDS Codes with up to Three Global Parities Junyu Chen Department of Information Engineering The Chinese University of Hong Kong Email: cj0@alumniiecuhkeduhk Kenneth W Shum
More informationDiscrete-Time Fourier Transform
C H A P T E R 7 Discrete-Time Fourier Transform In Chapter 3 and Appendix C, we showed that interesting continuous-time waveforms x(t) can be synthesized by summing sinusoids, or complex exponential signals,
More informationConstructing Approximation Kernels for Non-Harmonic Fourier Data
Constructing Approximation Kernels for Non-Harmonic Fourier Data Aditya Viswanathan aditya.v@caltech.edu California Institute of Technology SIAM Annual Meeting 2013 July 10 2013 0 / 19 Joint work with
More informationLecture 3 January 23
EE 123: Digital Signal Processing Spring 2007 Lecture 3 January 23 Lecturer: Prof. Anant Sahai Scribe: Dominic Antonelli 3.1 Outline These notes cover the following topics: Eigenvectors and Eigenvalues
More informationOn the Accuracy and Resolution of Powersum-based Sampling Methods
TO APPEAR IN IEEE TRANS. SIGNAL PROCESSING On the Accuracy and Resolution of Powersum-based Sampling Methods Julius Kusuma, Member, IEEE, and Vivek K Goyal, Senior Member, IEEE Abstract Recently several
More informationDirection of Arrival Estimation: Subspace Methods. Bhaskar D Rao University of California, San Diego
Direction of Arrival Estimation: Subspace Methods Bhaskar D Rao University of California, San Diego Email: brao@ucsdedu Reference Books and Papers 1 Optimum Array Processing, H L Van Trees 2 Stoica, P,
More informationDigital Speech Processing Lecture 10. Short-Time Fourier Analysis Methods - Filter Bank Design
Digital Speech Processing Lecture Short-Time Fourier Analysis Methods - Filter Bank Design Review of STFT j j ˆ m ˆ. X e x[ mw ] [ nˆ m] e nˆ function of nˆ looks like a time sequence function of ˆ looks
More informationHow many Fourier samples are needed for real function reconstruction?
How many Fourier samples are needed for real function reconstruction? Gerlind Plonka Marius Wischerhoff October 26, 2012 Abstract In this paper we present some new results on the reconstruction of structured
More informationTopic 3: Fourier Series (FS)
ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING
GEORGIA INSIUE OF ECHNOLOGY SCHOOL of ELECRICAL and COMPUER ENGINEERING ECE 6250 Spring 207 Problem Set # his assignment is due at the beginning of class on Wednesday, January 25 Assigned: 6-Jan-7 Due
More information2D Wavelets. Hints on advanced Concepts
2D Wavelets Hints on advanced Concepts 1 Advanced concepts Wavelet packets Laplacian pyramid Overcomplete bases Discrete wavelet frames (DWF) Algorithme à trous Discrete dyadic wavelet frames (DDWF) Overview
More informationMultirate Digital Signal Processing
Multirate Digital Signal Processing Basic Sampling Rate Alteration Devices Up-sampler - Used to increase the sampling rate by an integer factor Down-sampler - Used to decrease the sampling rate by an integer
More informationMaximally Flat Lowpass Digital Differentiators
Maximally Flat Lowpass Digital Differentiators Ivan W. Selesnick August 3, 00 Electrical Engineering, Polytechnic University 6 Metrotech Center, Brooklyn, NY 0 selesi@taco.poly.edu tel: 78 60-36 fax: 78
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 Homework 13 - Solutions
EE3054 - Homework 3 - Solutions. (a) The Laplace transform of e t u(t) is s+. The pole of the Laplace transform is at which lies in the left half plane. Hence, the Fourier transform is simply the Laplace
More informationOptimized Spline Interpolation
1 Optimized Spline Interpolation Ramtin Madani, Student Member, IEEE, Ali Ayremlou, Student Member, IEEE, Arash Amini, Farrokh Marvasti, Senior Member, IEEE, arxiv:11050011v1 [csmm] 29 Apr 2011 Abstract
More information3-D Directional Filter Banks and Surfacelets INVITED
-D Directional Filter Bans and Surfacelets INVITED Yue Lu and Minh N. Do Department of Electrical and Computer Engineering Coordinated Science Laboratory University of Illinois at Urbana-Champaign, Urbana
More informationINFINITUDE OF MINIMALLY SUPPORTED TOTALLY INTERPOLATING BIORTHOGONAL MULTIWAVELET SYSTEMS WITH LOW APPROXIMATION ORDERS. Youngwoo Choi and Jaewon Jung
Korean J. Math. (0) No. pp. 7 6 http://dx.doi.org/0.68/kjm.0...7 INFINITUDE OF MINIMALLY SUPPORTED TOTALLY INTERPOLATING BIORTHOGONAL MULTIWAVELET SYSTEMS WITH LOW APPROXIMATION ORDERS Youngwoo Choi and
More informationOn the Frequency-Domain Properties of Savitzky-Golay Filters
On the Frequency-Domain Properties of Savitzky-Golay Filters Ronald W Schafer HP Laboratories HPL-2-9 Keyword(s): Savitzky-Golay filter, least-squares polynomial approximation, smoothing Abstract: This
More informationNoise-Shaped Predictive Coding for Multiple Descriptions of a Colored Gaussian Source
Noise-Shaped Predictive Coding for Multiple Descriptions of a Colored Gaussian Source Yuval Kochman, Jan Østergaard, and Ram Zamir Abstract It was recently shown that the symmetric multiple-description
More informationSensitivity of hybrid filter banks A/D converters to analog realization errors and finite word length
Sensitivity of hybrid filter banks A/D converters to analog realization errors and finite word length Tudor Petrescu, Jacques Oksman To cite this version: Tudor Petrescu, Jacques Oksman. Sensitivity of
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 informationA STATE-SPACE APPROACH FOR THE ANALYSIS OF WAVE AND DIFFUSION FIELDS
ICASSP 2015 A STATE-SPACE APPROACH FOR THE ANALYSIS OF WAVE AND DIFFUSION FIELDS Stefano Maranò Donat Fäh Hans-Andrea Loeliger ETH Zurich, Swiss Seismological Service, 8092 Zürich ETH Zurich, Dept. Information
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 informationParametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d)
Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d) Electrical & Computer Engineering North Carolina State University Acknowledgment: ECE792-41 slides
More informationThe Poisson summation formula, the sampling theorem, and Dirac combs
The Poisson summation ormula, the sampling theorem, and Dirac combs Jordan Bell jordanbell@gmailcom Department o Mathematics, University o Toronto April 3, 24 Poisson summation ormula et S be the set o
More informationLIKELIHOOD-BASED ESTIMATION OF PERIODICITIES IN SYMBOLIC SEQUENCES. Dept. of Mathematical Statistics, Lund University, Sweden
LIKELIHOOD-BASED ESTIMATION OF PERIODICITIES IN SYMBOLIC SEQUENCES Stefan Ingi Adalbjörnsson, Johan Swärd, and Andreas Jaobsson Dept. of Mathematical Statistics, Lund University, Sweden ABSTRACT In this
More informationGENERALIZATION OF CAMPBELL S THEOREM TO NONSTATIONARY NOISE. Leon Cohen
GENERALIZATION OF CAMPBELL S THEOREM TO NONSTATIONARY NOISE Leon Cohen City University of New York, Hunter College, 695 Park Ave, New York NY 10056, USA ABSTRACT Campbell s theorem is a fundamental result
More informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationA Family of Nyquist Filters Based on Generalized Raised-Cosine Spectra
Proc. Biennial Symp. Commun. (Kingston, Ont.), pp. 3-35, June 99 A Family of Nyquist Filters Based on Generalized Raised-Cosine Spectra Nader Sheikholeslami Peter Kabal Department of Electrical Engineering
More informationReconstruction of graph signals: percolation from a single seeding node
Reconstruction of graph signals: percolation from a single seeding node Santiago Segarra, Antonio G. Marques, Geert Leus, and Alejandro Ribeiro Abstract Schemes to reconstruct signals defined in the nodes
More informationChapter 2: The Fourier Transform
EEE, EEE Part A : Digital Signal Processing Chapter Chapter : he Fourier ransform he Fourier ransform. Introduction he sampled Fourier transform of a periodic, discrete-time signal is nown as the discrete
More informationCapacity Bounds for Power- and Band-Limited Wireless Infrared Channels Corrupted by Gaussian Noise
40th Annual Allerton Conference on Communications, Control, and Computing, U.Illinois at Urbana-Champaign, Oct. 2-4, 2002, Allerton House, Monticello, USA. Capacity Bounds for Power- and Band-Limited Wireless
More informationReview: Continuous Fourier Transform
Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationMETRIC HEIGHTS ON AN ABELIAN GROUP
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 44, Number 6, 2014 METRIC HEIGHTS ON AN ABELIAN GROUP CHARLES L. SAMUELS ABSTRACT. Suppose mα) denotes the Mahler measure of the non-zero algebraic number α.
More informationL6: Short-time Fourier analysis and synthesis
L6: Short-time Fourier analysis and synthesis Overview Analysis: Fourier-transform view Analysis: filtering view Synthesis: filter bank summation (FBS) method Synthesis: overlap-add (OLA) method STFT magnitude
More informationComments on Hilbert Transform Based Signal Analysis
Brigham Young University Department of Electrical and Computer Engineering 459 Clyde Building Provo, Utah 84602 Comments on Hilbert Transform Based Signal Analysis David G. Long, Ph.D. Original: 15 June
More informationSystem Identification and Adaptive Filtering in the Short-Time Fourier Transform Domain
System Identification and Adaptive Filtering in the Short-Time Fourier Transform Domain Electrical Engineering Department Technion - Israel Institute of Technology Supervised by: Prof. Israel Cohen Outline
More information