Resource Scheduling in High Level Synthesis of Digital Filter using Differential Evolution Algorithm

Atul Jadhav, Shilpa K. C

Abstract


In this project, the process of high-level synthesis (HLS) with scheduling, involves the assignment of the DFG operations to various time-steps. DFG operations to physical arithmetic functional units (adders, multipliers, etc.), as well as the subsequent allocation of hardware resources (registers, multiplexors, etc.) to facilitate the data transfer in the DFG. Differential Evolution has been shown to be a simple yet efficient optimization approach in solving a variety of benchmark problems as well as many real-world applications. Differential evolution (DE) together with evolution strategies (ES’s) and evolutionary programing (EP) can be categorized into a class of population-based, Derivative free methods known as Evolutionary algorithm. In this project the resource scheduling in high level synthesis with differential evolution algorithm the number of functional units (adders, multipliers, etc.), as well as the subsequent allocation of hardware resources (registers, multiplexors, etc.) are reduced with the result of area , power and delay reduced with effective cost reduction.


Full Text:

PDF

References


Seyyed Ali Hashemi, Behrouz Nowrouzian. A novel particle swarm optimization for high-level synthesis of digital filters. In Proceedings of IEEE International Conference Alberta. 2012.

M. C. McFarland, A. C. Parker, R. Camposano. Tutorial on high-level synthesis. In Proceedings of the 25th ACM/IEEE Design Automation Conference. 1988; 330–336p.

J.-H. Lee, Y.-C. Hsu, Y.-L. Lin. A new integer linear programming formulation for the scheduling problem in data path synthesis. In Proceedings of 1989 IEEE International Conference on Computer-Aided Design. 1989; 20–23p.

S. O. Memik, R. Kastner, E. Bozorgzadeh, et al. A scheduling algorithm for optimization and early planning in high-level synthesis. ACM Transactions on Design Automation of Electronic Systems. 2005; 10: 33–57p.

D. D. Gajski, L. Ramachandran. Introduction to high-level synthesis. IEEE Design Test of Computers. 1994; 11(4): 44–54p.

P. G. Paulin, J. P. Knight. Force-directed scheduling in automatic data path synthesis. In Proceedings of the 24th ACM/IEEE Design Automation Conference. 1987; 195–202p.

J. H. Satyanarayana, B. Nowrouzian. A new technique for the high level synthesis of digit-serial digital filters based on genetic algorithms. Journal of Circuits, Systems, and Computers (JCSC). 1997; 7(6): 517–535p.

R. F. Abdel-Kader. Particle swarm optimization for constrained instruction scheduling. VLSI Des. 2008; 7: 1–7p.

A. Shahid, M. S. T. Benten, S. M. Sait. Gsa: scheduling and allocation using genetic algorithm. In Proceedings of the Conference on European design Automation. 1994; 84–89p.

S. Y. Kung, T. Kailath, H. J. Whitehouse. VLSI and Modern Signal Processing. Prentice Hall Professional Technical Reference; 1984.


Refbacks

  • There are currently no refbacks.