Efficient Computation for Discrete Fractional Hadamard Transform

IF 5.2 1区 工程技术 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Circuits and Systems I: Regular Papers Pub Date : 2024-08-15 DOI:10.1109/TCSI.2024.3441834
Zi-Chen Fan;Di Li;Susanto Rahardja
{"title":"Efficient Computation for Discrete Fractional Hadamard Transform","authors":"Zi-Chen Fan;Di Li;Susanto Rahardja","doi":"10.1109/TCSI.2024.3441834","DOIUrl":null,"url":null,"abstract":"This paper introduces a new fast algorithm for the discrete fractional Hadamard transform (FHT). The proposed algorithm demonstrates superior computational efficiency. For data lengths ranging from \n<inline-formula> <tex-math>$2 \\leq N \\leq 1024$ </tex-math></inline-formula>\n, our algorithm achieves a reduction in the number of multiplications by up to 96.53%, 81.82%, 33.33%, and 90% compared to four existing fast algorithms for the FHT. Additionally, we compare the execution times with those of existing fast algorithms, and the results show that the proposed algorithm has better performance. The reduced computational complexity makes the proposed algorithm a potential candidate for calculating the FHT.","PeriodicalId":13039,"journal":{"name":"IEEE Transactions on Circuits and Systems I: Regular Papers","volume":null,"pages":null},"PeriodicalIF":5.2000,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Circuits and Systems I: Regular Papers","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10637350/","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

This paper introduces a new fast algorithm for the discrete fractional Hadamard transform (FHT). The proposed algorithm demonstrates superior computational efficiency. For data lengths ranging from $2 \leq N \leq 1024$ , our algorithm achieves a reduction in the number of multiplications by up to 96.53%, 81.82%, 33.33%, and 90% compared to four existing fast algorithms for the FHT. Additionally, we compare the execution times with those of existing fast algorithms, and the results show that the proposed algorithm has better performance. The reduced computational complexity makes the proposed algorithm a potential candidate for calculating the FHT.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
高效计算离散分式哈达玛变换
本文介绍了一种新的离散分数哈达玛变换(FHT)快速算法。所提出的算法具有卓越的计算效率。与现有的四种 FHT 快速算法相比,我们的算法在数据长度为 $2 \leq N \leq 1024$ 时的乘法次数分别减少了 96.53%、81.82%、33.33% 和 90%。此外,我们还比较了现有快速算法的执行时间,结果表明所提算法的性能更好。计算复杂度的降低使提出的算法成为计算 FHT 的潜在候选算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Circuits and Systems I: Regular Papers
IEEE Transactions on Circuits and Systems I: Regular Papers 工程技术-工程:电子与电气
CiteScore
9.80
自引率
11.80%
发文量
441
审稿时长
2 months
期刊介绍: TCAS I publishes regular papers in the field specified by the theory, analysis, design, and practical implementations of circuits, and the application of circuit techniques to systems and to signal processing. Included is the whole spectrum from basic scientific theory to industrial applications. The field of interest covered includes: - Circuits: Analog, Digital and Mixed Signal Circuits and Systems - Nonlinear Circuits and Systems, Integrated Sensors, MEMS and Systems on Chip, Nanoscale Circuits and Systems, Optoelectronic - Circuits and Systems, Power Electronics and Systems - Software for Analog-and-Logic Circuits and Systems - Control aspects of Circuits and Systems.
期刊最新文献
Table of Contents IEEE Circuits and Systems Society Information TechRxiv: Share Your Preprint Research with the World! IEEE Transactions on Circuits and Systems--I: Regular Papers Information for Authors Guest Editorial Special Issue on the International Symposium on Integrated Circuits and Systems—ISICAS 2024
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1