File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Polynomial transform fast Hartley transform

TitlePolynomial transform fast Hartley transform
Authors
Issue Date1990
PublisherThe Institution of Engineering and Technology. The Journal's web site is located at http://www.ieedl.org/EL
Citation
Electronics Letters, 1990, v. 26 n. 22, p. 1914-1916 How to Cite?
AbstractA fast algorithm for computing the two-dimensional discrete Hartley transform (2D-DHT) based on the polynomial transform is presented. Using a simple relation between the discrete Fourier transform (DFT) and the DHT, it is found that the 2D-DHT can be mapped, by means of the polynomial transform, to a number of one-dimension type III discrete W transforms (DWT-III). An improved fast algorithm for computing the DWT-III is also proposed.
Persistent Identifierhttp://hdl.handle.net/10722/154923
ISSN
2015 Impact Factor: 0.854
2015 SCImago Journal Rankings: 0.549

 

DC FieldValueLanguage
dc.contributor.authorChan, SCen_US
dc.contributor.authorHo, KLen_US
dc.date.accessioned2012-08-08T08:31:09Z-
dc.date.available2012-08-08T08:31:09Z-
dc.date.issued1990en_US
dc.identifier.citationElectronics Letters, 1990, v. 26 n. 22, p. 1914-1916en_US
dc.identifier.issn0013-5194en_US
dc.identifier.urihttp://hdl.handle.net/10722/154923-
dc.description.abstractA fast algorithm for computing the two-dimensional discrete Hartley transform (2D-DHT) based on the polynomial transform is presented. Using a simple relation between the discrete Fourier transform (DFT) and the DHT, it is found that the 2D-DHT can be mapped, by means of the polynomial transform, to a number of one-dimension type III discrete W transforms (DWT-III). An improved fast algorithm for computing the DWT-III is also proposed.en_US
dc.languageengen_US
dc.publisherThe Institution of Engineering and Technology. The Journal's web site is located at http://www.ieedl.org/ELen_US
dc.relation.ispartofElectronics Lettersen_US
dc.titlePolynomial transform fast Hartley transformen_US
dc.typeArticleen_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-0025503583en_US
dc.identifier.volume26en_US
dc.identifier.issue22en_US
dc.identifier.spage1914en_US
dc.identifier.epage1916en_US
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridChan, SC=13310287100en_US
dc.identifier.scopusauthoridHo, KL=7403581592en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats