DocumentCode :
1457304
Title :
On fast multivariable bilinear and Hadamard transforms
Author :
Hertz, David
Author_Institution :
Rafael, Haifa, Israel
Volume :
39
Issue :
8
fYear :
1991
fDate :
8/1/1991 12:00:00 AM
Firstpage :
1788
Lastpage :
1792
Abstract :
Applying the bilinear transformation to an n-variance polynomial, n⩾1, one arrives at a rational function whose numerator is the transformed polynomial. Based on I.J. Good´s (1958) results and the symmetry properties of the single-dimensional bilinear transformation matrix, a fast implementation for computing the coefficients of such n-variable transformed polynomials is proposed. Letting Q denote the matrix relating the coefficients of the original polynomial to those of the transformed polynomials, it is shown that Sylvester-type Hadamard matrices coincide with the transformation matrices for the n-variable polynomials for which the highest degree of each variable is one. This new observation is used to derive W.R. Crowther and C.M. Rader´s (1966) formulation of the fast Hadamard transform
Keywords :
information theory; matrix algebra; polynomials; signal processing; transforms; Sylvester-type Hadamard matrices; bilinear transformation; fast Hadamard transform; fast implementation; multivariable polynomials; transformation matrices; Algebra; Dictionaries; Difference equations; Differential equations; Discrete transforms; Helium; Polynomials; Signal processing; Stability; System testing;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/78.91149
Filename :
91149
Link To Document :
بازگشت