This paper presents an implementation of the Haar transform suitable for VLSI integration. It shows how to map a bidimension linear transformation, which has a straightforward multiresolution realization on a pyramid data-parallel computer, onto a pipeline of simple processors. A further simplification of the linear structure leads to an extremely simple implementation based on a two-stage pipeline, capable of processing images as large as 1024×1024 pixels. VLSI simulations with current technologies predict HDTV video rates. Data compression is among the applications that benefit from the new formulation of the transform.

A high speed Haar transform implementation

ALBANESI, MARIA GRAZIA;FERRETTI, MARCO
1992-01-01

Abstract

This paper presents an implementation of the Haar transform suitable for VLSI integration. It shows how to map a bidimension linear transformation, which has a straightforward multiresolution realization on a pyramid data-parallel computer, onto a pipeline of simple processors. A further simplification of the linear structure leads to an extremely simple implementation based on a two-stage pipeline, capable of processing images as large as 1024×1024 pixels. VLSI simulations with current technologies predict HDTV video rates. Data compression is among the applications that benefit from the new formulation of the transform.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11571/460498
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact