Back to search

McMaster University

Fast Transformations with Walsh-Hadamard Functions

Abstract

dc:description.abstract

<p>In this thesis, various techniques to generate Walsh-Hadamard functions are discussed. Efficient algorithms to compute the discrete Walsh-Hadamard transform have been derived and implemented. The design of a simple, but very fast, digital circuit that can perform the transform or its inverse is presented. These algorithms have been applied to the processing of speech for the investigation of bit rate reduction. Intelligible speech has been reconstructed from 8 or 4 dominant Walsh-Hadamard coefficients out of a field of 64, with a constant update time of 8 milliseconds, on a CDC-1700 computer.</p>

Degree

thesis:*
Department dc:contributor.department
Electrical Engineering
Year dc:date.issued
1972

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Shum, Frank Y.Y.
Advisor dc:contributor.advisor
  • Elliott, A.R.

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Shum, Frank Y.Y.. Fast Transformations with Walsh-Hadamard Functions. 1972. http://hdl.handle.net/11375/20167