Optimal Systolic Designs for the Computation of the Discrete Hartley and the Discrete Cosine Transforms

Abstract

In this paper, we propose new algorithms for computing the Discrete Hartley and the Discrete Cosine Transform. The algorithms are based on iterative applications of the modified small n algorithms of DFT. The one dimensional transforms are mapped into two dimensions first and then implemented on two dimensional systolic arrays. Pipelined bit serial architectures operating on left to right LSB to MSB binary arithmetic is the basis of the hardware design. Different hardware schemes for implementing these transforms are studied. We show that our schemes achieve a substantial speed-up over existing schemes.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1988
Accession Number
ADA452389

Entities

People

  • Chaitali Chakrabarti
  • Joseph Jaja

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Binary Arithmetic
  • Computations
  • Information Operations
  • Mathematical Analysis
  • Mathematics
  • Numbers
  • Two Dimensional
  • Universities

Fields of Study

  • Engineering
  • Mathematics

Readers

  • Approximation Theory.
  • Computer Programming and Software Development.
  • Parallel and Distributed Computing.