A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Numerical Analysis for Iterative Filtering with New Efficient Implementations Based on FFT
[article]
2018
arXiv
pre-print
Preserved Fulltext
Other Versions
Based on these results we provide new ideas for efficient implementations of Iterative Filtering algorithm which are based on Fast Fourier Transform (FFT), and the reduction of the original iterative algorithm ...
In this work we tackle the problem of further analyzing the convergence of the Iterative Filtering method both in a continuous and a discrete setting in order to provide a comprehensive analysis of its ...
Based on these results in Section 4 we propose new ideas to increase the efficiency of the Iterative Filtering algorithm. ...
arXiv:1802.01359v2
fatcat:y5dlel4ppnc3vgaebimt4cl4b4
SIMPLIFIED BLUESTEIN NUMERICAL FAST FOURIER TRANSFORMS ALGORITHM FOR DSP AND ASP
2015
International journal of research - granthaalayah
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
than the one with greater operators. ...
The simplified numerical algorithm developed in this study is abbreviated with SBNADSP. The methodology adopted in this work was iterative and incremental development design. ...
This way, an old filter becomes new not by creation but by improvement. Simply stated, filter sharpening is a technique for creating a new filter from an old one. ...
doi:10.29121/granthaalayah.v3.i11.2015.2925
fatcat:rsndybhjrfebvj7amv44afsrli
Development of an Extended Improvement on the Simplified-Bluestein Algorithm
2017
Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
It is subjected to some numerical processing which included testing for efficiency on the C ++ platform. This test platform provided the basis for comparison leading to the desired EISBA. ...
The algorithms were tested on input block of width 1000 units, and above, and can be implemented on input size of 100 000, and 1000 000 000 without the challenge of storage overflow. ...
The analysis of iteration is based upon user feedback, and the program analysis facilities available. ...
doi:10.11648/j.com.20170504.11
fatcat:eivlsbitnfgptkx4l7esjh44p4
An orthogonal family of quincunx wavelets with continuously adjustable order
2005
IEEE Transactions on Image Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We can also prove that they yield wavelet bases of 2 ( 2 ) for any 0. ...
In fact, our method is almost as efficient as the standard Mallat algorithm for separable wavelets. Index Terms-McClellan transform, nonseparable filter design, quincunx sampling, wavelet transform. ...
We will make up for this handicap by proposing a fast Fourier transform (FFT)-based implementation which is almost as efficient as Mallat's algorithm for separable wavelets [11] .
II. ...
doi:10.1109/tip.2005.843754
pmid:15825484
fatcat:bua6ucpet5hiddo7gf2mheru2q
Solution of large dense complex matrix equations using a fast Fourier transform (FFT)-based wavelet-like methodology
2002
IEEE Transactions on Antennas and Propagation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Hence, the efficiency of the new procedure becomes clear for very high order filters. ...
The advantage of the FFT-based procedure utilizing ideal filters is that it can be computationally efficient and for very large matrices may yield a sparse matrix. ...
Use of FFT in the implementation of FIR filters with a symmetrically extended data set is available in [3, chapter 8] . ...
doi:10.1109/8.999617
fatcat:tbxduyulavdtbjgqbjltuniare
Realization of Multi-Delay Filter Using Fermat Number Transforms
2008
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper is about an efficient implementation of adaptive filtering for echo cancelers. ...
Then, an efficient implementation of the new procedure (SMDF-BPNLMS++) block filtering is proposed using Fermat Number Transform, which can significantly reduce the computation complexity of filter implantation ...
As the FFT and FNT realizations are basically equivalent, our FNT-based block adaptive filtering has been implemented with convolution procedures using the FFT technique. ...
doi:10.1093/ietfec/e91-a.9.2571
fatcat:2gprqfbsjvfz5nfkcuh6dmtvke
Solution of large dense complex matrix equations utilizing wavelet-like transforms
1999
IEEE Transactions on Antennas and Propagation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Hence, the efficiency of the new procedure becomes clear for very high order filters. ...
The advantage of the FFT-based procedure utilizing ideal filters is that it can be computationally efficient and for very large matrices may yield a sparse matrix. ...
Use of FFT in the implementation of FIR filters with a symmetrically extended data set is available in [3, chapter 8] . ...
doi:10.1109/8.805909
fatcat:iv2prjkefzcy7fekhnqx2a4zha
Inverse Kernels for Fast Spatial Deconvolution
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is based on estimating inverse kernels that are decomposed into a series of 1D kernels. ...
It commonly employs fast Fourier transform (FFT) to simplify computation. ...
The authors would like to thank Shicheng Zheng for his help in implementing part of the algorithm. ...
doi:10.1007/978-3-319-10602-1_3
fatcat:o5eeaqymhbh3je2lzutpelbwja
Page 6538 of Mathematical Reviews Vol. , Issue 2000i
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The basis is not based on filterbank iteration; instead, different filters are used for each scale. ...
Closed-form expressions for the filters are given, an efficient implementation of the transform is described, and improvement in a denoising example is shown. ...
The 5G candidate waveform race: a comparison of complexity and performance
2017
EURASIP Journal on Wireless Communications and Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The benefits of these new waveforms for the foreseen 5G use cases are clearly highlighted on representative criteria and experiments. ...
In addition to the complexity analysis, in this work, we also demonstrate the suitability of FBMC for specific 5G use cases via two experimental implementations. ...
For GFDM, we consider four symbols per carrier and an IC receiver with eight iterations. ...
doi:10.1186/s13638-016-0792-0
fatcat:khurb65tcvaqzpgt5zfqiekq7y
Comparative Study of AC Signal Analysis Methods for Impedance Spectroscopy Implementation in Embedded Systems
2022
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In implementations with hardware acceleration, the FFT with barycentre correction stands out. ...
This paper compares various methods, including the fast Fourier transform (FFT), the FFT with barycenter correction, the FFT with windowing, the Goertzel filter, the discrete-time Fourier transform (DTFT ...
Complexity n. op/Iteration FFT (Radix-2/4/8) Transform O(Nlog 2
Table 2 . 2 Efficient Hardware Acceleration Methods for AC signal analysis Methods Treated in this paper. ...
doi:10.3390/app12020591
fatcat:cm7lglpi5vh6zlderg5ezosvue
A 4096-Point Radix-4 Memory-Based FFT Using DSP Slices
2017
IEEE Transactions on Very Large Scale Integration (vlsi) Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
With this purpose, most of the hardware has been implemented in DSP48E. As a result, the proposed FPGA is efficient in terms of hardware resources, as is shown by the experimental results. ...
Apart from the low complexity, the FFT has been implemented on a Virtex 5 FPGA using DSP slices. The goal has been to reduce the use of distributed logic, which is scarce in the target FPGA. ...
This reduces the amount of hardware with respect to previous radix-4 memory-based FFTs. Furthermore, the proposed FFT has been implemented efficiently on an FPGA making use of the DSP slices. ...
doi:10.1109/tvlsi.2016.2567784
fatcat:yprfdmwbxrh5bpxmxexdxbem6q
An Energy-Efficient Biomedical Signal Processing Platform
2011
IEEE Journal of Solid-State Circuits
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents an energy-efficient processing platform for wearable sensor nodes, designed to support diverse biological signals and algorithms. ...
Programmable accelerators support numerous usage scenarios and perform signal processing tasks at 133 to 215× lower energy than the general-purpose CPU. ...
Sinangil for their valuable support, as well as to A. Shoeb and E. Shih for assistance with the EEG analysis algorithm. J. Kwong is supported by an NSERC fellowship. ...
doi:10.1109/jssc.2011.2144450
fatcat:vcxhvvh4djalbpdakpmhc5dkym
Page 6436 of Mathematical Reviews Vol. , Issue 2004h
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The questions are for- malizable and their solution must be based on efficient and robust computational techniques. ...
Summary: “We develop a new algorithm for the fast computa- tion of discrete sums f(y; ) := . 1K (yj; — x) G=1
based on the recently developed fast Fourier transform (FFT) at nonequispaced knots. ...
Spectral transformations for two-dimensional filters via FFT
2002
IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
In this paper, a new fast algorithm for spectral transformations for two-dimensional digital filters is presented. The algorithm is based on the use of the fast Fourier transform. ...
The simplicity and efficiency of the algorithm is illustrated by a numerical example. ...
Several implementation algorithms for 2-D digital filters have been widely reported [1] - [3] . Most of these algorithms are based on proper (2-D) rational (also called spectral) transformations. ...
doi:10.1109/tcsi.2002.1010037
fatcat:6ifvdwgb7jh43dhxw34sysjwsu
« Previous
Showing results 1 — 15 out of 10,264 results