Several different hardware configurations for implementing the Hadamard transform in real-time are discussed. The discussion is referenced to a 64 point (8 x 8) transform that is used in image coding for bandwidth reduction. A successive implementation of two 8 point transformations with intermediate random access memory using the straight forward N2 computation is compared to implementations of the Fast Hadamard Transform (FHT). The speed of computing transform coefficients is compared to the hardware requirements of the various techniques. The relationship between computational speed and the resolution and frame rate of television imagery that may be transform encoded using the different methods is illustrated. It is shown that for picture element (pixel) rates up to 5 MHz the N2 computation is the more economical to implement.

Date Published: 30 October 1975
PDF: 5 pages
Proc. SPIE 0066, Efficient Transmission of Pictorial Information, (30 October 1975); doi: 10.1117/12.965365

Published in SPIE Proceedings Vol. 0066:
Efficient Transmission of Pictorial Information
Andrew G. Tescher, Editor(s)