A parallel algorithm framework for feature extraction of EEG signals on MPI
Q Xiong, X Zhang, WF Wang… - … and Mathematical Methods …, 2020 - Wiley Online Library
In this paper, we present a parallel framework based on MPI for a large dataset to extract
power spectrum features of EEG signals so as to improve the speed of brain signal …
power spectrum features of EEG signals so as to improve the speed of brain signal …
Low-complexity Welch power spectral density computation
This paper presents a low-complexity algorithm and architecture to compute power spectral
density (PSD) using the Welch method. The Welch algorithm provides a good estimate of the …
density (PSD) using the Welch method. The Welch algorithm provides a good estimate of the …
50 years of FFT algorithms and applications
The fast Fourier transform (FFT) algorithm was developed by Cooley and Tukey in 1965. It
could reduce the computational complexity of discrete Fourier transform significantly from O …
could reduce the computational complexity of discrete Fourier transform significantly from O …
A High-Speed Low-Complexity Modified FFT Processor for High Rate WPAN Applications
This paper presents a high-speed low-complexity modified radix-2 5 512-point fast Fourier
transform (FFT) processor using an eight data-path pipelined approach for high rate wireless …
transform (FFT) processor using an eight data-path pipelined approach for high rate wireless …
A high-throughput radix-16 FFT processor with parallel and normal input/output ordering for IEEE 802.15. 3c systems
SJ Huang, SG Chen - … Transactions on Circuits and Systems I …, 2012 - ieeexplore.ieee.org
This paper presents a high-throughput FFT processor for IEEE 802.15. 3c (WPANs)
standard. To meet the throughput requirement of 2.59 Giga-samples/s, radix-16 FFT …
standard. To meet the throughput requirement of 2.59 Giga-samples/s, radix-16 FFT …
A High-Throughput Low-Complexity Radix- - - FFT/IFFT Processor With Parallel and Normal Input/Output Order for IEEE 802.11ad Systems
C Wang, Y Yan, X Fu - IEEE Transactions on Very Large Scale …, 2014 - ieeexplore.ieee.org
This brief presents a high-throughput low-complexity 512-point fast Fourier transform
(FFT)/inverse fast Fourier transform (IFFT) processor for IEEE 802.11 ad standard aiming at …
(FFT)/inverse fast Fourier transform (IFFT) processor for IEEE 802.11 ad standard aiming at …
An area-efficient and low-power 64-point pipeline Fast Fourier Transform for OFDM applications
GK Ganjikunta, SK Sahoo - Integration, 2017 - Elsevier
In an orthogonal frequency division multiplexing (OFDM) based wireless systems, Fast
Fourier Transform (FFT) is a critical block as it occupies large area and consumes more …
Fourier Transform (FFT) is a critical block as it occupies large area and consumes more …
Scaled Radix-2/8 Algorithm for Efficient Computation of Length- DFTs
This paper presents a scaled radix-2/8 fast Fourier transform (FFT)(SR28FFT) algorithm for
computing length-N= 2 m discrete Fourier transforms (DFTs) scaled by complex number …
computing length-N= 2 m discrete Fourier transforms (DFTs) scaled by complex number …
A high performance split-radix FFT with constant geometry architecture
J Kwong, M Goel - 2012 Design, Automation & Test in Europe …, 2012 - ieeexplore.ieee.org
High performance hardware FFTs have numerous applications in instrumentation and
communication systems. This paper describes a new parallel FFT architecture which …
communication systems. This paper describes a new parallel FFT architecture which …
Performance evaluation of FFT processor using conventional and Vedic algorithm
AR Prakash, S Kirubaveni - 2013 IEEE International …, 2013 - ieeexplore.ieee.org
Recently digital signal processing has received high attention due to the advancement in
multimedia and wireless communication. Accordingly Orthogonal Frequency Division …
multimedia and wireless communication. Accordingly Orthogonal Frequency Division …