A Graph Rewriting Approach for Converting Asynchronous ROMs into Synchronous Ones

IEICE Transactions on Information and Systems Volume E94D Issue 12 Page 2378-2388 published_at 2011-12
アクセス数 : 764
ダウンロード数 : 232

今月のアクセス数 : 4
今月のダウンロード数 : 3
File
IEICETransInfSyst_E94D-12_2378.pdf 477 KB 種類 : fulltext
Title ( eng )
A Graph Rewriting Approach for Converting Asynchronous ROMs into Synchronous Ones
Creator
Mondal Md Nazrul Islam
Ito Yasuaki
Source Title
IEICE Transactions on Information and Systems
Volume E94D
Issue 12
Start Page 2378
End Page 2388
Abstract
Most of FPGAs have Configurable Logic Blocks (CLBs) to implement combinational and sequential circuits and block RAMs to implement Random Access Memories (RAMs) and Read Only Memories (ROMs). 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. The main contribution of this paper is to provide one of the potent approaches to resolve this problem. We assume that a circuit using asynchronous ROMs designed by a non-expert or quickly designed by an expert is given. Our goal is to convert this circuit with asynchronous ROMs into an equivalent circuit with synchronous ones. The resulting circuit with synchronous ROMs can be embedded into FPGAs. We also discuss several techniques to decrease the latency and increase the clock frequency of the resulting circuits.
Keywords
FPGA
block RAMs
asynchronous read operations
rewriting algorithm
NDC
Information science [ 007 ]
Language
eng
Resource Type journal article
Publisher
電子情報通信学会
Date of Issued 2011-12
Rights
Copyright (c) 2011 The Institute of Electronics, Information and Communication Engineers
Publish Type Version of Record
Access Rights open access
Source Identifier
[ISSN] 0916-8532
[DOI] 10.1587/transinf.E94.D.2378
[NCID] AA10826272
[DOI] http://dx.doi.org/10.1587/transinf.E94.D.2378