The paper analyses and compares alternative iterative and recursive implementations of N-ary search algorithms in hardware (in field programmable gate arrays, in particular). The improvements over the previous results have been achieved with the aid of the proposed novel methods for the fast implementation of hierarchical algorithms. The methods possess the following distinctive features: 1) providing sub-algorithms with multiple entry points; 2) fast stack unwinding for exits from recursive sub-algorithms; 3) hierarchical returns based on two alternative approaches; 4) rational use of embedded memory blocks for the design of a hierarchical finite state machine.
Notas
Applications in Artificial Intelligence - Search
Información general
Fecha de exposición:agosto 2006
Fecha de publicación:agosto 2006
Idioma del documento:Inglés
Evento:19 th IFIP World Computer Congress - WCC 2006
Institución de origen:Red de Universidades con Carreras en Informática (RedUNCI)
Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)