Recursive and Iterative Algorithms for N-ary Search Problems

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 impleme...

Full description

Saved in:
Bibliographic Details
Published inIFIP International Federation for Information Processing Vol. 218; pp. 81 - 90
Main Authors Sklyarov, Valery, Skliarova, Iouliia
Format Book Chapter
LanguageEnglish
Published The Netherlands Springer 2006
Springer US
SeriesIFIP International Federation for Information Processing
Subjects
Adaptive Control System
Artificial intelligence
Clock Cycle
Field Programmable Gate Array
Hierarchical Algorithm
Incoming Message
Online AccessGet full text
ISBN0387346554
9780387346557
ISSN1571-5736
DOI10.1007/978-0-387-34749-3_9

Cover

More Information
Summary: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.
ISBN:0387346554
9780387346557
ISSN:1571-5736
DOI:10.1007/978-0-387-34749-3_9