By Topic

An approach to realize time-sharing of flip-flops in time-multiplexed FPGAs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
A. Khan ; Graduate Sch. of Eng., Tohoku Univ., Sendai, Japan ; N. Miyamoto ; T. Ohkawa ; A. Jamak
more authors

This work introduces a new approach to realize timesharing of flip-flops in time-multiplexed FPGAs. In order to implement large circuits in time-multiplexed FPGAs, it is important that flip-flops, as well as combinational logics, must be time-shared efficiently. To handle sequential circuits, previous works either required large amount of communication between sub-circuits or caused storage overhead due to buffer usage, resulting to complicated placing and routing tasks and limiting the size of target circuit that can be implemented. We propose a simple algorithm that can efficiently realize timesharing of flip-flops by refining an initial partitioning. Experimental results show that implementation of our approach can eliminate all storage overhead while the resultant change in the amount of communication between sub-circuits can be kept less than ±4%. We have also designed and fabricated a new temporal communication module, and implemented our new approach on it.

Published in:

Field-Programmable Technology, 2004. Proceedings. 2004 IEEE International Conference on

Date of Conference:

6-8 Dec. 2004