• No results found

fast Fourier transform algorithm

MR Butterfly—A fast Fourier Transform Algorithm Based on MapReduce

MR Butterfly—A fast Fourier Transform Algorithm Based on MapReduce

... Cooley-Tukey algorithm, a fast Fourier transform algorithm MR-Butterfly for large data is proposed in this ...The algorithm makes full use of the fast Fourier ...

5

Simulation Analysis of Multiple BP Decoding Algorithm and FFT BP Decoding Algorithm

Simulation Analysis of Multiple BP Decoding Algorithm and FFT BP Decoding Algorithm

... decoding algorithm is based on the traditional BP decoding algo- rithm, and the fast Fourier transform algorithm is used to replace the convolu- tion operation in the variable node ...

9

Review on FPGA based OFDM System Implementation using FFT

Review on FPGA based OFDM System Implementation using FFT

... using Fourier Transform and the signals are converted back from frequency domain to the time domain with using Inverse Fourier ...the Fourier transform is an effective ...discrete ...

5

Fast Fourier Transform Using Advanced Processor

Fast Fourier Transform Using Advanced Processor

... Cooley–Tukey algorithm, named after ...common fast Fourier transform (FFT) ...discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller DFTs ...

5

Floating Interpolation Stencil Topology-Based Ie-FFT Algorithm

Floating Interpolation Stencil Topology-Based Ie-FFT Algorithm

... many fast integral equation solvers have been developed to expedite the iterative solution of integral equation, such as conjugate gradient fast Fourier transform (CG-FFT) [3], multilevel ...

15

An Integrated Skew Detection And Correction Using Fast Fourier Transform And DCT

An Integrated Skew Detection And Correction Using Fast Fourier Transform And DCT

... detection algorithm, the Fast Fourier Transform (FFT) technique is applied as it is fast approach for finding the angle of skewed ...that Fourier spectrum is ...

6

Introduction to Fast Fourier Transform in Finance

Introduction to Fast Fourier Transform in Finance

... the fast Fourier transform (FFT), will only require Kn ln n operations 2 , but one still has to choose n carefully because the constant K can be very large for some choices of ...the transform ...

30

BUILT-IN SELF-TEST AND CALIBRATION OF ON-CHIP SPECTRAL CHARACTERISTICS WITH LOW COMPLEXITY

BUILT-IN SELF-TEST AND CALIBRATION OF ON-CHIP SPECTRAL CHARACTERISTICS WITH LOW COMPLEXITY

... use Fast Fourier Transform (FFT) algorithm with fixed size and a simple signal generator synchronized with a modified ADC resolution and the overall accuracy is limited by the ADCs ...

9

A Modified FFT Algorithm using Pruning Technology Based on OFDM Wireless Communication System

A Modified FFT Algorithm using Pruning Technology Based on OFDM Wireless Communication System

... Abstract-- Fast Fourier transforms (FFT) and Inverse Fast Fourier Transform (IFFT) processing is one of the key procedures in popular orthogonal frequency division multiplexing (OFDM) ...

5

Fast Fourier Transform Pipeline Architecture for OFDM

Fast Fourier Transform Pipeline Architecture for OFDM

... The work demonstrated the implementation of a scalable radix-2 N-point novel FFT processor architecture based on a reasonable balance between performance, power, area, flexibility and scalability parameters was proposed. ...

5

Fast Fourier Transform Approach for Signal Analysis

Fast Fourier Transform Approach for Signal Analysis

... discrete Fourier transform (DFT). For better understanding of fast Fourier transform (FFT) algorithm (With the help of functions in Matlab – Structured Programming and simple ...

5

A Modified Hilbert Analysis Method to Improve Voice Stress Analysis Systems

A Modified Hilbert Analysis Method to Improve Voice Stress Analysis Systems

... Detection of stress by voice analysis has numerous applications, most notably in military, law enforcement and emergency services. The concept of VSA comes from when a person is under stress, micro-muscle tremors which ...

6

Enhancement of Retinex Algorithm using Fast Fourier Transform

Enhancement of Retinex Algorithm using Fast Fourier Transform

... which is large enough to fully describe the spatial domain image. Once the image is transformed into the frequency domain, filters can be applied to the image by convolution. FFT turns the complicated convolution ...

6

On Two Transform Methods for the  Valuation of Contingent Claims

On Two Transform Methods for the Valuation of Contingent Claims

... a fast Fourier method to compute option prices for a whole range of ...the fast Fourier transform method is motivated by the following reasons: The algorithm has speed advantage, ...

25

Sublinear Time Numerical Linear Algebra for Structured Matrices

Sublinear Time Numerical Linear Algebra for Structured Matrices

... the fast multiplication algorithm based on the Fast Fourier Transform associated with Vandermonde matrices to reduce the computation of SA to a small number of disjoint matrix-vector ...

8

A Space-Frequency Anti-Jamming Algorithm Based on Sub-Band Energy Detection

A Space-Frequency Anti-Jamming Algorithm Based on Sub-Band Energy Detection

... anti-jamming algorithm based on sub-band energy detection (SF-SED) is ...the algorithm performs fast Fourier transform (FFT) on the received data of the array antenna and obtains ...

10

A Comparison of High-Speed Polynomial Multiplication Algorithms for Modern Cryptosystem

A Comparison of High-Speed Polynomial Multiplication Algorithms for Modern Cryptosystem

... Winograd Fourier Transform Algorithm (WFTA) is a technique that combines the Raders index mapping and Winograds short convolution algorithm for prime-factors into a composite-N Fourier ...

5

ELECTROENCEPHALOGRAPHY (EEG) SIGNAL ENHANCEMENT AND ANALYSIS USING WAVELET TRANSFORM

ELECTROENCEPHALOGRAPHY (EEG) SIGNAL ENHANCEMENT AND ANALYSIS USING WAVELET TRANSFORM

... wavelet transform is asignificant method for analysis of EEG ...wavelet transform is that it is limited in both time and frequency, whereas other classical methods like the Fourier transform ...

6

Parameterized Spectral Bathymetric Roughness Using the Nonequispaced Fast Fourier Transform

Parameterized Spectral Bathymetric Roughness Using the Nonequispaced Fast Fourier Transform

... nonequispaced fast Fourier transform (Kunis, 2006) is exploited as the statistic to provide several parameters of roughness following the method of Fox ...

190

Fourier Theoretic Probabilistic Inference over Permutations

Fourier Theoretic Probabilistic Inference over Permutations

... and Fourier domains so as to avoid costly convolutions, and provided efficient algorithms for dihedral and metacyclic ...of Fourier coefficients of the actual distribution, allowing for a principled ...

74

Show all 10000 documents...

Related subjects