具有谱支持的信号的快速DFT计算

Charantej Reddy Pochimireddy, V. S. S. P. Tej, Aditya Siripuram
{"title":"具有谱支持的信号的快速DFT计算","authors":"Charantej Reddy Pochimireddy, V. S. S. P. Tej, Aditya Siripuram","doi":"10.1109/NCC52529.2021.9530137","DOIUrl":null,"url":null,"abstract":"We consider the problem of computing the Discrete Fourier transform (DFT) of an N- length signal which has only k non-zero DFT coefficients at known locations. We say that a set of indices is spectral if there exists a DFT submatrix (square) with those columns that is unitary up to scaling. When the DFT support set is spectral and N is a prime power, we prove that this can be done in O(klogk) operations using k samples provided the DFT support. This is a generalization of a similar recent result for the case when N is a power of 2.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast DFT computation for signals with spectral support\",\"authors\":\"Charantej Reddy Pochimireddy, V. S. S. P. Tej, Aditya Siripuram\",\"doi\":\"10.1109/NCC52529.2021.9530137\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of computing the Discrete Fourier transform (DFT) of an N- length signal which has only k non-zero DFT coefficients at known locations. We say that a set of indices is spectral if there exists a DFT submatrix (square) with those columns that is unitary up to scaling. When the DFT support set is spectral and N is a prime power, we prove that this can be done in O(klogk) operations using k samples provided the DFT support. This is a generalization of a similar recent result for the case when N is a power of 2.\",\"PeriodicalId\":414087,\"journal\":{\"name\":\"2021 National Conference on Communications (NCC)\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC52529.2021.9530137\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC52529.2021.9530137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们考虑一个N长度信号的离散傅里叶变换(DFT)的计算问题,该信号在已知位置上只有k个非零DFT系数。我们说一组指标是谱的,如果存在一个DFT子矩阵(方阵),它的列在尺度上是酉的。当DFT支持集是谱的并且N是素幂时,我们证明了这可以在O(klogk)个操作中完成,使用k个样本提供DFT支持。这是对最近N是2的幂的类似结果的推广。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fast DFT computation for signals with spectral support
We consider the problem of computing the Discrete Fourier transform (DFT) of an N- length signal which has only k non-zero DFT coefficients at known locations. We say that a set of indices is spectral if there exists a DFT submatrix (square) with those columns that is unitary up to scaling. When the DFT support set is spectral and N is a prime power, we prove that this can be done in O(klogk) operations using k samples provided the DFT support. This is a generalization of a similar recent result for the case when N is a power of 2.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信