MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Research Laboratory for Electronics (RLE)
  • RLE Technical Reports
  • View Item
  • DSpace@MIT Home
  • Research Laboratory for Electronics (RLE)
  • RLE Technical Reports
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Regular and Irregular Signal Resampling

Author(s)
Russell, Andrew I.
Thumbnail
DownloadTR659.pdf (1.185Mb)
Metadata
Show full item record
Abstract
In this thesis,w e consider three main resampling problems. The first is the sampling rate conversion problem in which the input and output grids are both regularly spaced. It is known that the output signal is obtained by applying a time-varying filter to the input signal. The existing methods for finding the coefficients of this filter inherently tradeoff computational and memory requirements. Instead,w e present a recursive scheme for which the computational and memory requirements are both low. In the second problem which we consider,w e are given the instantaneous samples of a continuous-time (CT) signal taken on an irregular grid from which we wish to obtain samples on a regular grid. This is referred to as the nonuniform sampling problem. We present a noniterative algorithm for solving this problem,whic h,in contrast to the known iterative algorithms,can easily be implemented in real time. We show that each output point may be calculated by using only a finite number of input points, with an error which falls exponentially in the number of points used. Finally we look at the nonuniform lowpass reconstruction problem. In this case,w e are given regular samples of a CT signal from which we wish to obtain amplitudes for a sequence of irregularly spaced impulses. These amplitudes are chosen so that the original CT signal may be recovered by lowpass filtering this sequence of impulses. We present a general solution which exhibits the same exponential localization obtained for the nonuniform sampling problem. We also consider a special case in which the irregular grid is obtained by deleting a single point from an otherwise regular grid. We refer to this as the missing pixel problem,since it may be used to model cases in which a single defective element is present in a regularly spaced array such as the pixel arrays used in flat-panel video displays. We present an optimal solution which minimizes the energy of the reconstruction error,sub ject to the constraint that only a given number of pixels may be adjusted.
Description
Thesis Supervisor: Alan V. Oppenheim Title: Ford Professor of Engineering
Date issued
2006-02-22
URI
http://hdl.handle.net/1721.1/31215
Series/Report no.
Technical Report (Massachusetts Institute of Technology, Research Laboratory of Electronics); 659

Collections
  • RLE Technical Reports

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.