基于混叠滤波器的稀疏快速傅里叶变换算法性能研究。

Bin Li, Zhikang Jiang, Jie Chen
{"title":"基于混叠滤波器的稀疏快速傅里叶变换算法性能研究。","authors":"Bin Li, Zhikang Jiang, Jie Chen","doi":"10.3390/ELECTRONICS10091117","DOIUrl":null,"url":null,"abstract":"Computing the Sparse Fast Fourier Transform(sFFT) of a K-sparse signal of size N has emerged as a critical topic for a long time. There are mainly two stages in the sFFT: frequency bucketization and spectrum reconstruction. Frequency bucketization is equivalent to hashing the frequency coefficients into B buckets through one of these filters: Dirichlet kernel filter, flat filter, aliasing filter, etc. The spectrum reconstruction is equivalent to identifying frequencies that are isolated in their buckets. More than forty different sFFT algorithms compute Discrete Fourier Transform(DFT) by their unique methods so far. In order to use them properly, the urgent topic of great concern is how to analyze and evaluate the performance of these algorithms in theory and practice. The paper mainly discusses the sFFT Algorithms using the aliasing filter. In the first part, the paper introduces the technique of three frameworks: the one-shot framework based on the compressed sensing(CS) solver, the peeling framework based on the bipartite graph and the iterative framework based on the binary tree search. Then, we get the conclusion of the performance of six corresponding algorithms: sFFT-DT1.0, sFFT-DT2.0, sFFT-DT3.0, FFAST, R-FFAST and DSFFT algorithm in theory. In the second part, we make two categories of experiments for computing the signals of different SNR, different N, different K by a standard testing platform and record the run time, percentage of the signal sampled and L0, L1, L2 error both in the exactly sparse case and general sparse case. The result of experiments satisfies the inferences obtained in theory.","PeriodicalId":8487,"journal":{"name":"arXiv: Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On Performance of Sparse Fast Fourier Transform Algorithms Using the Aliasing Filter.\",\"authors\":\"Bin Li, Zhikang Jiang, Jie Chen\",\"doi\":\"10.3390/ELECTRONICS10091117\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Computing the Sparse Fast Fourier Transform(sFFT) of a K-sparse signal of size N has emerged as a critical topic for a long time. There are mainly two stages in the sFFT: frequency bucketization and spectrum reconstruction. Frequency bucketization is equivalent to hashing the frequency coefficients into B buckets through one of these filters: Dirichlet kernel filter, flat filter, aliasing filter, etc. The spectrum reconstruction is equivalent to identifying frequencies that are isolated in their buckets. More than forty different sFFT algorithms compute Discrete Fourier Transform(DFT) by their unique methods so far. In order to use them properly, the urgent topic of great concern is how to analyze and evaluate the performance of these algorithms in theory and practice. The paper mainly discusses the sFFT Algorithms using the aliasing filter. In the first part, the paper introduces the technique of three frameworks: the one-shot framework based on the compressed sensing(CS) solver, the peeling framework based on the bipartite graph and the iterative framework based on the binary tree search. Then, we get the conclusion of the performance of six corresponding algorithms: sFFT-DT1.0, sFFT-DT2.0, sFFT-DT3.0, FFAST, R-FFAST and DSFFT algorithm in theory. In the second part, we make two categories of experiments for computing the signals of different SNR, different N, different K by a standard testing platform and record the run time, percentage of the signal sampled and L0, L1, L2 error both in the exactly sparse case and general sparse case. The result of experiments satisfies the inferences obtained in theory.\",\"PeriodicalId\":8487,\"journal\":{\"name\":\"arXiv: Signal Processing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3390/ELECTRONICS10091117\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/ELECTRONICS10091117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

计算大小为N的k稀疏信号的稀疏快速傅里叶变换(sFFT)一直是一个重要的研究课题。sFFT主要有两个阶段:频率桶化和频谱重构。频率桶化相当于通过以下滤波器之一将频率系数散列到B桶中:狄利克雷核滤波器,平坦滤波器,混叠滤波器等。频谱重建相当于识别在其桶中被隔离的频率。目前已有40多种sFFT算法以其独特的方法计算离散傅里叶变换(DFT)。如何在理论和实践中对这些算法的性能进行分析和评价,是为了更好地使用这些算法而迫切需要关注的问题。本文主要讨论了基于混叠滤波器的sFFT算法。第一部分介绍了基于压缩感知(CS)求解器的一次性框架、基于二部图的剥离框架和基于二叉树搜索的迭代框架。然后,从理论上对sFFT-DT1.0、sFFT-DT2.0、sFFT-DT3.0、FFAST、R-FFAST和DSFFT算法这六种相应算法的性能进行了总结。第二部分在标准测试平台上对不同信噪比、不同N、不同K的信号进行了两类实验计算,记录了完全稀疏和一般稀疏情况下的运行时间、采样信号的百分比和L0、L1、L2误差。实验结果与理论推断相符。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Performance of Sparse Fast Fourier Transform Algorithms Using the Aliasing Filter.
Computing the Sparse Fast Fourier Transform(sFFT) of a K-sparse signal of size N has emerged as a critical topic for a long time. There are mainly two stages in the sFFT: frequency bucketization and spectrum reconstruction. Frequency bucketization is equivalent to hashing the frequency coefficients into B buckets through one of these filters: Dirichlet kernel filter, flat filter, aliasing filter, etc. The spectrum reconstruction is equivalent to identifying frequencies that are isolated in their buckets. More than forty different sFFT algorithms compute Discrete Fourier Transform(DFT) by their unique methods so far. In order to use them properly, the urgent topic of great concern is how to analyze and evaluate the performance of these algorithms in theory and practice. The paper mainly discusses the sFFT Algorithms using the aliasing filter. In the first part, the paper introduces the technique of three frameworks: the one-shot framework based on the compressed sensing(CS) solver, the peeling framework based on the bipartite graph and the iterative framework based on the binary tree search. Then, we get the conclusion of the performance of six corresponding algorithms: sFFT-DT1.0, sFFT-DT2.0, sFFT-DT3.0, FFAST, R-FFAST and DSFFT algorithm in theory. In the second part, we make two categories of experiments for computing the signals of different SNR, different N, different K by a standard testing platform and record the run time, percentage of the signal sampled and L0, L1, L2 error both in the exactly sparse case and general sparse case. The result of experiments satisfies the inferences obtained in theory.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信