Pruning fast Fourier transform algorithm design using group-based method

Fan, Chih‐Peng; Su, Guo-An

doi:10.1016/j.sigpro.2007.05.012

Cited by 13 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That method [24] was compared with other pruning techniques reported in the literature until 2009. Comparisons of the methods proposed by Bouguezel et al [15], Fan et al [16], Sreenivas et al [17], Roche [18], and the DFT DIF−DIT−Pr reported in [24] demonstrated that the DFT DIF−DIT−Pr modality requires fewer arithmetic operations than those of [15][16][17], while attaining the operational performances similar to that of [18]. Additionally, in Section 3, it was corroborated that our proposed DFT COMM technique requires equal or less arithmetic operations than [24].…”

Section: Comparison With Other Competing Algorithmssupporting

confidence: 71%

“…Markel in [1], and Skinner in [13], proposed the input pruning methods based on a radix-2 FFTs, while Yuan et al, in [14], proposed an input pruning of a split-radix FFT. The approaches of Bouguezel et al [15] and Fan et al [16] are applicable for output pruning a radix-2 FFTs, while the Xu's et al [3] proposal suggests pruning the output of a split-radix FFT. In addition, Sreenivas et al, in [17], Roche, in [18], and Wang et al, in [19], developed the methods for pruning the inputoutput at the same time.…”

Section: Related Workmentioning

confidence: 99%

“…Next, the methodology of Medina-Melendrez et al, in [24], merges the methods developed originally in [23] to obtain a composite structure that is capable to prune the input and/or output of a general decomposed transform at the same time. It was demonstrated, in [24], that such a computational structure could be as efficient as the one based on specific FFT algorithms [15][16][17]. In [24], a new methodology for decomposition over a composite length DFT has been proposed as a modification of the Sorensen's approach [23].…”

Section: Related Workmentioning

confidence: 99%

“…In addition, DFT computations for other sparse test scenarios with different values of N and k s were run, in particular, for N = L i = {2 13 , 2 14 ,…, 2 17 } and k s = L o = {1, 2, …, k smax } with k smax = 11 % of N. The test scenarios for the SFFT algorithms delivered successful results only for a few tested values of k s . For example, the SFFTv1 algorithm is executed successfully for N = {2 13 , 2 15 } and k s = {1, 2,…, 50}, for N = 2 14 and k s = {1, 2, …, 50} ∪ {56, 57, …, 63}, for N = 2 16 and k s = {1, 2, …, 50} ∪ {64, 65, …, 97}, and for N = 2 17 and k s = {1, 2,…, 74}.…”

Section: Comparison With the Sfft-related Algorithmsmentioning

confidence: 99%

“…The SFFTv2 algorithm is executed successfully for N = {2 13 , 2 14 ,…, 2 17 } and k s = {1, 2,…, 50}, while, the SFFTv3 algorithm performed successfully for N = 2 13 and k s = {4, 5,…, 673}, for N = 2 14 and k s = {4, 5,…, 1346}, for N = 2 15 and k s = {4, 5,…, 2692}, for N = 2 16 and k s = {4, 5,…, 5385}, and for N = 2 17 and k s = {4, 5,…, 10,771}. Furthermore, the DFT COMM algorithm is executed successfully for all test cases (for N = {2 13 , 2 14 ,…, 2 17 } in combination with all k s = {1, 5,…, k smax }, as follows from the data reported in Table 10.…”

Section: Comparison With the Sfft-related Algorithmsmentioning

confidence: 99%

See 4 more Smart Citations

Unified commutation-pruning technique for efficient computation of composite DFTs

Castro-Palazuelos

Medina-Melendrez

Torres-Roman

et al. 2015

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

An efficient computation of a composite length discrete Fourier transform (DFT), as well as a fast Fourier transform (FFT) of both time and space data sequences in uncertain (non-sparse or sparse) computational scenarios, requires specific processing algorithms. Traditional algorithms typically employ some pruning methods without any commutations, which prevents them from attaining the potential computational efficiency. In this paper, we propose an alternative unified approach with automatic commutations between three computational modalities aimed at efficient computations of the pruned DFTs adapted for variable composite lengths of the non-sparse input-output data. The first modality is an implementation of the direct computation of a composite length DFT, the second one employs the second-order recursive filtering method, and the third one performs the new pruned decomposed transform. The pruned decomposed transform algorithm performs the decimation in time or space (DIT) data acquisition domain and, then, decimation in frequency (DIF). The unified combination of these three algorithms is addressed as the DFT COMM technique. Based on the treatment of the combinational-type hypotheses testing optimization problem of preferable allocations between all feasible commuting-pruning modalities, we have found the global optimal solution to the pruning problem that always requires a fewer or, at most, the same number of arithmetic operations than other feasible modalities. The DFT COMM method outperforms the existing competing pruning techniques in the sense of attainable savings in the number of required arithmetic operations. It requires fewer or at most the same number of arithmetic operations for its execution than any other of the competing pruning methods reported in the literature. Finally, we provide the comparison of the DFT COMM with the recently developed sparse fast Fourier transform (SFFT) algorithmic family. We feature that, in the sensing scenarios with sparse/non-sparse data Fourier spectrum, the DFT COMM technique manifests robustness against such model uncertainties in the sense of insensitivity for sparsity/non-sparsity restrictions and the variability of the operating parameters.

show abstract

Section: Comparison With Other Competing Algorithmssupporting

confidence: 71%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Comparison With the Sfft-related Algorithmsmentioning

confidence: 99%

Section: Comparison With the Sfft-related Algorithmsmentioning

confidence: 99%

See 3 more Smart Citations

Unified commutation-pruning technique for efficient computation of composite DFTs

Castro-Palazuelos

Medina-Melendrez

Torres-Roman

et al. 2015

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

show abstract

Implementation of Fingerprint Based Biometric System Using Optimized 5/3 DWT Architecture and Modified CORDIC Based FFT

Bhairannawar

Sarkar

Raja

et al. 2017

Circuits Syst Signal Process

View full text Add to dashboard Cite

The real-time biometric systems are used to authenticate persons for wide range of security applications. In this paper, we propose implementation of fingerprint-based biometric system using Optimized 5/3 DWT architecture and Modified CORDIC-based Fast Fourier Transform (FFT). The Optimized 2D-DWT architecture is designed using Optimized 1D-DWT architectures, Memory Units and novel Controller Unit which is used to scan rows and columns of an image. The database fingerprint image is applied to the proposed Optimized 2D-DWT architecture to obtain four sub-bands of LL, LH, HL and HH. The efficient architecture of FFT is designed by using Modified CORDIC processor which generates twiddle factor angles of range 0 • -360 • using Pre-processing Unit and Comparator Block. Further, the LL sub-band coefficients are applied to the Modified CORDIC based FFT to generate

show abstract

An FPGA-Oriented FFT Algorithm for Sigma-Delta Signals

Miranda

Lima

2019

Circuits Syst Signal Process

View full text Add to dashboard Cite

Pruning fast Fourier transform algorithm design using group-based method

Cited by 13 publications

References 10 publications

Unified commutation-pruning technique for efficient computation of composite DFTs

Unified commutation-pruning technique for efficient computation of composite DFTs

Implementation of Fingerprint Based Biometric System Using Optimized 5/3 DWT Architecture and Modified CORDIC Based FFT

An FPGA-Oriented FFT Algorithm for Sigma-Delta Signals

Contact Info

Product

Resources

About