| Entries |
| Document | Title | Date |
|---|
| 20080215655 | Multi-carrier transmission process and system in a difficult environment with optimisation of emission power - The invention proposes a data transmission process, from a first unit ( | 09-04-2008 |
| 20090094305 | System for Displaying Spectral Trends in Complex Signals - A method for displaying changes in spectral content of data signals over periods of time using a computer system. The method includes the steps of transforming time segments of digitized data signals into a frequency based spectral representation of the digitized data. The resulting spectral data are then grouped into appropriate frequency bins. Each frequency bin is normalized by the frequency range of the bin. The energy or power in each frequency bin is then multiplied by f | 04-09-2009 |
| 20090157786 | METHOD AND APPARATUS FOR A FAIL SAFE FOURIER TRANSFORM MATRIX - A base station transmitter for maintaining data rate transmission between a set of Fourier Transform matrices, having a digital Fourier Transform Matrix (FTM), and analog FTM, and a plurality of transmit paths therebetween. During the occurrence of a power amplifier failure, the method includes detecting the failure of a power amplifier (PA); and reconfiguring the digital FTM and analog FTM to a pass-thru mode. | 06-18-2009 |
| 20090172061 | INVERSE HADAMARD TRANSFORM CONVERTER AND SYSTEM - The present invention provides an Inverse Hadamard Transform (IHT) converter which comprises a first group of registers for receiving coefficients inputted to the IHT converter; a first adder for adding selected the coefficients stored in the first group of registers; a second group of registers for receiving results from the first adder; and a second adder for adding selected the results stored in the second group of registers. The present invention provides an Inverse Hadamard Transform (IHT) converter system. | 07-02-2009 |
| 20100325185 | ALGORITHM FOR ADIABATIC PULSE DESIGN USING THE SHINNAR LE-ROUX TRANSFORM - A method for providing an adiabatic RF pulse that is an inversion or refocusing pulse for a RF pulse sequence is provided. A linear phase frequency profile (F | 12-23-2010 |
| 20110264724 | Apparatus, Methods, and HDL Code 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 Specifically, the apparatus, methods, and computer program products of the present invention, taking advantage of the independence of samples, updates each of the coefficients of the function as each sample is received. As such, when the final sample is received, the apparatus, methods, and computer program products of the present invention need only update each coefficient with the contribution of the last sample prior to outputting the coefficients. As such, the latency from the time the last sample is received and the availability of the coefficients is decreased. To further decrease the latency, in one embodiment, the apparatus, methods, and computer program products of the present invention prestore either all or a portion of the possible values of the contribution of a sample to each coefficient. As such, when the sample is received, the apparatus, methods, and computer program products of the present invention evaluate the value of the sample and retrieve the appropriate value from the prestored values that corresponds to the coefficient, sample, and value of the sample, thereby decreasing the time required to determine the coefficients. The apparatus, methods, and computer program products of the present invention also allow individual or subsets of the coefficients to be observed and also allow individual or subsets of the coefficients to be determined in varying resolutions. | 10-27-2011 |
| 20110270905 | METHOD AND DEVICE FOR PERFECTLY INCOHERENT SAMPLING TO A HAAR DOMAIN - The present invention relates to a method for converting a signal, including the steps of: providing a first representation of the signal in a first domain; converting the first representation of the signal into a second representation of the signal in a second domain, by applying a transform involving a Haar transform and a Hadamard transform, such that a basis of the second domain is maximally incoherent to a Haar basis. The signal is converted to a domain whose basis is maximally incoherent to a Haar basis. Yet, it is not required to convert the input vector representing the signal to a Haar basis first. This allows reducing the number of steps which increases conversion efficiency. Accordingly, obtaining the structure of the signal requires fewer samples. | 11-03-2011 |
| 20120323984 | LANGUAGE INTEGRATED QUERY OVER VECTOR SPACES - Language-integrated query (LINQ) operators can be extended to a set of vectors associated with a digital signal processing (DSP) environment. A language-integrated query (LINQ) operator can be created to execute a change of basis for a set of vectors. LINQ operators can be further be utilized with specifically generated parameters to perform a change of basis for the set of vectors. Additionally, the standard LINQ operators can be extended to enable querying with LINQ against the set of vectors. | 12-20-2012 |
| 20130159368 | Method and Apparatus for Calculating an N-Point Discrete Fourier Transform - Described embodiments provide an apparatus for calculating an N-point discrete Fourier transform of an input signal having multiple sample values. The apparatus includes at least one input configured to receive the sample values and a counter to count sample periods. Also included are at least two parallel multipliers to multiply each sample value, with each of the multipliers having a corresponding multiplication factor. There is at least one multiplexer to select one of the at least two parallel multipliers. An adder sums the scaled sample values and an accumulator accumulates the summed sample values. N is an integer and the at least two parallel multipliers are selectable based upon the value of N and the value of the sample period count. | 06-20-2013 |
| 20140052766 | REPRESENTING A FUNCTION BANDLIMITED WITHIN A POLYGONAL SPACE - Based at least in part on one or more characteristics relating to a measurement system, a polygonal space in a Fourier domain is determined. A representation of a function that is bandlimited within the polygonal space is computed. | 02-20-2014 |
| 20140089365 | OBJECT DETECTION METHOD, OBJECT DETECTOR AND OBJECT DETECTION COMPUTER PROGRAM - Object detection receives an input image to detect an object of interest. It determines feature matrices based on the received image, wherein each matrix represents a feature of the received image. The plurality of matrices are Fourier transformed to Fourier feature matrices. Fourier filter matrices are provided, each representing a feature of an object transformed in Fourier space. Each filter matrix is point-wise multiplied with one of the feature matrices corresponding to the same feature. The plurality of matrices are summed, resulting by point-wise multiplying each Fourier filter matrix with the corresponding Fourier feature matrix to obtain a Fourier score matrix. An inverse Fourier transform of the Fourier score matrix is performed, resulting in a score matrix, which is used to detect the object in the input image. | 03-27-2014 |
| 20140101219 | FOURIER TRANSFORM COMPUTATION FOR DISTRIBUTED PROCESSING ENVIRONMENTS - Fourier transform computation for distributed processing environments is disclosed. Example methods disclosed herein to compute a Fourier transform of an input data sequence include performing first processing on the input data sequence using a plurality of processors, the first processing resulting in an output data sequence having more data elements than the input data sequence Such example methods also include performing second processing on the output data sequence using the plurality of processors, the output data sequence being permutated among the plurality of processors, each of the processors performing the second processing on a respective permutated portion of the output data sequence to determine a respective, ordered segment of the Fourier transform of the input data sequence. | 04-10-2014 |
| 20140122553 | Vector NCO and Twiddle Factor Generator - A method and apparatus may be used to generate complex exponentials for either frequency domain or time domain applications by programming input parameter values into a complex exponential vector generator ( | 05-01-2014 |
| 20140164460 | DIGITAL SIGNAL PROCESSING APPARATUS AND PROCESSING METHOD THEREOF - A digital signal processing apparatus and a digital signal processing method are provided. The digital signal processing apparatus includes a memory, a control logic unit, a butterfly arithmetic unit, a selector, a first twiddle factor generator, a second twiddle factor generator and a twiddle factor latch. The first twiddle factor generator and the second twiddle factor respectively provide a first sub-twiddle factor and a second sub-twiddle factor. A weight value (twiddle factor) is produced by the butterfly arithmetic unit through performing a complex multiplication operation on the first sub-twiddle factor and the second sub-twiddle factor. | 06-12-2014 |
| 20140330879 | BI-PHASIC APPLICATIONS OF REAL & IMAGINARY SEPARATION, AND REINTEGRATION IN THE TIME DOMAIN - A signal is decomposed into different components using a transform, with the components then being separately presented to a person in a manner that produces a different cognitive experience than would have resulted from either (a) presentation of the original signal, or (b) presentation of a fully synthesized (inverse transformed) signal. | 11-06-2014 |
| 20150301985 | LOW COMPLEXITY PARTIAL PARALLEL ARCHITECTURES FOR FOURIER TRANSFORM AND INVERSE FOURIER TRANSFORM OVER SUBFIELDS OF A FINITE FIELD - Low complexity partial parallel architectures for performing a Fourier transform and an inverse Fourier transform over subfields of a finite field are described. For example, circuits to perform the Fourier transforms and the inverse Fourier transform as described herein may have architectures that have simplified multipliers and/or computational units as compared to traditional Fourier transform circuits and traditional inverse Fourier transform circuits that have partial parallel designs. In a particular embodiment, a method includes, in a data storage device including a controller and a non-volatile memory, the controller includes an inverse Fourier transform circuit having a first number of inputs coupled to multipliers, receiving elements of an input vector and providing the elements to the multipliers. The multipliers are configured to perform calculations associated with an inverse Fourier transform operation. The first number is less than a number of inverse Fourier transform results corresponding to the inverse Fourier transform operation. | 10-22-2015 |
| 20160070673 | EVENT-DRIVEN SPATIO-TEMPORAL SHORT-TIME FOURIER TRANSFORM PROCESSING FOR ASYNCHRONOUS PULSE-MODULATED SAMPLED SIGNALS - A method of processing asynchronous event-driven input samples of a continuous time signal includes calculating a short-time Fourier transform (STFT) output based on the event-driven input samples. The STFT output may be calculated by expressing an encoding pulse and an STFT window function as a sum of complex weighted causal complex exponentials. The method further includes interpolating output between events. | 03-10-2016 |
