Matches 1 - 50 out of 176 1 2 3 4 >


Match Document Document Title
US20150248374 TWIDDLE FACTOR GENERATION  
Systems and methods for generating twiddle factors are described herein according to various embodiments of the present disclosure. In one embodiment, a method for twiddle factor generation...
US20110289130 FFT COMPUTING APPARATUS AND POWER COMPUTING METHOD  
In an FFT computing apparatus, a computation-unit switching detection unit detects timing at which a complex multiplication is not being carried out in said butterfly computation of FFT...
US20140082039 Interleaved Method for Parallel Implementation of the Fast Fourier Transform  
The present invention generally relates to a method for computing a Fast Fourier Transform (FFT). In one embodiment, the present invention relates to an interleaved method for computing a Fast...
US20130046805 Precision Measurement of Waveforms Using Deconvolution and Windowing  
The invention consists of new ways of constructing a Measuring Matrices (MMs) including time deconvolution of Digital Fourier Transforms DFTs. Also, windowing functions specifically designed to...
US20120143936 RADIX-8 FIXED-POINT FFT LOGIC CIRCUIT CHARACTERIZED BY PRESERVATION OF SQUARE ROOT-i OPERATION  
A system and method to reduce roundoff error of Fast Fourier transform (FFT) operation. Data which comes out as an irrational number (a square root) out of twiddle factors on a complex plane,...
US20110113037 Matching a Fingerprint  
A method and a system are provided for matching a fingerprint, for example, an audio fingerprint. In one example, the system receives, from a user device, a chapter and a query about the chapter....
US20050251545 Learning heavy fourier coefficients  
A method includes searching in the ZN domain, for N greater than 2, for heavy Fourier coefficients of a function. The method may be implemented for any type of signal compression, such as image,...
US20150113030 NOVEL APPROACH FOR SIGNIFICANT IMPROVEMENT OF FFT PERFORMANCE IN MICROCONTROLLERS  
A system includes a memory bank and a control unit. The control unit is configured to perform FFT computations based on Merged radix-2 butterfly calculations by performing FFT computations over N...
US20120221617 Methods and apparatus for fast matrix multiplication and fast solving of matrix equations based on generalized convolution  
A method of fast matrix multiplication and a method and apparatus for fast solving of a matrix equation are disclosed. They are useful in many applications including image blurring, deblurring,...
US20130066932 CONSTANT GEOMETRY SPLIT RADIX FFT  
An apparatus for performing a Fast Fourier Transform (FFT) is provided. The apparatus comprises a reorder matrix, symmetrical butterflies, and a memory. The reorder matrix is configured to have a...
US20120131081 Hybrid Fast Fourier Transform  
A hybrid fast Fourier transform (FFT) combines a prime-factor algorithm (PFA) with a Cooley-Tukey algorithm (CTA). The combining includes performing combined permutations and combined weight...
US20120131079 METHOD AND DEVICE FOR COMPUTING MATRICES FOR DISCRETE FOURIER TRANSFORM (DFT) COEFFICIENTS  
A method of computing matrices of discrete-frequency Discrete Fourier Transform (DFT) coefficients, the method including the steps of (a) for a first frame (10) of samples, multiplying a frame of...
US20120041996 Parallel pipelined systems for computing the fast fourier transform  
The present invention relates to the design and implementation of parallel pipelined circuits for the fast Fourier transform (FFT). In this invention, an efficient way of designing FFT circuits...
US20080155002 Combined fast fourier transforms and matrix operations  
Embodiments of a hardware accelerator having a circuit configurable to perform a plurality of matrix operations and Fast Fourier Transforms (FFT) are presented herein.
US20060224651 Combined IFFT and FFT system  
A system (12) for determining discrete transforms as between time and frequency domains. The system comprises a grid (60) comprising adders and multipliers. The grid is operable to perform in...
US20080140747 COMPLEX MULTIPLIER AND TWIDDLE FACTOR GENERATOR  
The present invention relates to a complex multiplier and a twiddle factor generator. The complex multiplier according to an embodiment of the invention includes: a first adder/subtracter that...
US20080126026 FFT/IFFT processor and intellectual property builder  
A FFT/IFFT processor and an intellectual property (IP) builder are disclosed. Which include a circuit applying the mixed-radix algorithm and a parametric graphic user interface (GUI). The circuit...
US20070162533 Circuit for fast fourier transform operation  
A circuit for a fast Fourier transform (FFT) operation is provided. The FFT operation circuit includes a plurality of butterfly operation units connected in series. Each of the plurality of...
US20100205532 Customizable music visualizer  
Audio/music visualizers have become standard features in most music/video software applications available for music/video players. The music visualizer presents the user with a beautiful...
US20110219052 DISCRETE FOURIER TRANSFORM IN AN INTEGRATED CIRCUIT DEVICE  
Circuitry performing Discrete Fourier Transforms. The circuitry can be provided in a fixed logic device, or can be configured into a programmable integrated circuit device such as a programmable...
US20140280421 FFT ACCELERATOR  
An FFT operation is performed by dividing n time-domain input points into a plurality of groups of m points, performing a plurality of constant-geometry butterfly operations on each of the groups...
US20100085048 ROTATING-FRAME GRADIENT FIELDS FOR MAGNETIC RESONANCE IMAGING AND NUCLEAR MAGNETIC RESONANCE IN LOW FIELDS  
A system and method for Fourier encoding a nuclear magnetic resonance (NMR) signal is disclosed. A static magnetic field B0 is provided along a first direction. An NMR signal from the sample is...
US20100011045 Device and method for applying signal weights to signals  
Signal weights corresponding to an initial system of equations with a block coefficient matrix T0 can be obtained from the solution to a system of equations with a block coefficient matrix T. The...
US20090150470 FAST FOURIER TRANSFORMATION CIRCUIT  
Provided is a fast Fourier transformation circuit capable of optimizing an operation resource while matching a plurality of communication systems. In this circuit, an FFT circuit (100) comprises a...
US20070288542 MULTI-PORT MIXED-RADIX FFT  
A processor for performing a fast Fourier transform or inverse fast Fourier transform comprises a radix-2 butterfly structure; and a radix-4 butterfly structure. A method of performing a fast...
US20100070551 FOURIER TRANSFORM PROCESSING AND TWIDDLE FACTOR GENERATION  
In a data processing system, having a twiddle factor unit, a method for performing a mixed-radix discrete Fourier transform (DFT) having a block size, N, and a maximum block size, Nmax, wherein...
US20050138098 FFT/IFFT processor  
An FFT/IFFT processor having computation logic capable of processing butterfly operations, and storage for storing the operands of butterfly operations, including a mechanism for storing the...
US20060248135 Fast fourier transform twiddle multiplication  
An FFT engine implementing a cycle count method of applying twiddle multiplications in multi-stages. When implementing a multistage FFT, the intermediate values need to be multiplied by various...
US20140089368 Device with capability of processing FFT radix 2 butterfly operation and operation method thereof  
The disclosure provides a device with a capability of processing a Fast Fourier Transform Algorithm (FFT) radix 2 butterfly operation and an operation method thereof, the device at least includes...
US20140330880 METHODS AND DEVICES FOR MULTI-GRANULARITY PARALLEL FFT BUTTERFLY COMPUTATION  
A method and device for multi-granularity parallel FFT butterfly computation. The method and device read data and twiddle factors for computation in one butterfly group from the input buffers and...
US20080071847 Method for Transforming Data by Look-Up Table  
Provided is a method for transforming data using a look-up table. The method includes the steps of: (a) mapping preprocessed input binary data to a constellation diagram divided into four...
US20090049112 INTERLEAVED METHOD FOR PARALLEL IMPLEMENTATION OF THE FAST FOURIER TRANSFORM  
The present invention generally relates to a method for computing a Fast Fourier Transform (FFT). In one embodiment, the present invention relates to an interleaved method for computing a Fast...
US20090077150 METHOD AND SYSTEM FOR CONTROLLING A VOLTAGE WAVEFORM  
A method of automating a process for controlling a voltage waveform applied to an object is provided. A first waveform for applying to the object is received. A first FFT of the first waveform is...
US20060075010 Fast fourier transform method and apparatus  
A method and apparatus, especially suited for computers that can execute fused multiply-add instructions, for performing a fast Fourier transform (FFT) are disclosed. Divisions by zero that create...
US20120166507 METHOD AND APPARATUS OF PERFORMING FAST FOURIER TRANSFORM  
Disclosed are a method and apparatus of performing a fast Fourier transform (FFT). The apparatus include a plurality of single-path delay feedback (SDF) butterfly blocks which performs butterfly...
US20090063604 Vdsl2 Transmitter/Receiver Architecture  
The invention suggests a novel pipeline FFT/IFFT architecture that not only produces time-domain samples (after IFFT) but also pushes time-domain samples into FFT in a time-based sequential order....
US20100036898 COMPUTING MODULE FOR EFFICIENT FFT AND FIR HARDWARE ACCELERATOR  
A hardware accelerator operable in an FFT mode and an FIR mode. The hardware accelerator takes input data and coefficient data and performs the calculations for the selected mode. In the FFT mode,...
US20120166508 FAST FOURIER TRANSFORMER  
A fast Fourier transformer (FFT) includes a radix-2 butterfly unit configured to perform a butterfly operation on input data; a buffer unit configured to buffer data outputted from the radix-2...
US20050289207 Fast fourier transform processor, dynamic scaling method and fast Fourier transform with radix-8 algorithm  
The present invention provides a fast Fourier transform processor, dynamic scaling method and fast Fourier transform with radix-8 algorithm. It reduces quantization errors generated from the...
US20080215656 FAST FOURIER TRANSFORM CIRCUIT AND FAST FOURIER TRANSFORM METHOD  
A fast Fourier transform circuit includes a computation component, an extraction component and a setting component. The extraction component, at each step of the computation, extracts, from...
US20070266070 Split-radix FFT/IFFT processor  
This invention presents a CORDIC-based split-radix FFT/IFFT (Fast Fourier Transform/Inverse Fast Fourier Transform) processor dedicated to the computation of 2048/4096/8192-point DFT (Discrete...
US20070192394 Processor and method for performing a fast fourier transform and/or an inverse fast fourier transform of a complex input signal  
A processor for performing a Fast Fourier Transform and/or an Inverse Fast Fourier Transform of a complex input signal comprises a first stage for passing the input signal to a second stage when a...
US20050278405 Fourier transform processor  
The present invention is two-iteration Fourier transform processor for performing Fourier transform of N data inputs into N data outputs. The processor comprises a plurality of two-iteration...
US20110025371 METHOD FOR DETECTING A FAULT IN AN INDUCTION MACHINE  
The invention concerns a method for detecting a fault in a rotating field machine, in which current components are analysed in a flux-based, particularly rotor-flux-based, coordinate system a...
US20090222144 SYSTEMS AND METHODS FOR ELECTROMECHANICAL OSCILLATION MONITORING  
Systems and methods for electromechanical oscillation monitoring are disclosed herein. In one embodiment, a method for monitoring electromechanical oscillation in a power system includes forming a...
US20100085065 PASSIVE AGENT SYSTEM IMPEDANCE MONITORING STATION AND METHOD  
This invention relates to a hybrid passive agent system impedance monitoring station and method. The method of monitoring impedance of an electrical system includes the steps of providing an...
US20110137968 METHOD FOR DETERMINING THE POSITION OF IMPACTS  
A method for determining the position of impacts on an object comprising two acoustic sensors, and N active areas of said object, comprises the steps of: (a) receiving two acoustic signals S1(t)...
US20060253514 Memory-based Fast Fourier Transform device  
A memory-based Fast Fourier Transform device is provided, which adopts single-port random access memory (RAM), rather than dual-port RAM, as a storage, and the circuit area of the FFT device is...
US20080071848 In-Place Radix-2 Butterfly Processor and Method  
A butterfly processor architecture including a single high speed multiplier unit and two adder/subtracter units structured to efficiently perform radix-2 decimation-in-time (DIT) butterfly...
US20100030831 MULTI-FPGA TREE-BASED FFT PROCESSOR  
A fast Fourier transform (FFT) computation system comprises a plurality of field programmable gate arrays (FPGAs), a plurality of initial calculations modules, a plurality of butterfly modules, a...

Matches 1 - 50 out of 176 1 2 3 4 >