1 / 15

ICCad Contest

This paper presents a novel iterative algorithm for computing all k-cuts of nodes in sequential circuits, tailored for LUT-based FPGAs. With focus on 3-LUT and 3-Cut, the algorithm significantly enhances performance by implementing a bottom-up approach to merge node cuts efficiently. Additionally, it discusses the limitations of existing techniques like ABC and the need for the VL2MV parser, addressing issues including single circuit translation and lack of multiplication support. Included are suggested solutions and source code for efficient parser implementation.

malcolm-sandoval
Télécharger la présentation

ICCad Contest

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ICCad Contest A-Rei & K-Wei & Fox & Chen-Yu 2013/04/29

  2. Outline • K-cut • vl2mv

  3. K-Cut • A New Retiming-based Technology Mapping Algorithm for LUT-based FPGAs (1998) • The algorithm is based on a novel iterative procedure for computing all k-cuts of all nodes in a sequential circuit.

  4. K-Cut Definition

  5. K-Cut • K-Look up Table & K-Cut * K is very small Ex. 3-LUT & 3-Cut A B F C

  6. K-Cut V … u1 u2 …

  7. 4-Cut V u1 u2 u3 A B C D E Cu1 = { { A , B } , { U1 } } Cv= merge( Cu1 , Cu2 , Cu3 ) ∪ { { V } } = { { U1 , U2 , U3 }, {U1 , C , D, U3} , {U1 , C , D, E}, { A , B , U2 , U3} , { A , B , C , D, U3} , { A , B , C , D, E} { A , B , U2 , E} , { U1 , U2 , E} , { V } } Cu2 = { { C , D } , { U2 } } Cu3 = { { E } , { U3 } }

  8. Bottom Up Approach V u1 u2 u3

  9. Bottom Up Approach V u1 u2 u3

  10. Bottom Up Approach V u1 u2 u3

  11. Bottom Up Approach V u1 u2 u3

  12. Bottom Up Approach V V ’ u1 u2 u3 Avoid computation overhead !

  13. VL2MV • Why we need VL2MV • Parser • ABC’s limitation

  14. VL2MV • VL2MV Limitation • Doesn't support multiplication sign(*) • Only one circuit can be translated at the same time

  15. VL2MV • Solution • Include VL2MV source code and implement the parser by ourselves

More Related