A graph rewriting approach to replace asynchronous RAMs in circuits with cycles for FPGAs
File version
Author(s)
Zaman, MSU
Pal, B
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
Dhaka, Bangladesh
License
Abstract
Circuit design that minimizes the number of clock cycles is easy if we use asynchronous read operations. However, most of FPGAs support synchronous read operations, but do not support asynchronous read operations. It is one of the main difficulties for users to implement parallel and hardware algorithms in FPGAs. The main contribution of this paper is to provide one of the potent approaches to resolve this problem. We assume that a circuit which includes cycles using asynchronous RAMs designed by a non-expert or quickly designed by an expert is given. Our goal is to convert this circuit with asynchronous RAMs into an equivalent synchronous ones. The resulting circuit with synchronous RAMs can be embedded into the FPGAs.
Journal Title
Conference Title
2014 8th International Conference on Electrical and Computer Engineering (ICECE)
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Persistent link to this record
Citation
Mondal, MNI; Zaman, MSU; Pal, B, A graph rewriting approach to replace asynchronous RAMs in circuits with cycles for FPGAs, 2014 8th International Conference on Electrical and Computer Engineering (ICECE), 2015, pp. 152-155