用近似快速哈特利变换计算DFT

Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467) Pub Date : 1900-01-01 DOI:10.1109/ISSPA.2001.949785

How Sun Dee, V. Jeoti

{"title":"用近似快速哈特利变换计算DFT","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":"{\"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}","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

摘要

提出了一种基于近似快速哈特利变换(FHT)的离散傅立叶变换(DFT)系数近似计算方法。近似FHT采用周期离散小波变换(DWT)实现。我们发现所提出的方法在计算上优于基数2快速傅里叶变换(FFT)和基数2近似FFT算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Computing DFT using approximate fast Hartley transform

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)

自引率

0.00%

发文量