File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Split vector-radix fast Fourier transform

TitleSplit vector-radix fast Fourier transform
Authors
Chan, Stanley CHo, KL
Issue Date1992
Citation
Ieee Transactions On Signal Processing, 1992, v. 40 n. 8, p. 2029-2039 How to Cite?
DOI: http://dx.doi.org/10.1109/78.150004
AbstractThe split-radix approach for computing the discrete Fourier transform (DFT) is extended for the vector-radix fast Fourier tranform (FFT) to two and higher dimensions. It is obtained by further splitting the (N/2 × N/2) transforms with twiddle factors in the radix (2 × 2) FFT algorithm. The generalization of this split vector-radix FFT algorithm to higher radices and higher dimensions is also presented. By introducing a general approach for constructing the fast Hartley transform (FHT) from the corresponding FFT, new vector- and split-vector-radix FHT algorithms with the same desirable properties as their FFT counterparts are obtained.
Persistent Identifierhttp://hdl.handle.net/10722/154967
ISSN
1053-587X
2023 Impact Factor: 4.6
2023 SCImago Journal Rankings: 2.520
ISI Accession Number ID
WOS:A1992JF78800018

 

DC FieldValueLanguage
dc.contributor.authorChan, Stanley Cen_US
dc.contributor.authorHo, KLen_US
dc.date.accessioned2012-08-08T08:31:19Z-
dc.date.available2012-08-08T08:31:19Z-
dc.date.issued1992en_US
dc.identifier.citationIeee Transactions On Signal Processing, 1992, v. 40 n. 8, p. 2029-2039en_US
dc.identifier.issn1053-587Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/154967-
dc.description.abstractThe split-radix approach for computing the discrete Fourier transform (DFT) is extended for the vector-radix fast Fourier tranform (FFT) to two and higher dimensions. It is obtained by further splitting the (N/2 × N/2) transforms with twiddle factors in the radix (2 × 2) FFT algorithm. The generalization of this split vector-radix FFT algorithm to higher radices and higher dimensions is also presented. By introducing a general approach for constructing the fast Hartley transform (FHT) from the corresponding FFT, new vector- and split-vector-radix FHT algorithms with the same desirable properties as their FFT counterparts are obtained.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Signal Processingen_US
dc.titleSplit vector-radix fast Fourier transformen_US
dc.typeArticleen_US
dc.identifier.emailHo, KL:klho@eee.hku.hken_US
dc.identifier.authorityHo, KL=rp00117en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/78.150004en_US
dc.identifier.scopuseid_2-s2.0-0026908149en_US
dc.identifier.volume40en_US
dc.identifier.issue8en_US
dc.identifier.spage2029en_US
dc.identifier.epage2039en_US
dc.identifier.isiWOS:A1992JF78800018-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChan, Stanley C=36851809400en_US
dc.identifier.scopusauthoridHo, KL=7403581592en_US
dc.identifier.issnl1053-587X-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats