A uniform model for parallel fast Fourier transform (FFT) and fast discrete cosine transform (FDCT)

Author

Chou, Wen-Kuang ; Yun, David Y Y

Author_Institution

Lab. of Intelligent & Parallel Syst., Hawaii Univ., Manoa, HI, USA

fYear

1991

fDate

8-11 Apr 1991

Firstpage

457

Abstract

Extended summary form only given. The techniques for parallel processing of FFT are applied to design a parallel processing model for FDCT. Each transform is translated to a sequence of elementary operations, an equation with regularity. From the similarity of both equations, a uniform representation for FFT and FDCT is derived and a common parallel architecture (shown in diagram form) is proposed to realize both FFT and FDCT while also achieving the best known computational complexity

Keywords

computational complexity; fast Fourier transforms; parallel architectures; FDCT; FFT; common parallel architecture; computational complexity; fast Fourier transform; fast discrete cosine transform; parallel processing; regularity; sequence of elementary operations; uniform representation; Computer architecture; Concurrent computing; Discrete cosine transforms; Equations; Fast Fourier transforms; Hardware; Intelligent systems; Lips; Parallel architectures; Parallel processing;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 1991. DCC '91.

Conference_Location

Snowbird, UT

Print_ISBN

0-8186-9202-2

Type

conf

DOI

10.1109/DCC.1991.213304

Filename

213304

Link To Document

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