Efficient data-path synthesis based on algorithmic description under the constraints of time and area

Xing jian Xu, Mitsuru Ishizuka

Research output: Book/ReportBook

Abstract

The major purpose of this paper is to present a general redesigning methodology, which is able to optimize the circuit area and processing speed simultaneously under the constraints of time and area at a speed of O(nlog(n)). Our methodology first designs the most serial data-path with the smallest area, and then, repeats the stepwise modification of the data-path based on an efficient redesigning method employing the Time-Area ratio (T-A ratio in short) until a nearly optimized one is obtained.

Original languageEnglish
Place of PublicationAmsterdam, Netherlands
PublisherPubl by Elsevier Science Publishers B.V.
Number of pages8
ISBN (Print)0444816410
Publication statusPublished - 1993
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Efficient data-path synthesis based on algorithmic description under the constraints of time and area'. Together they form a unique fingerprint.

  • Cite this

    Xu, X. J., & Ishizuka, M. (1993). Efficient data-path synthesis based on algorithmic description under the constraints of time and area. Publ by Elsevier Science Publishers B.V.