Optimised state assignment for asynchronous circuit synthesis

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by C. Ykman-Couvreur Articles by B. Lin

Second Working Conference on Asynchronous Design Methodologies

London, England

May 30-May 31

ISBN: 0-8186-7098-3

	ASCII Text	x
	C. Ykman-Couvreur, B. Lin, "Optimised state assignment for asynchronous circuit synthesis," Asynchronous Circuits and Systems, International Symposium on, pp. 118, Second Working Conference on Asynchronous Design Methodologies, 1995.

	BibTex	x
	@article{ 10.1109/WCADM.1995.514649, author = {C. Ykman-Couvreur and B. Lin}, title = {Optimised state assignment for asynchronous circuit synthesis}, journal ={Asynchronous Circuits and Systems, International Symposium on}, volume = {0}, year = {1995}, isbn = {0-8186-7098-3}, pages = {118}, doi = {http://doi.ieeecomputersociety.org/10.1109/WCADM.1995.514649}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Asynchronous Circuits and Systems, International Symposium on TI - Optimised state assignment for asynchronous circuit synthesis SN - 0-8186-7098-3 SP EP A1 - C. Ykman-Couvreur, A1 - B. Lin, PY - 1995 KW - state assignment; asynchronous circuits; logic design; encoding; optimised state assignment; asynchronous circuit synthesis; complete state coding; state graph level; asynchronous benchmarks; circuit area; computation time VL - 0 JA - Asynchronous Circuits and Systems, International Symposium on ER -

C. Ykman-Couvreur, IMEC, Leuven, Belgium

B. Lin, IMEC, Leuven, Belgium

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WCADM.1995.514649

This paper presents a new efficient optimised state assignment method for solving complete state coding (CSC) problem that operates purely at the state graph level and is applicable to a broad class of behaviors. This method has been automated and applied to a large set of asynchronous benchmarks and industrial circuits. Compared to existing techniques, this new method achieves significant improvements in terms of both circuit area and computation time.

Index Terms:

state assignment; asynchronous circuits; logic design; encoding; optimised state assignment; asynchronous circuit synthesis; complete state coding; state graph level; asynchronous benchmarks; circuit area; computation time

Citation:

C. Ykman-Couvreur, B. Lin, "Optimised state assignment for asynchronous circuit synthesis," async, pp.118, Second Working Conference on Asynchronous Design Methodologies, 1995

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.