新公式的快速离散哈特利变换与最少的乘法数

[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings Pub Date : 1991-05-09 DOI:10.1109/PACRIM.1991.160744

Y. Chan, W. Siu

{"title":"新公式的快速离散哈特利变换与最少的乘法数","authors":"Y. Chan, W. Siu","doi":"10.1109/PACRIM.1991.160744","DOIUrl":null,"url":null,"abstract":"A simple algorithm is proposed to realize a one-dimensional discrete Hartley transform (DHT) with sequence lengths equal to 2/sup m/. This algorithm achieves the same multiplicative complexity as Malvar's algorithm (1987, 1988) which requires the least number of multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar's algorithm.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"New formulation of fast discrete Hartley transform with the minimum number of multiplications\",\"authors\":\"Y. Chan, W. Siu\",\"doi\":\"10.1109/PACRIM.1991.160744\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A simple algorithm is proposed to realize a one-dimensional discrete Hartley transform (DHT) with sequence lengths equal to 2/sup m/. This algorithm achieves the same multiplicative complexity as Malvar's algorithm (1987, 1988) which requires the least number of multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar's algorithm.<<ETX>>\",\"PeriodicalId\":289986,\"journal\":{\"name\":\"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.1991.160744\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.1991.160744","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

提出了一种实现序列长度为2/sup m/的一维离散Hartley变换(DHT)的简单算法。该算法与Malvar算法(1987,1988)的乘法复杂度相同，其需要的乘法次数最少。然而，与马尔瓦尔算法相比，这种方法的优点是需要更少的加法。

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

查看原文本刊更多论文

New formulation of fast discrete Hartley transform with the minimum number of multiplications

A simple algorithm is proposed to realize a one-dimensional discrete Hartley transform (DHT) with sequence lengths equal to 2/sup m/. This algorithm achieves the same multiplicative complexity as Malvar's algorithm (1987, 1988) which requires the least number of multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar's algorithm.<>

求助全文

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

来源期刊

[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings

自引率

0.00%

发文量