Topic
Hartley transform
About: Hartley transform is a research topic. Over the lifetime, 2709 publications have been published within this topic receiving 79944 citations.
Papers published on a yearly basis
Papers
More filters
Patent•
20 Dec 1996
TL;DR: In this paper, an apparatus and a method perform an N-point Fast Fourier Transform (FFT) on first and second arrays having real and imaginary input values using a processor with a multimedia extension unit (MEU), wherein N is a power of two.
Abstract: An apparatus and a method perform an N-point Fast Fourier Transform (FFT) on first and second arrays having real and imaginary input values using a processor with a multimedia extension unit (MEU), wherein N is a power of two. The invention repetitively sub-divides the N-point Fourier Transform into N/2-point Fourier Transforms until only a 2-point Fourier Transform remains. Next, it vector processes the 2-point Fourier Transform using the MEU and cumulates the results of the 2-point Fourier Transforms from each of the sub-divided N/2 Fourier Transforms to generate the result of the N-point Fourier Transform.
23 citations
TL;DR: The Heisenberg Uncertainty principles for the two-dimensional nonseparable linear canonical transform (2-D NSLCT) are derived and the functions that can achieve the lower bound of the inequality are found.
23 citations
Patent•
NEC1
TL;DR: In this paper, a linear transform calculation on a product signal produced by multiplying a predetermined transform window function and an apparatus input signal is described. But this is not applicable to either of forward and inverse transform units.
Abstract: In an apparatus for carrying out a linear transform calculation on a product signal produced by multiplying a predetermined transform window function and an apparatus input signal, an FFT part (23) carries out fast Fourier transform on a processed signal produced by processing the product signal in a first processing part (21). As a result, the FFT part produces an internal signal which is representative of a result of the fast Fourier transform. A second processing part (22) processes the internal signal into a transformed signal which represents a result of the linear transform calculation. The apparatus is applicable to either of forward and inverse transform units (11, 12).
23 citations
01 Aug 1987
TL;DR: The cas-cas transform as mentioned in this paper is a real-to-real transform for convolutional arrays and power spectra, which can be used to compute 2D power spectrum.
Abstract: This letter introduces a discrete, separable, real-to-real transform, called the cas-cas transform. Theorems for the two-dimensional (2-D) case are presented, and the cas-cas transform is compared to the Hartley transform as an alternative way to convolve 2-D arrays and compute 2-D power spectra.
23 citations
23 citations