An approach to graph and netlist compression Conference Paper

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. 2008 IEEE.

name of conference

• Data Compression Conference (dcc 2008)

authors

• Savari, Serap

published proceedings

• DCC: 2008 DATA COMPRESSION CONFERENCE, PROCEEDINGS

altmetric score

• 3

author list (cited authors)

• Yang, J., Savari, S. A., & Mencer, O.

citation count

• 0

complete list of authors

• Yang, Jeehong||Savari, Serap A||Mencer, Oskar

publication date

• March 2008

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Data Compression Conference Proceedings  Journal

keywords

• 40 Engineering
• 4006 Communications Engineering
• 46 Information And Computing Sciences
• 4603 Computer Vision And Multimedia Computation

Digital Object Identifier (DOI)

• 10.1109/DCC.2008.65

International Standard Book Number (ISBN) 10

• 0769531210

International Standard Book Number (ISBN) 13

• 978-0-7695-3121-2

start page

• 33

end page

• +

URL

• http://dx.doi.org/10.1109/dcc.2008.65