An FPT algorithm with a modularized structure for computing 2-D cyclic convolutions

Author

Truong, T.K. ; Pei, D.Y. ; Reed, I.S. ; Chu, Y.F. ; Hsu, I.S.

Author_Institution

Jet Propulsion Lab., Pasadena, CA, USA

Volume

Issue

fYear

1988

fDate

9/1/1988 12:00:00 AM

Firstpage

1540

Lastpage

1542

Abstract

The fast polynomial transform (FPT) for computing 2-D cyclic convolutions is modularized into identical modules. In the new method, the 1-D cyclic polynomial convolution is decomposed into cycle convolutions of polynomials, all of the same length. Thus, only FPTs and FFT´s of the same length are required. As a consequence, the architecture is more regular and naturally suitable for a VLSI implementation

Keywords

polynomials; signal processing; transforms; 2-D cyclic convolutions; FFT; FPT; VLSI implementation; architecture; fast polynomial transform; signal processing; Adaptive filters; Adaptive signal processing; Convolution; Digital filters; Filtering; IIR filters; Polynomials; Signal analysis; Signal processing algorithms; Speech processing;

fLanguage

English

Journal_Title

Acoustics, Speech and Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

0096-3518

Type

jour

DOI

10.1109/29.90389

Filename

90389

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1442319