Datapath design methodology and routing apparatus

Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C716S030000

Reexamination Certificate

active

06598215

ABSTRACT:

FIELD
The present invention is directed to a routing methodology.
BACKGROUND
As technology migrates toward ultra deep sub-micron feature sizes, designs are becoming increasingly complex with very aggressive goals. For example, microprocessor designs may target operating frequencies of upwards to 4 or 5 GHz, and desire process feature sizes less than or equal to 0.13 &mgr;m. A microprocessor may contain four different types of circuits, namely interface circuits, memory, datapaths and random (controller) circuits. Datapaths are an important part of the design because a majority of computations are performed in these units. Datapath circuits typically account for a large percentage of all the transistors of a microprocessor and consume a large part of the designer's time and effort. To a large extent, the performance of the datapath may determine the performance of the entire integrated circuit (IC). Traditional design automation methodologies are not well suited for the design of high-performance datapaths because they do not exploit the structural regularity of bit-slices. As a result, datapath blocks may be manually designed resulting in a significantly larger design time and cost.


REFERENCES:
patent: 5519627 (1996-05-01), Mahmood et al.
patent: 5640327 (1997-06-01), Ting
patent: 5812417 (1998-09-01), Young
patent: 6327697 (2001-12-01), Ghosh
R.X.T. Nijssen et al., “Regular layout Generation of Logically Optimized Datapaths”,Proceeding of the International Symposium on Physical Design, pp. 42-47, 1997.
Naveen Buddi, et al., “Layout Synthesis for Datapath Designs”,Proceedings of European Design Automation Conference, pp. 86-90, 1995.
Terry Tao Ye, et al., “Datapath Placement with Regularity”,Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp. 264-270, 2000.
Serken Askar et al., “Analytical Approach to Custom Datapath Design”,Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp. 98-101, 199.
Jaewon Kim, et al., “A Timing-driven Data Path Layout Synthesis with Integer Programming”,Proceedings of IEEE/ACM International Conference on Computer Aided Design, pp. 716-719, 1995.
Suresh Ramen et al., “Datapath Routing Based on A Decongestion Metric”,Proceedings of the ACM International Symposium on Physical Design, pp. 122-127, 2000.
Amit Chowdhary et al., “A General Approach for Regularity Extraction in Datapath Circuits”,Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp. 332-339, 1998.
Srinivasa R. Arikati, et al., “A Signature Based Approach to Regularity Extraction”,Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp. 542-545, 1997.
Soha Hassoun et al., “Regularity Extraction Via Clan-Based Structural Circuit Decomposition”,Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp. 414-418, 1999.
http://www.sycon-design.com/Products/Tempest-Block/tempest-block.html, pp. 1-3, Apr. 4, 2001.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Datapath design methodology and routing apparatus does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Datapath design methodology and routing apparatus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Datapath design methodology and routing apparatus will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3020123

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.