2025-02-22T21:33:51-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-101562%22&qt=morelikethis&rows=5
2025-02-22T21:33:51-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-101562%22&qt=morelikethis&rows=5
2025-02-22T21:33:51-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T21:33:51-05:00 DEBUG: Deserialized SOLR response

Translation of VHDL Sequential Statements

VHDL is one of the most popular languages used in logic synthesis tools. It has variety of statements which make it powerful and flexible tool. But, as the result, it is rather difficult to create a compiler of VHDL language, especially the one which will be used in a logic synthesis. There is littl...

Full description

Saved in:
Bibliographic Details
Main Author: Radziewicz, M.
Format: Article
Language:English
Published: Інститут проблем моделювання в енергетиці ім. Г.Є. Пухова НАН України 2008
Series:Электронное моделирование
Subjects:
Online Access:http://dspace.nbuv.gov.ua/handle/123456789/101562
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:VHDL is one of the most popular languages used in logic synthesis tools. It has variety of statements which make it powerful and flexible tool. But, as the result, it is rather difficult to create a compiler of VHDL language, especially the one which will be used in a logic synthesis. There is little information about translation algorithms used to generate hardware representation from VHDL sources. The algorithms for few sequential statements of VHDL language are developed. Apart from the algorithms themselves the paper presents a lot of information about translation process itself and all possible problems which may occur during it. Proposed solution was implemented in a compilerwhich uses Boolean equations as an output format. The paper includes results of tests which were performed to check practical usability boundaries of proposed algorithms.