Matches 101 - 150 out of 240 < 1 2 3 4 5 >
Match Document Document Title
6240141 Lower-complexity peak-to-average reduction using intermediate-result subset sign-inversion for DSL  
A Digital-Subscriber Line (DSL) modem reduces signal peaks by digital processing. The peak-to-average ratio (PAR) is effectively reduced by the PAR reduction when the signal peaks are reduced...
6230176 Fast fourier transform processing device, fast fourier transform processing system, and fast fourier transform processing method  
An object of the invention is to perform fast Fourier transform processes of radix 4 and 2 at a high speed. In order to attain this object, the invention divides complex number data in which the...
6230177 Method and apparatus for performing fast fourier transforms  
The method and apparatus employ a texture filter in a graphics processor to perform a transform such as, for example, a Fast Fourier Transform. The texturizer can include an array of linear...
6157938 Fast fourier transform device with parallel lattice architecture  
A Fast Fourier Transform device of a discrete multitone modulation system can be implemented by very large scale integrated (VLSI) architecture. The I-FFT/F-FFT functions are modified to avoid...
6141673 Microprocessor modified to perform inverse discrete cosine transform operations on a one-dimensional matrix of numbers within a minimal number of instructions  
A multimedia extension unit (MEU) is provided for performing various multimedia-type operations. The MEU can be coupled either through a coprocessor bus or a local central processing unit (CPU) bus...
6088714 Mechanism for calculating one-dimensional fast fourier transforms  
The inventive mechanism uses seven steps to perform the mathematic equivalent to performing one large FFT on the input data. The input data array is decomposed into a plurality of squares. In first...
6081821 Pipelined, high-precision fast fourier transform processor  
The Fast Fourier Transform (FFT) processor includes a plurality of pipelined, functionally identical stages, each stage adapted to perform a portion of an FFT operation on a block of data. The...
6074086 Synchronization of OFDM signals with improved windowing  
A mechanism for determining phases of a symbol for phase correlation is provided. The mechanism performs a symmetric apodizing window function on a symbol sample of a symbol having a symbol period...
6061705 Power and area efficient fast fourier transform processor  
A fast Fourier transform (FFT) processor is constructed using discrete Fourier transform (DFT) butterfly modules having, in preferred example embodiments, sizes greater than 4. In a first example...
6058121 Fine FFT window position recovery apparatus of an OFDM system receiver  
A fine fast Fourier transform window position recovering apparatus of an OFDM system receiver for recovering the phase error of an FFT window by using the number of zero-crossings of the phase...
6058409 Computation apparatus and method  
A computation apparatus such as a Fast Fourier Transform (FFT) apparatus which processes ordered sets of data in a computation unit (4, 24) operating according to a high-speed clock includes an...
6052421 Method for separating a desired signal from an interfering signal  
A method for separating a desired signal from an interfering signal, which is particularly useful when the desired signal is substantially weaker than the interfering signal, includes the steps of...
6035313 Memory address generator for an FFT  
A fast Fourier transformer (160) includes an FFT engine (162) having a twiddle index input and a memory bus coupled to a data input (167), a memory (164) coupled to the memory bus, an address...
6023719 Signal processor and method for fast Fourier transformation  
With reference to FIG. 1 signal processor (10) for performing transformations of sets of input data points comprises a memory for storing a first half input data points and a second half input data...
6006245 Enhanced fast fourier transform technique on vector processor with operand routing and slot-selectable operation  
An apparatus and a method perform an N-point Fast Fourier Transform (FFT) on first and second arrays having real and imaginary input values using a processor with a multimedia extension unit (MEU),...
6003056 Dimensionless fast fourier transform method and apparatus  
A method and apparatus for calculating fast Fourier transforms FFTs. An FFT of a given size is formatted using tensor product principles for implementation in apparatus or by software such that the...
5951627 Photonic FFT processor  
A high-performance photonic chipset for computing 1-D complex fast Fourier transform (FFT) calculations. Flip-chip integration is used to combine submicron CMOS ICs with GaAs chips containing 2-D...
5946293 Memory efficient channel decoding circuitry  
A memory efficient channel decoder circuit is provided for channel decoding differentially modulated data samples comprising multiple adjacent carriers each including two data samples associated...
5941940 Digital signal processor architecture optimized for performing fast Fourier Transforms  
A digital signal processor architecture particularly adapted for performing fast Fourier Transform algorithms efficiently. The architecture comprises dual, parallel multiply and accumulate units in...
5931892 Enhanced adaptive filtering technique  
A signal represented as a matrix of input values is adaptively filtered using a processor with a multimedia extension unit. A plurality of coefficients are loaded into a first vector register and...
5912829 Universal narrow band signal conditioner  
A system for processing a signal made up of at least one spectral component. The system includes a sampling circuit for periodically sampling the signal to obtain a sequence of discrete data...
5890098 Device and method for performing fast Fourier transform using a butterfly operation  
In order to carry out FFT operations at a high speed, a configuration is adopted where, while a FFT (fast Fourier transform) operation or inverse FFT (inverse fast Fourier transform) operation is...
5854758 Fast fourier transformation computing unit and a fast fourier transformation computation device  
To provide FFT computing units, FFT computation devices, and pulse counters that can achieve computational precision using the smallest possible circuit size. FFT computing unit 602 comprises a...
5841395 Localized interference nulling preprocessor  
A localized interference nulling preprocessor for a Fast Fourier Transform (FFT) or a Butler matrix system includes a means for forming a dot product of a signal vector and each of the preprocessed...
5835392 Method for performing complex fast fourier transforms (FFT's)  
A method in a computer system of performing a butterfly stage of a complex fast fourier transform of two input signals. First, a packed multiply add is performed on a first packed complex value...
5831883 Low energy consumption, high performance fast fourier transform  
A practical, low-energy consumption method of performing an N-point fast rier transform employing mathematically justified manipulation of input data, multirate, parallel and asynchronous circuit...
5822368 Developing a channel impulse response by using distortion  
A digital audio broadcasting (DAB) system includes a radio-frequency (RF) receiver that develops a characterization signal representative of a respective mobile communications channel as a...
5751616 Memory-distributed parallel computer and method for fast fourier transformation  
Two-dimensional real number data are stored in a two-dimensional array spanning plural processors. Each subarray in each processor is divided into two sets of row vectors and one set is referred to...
5717620 Improved-accuracy fast-Fourier-transform butterfly circuit  
A channelizer (16) and combiner (22) in a cellular-telephone base station (10) are implemented in fast-Fourier-transform butterfly circuits (FIG. 4 ) in which outputs of adders (40, 46) are applied...
5694347 Digital signal processing system  
A method for computing a fast Fourier Transform of an input signal which includes the steps of: a) storing first and second data values and a first coefficient in a first register stage; b) storing...
5633817 Fast fourier transform dedicated processor  
A Fast Fourier Transform (FFT) dedicated processor includes a scrambler SM scrambling a real input data sequence x(i) and thereby providing two scrambled data subsequences a(i) and b(i). A data...
5576978 High resolution frequency analyzer and vector spectrum analyzer  
A high resolution frequency analyzer analyzes frequency spectra of an incoming analog signal based on a fast Fourier transformer at ultra-high resolution without increasing the sampling number or...
5491652 Fast Fourier transform address generator  
A for Fast Fourier Transform (FFT) address generator utilizes a butterfly counter to count a butterfly count for each butterfly stage of FFT in numerical sequence; and a stage counter to count a...
5481488 Block floating point mechanism for fast Fourier transform processor  
A block floating point mechanism for a Fast Fourier Transform processor utilizes a pipelined butterfly processor to receive the source data to be computed, to perform the butterfly computations,...
5477478 Orthogonal transform processor  
The output of a butterfly unit is entered into a product-sum unit in a forward DCT and the output of the product-sum unit is entered into the butterfly unit in an inverse DCT. The product-sum unit...
5473556 Digit reverse for mixed radix FFT  
A digit reversing system is disclosed for handling mixed radix FFT operations with arbitrary arrangements of radices. In a first step, all bits in an integer field of size log 2 N are position...
5430667 Hardware arrangement for fast fourier transform having improved addressing techniques  
A hardware arrangement for a fast Fourier Transform includes, an arithmetic unit for executing said fast Fourier Transform, a data memory for storing data to be executed and storing results...
5394349 Fast inverse discrete transform using subwords for decompression of information  
A method for imparting to a general purpose (CISC), or reduced instruction set (RISC), type of central processing unit (CPU; microprocessor) the characteristics and performance of an integer...
5367539 Digital block processor for processing a plurality of transmission channels in a wireless radiotelephony system  
A digital block receiver system, in a cellular/wireless FM radiotelephony system, receives and heterodyne a block of cellular/wireless receive channels to a very low block IF signal by analog...
5365469 Fast fourier transform using balanced coefficients  
A method and apparatus for processing a digital signal by a fast Fourier transformation using balanced coefficients. The balanced coefficient method reduces the number of coefficients required to...
5343208 Radar with individually optimized doppler filters  
An FFT-like array architecture (500), for use on the Doppler filters of a radar system, includes a plurality of stages (505, 506) of weighted butterflies (501, 502, 503, 504), in which each...
5329473 Fast window/presum operation  
An architecture and method for performing the known windowing and presumming operations associated with enhancing the performance of a fast Fourier transform (FFT) processor is disclosed. The...
5329474 Element rearrangement method for fast Fourier transform  
In a Fast Fourier Transform method, the elements of Fast Fourier Transform are arranged as a two-dimensional square and stored in areas of an array whose number of lines is twice that of columns....
5327367 Computer system with vector functional unit for fast fourier transform  
A computer system for Fast Fourier Transform provided with a vector functional unit with a process to store rotation factors. The input elements are multiplied in Fast Fourier Transform into an...
5317524 Spectral signal analyzer system  
A process for analyzing a spectral signal generated by a birefringent element and transmitted to an array. An output spectral signal emanating from the array is converted from an analog to a...
5297070 Transform processing circuit  
The elements of a transform processing circuit are switchable to change the order of data in a data stream and/or to perform a fast Fourier transform (FFT) or inverse fast Fourier transform (IFFT)...
5293382 Method for FDMA signal multiplexing and demultiplexing  
A method for multiplexing a series of frequency division multiple access (FDMA) signals includes providing complex channels offset relative to the FDMA signals. Each FDMA signal is filtered to be...
5272446 Digitally implemented fast frequency estimator/demodulator for low bit rate maritime and mobile data communications without the use of an acquisition preamble  
A low-bit-rate, low-cost, all-digital preambleless demodulator for maritime and mobile data communications operates under severe high noise conditions, fast Doppler frequency shifts, large...
5260613 Real-data FFT buffer  
A FFT buffer circuit having at least three FIFO buffers and a FIFO buffer lect circuit to separate incoming real-data into its in-phase and quadrature components and to output each component to a...
5224063 Address translation in FFT numerical data processor  
A numerical data processor includes first and second registers for receiving and holding input data from a memory, respectively, and a multiplier receiving the input data held in the first and...
Matches 101 - 150 out of 240 < 1 2 3 4 5 >