Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Time sequence estimation method for FPGA (field programmable gate array) post-mapping net list

A netlist and timing technology, applied in computing, special data processing applications, instruments, etc., can solve problems such as lack of block units and wiring resources

Active Publication Date: 2015-03-18
CAPITAL MICROELECTRONICS
View PDF4 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Do FPGA timing estimation before layout and routing. Due to the lack of on-chip physical location information of block units and routing resources, it is very difficult to achieve small errors. Research in this field is basically blank in the current industry.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Time sequence estimation method for FPGA (field programmable gate array) post-mapping net list
  • Time sequence estimation method for FPGA (field programmable gate array) post-mapping net list
  • Time sequence estimation method for FPGA (field programmable gate array) post-mapping net list

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] Synthesize the circuit designed by the user and map the library to form a netlist, so that the basic units and their connection relationships can also be obtained. The basic units include: lookup tables, registers, memories, input and output, etc., and the connections between basic units The connection is called a single-segment connection, and the layout and routing are usually completed once on the FPGA chip. According to the result of the layout and routing, the delay value of any single-segment connection can be uniquely determined.

[0042] figure 1 It is a flow chart of the method for timing estimation of netlist after FPGA mapping provided by Embodiment 1 of the present invention. Such as figure 1 As shown, the method provided by the embodiment of the present invention includes:

[0043] Step 101, for a single-segment connection between a source block unit and a sink unit, determine the type of the single-segment connection according to the types of the source ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a time sequence estimation method for an FPGA (field programmable gate array) post-mapping net list. The method includes the steps: determining the type of a single connecting wire between a source block unit and a collecting block unit according to types of the source block unit and the collecting block unit; searching the global delay range and the global congestion range of the single connecting wire in a timing model library file according to the type of the single connecting wire; calculating local congestion of the single connecting wire and determining the local congestion range and the local delay range of the single connecting wire according to the local congestion; calculating the delay value of the single connecting wire according to the local congestion range and the local delay range of the single connecting wire. Therefore, the highest working frequency of an FPGA before placement and routing can be estimated, a clock constraint file is generated and replaces clock constraint set by a user to serve as input of a placement and routing tool, and the better highest frequency can be obtained by fewer iteration times.

Description

technical field [0001] The invention relates to the field of chip layout, in particular to a method for timing estimation of netlists after FPGA mapping. Background technique [0002] The highest frequency that Field Programmable Gate Array (FPGA) software can achieve is a measure of the performance of the FPGA chip. It has a lot to do with the initial clock constraints set by the user. Different initial clock constraints may lead to The highest frequency finally achieved varies greatly, and FPGA timing estimation is generally performed after place and route. Doing FPGA timing estimation before layout and routing, due to the lack of on-chip physical location information of block units and routing resources, it is very difficult to achieve a small error. Research in this field is basically blank in the current industry. Contents of the invention [0003] The purpose of the present invention is to provide a method for timing estimation of the netlist formed after the gate-l...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F17/50
Inventor 李璇樊平刘明
Owner CAPITAL MICROELECTRONICS
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products