Checking for valid slice packing in a programmable device

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

07831943

ABSTRACT:
A method of determining validity of slice packing for a programmable device can include identifying a slice topology for a slice, identifying a circuit fragment assigned to the slice, and generating a set of Boolean equations describing conditions for mapping the circuit fragment to the slice according to the slice topology. The method further can include determining whether a solution to the set of Boolean equations exists and indicating whether the slice is validly packed according to whether a solution for the set of Boolean equations is determined.

REFERENCES:
patent: 7028281 (2006-04-01), Agrawal et al.
R. G. Wood and R. A. Rutenbar, “FPGA routing and routability estimation via Boolean satisfiability,” IEEE Trans. VLSI Syst., vol. 16, pp. 222-231, Jun. 1998.

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

Checking for valid slice packing in a programmable device does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Checking for valid slice packing in a programmable device, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Checking for valid slice packing in a programmable device will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4231487

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