Thumbnail
Access Restriction
Open

Author Cong, Jason
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Area Minimization ♦ Lut-based Fpga Mapping ♦ Simultaneous Depth ♦ Depth-optimal Mapping Solution ♦ Critical Node ♦ Flwomap Algorithm ♦ Mapping Process ♦ Depth Relaxation ♦ Mcnc Logic Synthesis Benchmark ♦ Depth Relaxation Routine ♦ Non-critical Node ♦ Depth Minimization ♦ Min-cost Kfeasible Cut ♦ Min-cost Min-height K-feasible Cut ♦ Polynomial Time ♦ Flowmap_r Algorithm ♦ Flowmap Algorithm ♦ Flowmap_r Performs
Abstract ... FlwoMap algorithm, named CutMap, which combines depth and area minimization during the mapping process by computing min-cost min-height K-feasible cuts for critical nodes for depth minimization and computing min-cost Kfeasible cuts for non-critical nodes for area minimization. CutMap guarantees depth-optimal mapping solutions in polynomial time as the FlowMap algorithm but uses considerably fewer K-LUTs. We have implemented CutMap and tested it on the MCNC logic synthesis benchmarks. For depth-optimal mapping solutions, CutMap uses 15% fewer K-LUTs than FlowMap. We also tested CutMap followed by the depth relaxation routines in FlowMap_r algorithm, which achieves area minimization by depth relaxation. CutMap followed FlowMap_r performs better than FlowMap_r.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study