3
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Generalized Hadamard—Fourier Transforms

Pages 123-127 | Received 27 Mar 1973, Published online: 11 Jul 2015

REFERENCES

  • Cooley (JW) and Tukey (JW). An Algorithm for the Machine Computation of Complex Fourier Series. Math. Comput. 19, 90; 1965; 297–301.
  • Gold (B) and Rader (CM). Digital Processing of Signals. 1969. McGraw Hill. New York. P 204.
  • Walsh (JL). A Closed Set of Normal Orthogonal Functions. Am J. Math. 55, 1923; 5–24.
  • Whelchel (JE) JR. and Guinn (DF). The Fast Fourier Hadamard Transform and its Use in Signal Representation and Classification. EASCON 1968 convention Rec. EAS 561–573.
  • Shanks (JL). Computation of the Fast Walsh-Fourier Transform. IEEE Trans. C-18, 5; 1969; 457–459.
  • Rushforth (CK). Fast Fourier—Hadamard Decoding of Orthogonal Codes. Inf. & Cont. 15, 1; 1969; 33–37.
  • Ulman (LJ). Computation of the Hadamard Transform and the R-Transform in ordered Form. Trans. IEEE. C-19, 4; 1970; 359–360.
  • Pratt (WK). An Algorithm for a Fast Hadamard Matrix Transform of Order 12. IEEE Trans. C-18, 12; 1969; 1131–1132.
  • Carl (JW). Comment on An Algorithm for a Fast Hadamard Matrix Transform of order 12. IEEE Trans. C-20, 5; 1971; 585–586.
  • Webb (SR) and Kennedy (JD). Some Comments on the Fast Hadamard Transform of Order 12. IEEE Trans. C-20, 5; 1971; 588–590.
  • Welch (LR). Walsh Functions and Hadamard Matrices; Applications of Walsh Functions. 1970 Proc. Editor C.A. Bass. Washington DC. P 163–165.
  • Gibbs (JE). Discrete Complex Walsh Functions: Applications of Walsh Functions. 1970 Proc. Editor C.A. Bass. Washington DC. P 106–122.
  • Ohnsorg (FR). Application of Walsh Functions to Complex Signals: Applications of Walsh Functions. 1970 Proc. Editor C. A. Bass. Washington DC. P 123–127.
  • Ahmed (N) and Rao (KR). Complex BIFORE Transform. Electronics Letters. 6, 8; 1970; 256–258.
  • Chrestenson (HE). A Class of Generalized Walsh Functions. Pac. J. Math. 5, 1955; 17–31.
  • Andrews (HC) and Kane (J). Kronecker Matrices: Computer Implementation and Generalized Spectra. JACM. 17, 2; 1970; 260–268.
  • Hall (M). Combinatorial Theory. Chapter 14; 1967. Blaisdell Publishing Company; Massachusetts. P 204–222.
  • Andrews (HC) and Caspari (KL). A Generalized Technique for Spectral Analysis. IEEE Trans. C-19, 1; 1970; 16–25.
  • Andrews (HC) and Caspari (KL). Degrees of Freedom and Computational Requirements in Matrix Multiplication. IEEE Trans. C-20, 2; 1971; 133–141.
  • Caspari (KL). Generalized Spectrum Analysis; Applications of Walsh Functions. 1970 Proc. Editor C.A. Bass. Washington DC. P 195–207.
  • Good (IJ). The Relationship between Two Fast Fourier Transforms. IEEE Trans. C-20, 3; 1971; 310–317.
  • Pease (MC). An adaptation of the Fast Fourier Transform for parallel Processing. Ass. Comput Math. J. 15, 2; 1968; 252–264.
  • Bergland (GD). A parallel implementation of the Fast Fourier Transform Algorithm. IEEE Trans. C-21, 4; 1972; 366–370.
  • Munhaghan (FD). The theory of group representations. 1938. Dover.
  • Williamson (J). Hadamard's Determinant Theorem and the Sum of Four Squares. Duke Math J. 11, 169; (MR 5) 1944; 65–81.
  • Baumert (LD) and Hall (M). Hadamard Matrices of the Williamson Type. Math. Comput. 19, 1965; 442–447.
  • Yang (CH). On Hadamard Matrices Constructible by Circulant Submatrices. Math. Comput. 25, 113; 1971; 181–186.
  • Moharir (PS). Walsh-Fourier and Trigonometric Secrecy Coding. JIETE. 20, 5; 1974; 207–210.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.