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

Fingerprint

Networks (circuits)
Processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

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

Efficient data-path synthesis based on algorithmic description under the constraints of time and area. / Xu, Xing jian; Ishizuka, Mitsuru.

Amsterdam, Netherlands : Publ by Elsevier Science Publishers B.V., 1993. 8 p.

Research output: Book/ReportBook

Xu, XJ & 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., Amsterdam, Netherlands.
Xu XJ, Ishizuka M. Efficient data-path synthesis based on algorithmic description under the constraints of time and area. Amsterdam, Netherlands: Publ by Elsevier Science Publishers B.V., 1993. 8 p.
Xu, Xing jian ; Ishizuka, Mitsuru. / Efficient data-path synthesis based on algorithmic description under the constraints of time and area. Amsterdam, Netherlands : Publ by Elsevier Science Publishers B.V., 1993. 8 p.
@book{95625a15f921454cbe47057a1cbfdbea,
title = "Efficient data-path synthesis based on algorithmic description under the constraints of time and area",
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.",
author = "Xu, {Xing jian} and Mitsuru Ishizuka",
year = "1993",
language = "English",
isbn = "0444816410",
publisher = "Publ by Elsevier Science Publishers B.V.",

}

TY - BOOK

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

AU - Xu, Xing jian

AU - Ishizuka, Mitsuru

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027725412&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027725412&partnerID=8YFLogxK

M3 - Book

SN - 0444816410

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

PB - Publ by Elsevier Science Publishers B.V.

CY - Amsterdam, Netherlands

ER -