arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.01529q-bio.NCeess.SP
收藏

64点复FFT子带{1,2,5,6}的计算及其对N(=2^N)点FFT的推广

Calculation of Sub-bands {1,2,5,6} for 64-Point Complex FFT and Its extension to N (=2^N) Point FFT

Bhaskar Sen

摘要:

FFT算法是数字信号处理中应用最广泛的算法之一。数字信号处理在生物医学中的应用越来越重要。FFT的硬件实现在生物可穿戴设备中得到了很好的应用。然而,对于这些设备,低功耗和低面积是至关重要的。在这份报告中,我们研究了一个子结构的抽取频率(DIF)FFT,其中一些子带是我们感兴趣的。具体来说,我们将频率范围划分为8个子带(0-7),并计算其中的4个子带(1,2,5,6)。我们表明,使用的概念,如pushingandradix 22,复数乘法的数量可以显着减少16点,32点和64点FFT,而计算这些特定的频带。在优化的64点FFT结构的基础上,我们又将其扩展到N = 2n点FFT。使用合并FFT进一步减少了复数乘法的次数。我们的研究结果表明,乘法的数量(因此功率)可以大大减少使用我们的优化结构相比,未优化的结构。这可以在生物医学信号处理中找到应用,特别是当计算生理时间序列的较低谱密度时,其中降低计算能力是至关重要的

英文摘要:

FFT algorithm is one of the most applied algorithmsin digital signal processing. Digital signal processing hasgradually become important in biomedical application. Herehardware implementation of FFTs have found useful appli-cations for bio-wearable devices. However, for these devices, low-power and low-area are of utmost importance.In this report, we investigate a sub-structure of decimation-in-frequency (DIF) FFT where a number of sub-bands areof interest to us. Specifically, we divide the range of frequencies into 8 sub-bands (0-7) and calculate 4 of them( 1,2,5,6). We show that using concepts likepushingandradix22, the number of complex multiplications can be dras-tically reduced for 16-point, 32-point and 64-point FFTswhile computing those specific bands. Later, we also extendit toN= 2n-point FFT based on optimized 64-point FFTstructure. The number of complex multiplications is furtherreduced usingmerge-FFT. Our results show that the numberof multiplications (and hence power) can be reduced greatlyusing our optimized structure compared to an unoptimizedstructure. This can find application in biomedical signal processing specifically while computingp ower spectral density of a physiological time series where reducing computational power is of utmost importance

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