UCHT与FFT的关系

S. Xie, S. Rahardja, Z. Gu
{"title":"UCHT与FFT的关系","authors":"S. Xie, S. Rahardja, Z. Gu","doi":"10.1109/ISMVL.2003.1201400","DOIUrl":null,"url":null,"abstract":"This paper presents relationships among unified complex Hadamard transform (UCHT) whose transformation matrix contains elements /spl plusmn/1 and /spl plusmn/i, Walsh-Hadamard transform (WHT) whose transformation matrix contains elements /spl plusmn/1, and Fast Fourier Transform (FFT). They are all related to each other by a key matrix, and FFT can be computed by using UCHT WHT and some twiddle factor matrices.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"2 20","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Relationship between UCHT and FFT\",\"authors\":\"S. Xie, S. Rahardja, Z. Gu\",\"doi\":\"10.1109/ISMVL.2003.1201400\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents relationships among unified complex Hadamard transform (UCHT) whose transformation matrix contains elements /spl plusmn/1 and /spl plusmn/i, Walsh-Hadamard transform (WHT) whose transformation matrix contains elements /spl plusmn/1, and Fast Fourier Transform (FFT). They are all related to each other by a key matrix, and FFT can be computed by using UCHT WHT and some twiddle factor matrices.\",\"PeriodicalId\":434515,\"journal\":{\"name\":\"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.\",\"volume\":\"2 20\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2003.1201400\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2003.1201400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文给出了变换矩阵包含元素/spl plusmn/1和/spl plusmn/i的统一复Hadamard变换(UCHT)、变换矩阵包含元素/spl plusmn/1的沃尔什-Hadamard变换(WHT)和快速傅里叶变换(FFT)之间的关系。它们都是通过一个关键矩阵相互关联的,FFT可以通过使用UCHT WHT和一些中间因子矩阵来计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Relationship between UCHT and FFT
This paper presents relationships among unified complex Hadamard transform (UCHT) whose transformation matrix contains elements /spl plusmn/1 and /spl plusmn/i, Walsh-Hadamard transform (WHT) whose transformation matrix contains elements /spl plusmn/1, and Fast Fourier Transform (FFT). They are all related to each other by a key matrix, and FFT can be computed by using UCHT WHT and some twiddle factor matrices.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信