FPGA-based implementation and comparison of recursive and iterative algorithms

The paper analyses and compares alternative iterative and recursive implementations of FPGA circuits for various problems. Two types of recursive calls have been examined, namely for cyclic and binary (N-ary) search algorithms. The details of experiments are presented for four different design problems. The relevant comparative data have been obtained as a result of synthesis and implementation in FPGAs of the respective circuits from system-level (Handel-C) and RTL (VHDL) specifications.

• Type: Conference
• Year: 2005
• Where: FPL
• Authors: Valery Sklyarov, Iouliia Skliarova, Bruno Figueiredo Pimentel
• Keywords: FPGA Circuits, FPL 2005, Recursive Calls, Recursive Implementations