Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 294986

Condition Graphs for High-Quality Behavioral Synthesis


Juan, Hsiao-Ping; Chaiyakul, Viraphol; Gajski, Daniel D.
Condition Graphs for High-Quality Behavioral Synthesis // Procedings of IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
San Jose (CA), Sjedinjene Američke Države: Institute of Electrical and Electronics Engineers (IEEE), 1994. str. 170-174 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


CROSBI ID: 294986 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
Condition Graphs for High-Quality Behavioral Synthesis

Autori
Juan, Hsiao-Ping ; Chaiyakul, Viraphol ; Gajski, Daniel D.

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Procedings of IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems / - : Institute of Electrical and Electronics Engineers (IEEE), 1994, 170-174

Skup
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Mjesto i datum
San Jose (CA), Sjedinjene Američke Države, 06.11.1994. - 10.11.1994

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
Mutual exclusiveness; Condition Graph

Sažetak
Identifying mutual exclusiveness between operators during behavioral synthesis is important in order to reduce the required number of control steps or hardware resources. To improve the quality of the synthesis result, we propose a representation, the Condition Graph, and an algorithm for identification of mutually exclusive operators. Previous research efforts have concentrated on identifying mutual exclusiveness by examining language constructs such as IF-THEN-ELSE statements. Thus, their results heavily depend on the description styles. The proposed approach can produce results independent of description styles and identify more mutually exclusive operators than any previous approaches. The Condition Graph and the proposed algorithm can be used in any scheduling or binding algorithms. Experimental results on several benchmarks have shown the efficiency of the proposed representation and algorithm.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo



POVEZANOST RADA


Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb

Profili:

Avatar Url Daniel Gajski (autor)


Citiraj ovu publikaciju:

Juan, Hsiao-Ping; Chaiyakul, Viraphol; Gajski, Daniel D.
Condition Graphs for High-Quality Behavioral Synthesis // Procedings of IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
San Jose (CA), Sjedinjene Američke Države: Institute of Electrical and Electronics Engineers (IEEE), 1994. str. 170-174 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Juan, H., Chaiyakul, V. & Gajski, D. (1994) Condition Graphs for High-Quality Behavioral Synthesis. U: Procedings of IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
@article{article, author = {Juan, Hsiao-Ping and Chaiyakul, Viraphol and Gajski, Daniel D.}, year = {1994}, pages = {170-174}, keywords = {Mutual exclusiveness, Condition Graph}, title = {Condition Graphs for High-Quality Behavioral Synthesis}, keyword = {Mutual exclusiveness, Condition Graph}, publisher = {Institute of Electrical and Electronics Engineers (IEEE)}, publisherplace = {San Jose (CA), Sjedinjene Ameri\v{c}ke Dr\v{z}ave} }
@article{article, author = {Juan, Hsiao-Ping and Chaiyakul, Viraphol and Gajski, Daniel D.}, year = {1994}, pages = {170-174}, keywords = {Mutual exclusiveness, Condition Graph}, title = {Condition Graphs for High-Quality Behavioral Synthesis}, keyword = {Mutual exclusiveness, Condition Graph}, publisher = {Institute of Electrical and Electronics Engineers (IEEE)}, publisherplace = {San Jose (CA), Sjedinjene Ameri\v{c}ke Dr\v{z}ave} }




Contrast
Increase Font
Decrease Font
Dyslexic Font