File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Fast algorithms for computing the discrete W transforms

TitleFast algorithms for computing the discrete W transforms
Authors
Chan, SCHo, KL
Issue Date1991
Citation
The 1990 IEEE Region 10 Conference on Computer and Communication Systems (IEEE TENCON '90); Hong Kong, 24-27 September 1990. How to Cite?
AbstractNew algorithms for computing the discrete W transform (DWT) of arbitrary lengths are presented. It is found that an odd length type II and III DWT can be mapped to a discrete Hartley transform (DHT) by means of a simple index mapping. The DHT or DWT-I can be computed, for example, by the real-valued fast Fourier transform algorithms such as the real-valued prime factor fast Fourier transform algorithm (RPFA FFT). Using the close relationship between the odd DFTs and the DWTs, it is possible to compute the type II and III DWTs with even lengths by means of the real-valued FFT or the fast Hartley transform (FHT). Similar algorithms are also presented for the DWT-IV.
Persistent Identifierhttp://hdl.handle.net/10722/158082

 

DC FieldValueLanguage
dc.contributor.authorChan, SCen_US
dc.contributor.authorHo, KLen_US
dc.date.accessioned2012-08-08T08:58:00Z-
dc.date.available2012-08-08T08:58:00Z-
dc.date.issued1991en_US
dc.identifier.citationThe 1990 IEEE Region 10 Conference on Computer and Communication Systems (IEEE TENCON '90); Hong Kong, 24-27 September 1990.-
dc.identifier.urihttp://hdl.handle.net/10722/158082-
dc.description.abstractNew algorithms for computing the discrete W transform (DWT) of arbitrary lengths are presented. It is found that an odd length type II and III DWT can be mapped to a discrete Hartley transform (DHT) by means of a simple index mapping. The DHT or DWT-I can be computed, for example, by the real-valued fast Fourier transform algorithms such as the real-valued prime factor fast Fourier transform algorithm (RPFA FFT). Using the close relationship between the odd DFTs and the DWTs, it is possible to compute the type II and III DWTs with even lengths by means of the real-valued FFT or the fast Hartley transform (FHT). Similar algorithms are also presented for the DWT-IV.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Region 10 International Conference (TENCON)-
dc.titleFast algorithms for computing the discrete W transformsen_US
dc.typeConference_Paperen_US
dc.identifier.emailChan, SC:scchan@eee.hku.hken_US
dc.identifier.emailHo, KL:klho@eee.hku.hken_US
dc.identifier.authorityChan, SC=rp00094en_US
dc.identifier.authorityHo, KL=rp00117en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0025726043en_US
dc.identifier.scopusauthoridChan, SC=13310287100en_US
dc.identifier.scopusauthoridHo, KL=7403581592en_US
dc.customcontrol.immutablesml 151023 - merged-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats