DOCSLIB.ORG

ECE4330 Lecture 23 Sampling and Signal Reconstruction Prof

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ECE4330 Lecture 23 Sampling and Signal Reconstruction Prof ECE4330 Lecture 23 Sampling and Signal Reconstruction Prof. Mohamad Hassoun Sampling of Continuous-Time Analog Signals Discrete-time system implementation is very convenient because it takes advantage of the flexibility and efficiency of digital processors. In practice, most discrete-time systems require us to discretize the (physical) continuous input signal. A sequence 푓[푛] (or 푓[푘]) can be obtained from a continuous-time signal 푓(푡) through sampling. Here, the value of 푓[푛] for some integer 푛 is equal to 푓(푛푇푠), the value of 푓(푡) at time 푡 = 푛푇푠. So, we sample at regular intervals of width 푇푠 seconds or, equivalently, with a 1 sampling rate of 푓푠 = Hz. It is kind of intuitive to argue that sampling 푇푠 generally leads to loss of signal information. But we may also argue that this loss of information about the signal 푓(푡) can be made insignificant if we sample at a very high rate (i.e., select very small 푇푠). The question now is whether or not, for a finite sampling rate, 푓푠, we can perfectly reconstruct 푓(푡) from its samples, 푓[푛]. If the answer is yes, then we need to answer the following questions: (1) What is a sufficient sampling rate that allows for perfect signal reconstruction? (2) Are there restrictions on the nature of the continuous-time signal 푓(푡) being sampled? (3) Can we derive a formula to reconstruct 푓(푡) from its samples 푓[푛]? (4) Can we realize a physical (or simulated) system that accepts 푓[푛] and generates 푓(푡)? Surprisingly, the answer to the above questions is affirmative. This is captured by Shannon’s Sampling Theorem: Let 푓(푡) be a real-valued, continuous-time, bandlimited (finite bandwidth) signal with bandwidth 퐵. And let 푓[푛] be the sequence of numbers obtained by sampling 푓(푡) at a sampling rate of 푓푠 samples per second (Hz); i.e., a sample is taken every 1 푇푠 = seconds. Then, 푓(푡) can be perfectly reconstructed from its 푓푠 samples 푓[푛] if and only if 푓푠 > 2퐵. The sampling rate must exceed twice the bandwidth of the signal (2퐵 is referred to as Nyquist sampling rate). Furthermore, 푓(푡) can be uniquely reconstructed by the following interpolation formula: ∞ ∞ sin [휋푓푠(푡 − 푛푇푠)] 푓(푡) = ∑ 푓(푛푇푠) = ∑ 푓[푛]sinc [휋푓푠(푡 − 푛푇푠)] 휋푓푠(푡 − 푛푇푠) 푛=−∞ 푛=−∞ In the remainder of this lecture, we will prove the Sampling Theorem and discuss its practical applications to storage and reconstruction of digital data. Again, we will witness the importance of Fourier methods (transform and series) in the analysis and design of sampling systems. The Sampling Process Today, digital computers are used to store and process physical and synthetic signals in the form of digital data. For example, an audio signal picked up by the microphone of your laptop or smart phone is first sampled and then digitized (amplitude converted into binary code) prior to processing or storage on disk. Later, before the digital audio signal can drive a speaker, the digital amplitudes (binary code) must be converted back into analog values and then reconstructed as a continuous-time signal. The analog to digital conversion is performed using an analog-to- digital convertor (ADC) circuit. Similarly, the digital to analog conversion is performed using a digital-to-analog (DAC) circuit. The following figure illustrates such steps. In the remainder of this lecture, we will use 푓(푛푇푠) to signify the sampled signal. We will also use the symbol 푓[푛] to represent the value of the 푛th sample of 푓(푡) at time 푛푇푠. It should be stressed here that 푓[푛] is a sequence of numbers. It does not retain any information about the sampling rate or time (i.e., it can’t be displayed on an oscilloscope). On the other hand, 푓(푛푇푠) is the true sampled signal that position its non-zero values at exact time instances, 푛푇푠 (this signal will display physically on an oscilloscope). We will have more to say about this in the next lecture. As we will see, the real signal 푓(푡) is generally not bandlimited, therefore the reconstructed signal will have some degree of distortion. Another source of distortion is the approximate nature of the reconstruction filter (a low-pass filter) that is used to reconstruct (interpolate) the signal. Sampling, in theory, consists of simply modulating (multiplying) the signal 푓(푡) by another signal, 훿푠(푡), which consists of a train of unit- impulses separated (in time) by 푇푠 seconds. We will refer to the sampled signal as 푔(푡), and express it analytically as ∞ 푔(푡) = 푓(푡)훿푠(푡) = 푓(푡) ∑ 훿(푡 − 푛푇푠) 푛=−∞ Employing the sampling property of the delta function [namely, 푓(푡)훿(푡 − 푎) = 푓(푎)훿(푡 − 푎)] we may express the above expression as ∞ 푔(푡) = ∑ 푓(푛푇푠)훿(푡 − 푛푇푠) 푛=−∞ The following figure depicts the sampling process for an arbitrary, bandlimited signal. We may now gain a better picture of the sampling process by considering the signals in the frequency domain. Let us apply the Fourier transform to the sampled signal ∞ 푔(푡) = 푓(푡)훿푠(푡) = 푓(푡) ∑ 훿(푡 − 푛푇푠) (1) 푛=−∞ We will employ the frequency-convolution property 푓1(푡)푓2(푡) ↔ 1 퐹 (휔) ∗ 퐹 (휔). We may also note that 훿 (푡) is a periodic signal (of 2휋 1 2 푠 2휋 fundamental frequency 휔푠 = = 2휋푓푠) having the following exponential 푇푠 Fourier series representation (derive it! This was assigned in Lecture 15) ∞ ∞ ∞ 1 휔푠 푗푛휔푠푡 푗푛휔푠푡 훿푠(푡) = ∑ 훿(푡 − 푛푇푠) = ∑ 푒 = ∑ 푒 푇푠 2휋 푛=−∞ 푛=−∞ 푛=−∞ 푗푛휔표푡 By employing the Fourier Pair 푒 ↔ 2휋훿(휔 − 푛휔표) and the superposition property, then the Fourier transform of 훿푠(푡) would be ∞ 퐹{훿푠(푡)} = 휔푠 ∑ 훿(휔 − 푛휔푠) 푛=−∞ Transforming the signal 푔(푡) = 푓(푡)훿푠(푡) we obtain ∞ ∞ 1 휔 퐺(휔) = 퐹(휔) ∗ [휔 ∑ 훿(휔 − 푛휔 )] = 푠 ∑ 퐹(휔 − 푛휔 ) 2휋 푠 푠 2휋 푠 푛=−∞ 푛=−∞ where the distributive property and the convolution with a shifted impulse, 퐹(휔) ∗ 훿(휔 − 푛휔푠) = 퐹(휔 − 푛휔푠) were applied. We may also, for convenience, express the above result in terms of the Hz frequency, 푓, as 휔 (recall that 푓 = 푠) 푠 2휋 ∞ 퐺(푓) = ∑ 푓푠퐹(푓 − 푛푓푠) 푛=−∞ [Do not confuse the Hz frequencies 푓 and 푓푠 with the signal 푓(푡). ] The above equation represents a very important and elegant result. It states that, in the frequency domain, the sampled signal is essentially a superposition of shifted (by integer multiples of the sampling frequency, 푓푠) versions of the spectrum of the signal 푓(푡). Also, the amplitude of the spectrum 퐺(푓) is scaled by the sampling rate, 푓푠. The following figure depicts, graphically, the magnitude spectra |퐹(푓)| and |퐺(푓)| as a function of frequency, 푓. Note how the magnitude spectrum |퐹(푓)| is duplicated every 푓푠 (Hz) in the spectrum for |퐺(푓)|. These duplicates are known as the image spectra. It shows that if the sampling frequency 푓푠 is twice the bandwidth (i.e., 푓푠 = 2퐵) of the bandlimited signal 푓(푡), then there will be no overlap between |퐹(푓)| and its images, therefore an ideal (brick-wall) low-pass filter with a 푓 cutoff frequency 푓 = 푠 = 퐵 (and dc gain 푇 ) can be used to perfectly 표 2 푠 reconstruct 푓(푡) (refer to the following figure, Part 푐). Increasing the sampling rate beyond 2퐵 (푓푠 > 2퐵) allows for further separation between |퐹(푓)| and its adjacent image spectra, and may allow for a practical filter (say a 4th or higher order Butterworth filter) to properly reconstruct the signal 푓(푡) [refer to (푑) in the following figure]. On the other hand if we under sample, 푓푠 < 2퐵, then there will be overlap with the image spectra and the reconstructed signal will always have distortion (aliasing) [refer to (푏) in the following figure]. The 푓푠 = 2퐵 threshold value on the sampling frequency is known as the Nyquist sampling rate. There are some special bandlimited signals that require the sampling frequency to strictly exceed this sampling rate for perfect reconstruction. Also, for non-bandlimited signals with effective bandwidth 퐵, 푓푠 would have to significantly exceed 2퐵. Your turn: Consider 푓(푡) = sin(2휋푡) sampled at the Nyquist rate, 푓푠 = 2Hz. Can the reconstruction lead to a unique signal? Explain. Your turn: Compute the Nyquist sampling rate [think (95%) effective bandwidth 퐵; Lecture 18] for reconstructing the signal 푓(푡) = 0.5푒−|푡| from its samples. Sketch the spectrum, 퐺(푓), of the sampled signal assuming: (1) 푓푠 = 2퐵, (2) 푓푠 = 4퐵 and (3) 푓푠 = 8퐵. What is the smallest sampling rate that is appropriate for this non bandlimited signal? Explain. Your turn: Repeat the above problem assuming the signal (휎 = 0.5) 푡2 − 푓(푡) = 푒 2휎2 The Sinc Interpolation Formula Next, we derive an analytical formula for reconstructing the signal 푓(푡) from its samples. Assuming the sampling condition 푓푠 ≥ 2퐵 and a brick- wall low-pass reconstruction filter, we may solve for the (zero-state) output 푦(푡) of the filter by convoluting 푔(푡) with the unit-impulse response, ℎ(푡), of the filter, 푦(푡) = 푔(푡) ∗ ℎ(푡). The transfer function of 푓 the filter (a rectangular, brick-wall spectrum with cutoff frequency 푠 and a 2 1 푓 dc gain 푇푠) can be expressed as 퐻(푓) = rect ( ), or 퐻(휔) = 푓푠 푓푠 2휋 휔 rect ( ). We may employ Fourier Pair #18 which is reproduced below 휔푠 휔푠 to find the filter’s impulse response, 2휋 휔푠 휔푠 ℎ(푡) = ( ) ( ) sinc ( 푡) = sinc(휋푓푠푡) 휔푠 2휋 2 sin(휋푓푠푡) where sinc(휋푓푠푡) = .
Load more

