140 search results - page 6 / 28 » A Novel Approach to Fast Discrete Hartley Transform |
PACT
2009
Springer
14 years 2 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
ICMCS
2009
IEEE
13 years 5 months ago
2009
IEEE
This paper presents a tool and a novel Fast Invariant Transform (FIT) algorithm for language independent e-documents access. The tool enables a person to access an e-document thro...
SMI
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper we present a new method for alignment of 3D models. This approach is based on symmetry properties, and uses the fact that the principal components analysis (PCA) hav...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
We propose a novel algorithm for sparse system identification in the frequency domain. Key to our result is the observation that the Fourier transform of the sparse impulse respo...