Register allocation using circular FIFOs
Imed Eddine Bennour, E.M. Aboulhamid · 1996
In this paper, we study the memory allocation problem in data path synthesis. We propose a register organization called circular FIFO as an alternative to register file organization. In comparison with register file organization, FIFO organization eliminates the overhead of address generation and decoding hardware. The memory allocation problem, based on the circular FIFO organization, has been solved efficiently using constraint logic and interval constraint programming.