Recommended publications
  • CHAPTER 3 ADC and DAC
    CHAPTER 3 ADC and DAC Most of the signals directly encountered in science and engineering are continuous: light intensity that changes with distance; voltage that varies over time; a chemical reaction rate that depends on temperature, etc. Analog-to-Digital Conversion (ADC) and Digital-to-Analog Conversion (DAC) are the processes that allow digital computers to interact with these everyday signals. Digital information is different from its continuous counterpart in two important respects: it is sampled, and it is quantized. Both of these restrict how much information a digital signal can contain. This chapter is about information management: understanding what information you need to retain, and what information you can afford to lose. In turn, this dictates the selection of the sampling frequency, number of bits, and type of analog filtering needed for converting between the analog and digital realms. Quantization First, a bit of trivia. As you know, it is a digital computer, not a digit computer. The information processed is called digital data, not digit data. Why then, is analog-to-digital conversion generally called: digitize and digitization, rather than digitalize and digitalization? The answer is nothing you would expect. When electronics got around to inventing digital techniques, the preferred names had already been snatched up by the medical community nearly a century before. Digitalize and digitalization mean to administer the heart stimulant digitalis. Figure 3-1 shows the electronic waveforms of a typical analog-to-digital conversion. Figure (a) is the analog signal to be digitized. As shown by the labels on the graph, this signal is a voltage that varies over time.
    [Show full text]
  • Efficient Implementations of Discrete Wavelet Transforms Using Fpgas Deepika Sripathi
    Florida State University Libraries Electronic Theses, Treatises and Dissertations The Graduate School 2003 Efficient Implementations of Discrete Wavelet Transforms Using Fpgas Deepika Sripathi Follow this and additional works at the FSU Digital Library. For more information, please contact [email protected] THE FLORIDA STATE UNIVERSITY COLLEGE OF ENGINEERING EFFICIENT IMPLEMENTATIONS OF DISCRETE WAVELET TRANSFORMS USING FPGAs By DEEPIKA SRIPATHI A Thesis submitted to the Department of Electrical and Computer Engineering in partial fulfillment of the requirements for the degree of Master of Science Degree Awarded: Fall Semester, 2003 The members of the committee approve the thesis of Deepika Sripathi defended on November 18th, 2003. Simon Y. Foo Professor Directing Thesis Uwe Meyer-Baese Committee Member Anke Meyer-Baese Committee Member Approved: Reginald J. Perry, Chair, Department of Electrical and Computer Engineering The office of Graduate Studies has verified and approved the above named committee members ii ACKNOWLEDGEMENTS I would like to express my gratitude to my major professor, Dr. Simon Foo for his guidance, advice and constant support throughout my thesis work. I would like to thank him for being my advisor here at Florida State University. I would like to thank Dr. Uwe Meyer-Baese for his guidance and valuable suggestions. I also wish to thank Dr. Anke Meyer-Baese for her advice and support. I would like to thank my parents for their constant encouragement. I would like to thank my husband for his cooperation and support. I wish to thank the administrative staff of the Electrical and Computer Engineering Department for their kind support. Finally, I would like to thank Dr.
    [Show full text]
  • Post-Sampling Aliasing Control for Natural Images
    POST-SAMPLING ALIASING CONTROL FOR NATURAL IMAGES Dinei A. F. Florêncio and Ronald W. Schafer Digital Signal Processing Laboratory School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta, Georgia 30332 f1orenceedsp . gatech . edu rws@eedsp . gatech . edu ABSTRACT Shannon sampling theorem, and can be useful in developing Sampling and recollstruction are usuaiiy analyzed under better pre- and post-filters based on non-linear techniques. the framework of linear signal processing. Powerful tools Critical Morphological Sampling is similar to traditional like the Fourier transform and optimum linear filter design techniques in the sense that it also requires pre-ifitering be- techniques, allow for a very precise analysis of the process. fore subsampling. In some applications, this pre-ifitering In particular, an optimum linear filter of any length can be maybe undesirable, or even impossible, in which case the derived under most situations. Many of these tools are not signal is simply subsampled, without any pre-filtering, or available for non—linear systems, and it is usually difficult to a very simple filter is used. An example of increasing im find an optimum non4inear system under any criteria. In portance is video processing, where the high data rate and this paper we analyze the possibility of using non-linear fil memory restrictions often limit the filtering to very short tering in the interpolation of subsampled images. We show windows. that a very simple (5x5) non-linear reconstruction filter out- In this paper we show how it is possible to reduce performs (for the images analyzed) linear filters of up to the effects of aliasing by using non-linear reconstruction 256x256, including optimum (separable) Wiener filters of techniques.
    [Show full text]
  • Compensation of Reconstruction Filter Effect in Digital Signal Processing System
    Journal of Signal Processing, Vol.18, No.3, pp.121-134, May 2014 PAPER Compensation of Reconstruction Filter Effect in Digital Signal Processing System Sukanya Praesomboon1, Kobchai Dejhan1 and Surapun Yimman2 1Faculty of Engineering, King Mongkut’s Institute of Technology Ladkrabang, Bangkok 10520, Thailand 2Faculty of Applied Science, King Mongkut’s University of Technology North Bangkok, Bangkok 10800, Thailand E-mail: [email protected], [email protected], [email protected] Abstract This paper proposes the reduction effect of reconstruction filter for digital signal processing system. It is well known that the reconstruction filter limits the bandwidth of output signal processing and the output signal is staircase form or has high frequency components. For effect reduction we use the nonrecursive system which corresponds with the inverse system function of the reconstruction filter. The initial step starts with the analog system function of the reconstruction filter and is converted to a discrete-time system using the approximation of derivative technique and inverse system. This inverse discrete-time system function is a nonrecursive system to compensate the reduction effect of the reconstruction filter implemented by using the software. For hardware experiments, we use TMS320C31 digital signal processor, D/A, PIC-32 microcontroller, PWM analog output. The experimental results of the proposed principle show that it can be used to compensate the bandwidth and reduce the total harmonic distortion (THD) of high frequency signal. In addition, this experiment shows that the nonrecursive system for compensation uses only first-order system and it does not utilizes any more processor. Furthermore, it is able to increase the performance.
    [Show full text]
  • Oversampled Perfect Reconstruction Filter Bank Transceivers
    Oversampled Perfect Reconstruction Filter Bank Transceivers Siavash Rahimi Department of Electrical & Computer Engineering McGill University Montreal, Canada March 2014 A thesis submitted to McGill University in partial fulfillment of the requirements for the degree of Doctor of Philosophy. c 2014 Siavash Rahimi 2014/03/05 i Contents 1 Introduction 1 1.1 Multicarrier Modulation ............................ 1 1.2 Literature Review ................................ 3 1.2.1 Oversampled perfect reconstruction filter bank ............ 5 1.2.2 Synchronization and equalization ................... 6 1.2.3 Extension to multi-user applications .................. 8 1.3 Thesis Objectives and Contributions ..................... 9 1.4 Thesis Organization and Notations ...................... 12 2 Background on Filter Bank Multicarrier Modulation 14 2.1 OFDM ...................................... 15 2.1.1 The Cyclic Prefix ............................ 17 2.1.2 OFDM Challenges ........................... 19 2.2 Multirate Filter Banks ............................. 22 2.2.1 Basic Multirate Operations ...................... 24 2.2.2 Transceiver Transfer Relations and Reconstruction Conditions . 29 2.2.3 Modulated Filter Banks ........................ 32 2.2.4 Oversampled Filter Banks ....................... 37 2.3 A Basic Survey of Different FBMC Types .................. 39 2.3.1 Cosine Modulated Multitone ...................... 39 2.3.2 OFDM/OQAM ............................. 41 2.3.3 FMT ................................... 45 2.3.4 DFT modulated OPRFB ........................ 46 Contents ii 3 OPRFB Transceivers 47 3.1 Background and Problem Formulation .................... 47 3.2 A Factorization of Polyphase Matrix P(z) .................. 51 3.2.1 Preliminary Factorization of P(z)................... 51 3.2.2 Structure of U(z) ........................... 52 3.2.3 Expressing U(z) in terms of Paraunitary Building Blocks ...... 54 3.3 Choice of a Parameterization for Paraunitary Matrix B(z) ........
    [Show full text]
  • M-Ary Orthogonal Modulation Using Wavelet
    M-ARY ORTHOGONAL MODULATION USING WAVELET BASIS FUNCTIONS A Thesis Presented to The Faculty of the School of Electrical Engineering and Computer Science Fritz J. and Dolores H. Russ College of Engineering and Tech~~olog~. Ohio University In Partial Fulfillment of the Requirements for the Degree Master of Science by Xiaoyun Pan No\~ember,3000 THIS THESIS ENTITLED "M-ARY 0:RTHOGONAL MODULATION USING WAVELET BASIS FUNCTIONS" by Xiaoyun Pan has been approved for the School of Electrical Engineering and Computer Science and the Russ College of Engineering and Technology Jerrel R. Mitchell, Dean :/ ,I Fritz J. and Dolores H. Russ College of Engineering and Technology Acknowledgement I would like to express my sincere gratitude to my advisor, Dr. Jeffrey C. Dill, for his instruction and guidance during the development of this thesis. His knowledge, patience and insightful direction and continuous encouragement greatly contributed to the completion of this research. I also wish to thank all the thesis committee members, Dr. David Matolali, Dr. Joseph Essman and Dr. Thomas Hogan for their interest in this thesis, their suggestions and instructions. 'Their willingness to be part of the review process is greatly appreciated. I would like to take this opportunity to express my deepest appreciation to my parents and my husband, Ming, for the love and encouragement they have given me o\ er the years. They are always the indispensable support in my emotion and spirit. Special thanks are given to Jim, my good friend for helping nle check the grammar and spelling of this thesis. His continuous friendship and encouragement remain in my mc!noiy along ith thc two year 2nd eight nlonth's stiidy life in Athcns.
    [Show full text]
  • Multidimensional Filter Banks and Multiscale Geometric Representations Full Text Available At
    Full text available at: http://dx.doi.org/10.1561/2000000012 Multidimensional Filter Banks and Multiscale Geometric Representations Full text available at: http://dx.doi.org/10.1561/2000000012 Multidimensional Filter Banks and Multiscale Geometric Representations Minh N. Do University of Illinois at Urbana-Champaign Urbana, IL 61801 USA [email protected] Yue M. Lu Harvard University Cambridge, MA 02138 USA [email protected] Boston { Delft Full text available at: http://dx.doi.org/10.1561/2000000012 Foundations and Trends R in Signal Processing Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 USA Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is M. N. Do and Y. M. Lu, Multidimen- sional Filter Banks and Multiscale Geometric Representations, Foundations and Trends R in Signal Processing, vol 5, no 3, pp 157{264, 2011 ISBN: 978-1-60198-584-2 c 2012 M. N. Do and Y. M. Lu All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Cen- ter, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for internal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC).
    [Show full text]
  • Reconstruction of Nonuniformly Sampled Bandlimited Signals
    RECONSTRUCTION OF NONUNIFORMLY SAMPLED BANDLIMITED SIGNALS USING TIME-VARYING DISCRETE-TIME FIR FILTERS Håkan Johansson and Per Löwenborg Division of Electronics Systems Department of Electrical Engineering SE-581 83 Linköping University, Sweden Abstract – This paper deals with reconstruction of non- (a) xa(t) (b) xa(t) uniformly sampled bandlimited continuous-time signals using time-varying discrete-time FIR filters. The points of departures are that the signal is slightly oversampled as to the average sampling frequency and that the sampling t t t t t t t instances are known. Under these assumptions, a representa- 0 T4T2T3T 5T t 0 1 2 3 4 5 tion of the reconstructed sequence is derived that utilizes a (c) xa(t) time-frequency function. This representation enables a proper utilization of the oversampling and reduces the reconstruction problem to a design problem that resembles an ordinary filter design problem. Furthermore, for an d0 2T+d0 4T+d0 t important special case, corresponding to a certain type of d1 2T+d1 4T+d1 periodic nonuniform sampling, it is shown that the recon- igure 1. (a) Uniform sampling. (b) Nonuniform sampling. struction problem can be posed as a filter-bank design prob- c) Periodic nonuniform sampling. lem, thus with requirements on a distortion transfer function and a number of aliasing transfer functions. 1. INTRODUCTION cut-off frequency. Although different weights (windows) Nonuniform sampling occurs in many practical applications can improve the situation, it is recognized that other design either intentionally or unintentionally [1]. An example of the methods are usually preferred [8]. When designing filters, latter is found in time-interleaved analog-to-digital convert- one does normally not attempt to approximate a desired ers (ADCs) where static time-skew errors between the dif- function over the whole frequency range ωT ≤ π , ωT ferent subconverters give rise to a class of periodic being the frequency variable.
    [Show full text]
  • Sampling and Reconstruction Introduction Signal Processing
    Introduction • A theoretical basis for antialiasing – provides explanations for how aliasing appears – answers questions about what to do in practice Sampling and Reconstruction • Imported from the signal processing community CS417 Lecture 5 Cornell CS417 Spring 2003 • Lecture 5 © 2003 Steve Marschner • 1 Cornell CS417 Spring 2003 • Lecture 5 © 2003 Steve Marschner • 2 Signal processing Continuous and discrete • Discrete representations of continuous functions • Raster image = discrete representation of continuous – note abuse of “continuous” 2D function • Relevant math worked out by Nyquist in the 1920s • Sampling and reconstruction are just conversions back – early practical use: digital audio recording (1960s) and forth between functions and this discrete • Applies to multidimensional “signals” like images representation – this lecture is in 1D but it’s understood to apply in 2D Cornell CS417 Spring 2003 • Lecture 5 © 2003 Steve Marschner • 3 Cornell CS417 Spring 2003 • Lecture 5 © 2003 Steve Marschner • 4 Continuous to discrete Sampling example • Sampling is simple • When we sample a high-frequency signal we don’t get – given a function and a sampling grid what we expect – write down function values at all sample points – result looks like a lower frequency • Aliasing – not possible to distinguish between this and a low-frequency signal – saw last time that area averaging is a good idea – why? Cornell CS417 Spring 2003 • Lecture 5 © 2003 Steve Marschner • 5 Cornell CS417 Spring 2003 • Lecture 5 © 2003 Steve Marschner • 6 1 Discrete
    [Show full text]
  • Generalizations of the Sampling Theorem: Seven Decades After Nyquist P
    1094 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—I: FUNDAMENTAL THEORY AND APPLICATIONS, VOL. 48, NO. 9, SEPTEMBER 2001 Generalizations of the Sampling Theorem: Seven Decades After Nyquist P. P. Vaidyanathan, Fellow, IEEE Abstract—The sampling theorem is one of the most basic and then established for the cases of bandlimited as well as nonban- fascinating topics in engineering sciences. The most well- known dlimited sampling in Sections IV-B and C. The connection be- form is Shannon’s uniform-sampling theorem for bandlimited sig- tween this kind of stability and functional subspaces is reviewed nals. Extensions of this to bandpass signals and multiband signals, and to nonuniform sampling are also well-known. The connection in Section IV-D. The role of nonuniform sampling in MR theory between such extensions and the theory of filter banks in DSP has is explained in Section V. We show in particular that the MR been well established. This paper presents some of the less known coefficients can often be calculated using FIR filtering opera- aspects of sampling, with special emphasis on non bandlimited sig- tions without the use of oversampling (which is often resorted nals, pointwise stability of reconstruction, and reconstruction from to). Sampling theorems for non bandlimited discrete time signals nonuniform samples. Applications in multiresolution computation and in digital spline interpolation are also reviewed. are discussed in Section VI. These results are based on well es- tablished concepts in multirate digital signal processing. Results Index Terms—Bandlimited signals, FIR reconstruction, multi- resolution, nonuniform sampling, sampling theorems. on FIR reconstructibility in this context are established in Sec- tions VI-B–D.
    [Show full text]
  • 2.161 Signal Processing: Continuous and Discrete Fall 2008
    MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts Institute of Technology Department of Mechanical Engineering 2.161 Signal Processing - Continuous and Discrete Fall Term 2008 1 Lecture 10 Reading: • Class Handout: Sampling and the Discrete Fourier Transform • Proakis & Manolakis (4th Ed.) Secs. 6.1 – 6.3, Sec. 7.1 • Oppenheim, Schafer & Buck (2nd Ed.) Secs. 4.1 – 4.3, Secs. 8.1 – 8.5 1 The Sampling Theorem Given a set of samples {fn} and its generating function f(t), an important question to ask is whether the sample set uniquely defines the function that generated it? In other words, given {fn} can we unambiguously reconstruct f(t)? The answer is clearly no, as shown below, where there are obviously many functions that will generate the given set of samples. f(t ) t In fact there are an infinity of candidate functions that will generate the same sample set. The Nyquist sampling theorem places restrictions on the candidate functions and, if satisfied, will uniquely define the function that generated a given set of samples. The theorem may be stated in many equivalent ways, we present three of them here to illustrate different aspects of the theorem: • A function f(t), sampled at equal intervals ΔT , can not be unambiguously reconstructed from its sample set {fn} unless it is known a-priori that f(t) contains no spectral energy at or above a frequency of π/ΔT radians/s.
    [Show full text]
  • A Resampling Theory for Non-Bandlimited Signals and Its Applications
    Copyright is owned by the Author of the thesis. Permission is given for a copy to be downloaded by an individual for the purpose of research and private study only. The thesis may not be reproduced elsewhere without the permission of the Author. A Resampling Theory for Non-bandlimited Signals and Its Applications Beilei Huang A thesis presented for the partial fulfillment of the requirements for the degree of Doctor of Philosophy in Engineering at Massey University, Wellington New Zealand 2008 Abstract Currently, digital signal processing systems typically assume that the signals are bandlim- ited. This is due to our knowledge based on the uniform sampling theorem for bandlimited signals which was established over 50 years ago by the works of Whittaker, Kotel'nikov and Shannon. However, in practice the digital signals are mostly of finite length. This kind of signals are not strictly bandlimited. Furthermore, advances in electronics have led to the use of very wide bandwidth signals and systems, such as Ultra-Wide Band (UWB) communication systems with signal bandwidths of several giga-hertz. This kind of signals can effectively be viewed as having infinite bandwidth. Thus there is a need to extend existing theory and techniques for signals of finite bandwidths to that for non-bandlimited signals. Two recent approaches to a more general sampling theory for non-bandlimited sig- nals have been published. One is for signals with finite rate of innovation. The other introduced the concept of consistent sampling. It views sampling and reconstruction as projections of signals onto subspaces spanned by the sampling (acquisition) and re- construction (synthesis) functions.
    [Show full text]