loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (DFT'04)
Compression of VLSI Test Data by Arithmetic Coding
Cannes, France
October 10-October 13
ISBN: 0-7695-2241-6
ASCII Text
x 
 
H. Hashempour, F. Lombardi, "Compression of VLSI Test Data by Arithmetic Coding," Defect and Fault-Tolerance in VLSI Systems, IEEE International Symposium on, pp. 150-157, 19th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (DFT'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/DFT.2004.18,
author = {H. Hashempour and F. Lombardi},
title = {Compression of VLSI Test Data by Arithmetic Coding},
journal ={Defect and Fault-Tolerance in VLSI Systems, IEEE International Symposium on},
volume = {0},
year = {2004},
issn = {1550-5774},
pages = {150-157},
doi = {http://doi.ieeecomputersociety.org/10.1109/DFT.2004.18},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Defect and Fault-Tolerance in VLSI Systems, IEEE International Symposium on
TI - Compression of VLSI Test Data by Arithmetic Coding
SN - 1550-5774
SP150
EP157
A1 - H. Hashempour,
A1 - F. Lombardi,
PY - 2004
KW - null
VL - 0
JA - Defect and Fault-Tolerance in VLSI Systems, IEEE International Symposium on
ER -
 
H. Hashempour, Northeastern University, Boston, Mass
F. Lombardi, Northeastern University, Boston, Mass
This paper presents Arithmetic Coding and its application to data compression for VLSI testing. The use of arithmetic codes for compression results in a codeword whose length is close to the optimal value as predicted by entropy in information theory. Previous techniques (such as those based on Huffman or Golomb coding) result in optimal codes for test data sets in which the probability model of the symbols satisfies specific requirements. We show that Huffman and Golomb codes result in large difference between entropy bound and sustained compression. We present compression results of arithmetic coding for circuits through a practical integer implementation of Arithmetic coding/decoding and analyze its deviation from entropy bound as well. A software implementation approach is proposed and studied in detail using industrial embedded DSP cores.
Citation:
H. Hashempour, F. Lombardi, "Compression of VLSI Test Data by Arithmetic Coding," dft, pp.150-157, 19th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (DFT'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.