loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (dcc 2008)
An Approach to Graph and Netlist Compression
March 25-March 27
ISBN: 978-0-7695-3121-2
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
Usage of this product signifies your acceptance of the Terms of Use.