Method for executing a linear transformation
OwnerJohn Arthur Scholzinventor
Life of this patent
Estimating the term…
Abstract
A sliding weight Fourier transformer for the transformation of rows of numbers, in the process of which a new Fourier transformation is performed by making a correction to a previously determined Fourier transformation. In order to obtain a weighted Fourier transformation, the Fourier transformation is split-up in three transformations that can also be corrected and that together make up the weighted Fourier transformation.
Claims8
Method for performing an N-point linear weighted transformation with N=2, 3, . . . , upon a row of numbers X1, . . . XN, which N-points transformation can be performed by multiplying the row of numbers with a matrix which has the property that the (i+1)th column can be obtained from the ith column of the same matrix by multiplying the ith column with a fixed correction vector, characterized in that a weighted transformation can be realised or approximated by a sum of at least a partial transformation U′, a partial transformation U″, and a partial transformation kU, in such a way that each partial transformation has the property that an (i+1)th column from a matrix that represents the partial transformation can be obtained from the ith column of the same matrix by multiplying the ith column with a fixed correction vector.
Method according to one of the previous claims, characterized in that a row of M-bits binary numbers X1, . . . , XN, . . . is split-up in M rows of one bit binary numbers, that a transformation is performed separately on each of the M rows and that the results are combined in a weighted addition.
Linear transformer, designed for the execution of a method as claimed in one of the previous claims.
Dependencies are inferred from the claim text.