Results 1  10
of
43,100
On semifast Fourier transform algorithms
, 907
"... In this paper, following [1, 2, 3, 4, 5, 6, 7] we consider the relations between wellknown Fourier transform algorithms. 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, following [1, 2, 3, 4, 5, 6, 7] we consider the relations between wellknown Fourier transform algorithms. 1
Learning Under the Fourier Transform Algorithm
, 1996
"... this paper was to implement the Fourier Transform algorithm for boolean function in an efficient way so that, as we shall demonstrate, it is not only a useful theoretical tool but also a practical one. Note that the procedure scales linearly with the number of input variables, conveniently allowing ..."
Abstract
 Add to MetaCart
this paper was to implement the Fourier Transform algorithm for boolean function in an efficient way so that, as we shall demonstrate, it is not only a useful theoretical tool but also a practical one. Note that the procedure scales linearly with the number of input variables, conveniently allowing
An Equivariant Fast Fourier Transform Algorithm
"... This paper presents a generalization of the CooleyTukey fast Fourier transform algorithm that respects group symmetries. The algorithm, when applied to a function invariant under a group of symmetries, fully exploits these symmetries to reduce both the number of arithmetic operations and the amount ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper presents a generalization of the CooleyTukey fast Fourier transform algorithm that respects group symmetries. The algorithm, when applied to a function invariant under a group of symmetries, fully exploits these symmetries to reduce both the number of arithmetic operations
Implementation issues in the Fourier Transform algorithm
 Proceedings of the Neural Information Processing Systems
, 1995
"... The Fourier transform of functions with boolean inputs has received considerable attention in the last few years in the Computational Learning Theory community, and has come to play an important role in proving many important learnability results. The aim of this work is to demonstrate that the Four ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
that the Fourier transform techniques are also a useful and practical algorithm, in addition to having many interesting theoretical properties. One of the benefits we present is the confidence level the algorithm produces in addition to the predictions. The confidence level measures the likelihood
Recursive Fast Fourier Transform Algorithm
, 2008
"... The basis of this report is to cover the Fast Fourier Transform (FFT) algorithm. The Fourier Transform is used mainly in the field of signal processing. The use of the Fourier Transform, and the FFT, is to convert a given input signal from the time domain to the frequency domain. This report will no ..."
Abstract
 Add to MetaCart
The basis of this report is to cover the Fast Fourier Transform (FFT) algorithm. The Fourier Transform is used mainly in the field of signal processing. The use of the Fourier Transform, and the FFT, is to convert a given input signal from the time domain to the frequency domain. This report
A Quantum Fourier Transform Algorithm
, 2004
"... Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds given earlier. Exact bounds are given for the number of qubits n ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds given earlier. Exact bounds are given for the number of qubits
Fast Fourier Transform algorithm for efficient
"... (FFT),Discrete Cosine Transforms are a major block in communication systems. This paper reports architecture of complex FFT core using new distributed arithmetic (NEDA) algorithm. New Distributed Arithmetic (NEDA) is one of the techniques to implement many digital signal processing systems that requ ..."
Abstract
 Add to MetaCart
(FFT),Discrete Cosine Transforms are a major block in communication systems. This paper reports architecture of complex FFT core using new distributed arithmetic (NEDA) algorithm. New Distributed Arithmetic (NEDA) is one of the techniques to implement many digital signal processing systems
Optimal multicriteria approach to the iterative Fourier transform algorithm
"... In this paper, we propose a unified approach for the multicriteria design of diffractive optics. A multicriteria version of the Direct Binary Search (DBS) that allows the user to tune the compromise between diffraction efficiency and Signal to Noise Ratio already exists. This technique proves extr ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
extremely powerful but also very time consuming. We extend this multicriteria approach to the Iterative Fourier Transform Algorithm (IFTA), which helps to reduce computation time dramatically, especially for multilevel domains. Simulations as well as experimental validations are provided.
Vortex Stagnation problem in iterative Fourier transform algorithms
, 2004
"... Optical vortex stagnation problem in Iterative Fourier Transform Algorithm occurs due to the termination of the process of self annihilation of optical vortices. The role played by propagation and inverse propagation operators combined with the Fourier domain constraint in this vortex annihilation p ..."
Abstract
 Add to MetaCart
Optical vortex stagnation problem in Iterative Fourier Transform Algorithm occurs due to the termination of the process of self annihilation of optical vortices. The role played by propagation and inverse propagation operators combined with the Fourier domain constraint in this vortex annihilation
An Improved Quantum Fourier Transform Algorithm and Applications
 In Proceedings of the 41st Annual Symposium on Foundations of Computer Science
, 2000
"... We give an algorithm for approximating the quantum Fourier transform over an arbitrary Z p which requires only O(n log n) steps where n = log p to achieve an approximation to within an arbitrary inverse polynomial in n. This improves the method of Kitaev [11] which requires time quadratic in n. Thi ..."
Abstract

Cited by 45 (6 self)
 Add to MetaCart
We give an algorithm for approximating the quantum Fourier transform over an arbitrary Z p which requires only O(n log n) steps where n = log p to achieve an approximation to within an arbitrary inverse polynomial in n. This improves the method of Kitaev [11] which requires time quadratic in n
Results 1  10
of
43,100