三维离散Hartley变换的一种新方法

2012 Second International Conference on Instrumentation, Measurement, Computer, Communication and Control Pub Date : 2012-12-08 DOI:10.1109/IMCCC.2012.127

Tinghuan Chen, Z. Dong

{"title":"三维离散Hartley变换的一种新方法","authors":"Tinghuan Chen, Z. Dong","doi":"10.1109/IMCCC.2012.127","DOIUrl":null,"url":null,"abstract":"In this correspondence, we propose a vector-radix algorithm for fast computation of 3-D discrete Hartley transform(DHT). For data sequences whose length is a power of three, a radix-3×3×3 decimation in frequency algorithm is developed. It decomposes a length-N×N×N DHT into twenty-seven length-(N/3)×(N/3)×(N/3) DHTs. Comparison of computational complexity with known algorithms shows that the proposed algorithm, in some cases, reduces significantly the number of arithmetic operation.","PeriodicalId":394548,"journal":{"name":"2012 Second International Conference on Instrumentation, Measurement, Computer, Communication and Control","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A New Method for the 3-D Discrete Hartley Transform\",\"authors\":\"Tinghuan Chen, Z. Dong\",\"doi\":\"10.1109/IMCCC.2012.127\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this correspondence, we propose a vector-radix algorithm for fast computation of 3-D discrete Hartley transform(DHT). For data sequences whose length is a power of three, a radix-3×3×3 decimation in frequency algorithm is developed. It decomposes a length-N×N×N DHT into twenty-seven length-(N/3)×(N/3)×(N/3) DHTs. Comparison of computational complexity with known algorithms shows that the proposed algorithm, in some cases, reduces significantly the number of arithmetic operation.\",\"PeriodicalId\":394548,\"journal\":{\"name\":\"2012 Second International Conference on Instrumentation, Measurement, Computer, Communication and Control\",\"volume\":\"101 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Second International Conference on Instrumentation, Measurement, Computer, Communication and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMCCC.2012.127\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Second International Conference on Instrumentation, Measurement, Computer, Communication and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCCC.2012.127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文提出了一种快速计算三维离散哈特利变换(DHT)的向量基算法。对于长度为3次幂的数据序列，提出了一种radix-3×3×3频率抽取算法。它将一个length-N×N×N DHT分解为27个长度-(N/3)×(N/3)×(N/3) DHT。与已知算法的计算复杂度比较表明，该算法在某些情况下显著减少了算术运算次数。

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

查看原文本刊更多论文

A New Method for the 3-D Discrete Hartley Transform

In this correspondence, we propose a vector-radix algorithm for fast computation of 3-D discrete Hartley transform(DHT). For data sequences whose length is a power of three, a radix-3×3×3 decimation in frequency algorithm is developed. It decomposes a length-N×N×N DHT into twenty-seven length-(N/3)×(N/3)×(N/3) DHTs. Comparison of computational complexity with known algorithms shows that the proposed algorithm, in some cases, reduces significantly the number of arithmetic operation.

求助全文

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

来源期刊

2012 Second International Conference on Instrumentation, Measurement, Computer, Communication and Control

自引率

0.00%

发文量