We solve each of the derived cost function with a low complexity fast-Fourier-transform (FFT)-based solution in three dimensions. We further carry out a derivation to reduce the three-dimensional search to two-dimensional (2D) search and solve it with a 2D-FFT. Another reduced dimension ...
image. If the whole scene in the images of the video is moving uniformly as in camera panning on a distant shot, i.e., translational motion, all the spatial frequency components move at the same velocity v. Then, the image can be decomposed into those components by using a 2D FFT. ...
Because the beat periods may be approximations due to the imprecision of mathematical processes, such as the sampling rate, the FFT window, beat detection, etc., the same interval may have a period that varies by two samples. Thus, a phase to consolidate the periods may be used. For ...
As the first functional studies of 3D neuronal networks emerge4, the experimental challenges remain strict: Neurons generate and propagate electrical signals at a millisecond timescale via action potentials. Thus, the functionality of a neuronal tissue needs to be assessed at this timescale in 3D, ...
It uses inverse symplectic Fourier transform (ISFFT) to spread the signal in time-frequency domain. To extract diversity gain from 2D spreaded signal, advanced receivers are required. In this work, we investigate a low complexity linear minimum mean square error receiver which exploits sparsity and...
Electroencephalography (EEG) is a method for recording electrical activity, indicative of cortical brain activity from the scalp. EEG has been used to diagnose neurological diseases and to characterize impaired cognitive states. When the electrical activ
A three-stage algorithm of combining sequential heuristic methods into a parallel neural network is presented for the channel assignment problem in cellula... N Funabiki,N Okutani,S Nishikawa - 《IEEE Transactions on Vehicular Technology》 被引量: 66发表: 2002年 Partial FFT demodulation: A detecti...
We propose a low-complexity acquisition algorithm that is capable of capturing extremely weak DSSS signal in the presence of large Doppler dynamics. The algorithm uses fast Fourier transform (FFT)-based frequency-domain techniques to implement circular correlations between the received signal and the ...
The algorithm proposed in this paper improves the resolving power by two and one orders of magnitude, respectively, compared to the classical FFT and MUSIC algorithms in the same signal-to-noise environment, and the complexity of the algorithm can be reduced by about 25-30%, with the same ...
For sorting and for FFT graphs, it is shown that communication delay of Ω(n log n/(p log(n/p)) is required for p≤n/ log n. This bound is tight for FFT graphs; it is also shown to be tight for sorting provided p≤n 1ε for any fixed ε>0. Given a binary tree, τ, ...