Purpose: Heart rate variability (HRV) is acknowledged as a useful tool to estimate autonomic function. Fast Fourier transform (FFT) and autoregressive model (AR) are used for power spectral analysis of HRV. However, there is little evidence of agreement between FFT and AR in relation to HRV following food intake in females. In the present study, we applied both FFT and AR after food intake duri...

We present the fast Fourier transform (FFT), of arbitrary dimensions, on the graphics processing unit (GPU). The FFT on GPUs exploits the architecture in its image processing capability, as well as its particular graphics/image rendering capacity. It also couples the processing and rendering furthermore. We view the GPU as a special architecture that supports fine-granularity, two-dimensional (...

This paper shows a design and implementation of a radix-4 FFT in FPGA using a Xilinx Spartan-6. The decimation in time equations are reviewed and in sequence several FPGA modules are presented according to algorithm architecture looking for optimization in execution time and occupied device area. Several tests were performed in order to validate the algorithm performance, FFT functionality, and...

We describe an implementation of the Cooley Tukey complex-to-complex FFT on the Connection Machine. The implementation is designed to make e ective use of the communications bandwidth of the architecture, its memory bandwidth, and storage with precomputed twiddle factors. The peak data motion rate that is achieved for the interprocessor communication stages is in excess of 7 Gbytes/s for a Conn...

In this paper, we present an e cient FFT based signaling scheme for Multimedia Steganography. The use of FFT permits the use of signal sets of large dimensions without increasing the computational complexity drastically. This is achieved by generating the maximally separable points of the signal constellation in such a way that detection is implemented through an FFT based cyclic correlation. I...

In this paper an adaptive broadband beamformer is presented which is based on a partitioned frequency-domain least-mean-square algorithm (PFDLMS). This block algorithm is known for its efficient computation and fast convergence even when the input signals are correlated. In applications where long filters are required but only a small processing delay is allowed, a frequency domain adaptive bea...

The Radon transform constitutes the conventional tool for tomosynthesis, i.e., composition of cross-sections an object from its projections. It is actually a version Fourier Transform, which accompanied by appropriate digital high pass filters correct distribution energy among reconstructed frequency components. and inverse are employed in their 2D 3D versions, respectively, whole procedure ver...

FFT (Fast Fourier Transform) factorizations presenting a regular interconnection pattern between factors or stages are known as parallel algorithms, or Pease algorithms since were first proposed by Pease. In this paper, new FFT/IFFT (Inverse FFT) factorizations with blocks that exhibit regular Pease interconnection pattern are derived. It is shown these blocks can be obtained at a previously se...

This paper presents an efficient VLSI design of 8kpoint pipeline fast Fourier transform (FFT) processor capable of producing the sequential order output. The proposed FFT architecture is derived based on the modified delay feed-forward data commutator, and processes the internal dual data streams in the real and imaginary alternate approach. Compared with the general pipeline FFT designs, ours ...

In this note, we present a simple geometric argument to determine a lower bound on the split rank of intersection cuts. As a first step of this argument, a polyhedral subset of the lattice-free convex set that is used to generate the intersection cut is constructed. We call this subset the restricted lattice-free set. It is then shown that dlog2(l)e is a lower bound on the split rank of the int...