An Approach to Graph and Netlist Compression

March 25-March 27

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/DCC.2008.65

Data Compression Conference (dcc 2008)

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	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 Jeehong Yang Articles by Serap A. Savari Articles by Oskar Mencer

	ASCII Text	x
	Jeehong Yang, Serap A. Savari, Oskar Mencer, "An Approach to Graph and Netlist Compression," Data Compression Conference, pp. 33-42, Data Compression Conference (dcc 2008), 2008.

	BibTex	x
	@article{ 10.1109/DCC.2008.65, author = {Jeehong Yang and Serap A. Savari and Oskar Mencer}, title = {An Approach to Graph and Netlist Compression}, journal ={Data Compression Conference}, volume = {0}, year = {2008}, issn = {1068-0314}, pages = {33-42}, doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2008.65}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Compression Conference TI - An Approach to Graph and Netlist Compression SN - 1068-0314 SP33 EP42 A1 - Jeehong Yang, A1 - Serap A. Savari, A1 - Oskar Mencer, PY - 2008 KW - Graph Compression KW - Netlist Compression KW - EDIF Compression KW - CEDIF KW - SUBDUE KW - GRAPHITOUR VL - 0 JA - Data Compression Conference ER -

Jeehong Yang

Serap A. Savari

Oskar Mencer

We introduce an EDIF netlist graph-based compression algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains. The algorithm builds on the graph mining tool SUBDUE. Our algorithm, CEDIF (Compressed EDIF), compresses the EDIF file to a size about 39% of the size of the compressed file resulting from the state-of-the-art PAQ text compression algorithm and to about 85% of the size of a GRAPHITOUR-like graph compression algorithm.

Index Terms:

Graph Compression, Netlist Compression, EDIF Compression, CEDIF, SUBDUE, GRAPHITOUR

Citation:

Jeehong Yang, Serap A. Savari, Oskar Mencer, "An Approach to Graph and Netlist Compression," dcc, pp.33-42, Data Compression Conference (dcc 2008), 2008

Peer Review Notice | Give Us Feedback

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