|
Match
|
Document |
Document Title |
|
|
7596472 |
Device for synthesis of a composite digital signal with explicit control of the first three moments thereof
The device determines the weighting coefficients to be applied to N digital source signals to form a composite signal. The first- to third-order moments of the composite signal must respectively...
|
|
|
7577698 |
Fast fourier transform processor
A Fast Fourier Transform (FFT) processor is provided. It comprises a multiplexer, a first angle rotator, a second angle rotation and multiplexing unit, an adder, a twiddle factor storage, a...
|
|
|
7574313 |
Information signal processing by modification in the spectral/modulation spectral range representation
Processing of information signals separated according to modulation and carrier components in a more controlled way is made possible by a device for processing an information signal including a...
|
|
|
7555511 |
Methods for addressing input data values of a Fast Fourier Transform (FFT) calculation
A method for the generation of addresses of successive pairs of input data values of stages of a Fast Fourier Transform calculation stored contiguously in a memory includes initializing at most...
|
|
|
7555509 |
Parallel fast Fourier transformation method of concealed-communication type
In a 3-dimensional fast Fourier transformation implemented by using a parallel-processing computer, an overhead caused by transfers of data between processors employed in the computer is reduced...
|
|
|
7552162 |
Receiver and communication method for digital multi-carrier communication
A receiving apparatus and receiving method employ a digital multi-carrier transmission technique utilizing a real coefficient wavelet filter bank in digital demodulation. The receiving apparatus...
|
|
|
7552161 |
Multi-stream FFT for MIMO-OFDM systems
The present invention proposes a signal processor for Fast Fourier Transformation, FFT, of M R , M R >1, input data streams of 2 k samples each, supplied in parallel. After multiplexing the...
|
|
|
7552159 |
Transform calculation device
The present invention relates to a discrete transform calculation device (FFTP). The device has control means (CNTRL) which configure first and second memories (RAM 1 and RAM 2 ) according to the...
|
|
|
7543010 |
Modular pipeline fast Fourier transform
A modular pipeline algorithm and architecture for computing discrete Fourier transforms is described. For an N point transform, two pipeline √{square root over (N)} point fast Fourier transform...
|
|
|
7543009 |
Fractional fourier transform convolver arrangement
An M-point Fractional Fourier is described using several 2M-points traditional Fourier transforms. The signal path is fed through a series of blocks including a first multiplier, a zero pad, an...
|
|
|
7496618 |
System and method for a fast fourier transform architecture in a multicarrier transceiver
A Fourier transform architecture and system for FFT and IFFT processing within multicarrier transceiver is disclosed that includes a programmable butterfly component, a memory and a programmable...
|
|
|
7486609 |
European digital audio broadcast receiver having a simply implementable fast fourier transform processor and an operation method therefor
Disclosed is a European digital audio broadcast receiver having a simply implementable fast Fourier transform processor and an operation method therefor. A digital audio broadcast receiver having...
|
|
|
7464127 |
Fast fourier transform apparatus
A data transform system performs FFT and IFFT computations with respect to N data points. The data transform system performs radix-R (R is an integer) butterfly computation in parallel by use of M...
|
|
|
7461114 |
Fourier transform apparatus
A Fourier transform apparatus whose pipeline width is independent of transform point number of individual pipeline FFT circuits in each stage and composed of a preceding stage and a succeeding...
|
|
|
7454452 |
Fast fourier transform operation with reduced cache penalty
A data processing apparatus having data cache performs an N-point radix-R Fast Fourier Transform. If the data set is smaller than the data cache, the data processing apparatus performs the Fast...
|
|
|
7437396 |
Apparatus and method for generating transforms
An apparatus includes a primary information storage unit, a secondary information storage unit, and an information processing unit. The primary information storage unit has a primary storage...
|
|
|
7437395 |
FFT operating apparatus of programmable processors and operation method thereof
A fast Fourier transform (FFT) operating apparatus and a method thereof carries out an FFT operation in a programmable processor chip. A program controller generates an FFT start signal and...
|
|
|
7430575 |
One-dimensional fourier transform program, method and apparatus
A one-dimensional Fourier transform program for quickly performing a one-dimensional Fourier transform intended for a scalar computer comprises a step of resolving a data length N of...
|
|
|
7428564 |
Pipelined FFT processor with memory address interleaving
A fast Fourier transform processor using a single delay path and a permuter provides a reduction in the implementation area and a related reduction in power consumption through efficiencies...
|
|
|
7428563 |
Apparatus and method for selectively performing Fast Hadamard Transform or Fast Fourier Transform
Disclosed is an apparatus for performing both FHT (Fast Hadamard Transform) and FFT (Fast Fourier Transform). This apparatus determines the phase coefficients as constantly “1” when performing...
|
|
|
7406494 |
Method of generating a cycle-efficient bit-reverse index array for a wireless communication system
An efficient method of generating a bit-reverse index array in real time without performing any bit manipulation for a wireless communication system.
|
|
|
7395293 |
Memory segmentation for fast fourier transform
Various approaches for performing a fast-Fourier transform (FFT) of N input data elements using a radix K decomposition of the FFT are disclosed (K>=2, and N>=8). In one approach, N/K input...
|
|
|
7391632 |
Apparatus of selectively performing fast hadamard transform and fast fourier transform, and CCK modulation and demodulation apparatus using the same
A Fast Fourier Transform (FFT) apparatus for selectively performing Fast Hadamard transform (FHT), and a complementary code keying (CCK) modulation/demodulation apparatus using the same. An OFDM...
|
|
|
7382718 |
Transmitting and receiving method for reducing distortion caused by a time-varying channel in an orthogonal frequency division multiplex system
Disclosed is a transmitting and receiving method for reducing a time-varying channel distortion in an orthogonal frequency division multiplex (OFDM) system. In the present invention, the...
|
|
|
7376173 |
Unambiguously encoding and decoding signals for wireless channels
A method encodes a sequence of blocks of input bits to be transmitted over a wireless channel. Each block of input bits is converted to a codeword, and each codeword is mapped to multiple...
|
|
|
7315878 |
Fast Fourier transform device
Dislosed is a fast Fourier transform device of a wireless LAN orthogonal frequency division multiplexing (OFDM) system. The device comprises: an FFT/IFFT unit constituted with one hardware, for...
|
|
|
7315877 |
Efficient implementation of a multidimensional fast fourier transform on a distributed-memory parallel multi-node computer
The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array...
|
|
|
7299252 |
Power saving zero pruning algorithm for fast fourier transform (FFT) circuitry
A fast Fourier transform (FFT) circuit from which unneeded butterfly computation modules can be effectively pruned for specific applications. Each module that is not needed is pruned by injecting...
|
|
|
7284027 |
Method and apparatus for high speed calculation of non-linear functions and networks using non-linear function calculations for digital signal processing
The invention includes apparatus and methods for high-speed calculation of non-linear functions based upon a shifted adder and a offset generator. Various implementations may preferably include a...
|
|
|
7246143 |
Traced fast fourier transform apparatus and method
A Fast Fourier Transform (FFT) arrangement for use in those situations in which not all of the outputs are desired is controlled in such a fashion that at least those multiplications (and possibly...
|
|
|
7227902 |
Method and apparatus for digital channelisation and de-channelisation
The present invention relates generally to the problem of filtering, decimation or interpolation and frequency conversion in the digital domain, and more particularly to its use in wideband...
|
|
|
7197095 |
Inverse fast fourier transform (IFFT) with overlap and add
A system for efficiently filtering interfering signals in a front end of a GPS receiver is disclosed. Such interfering signals can emanate from friendly, as well as unfriendly, sources. One...
|
|
|
7190735 |
Generating two signals having a mutual phase difference of 90°
A method and device are described for generating two output signals (I; Q) each substantially identical to a square-wave input signal (A) from a local oscillator ( 2 ), wherein the first output...
|
|
|
7184468 |
Method and system for implementing a conditional one's complement of partial address
Provided is a system and method for a modem including one or more processing paths. Also included is a number of interconnected modules sequentially arrayed along the one or more paths. Each module...
|
|
|
7120659 |
Apparatus, methods, and computer program products for determining the coefficients of a function with decreased latency
The present invention provides apparatus, methods, and computer program products that can decrease the latency with which the coefficients of a function representative of signal are determined....
|
|
|
7092429 |
Multi-pass frequency hop-acquisition correlator
A multi-pass frequency hop timing acquisition correlator that produces a more accurate time estimate from the fast acquisition frequency hop signal is disclosed. The time estimate produced by the...
|
|
|
7088791 |
Systems and methods for improving FFT signal-to-noise ratio by identifying stage without bit growth
Systems and methods are provided for performing signal processing on communication data utilizing scale reduced Fast Fourier Transform computations. The present invention provides scaling in a Fast...
|
|
|
7082451 |
Reconfigurable vector-FFT/IFFT, vector-multiplier/divider
Systems and methods are described for providing a reconfigurable circuit having multiple distinct circuit configurations with respective distinct operating modes The circuit may be controllably...
|
|
|
7062523 |
Method for efficiently computing a fast fourier transform
A method for computing an out of place FFT in which each stage of the FFT has an identical signal flow geometry. In each stage of the presently disclosed FFT method the group loop has been...
|
|
|
7047268 |
Address generators for mapping arrays in bit reversed order
A method and apparatus to reduce the amount of required memory and instruction cycles when implementing Fast Fourier Transforms (FFTs) on a computer system is described. The invention optimizes FFT...
|
|
|
7035867 |
Determining redundancies in content object directories
A system for identifying files can use fingerprints to compare various files and determine redundant files. Frequency representations of portions of files can be used, such as Fast Fourier...
|
|
|
7028063 |
Method and apparatus for a DFT/IDFT engine supporting multiple X-DSL protocols
A Fourier transform processor utilizing discrete circuits each of which is configurable for processing a wide range of sample sizes. A single pipeline supports multiplexed bi-directional...
|
|
|
7024443 |
Method and system for performing a fast-Fourier transform
In a method for performing a fast-Fourier transform (FFT), input data samples are written to a storage instance in a data input step, then subjected to a processing step in which the stored input...
|
|
|
7024442 |
Processing apparatus
A processing apparatus includes a memory capable of storing data, a butterfly arithmetic unit for performing butterfly computation processes, and a bit-reversed order shuffle processing unit for...
|
|
|
7007056 |
Memory address generating apparatus and method
A memory address generating method in which a memory bank index and an address control signal, that are required for a series of FFT processes in which a plurality of butterfly input samples are...
|
|
|
6993547 |
Address generator for fast fourier transform processor
An address generator for use in conjunction with a fast Fourier transform processor includes an efficient architecture for computing the memory addresses of input data points, output data points...
|
|
|
6990062 |
Reduced complexity DMT/OFDM transceiver
A DMT/OFDM transceiver wherein communication occurs between stations in the form of symbols distributed and transmitted in channels which are allocated when making a link between the stations, each...
|
|
|
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...
|