The Fast Fourier-Hadamard Transform and Its Use in Signal Representation and Classification,

Abstract

A discrete time transform was studied and applied to the representation and discrimination of digitized signals. The transform consists of an orthogonal (Hadamard) matrix whose elements are all ones and minus ones. To facilitate implementation, a fast Hadamard transform (FHT) has been developed requiring only NlogN rather than N squared algebraic additions. Several properties of the FHT are revealed, including the nature of its presence in the fast Fourier transform, in which it performs the additive operations as shown by further decomposing the product of matrices representing the FFT.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1968
Accession Number
ADA045066

Entities

People

  • D. F. Guinn
  • J. E. Whelchel Jr.

Organizations

  • Melpar

Tags

Communities of Interest

  • Energy and Power Technologies
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Covariance
  • Data Sets
  • Digital Signal Processing
  • Fast Fourier Transforms
  • Frequency
  • Gaussian Processes
  • Information Theory
  • Matched Filters
  • Pattern Recognition
  • Power Spectra
  • Probability
  • Random Variables
  • Recognition
  • Signal Processing
  • Spectra
  • Stationary Processes
  • Walsh Functions

Fields of Study

  • Engineering

Readers

  • Approximation Theory.
  • Computer Vision.