2003•Unpublished venueRequires access

Datapath allocation algorithm for deep submicron VLSI

Lei Wang, Shaojun Wei

Open publisher page 0 citations

Abstract

With the feature size of VLSI scaling down, interconnect delays begin to dominate the circuit performance. Typical Top-Down High level synthesis methodology is not suitable to the deep submicron VLSI design any more. We present a novel design methodology of datapath allocation for deep submicron VLSI. After allocation, we obtain not only the datapath netlists, but also the floorplan information. Floorplan information is used to direct allocation, thus interconnect delays are efficiently optimized. Design examples are presented to help concluding that our algorithm is very efficient.

About this research paper

What this paper is about

With the feature size of VLSI scaling down, interconnect delays begin to dominate the circuit performance. Typical Top-Down High level synthesis methodology is not suitable to the deep submicron VLSI design any more. We present a novel design methodology of datapath allocation for deep submicron VLSI. After allocation, we obtain not only the datapath netlists, but also the floorplan information. Floorplan information is used to direct allocation, thus interconnect delays are efficiently optimized. Design examples are presented to help concluding that our algorithm is very efficient.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

With the feature size of VLSI scaling down, interconnect delays begin to dominate the circuit performance. Typical Top-Down High level synthesis methodology is not suitable to the deep submicron VLSI design any more. We present a novel design methodology of datapath allocation for deep submicron VLSI. After allocation, we obtain not only the datapath netlists, but also the floorplan information. Floorplan information is used to direct allocation, thus interconnect delays are efficiently optimized. Design examples are presented to help concluding that our algorithm is very efficient.

Key concepts: Datapath, Very-large-scale integration, Floorplan, Computer science, Interconnection, Routing (electronic design automation), Integrated circuit layout, Parallel computing

Related papers

Back to paper searchBrowse research topicsOriginal source
Datapath allocation algorithm for deep submicron VLSI — Research Paper | ScholarLens