You are here: Home :: Area NEM :: Computer science

Ulrich Möhrke, Paul Herrmann, Matthias Steffen, Udo Kebschull, Wilhelm G. Spruth

A Branch&Bound Approach to Routing of Field Programmable Gate Arrays

The description of the FPGA routing problem and an approach based on a branch&bound method are presented. Results for program run times, length of the critical path of the resulting circuit and the number of the enclosed search nodes with regard to various search strategies are given. These results show a significant shortening of the longest paths compared to a commercial placement and routing tool.

it – Information Technology (vormals it+ti), Oldenbourg Wissenschaftsverlag

Print ISSN: 1611-2776
Volume: 41, 06/1999
Pages: 17

Journal homepage (external site)

Show all available items of this journal

 

Area NEM