Title :
An Approach to Graph and Netlist Compression
Author :
Yang, Jeehong ; Savari, Serap A. ; Mencer, Oskar
Author_Institution :
Univ. of Michigan, Ann Arbor
Abstract :
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.
Keywords :
data compression; data mining; electronic data interchange; electronic engineering computing; graph theory; text analysis; EDIF netlist graph; GRAPHITOUR-like graph compression algorithm; PAQ text compression algorithm; SUBDUE; circuit information; compressed EDIF; graph mining tool; Circuits; Compression algorithms; Computational complexity; Data compression; Educational institutions; Heuristic algorithms; Markup languages; Physics; Very large scale integration; XML; CEDIF; EDIF Compression; GRAPHITOUR; Graph Compression; Netlist Compression; SUBDUE;
Conference_Titel :
Data Compression Conference, 2008. DCC 2008
Conference_Location :
Snowbird, UT
Print_ISBN :
978-0-7695-3121-2
DOI :
10.1109/DCC.2008.65
