Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 1, 1988 | public
Journal Article Open

Classical sampling theorems in the context of multirate and polyphase digital filter bank structures

Abstract

The recovery of a signal from so-called generalized samples is a problem of designing appropriate linear filters called reconstruction (or synthesis) filters. This relationship is reviewed and explored. Novel theorems for the subsampling of sequences are derived by direct use of the digital-filter-bank framework. These results are related to the theory of perfect reconstruction in maximally decimated digital-filter-bank systems. One of the theorems pertains to the subsampling of a sequence and its first few differences and its subsequent stable reconstruction at finite cost with no error. The reconstruction filters turn out to be multiplierless and of the FIR (finite impulse response) type. These ideas are extended to the case of two-dimensional signals by use of a Kronecker formalism. The subsampling of bandlimited sequences is also considered. A sequence x(n ) with a Fourier transform vanishes for |ω|⩾Lπ/M, where L and M are integers with L

Additional Information

© Copyright 1988 IEEE. Reprinted with permission. Manuscript received October 13, 1987; revised March 5, 1988. This work was supported in part by the National Science Foundation under Grant DCI 8552579, by the matching funds provided by Pacific Bell and General Electric Co., by Caltech's Programs in Advanced Technology grant sponsored by Aerojet General, General Motors, GTE, and TRW, and by the National Science Foundation under Grant MIP 8604456.

Files

VAIieeetassp88a.pdf
Files (1.5 MB)
Name Size Download all
md5:574e217d42ebbd2804d367baf09a942d
1.5 MB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023