|
Match
|
Document |
Document Title |
|
|
6988117 |
Bit-reversed indexing in a modified harvard DSP architecture
A method for indexing a plurality of ordered elements stored in bit-reversed order in a first and a second memory space, the first memory space indexed by a first memory index denoting memory...
|
|
|
6985919 |
Time-recursive lattice structure for IFFT in DMT application
The present invention may significantly reduce the number of iteration of the time recursive IFFT structure. First, the real and imaginary part of the input signal are modified based on the...
|
|
|
6976047 |
Skipped carry incrementer for FFT address generation
A method and apparatus are used to generate FFT data addresses for a butterfly stage based upon a computation stage value. The method includes setting a selected bit of a binary word at a logical...
|
|
|
6963891 |
Fast fourier transform
A fast Fourier transform with sequential memory accessing within each stage.
|
|
|
6963892 |
Real-time method and apparatus for performing a large size fast fourier transform
A method and apparatus for performing a fast Fourier transform (FFT) computation on large data sizes in real time is provided. The speed at which a FFT is performed is increased by reducing the...
|
|
|
6957241 |
FFT and FHT engine
A transformation engine includes an address generator; a butterfly unit coupled to the address generator; a twiddle LUT coupled to the address generator; and a multiplier having a first input...
|
|
|
6938064 |
Method for computing fast Fourier transform and inverse fast Fourier transform
A method of calculating the fast Fourier transform or the inverse fast Fourier transform of a series of N real samples x(n), with N power of two, operating according to a time interleaving...
|
|
|
6917955 |
FFT processor suited for a DMT engine for multichannel CO ADSL application
A real-valued FFT processor implements Bergland's real-valued FFT and uses unique interstage switching/delay modules to reduce pipeline latency. Modified hybrid floating point arithmetic is also...
|
|
|
6907439 |
FFT address generation method and apparatus
A method and apparatus are used to generate FFT data addresses based upon a computation stage value and a computation step value within that computation stage. The method includes the steps of...
|
|
|
6868114 |
Interference suppression in a spread spectrum communications system using non-linear frequency domain excision
In a frequency-domain excision system for a wide band receiver, a window function is applied to blocks of received signal samples and a transform function is applied to the windowed blocks. Each...
|
|
|
6862262 |
OFDM communication device and detecting method
Residual phase error compensation circuit 104 performs differential detection between pilot symbols included in an OFDM signal to compensate for residual phase errors of the OFDM signal and then...
|
|
|
6859816 |
Fast Fourier transform method and inverse fast Fourier transform method
First, at step S 1 , i=0 is set. At step S 2 , data comprising M samples is fetched. At step S 3 , an M-point DFT is applied to the data fetched at step S 2 above. At step S 4 , an obtained y(k)...
|
|
|
6760741 |
FFT pointer mechanism for FFT memory management
A method for advancing pointers in a memory including a sequence of N data points of a stage M of a Fast Fourier Transform (FFT) whose first stage is stage 0, the N data points including N/2 a data...
|
|
|
6751641 |
Time domain data converter with output frequency domain conversion
A time domain data converter with output frequency domain conversion. A data conversion circuit is operable to receive a signal in the time domain and provide an output in the frequency domain. It...
|
|
|
6751642 |
Process and device for transforming complex symbols into real data, especially for the transmission over a telephone line of phase-modulated and amplitude-modulated carriers
Interleaved type processing includes a preprocessing phase in which for each initial symbol received an auxiliary symbol that includes N auxiliary complex samples is formulated, and a processing...
|
|
|
6747946 |
Method and apparatus for transmitting orthogonal-multi-carrier signal
An apparatus for transmitting an orthogonal-multi-carrier signal includes a first device for subjecting an information signal to first inverse discrete Fourier transform to convert the information...
|
|
|
6741551 |
Hybrid TDMA/CDMA system based on filtered multitone modulation
A multiple access communications network system in which a head-end controller (HC) broadcasts data and medium-access control (MAC) information over a set of downstream channels to several...
|
|
|
6735221 |
Communication network system
A digital communications network system for multiple access has a head-end node and at least one station node at at least one other end node; the system comprises a head-end controller ( 3 )...
|
|
|
6728742 |
Data storage patterns for fast fourier transforms
A method of performing a FFT of a sequence of N=B n numbers, where B is a power of 2 and n is a positive integer. A pattern of storage locations for the B n numbers in M in-place memories is...
|
|
|
6718356 |
In-place operation method and apparatus for minimizing the memory of radix-r FFTs using maximum throughput butterflies
The invention relates generally to radix-r FFTs (Fast Fourier Transforms), and more particularly to a method and an apparatus for assigning data samples to memory when computing a radix-r FFT. In...
|
|
|
6711600 |
System and method for RAM-partitioning to exploit parallelism of RADIX-2 elements in FPGAs
A system and method are disclosed for providing highly parallel, FFT calculations in a circuit including a plurality of RADIX-2 elements. Partitioned RAM resources allow RADIXes at all stages to...
|
|
|
6704438 |
Apparatus and method for improving the signal to noise ratio on ultrasound images using coded waveforms
A parallel, frequency domain filter ( 50 ) for providing frequency-dependent phase delay for real data includes a fast Fourier transform (FFT) device ( 52 ), a complex multiplier ( 54 ), a filter...
|
|
|
6665697 |
Fourier analysis method and apparatus calculating the Fourier factor Wn utilizing trigonometric relations
The data carrying signals to be synthesized into an image, to be subject to data compression can be subjected to Fourier transformation by the formation of a Fourier factor W N which is a function...
|
|
|
6658441 |
Apparatus and method for recursive parallel and pipelined fast fourier transform
A circuit for performing Fast Fourier Transform (FFT) with minimum number of clock cycles and minimum complexity. One-dimensional FFT of size N=N 0 ×N 1 × . . . ×N M−1 , N m m=0, 1, . . . ,...
|
|
|
6629117 |
Method for computing a fast fourier transform and associated circuit for addressing a data memory
The present invention is generally directed to a novel method of computing a fast Fourier transform (FFT), and an associated circuit that controls the addressing of a data memory of the FFT...
|
|
|
6625630 |
Two cycle FFT
A digital signal processor (DSP) includes at least two multipliers, at least two three-input arithmetic logic units (ALU), at least two first-cycle registers, at least two second-cycle registers,...
|
|
|
6615227 |
Circuit and method for computing a fast fourier transform
A processing circuit is disclosed for computing a fast Fourier transform (FFT). In one embodiment, the processing circuit includes a memory device, a multiplier, a detector, a state machine, and a...
|
|
|
6609140 |
Methods and apparatus for fast fourier transforms
A system for calculating fast Fourier transforms includes a non-final stage calculating means for repetitively performing in-place butterfly calculations for n−1 stages as well as a final stage...
|
|
|
6601206 |
Error concealment or correction of speech, image and video signals
A method of error concealment or correction, suitable for signals such as speech, image and video signals, and particularly for such signals as transmitted over wireless and ATM channels. The...
|
|
|
6591284 |
Method for performing a fast transform
The power consumption, memory allocation, and CPU time used in a signal processor executing a fast transform can be optimized by using a particular method of scheduling the calculations. The...
|
|
|
6564236 |
Device and associated method for calculating the direct or inverse fourier transform of the product of a complex symbol times a complex sinusoidal waveform
A device includes a processor able to calculate the direct or inverse Fourier transform of the product of a complex input symbol of size N times a complex sinusoidal waveform of period n. The...
|
|
|
6549925 |
Circuit for computing a fast fourier transform
The present invention is generally directed to a processing circuit for computing a fast Fourier transform (FFT). The present invention reflects the recognition that excessive reads to and writes...
|
|
|
6549589 |
Digital audio broadcasting receiver
A DAB (Digital Audio Broadcasting) receiver includes a delay circuit for delaying a received DAB signal by a prescribed period, a correlation circuit for taking correlation between a delayed output...
|
|
|
6532484 |
Parallel system and method for performing fast fourier transform
A parallel FFT generating system is disclosed for generating a Fast Fourier Transform (FFT) of an input vector. The parallel FFT generating system includes a plurality of processes configured to...
|
|
|
6509866 |
Fast chirp transform
A Fast Chirp Transform (FCT) for the digital processing of chirp signals and exemplary applications. The FCT is a generalization of a multidimensional Fast Fourier Transform. Phase coefficients for...
|
|
|
6477444 |
Method for the automated design of decentralized controllers for modular self-reconfigurable robots
A method and computer-readable medium is provided for designing control software for a module in a self-reconfigurable robot. A genetic method randomly selects a plurality of module software...
|
|
|
6463451 |
High speed digital signal processor
A digital signal processor being capable of rapidly operating a number of complex arithmetic formulae as such FFT. The digital signal processor operates data from first input line and data from...
|
|
|
6430149 |
Processing circuits for complex operation
A processing circuit for a complex operation, includes buffer memories in which a pair of quadrature demodulation output signals based on a modulated carrier wave signal obtained in accordance with...
|
|
|
6430587 |
Method and apparatus for FFT computation
A method and an apparatus for computing Fast Fourier Transforms (FFT) on a serial input of data blocks are described. Two input buffers share one data processing device in such a way that, at any...
|
|
|
6421696 |
System and method for high speed execution of Fast Fourier Transforms utilizing SIMD instructions on a general purpose processor
A method for performing Fast (forward or inverse) Fourier Transform in a micro-processor-based computer system. The microprocessor includes parallel execution resources for executing parallel...
|
|
|
6411978 |
Mechanism for block floating point FFT hardware support on a fixed point digital signal processor
A processor for performing a block floating point Fast Fourier Transform having improved signal to quantization noise ratio performance. In the radix-2 Decimation In Time algorithm, overflow...
|
|
|
6400782 |
Method of frequency domain filtering employing a real to analytic transform
The present invention discloses a novel scheme of performing frequency domain filtering that does not require a Hilbert transform and which is faster than equivalent FIR filtering schemes. Such a...
|
|
|
6401162 |
Generalized fourier transform processing system
Improved Fourier transform processing systems for a data transmission system are disclosed. The improved Fourier transform processing systems efficiently performs Fourier transform signal...
|
|
|
6366936 |
Pipelined fast fourier transform (FFT) processor having convergent block floating point (CBFP) algorithm
A pipelined FFT (fast Fourier transform) processor including a CBFP (convergent block floating point) algorithm, includes an inverse multiplexer for inverse-multiplexing an 8K-/2K-point input data,...
|
|
|
6356926 |
Device and method for calculating FFT
The present invention relates to a device and a method for calculating FFT, IFFT or like transforms with the aid of a calculating unit and at least two memories. The calculating unit reads input...
|
|
|
6351758 |
Bit and digit reversal methods
The present invention provide a method of implementing bit reversal using a subtree lookup table. In another aspect of the invention, a subtree lookup table is used to implement digit reversal.
|
|
|
6304887 |
FFT-based parallel system for array processing with low latency
A DSP system is provided for performing FFT computations with low latency by parallel processing of complex data points through a plurality of butterfly FFT execution units. The system simplifies...
|
|
|
6279022 |
System and method for detecting symbol boundary in multi-carrier transmission systems
Frame synchronization between Asymmetric Digital Subscriber Line (ADSL) transceivers operating using Discrete Multi-tone (DMT) line code is effectuated by boundary detection logic executing a...
|
|
|
6263356 |
Fast fourier transform calculating apparatus and fast fourier transform calculating method
A calculating apparatus performs FFT calculation or IFFT calculation on input data and then outputs the calculated data. An input buffer memory temporarily stores the input data and outputs it to a...
|
|
|
6247034 |
Fast fourier transforming apparatus and method, variable bit reverse circuit, inverse fast fourier transforming apparatus and method, and OFDM receiver and transmitter
In fast Fourier transform, a necessary memory capacity is decreased, thereby decreasing a cost. The fast Fourier transform is performed on a symbol stored in a RAM by a butterfly operation unit in...
|