{"title":"Computing DFT using approximate fast Hartley transform","authors":"How Sun Dee, V. Jeoti","doi":"10.1109/ISSPA.2001.949785","DOIUrl":null,"url":null,"abstract":"We propose an approximate fast Hartley transform (FHT) based method to compute the discrete Fourier transform (DFT) coefficients approximately. The approximate FHT is implemented using a periodic discrete wavelet transform (DWT). We find that the proposed method is computationally superior to both the radix 2 fast Fourier transform (FFT) and also the radix 2 approximate FFT algorithms.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.2001.949785","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
We propose an approximate fast Hartley transform (FHT) based method to compute the discrete Fourier transform (DFT) coefficients approximately. The approximate FHT is implemented using a periodic discrete wavelet transform (DWT). We find that the proposed method is computationally superior to both the radix 2 fast Fourier transform (FFT) and also the radix 2 approximate FFT algorithms.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
