Some properties of generalized factorable 2-D FIR filters

Author

Manduchi, R.

Author_Institution

Dept. of Comput. Sci., Stanford Univ., CA, USA

Volume

4

fYear

1996

fDate

7-10 May 1996

Firstpage

2379

Abstract

A paper by Chen and Vaidyanathan (1993) describes a method for designing multidimensional (MD) filters with spectral support in the shape of a parallelepiped, starting from M 1-D prototypes. Such filters require a number of elementary operations per input sample (OPS) that grows linearly with the size of each 1-D prototype. As a matter of fact, they belong to the general class of generalized factorable (GF) filters, which we define here. Beside the computational efficiency (in both the design and the implementation), we show in this work that GF filters share some interesting properties (relative to symmetry and frequency response constraints)

Keywords

FIR filters; computational complexity; spectral analysis; two-dimensional digital filters; GF filters; computational efficiency; design; generalized factorable 2-D FIR filters; generalized factorable filters; implementation; multidimensional filters; operations per input sample; parallelepiped; prototype; spectral support; Algorithm design and analysis; Computational efficiency; Computer science; Design methodology; Electronic mail; Finite impulse response filter; Frequency response; Lattices; Prototypes; Shape;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on

Conference_Location

Atlanta, GA

ISSN

1520-6149

Print_ISBN

0-7803-3192-3

Type

conf

DOI

10.1109/ICASSP.1996.547761

Filename

547761