2003 · 60 citations · 12 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureField-programmable Gate ArraysReconfigurable ComputingField-programmable Gate Array ArchitectureFpga ArchitectureLookup TablesRoutingRouting AlgorithmsRouting ArchitectureField-programmable Gate Arrays (Fpgas)Global RoutingLut RoutingPlacement AlgorithmsRouting In Field-programmable Gate ArraysSimulated AnnealingSimulated Annealing RoutingTechnology Mapping To Logic Blocks
A routing-driven technology mapper for lookup-table, (LUT)-based field-programmable gate arrays (FPGAs) is presented. The approach is based on performing mapping aimed at routing feasibility. For an FPGA of given size (number of LUTs), the logic being implemented is distributed in such a manner that the total wire length is minimized and the routing resources are not overutilized. Simulated annealing is used to perform mapping, placement, and global routing in tandem. The algorithm can handle both combinational and sequential logic circuits, and has been implemented for combinational circuits. Experiments on MCNC benchmark circuits show encouraging results.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
12
Sequential circuit design using synthesis and optimization
Ellen Sentovich, K.J. Singh, Cho W. Moon et al. · 2003 · 615 citations
Improved logic synthesis algorithms for table look up architectures
Rajeev Murgai, Narendra Shenoy, Robert K. Brayton et al. · 2002 · 209 citations
Performance directed synthesis for table look up programmable gate arrays
Rajeev Murgai, Narendra Shenoy, Robert K. Brayton et al. · 2002 · 114 citations