The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A síntese de verificadores para verificação baseada em asserções torna-se popular devido ao progresso recente no ambiente de prototipagem FPGA. No artigo, propomos um método de síntese de verificador baseado no autômato de memória de entrada finita adequado para módulos RAM embarcados em FPGA. Existem mais de 1 Mbit de memória em FPGAs de tamanho médio e essas células de memória incorporadas têm a capacidade de serem usadas como registradores de deslocamento. A ideia principal é construir um circuito verificador usando autômatos de memória de entrada finita e implementar a cadeia de registradores de deslocamento por elementos lógicos ou módulos de RAM embarcados. Ao utilizar o módulo RAM, o método não consome nenhum elemento lógico para armazenar o valor. Observe que a cadeia de registradores de deslocamento da memória de entrada pode ser compartilhada com diferentes asserções e podemos reduzir significativamente o recurso de hardware. Verificamos a eficácia do método proposto usando diversas afirmações.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Chengjie ZANG, Shinji KIMURA, "Finite Input-Memory Automaton Based Checker Synthesis of SystemVerilog Assertions for FPGA Prototyping" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 6, pp. 1454-1463, June 2009, doi: 10.1587/transfun.E92.A.1454.
Abstract: Checker synthesis for assertion based verification becomes popular because of the recent progress on the FPGA prototyping environment. In the paper, we propose a checker synthesis method based on the finite input-memory automaton suitable for embedded RAM modules in FPGA. There are more than 1 Mbit memories in medium size FPGA's and such embedded memory cells have the capability to be used as the shift registers. The main idea is to construct a checker circuit using the finite input-memory automata and implement shift register chain by logic elements or embedded RAM modules. When using RAM module, the method does not consume any logic element for storing the value. Note that the shift register chain of input memory can be shared with different assertions and we can reduce the hardware resource significantly. We have checked the effectiveness of the proposed method using several assertions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.1454/_p
Copiar
@ARTICLE{e92-a_6_1454,
author={Chengjie ZANG, Shinji KIMURA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Finite Input-Memory Automaton Based Checker Synthesis of SystemVerilog Assertions for FPGA Prototyping},
year={2009},
volume={E92-A},
number={6},
pages={1454-1463},
abstract={Checker synthesis for assertion based verification becomes popular because of the recent progress on the FPGA prototyping environment. In the paper, we propose a checker synthesis method based on the finite input-memory automaton suitable for embedded RAM modules in FPGA. There are more than 1 Mbit memories in medium size FPGA's and such embedded memory cells have the capability to be used as the shift registers. The main idea is to construct a checker circuit using the finite input-memory automata and implement shift register chain by logic elements or embedded RAM modules. When using RAM module, the method does not consume any logic element for storing the value. Note that the shift register chain of input memory can be shared with different assertions and we can reduce the hardware resource significantly. We have checked the effectiveness of the proposed method using several assertions.},
keywords={},
doi={10.1587/transfun.E92.A.1454},
ISSN={1745-1337},
month={June},}
Copiar
TY - JOUR
TI - Finite Input-Memory Automaton Based Checker Synthesis of SystemVerilog Assertions for FPGA Prototyping
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1454
EP - 1463
AU - Chengjie ZANG
AU - Shinji KIMURA
PY - 2009
DO - 10.1587/transfun.E92.A.1454
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2009
AB - Checker synthesis for assertion based verification becomes popular because of the recent progress on the FPGA prototyping environment. In the paper, we propose a checker synthesis method based on the finite input-memory automaton suitable for embedded RAM modules in FPGA. There are more than 1 Mbit memories in medium size FPGA's and such embedded memory cells have the capability to be used as the shift registers. The main idea is to construct a checker circuit using the finite input-memory automata and implement shift register chain by logic elements or embedded RAM modules. When using RAM module, the method does not consume any logic element for storing the value. Note that the shift register chain of input memory can be shared with different assertions and we can reduce the hardware resource significantly. We have checked the effectiveness of the proposed method using several assertions.
ER -