RL-huffman encoding for test compression and power reduction in scan applications

Nourani, Mehrdad; Tehranipour, M.H.

doi:10.1145/1044111.1044117

Cited by 116 publications

(61 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Golomb [4], FDR [5], ALT-FDR [6] EFDR [7], SHC [8], VIHC [9], RL-HC [10], and 9C [12]. It should be noted that SHC [8], VIHC [9] and RL-HC [10] are test-data dependent while the other techniques are test independent.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Efficient test compression technique based on block merging

El-Maleh

2008

IET Comput. Digit. Tech.

View full text Add to dashboard Cite

Test data compression is an effective methodology for reducing test data volume and testing time. In this paper, we present a new test data compression technique based on block merging. The technique capitalizes on the fact that many consecutive blocks of the test data can be merged together. Compression is achieved by storing the merged block and the number of blocks merged. It also takes advantage of cases where the merged block can be filled by all 0's or all 1's. Test data decompression is performed on chip using a simple circuitry that repeats the merged block the required number of times. The decompression circuitry has the advantage of being test data independent. Experimental results on benchmark circuits demonstrate the effectiveness of the proposed technique compared to other coding-based compression techniques.

show abstract

Section: Resultsmentioning

confidence: 99%

“…It should be noted that SHC [8], VIHC [9] and RL-HC [10] are test-data dependent while the other techniques are test independent.…”

Section: Resultsmentioning

confidence: 99%

Efficient test compression technique based on block merging

El-Maleh

2008

IET Comput. Digit. Tech.

View full text Add to dashboard Cite

show abstract

“…The method of compression RL [13] uses what one indicates by coding by zone. The process is simple: the algorithm tries to detect in all the image of the rectangles whose pixels are identical.…”

Section: -2-run Length (Rl) Compression Methodsmentioning

confidence: 99%

A Multi-agent System for Image Compression

Redjimi¹

2012

IJCA

View full text Add to dashboard Cite

We describe, in this paper, a multi-agent system (MAS) dedicated to the compression of digital images. An Image may be considered as a matrix of N lines and of M columns, that is to say a size of NxM pixels. To each line, we associate an agent. Our approach is inspired from the RLE (Run Length Encoding) method but instead of storing the occurrences of the pixels having a same value followed by the value of these pixels, we use a labeling table which contains all the values of the pixels of the image. We obtain a compressed image as a list of color labels followed by the number of successive occurrences of this color. We observe, that, an image is made up of about thirty different colors approximately, this mean that the label of color can be coded on five bits. This method is very effective for images where the color is coded on several bytes. The algorithm is as follow: each agent traverses the image line with which it is associated by seeking for each detected color the number of its successive occurrences. The agent thus draws up a set of lists for each color found including the number of its occurrences. All the other agents carry out these tasks in parallel. It is possible to obtain images compressed without or with loss of information according to the desired quality of the compressed image. This approach allows a very great improvement of the performances in storage capacity of information (the compressed images thus obtained occupy less memory space) and in execution time (the parallel execution allows very high accelerations of the algorithms).

show abstract

“…Mcintyre and Pechuraapplied Huffman to test data over various source programs in four different languages where the data was read from files [11]. Nourani and Tehranipour used Huffman technique to reduce test data volume, power dissipation and pattern delivery time in the field of Integrated Circuits [12]. Also, Tang utilised Huffman encoding methods for a proposed method of multimedia encryption for vast amounts of MPEG video data [13].…”

Section: Huffman Codingmentioning

confidence: 99%

Efficient Sequence Comparison Using Binary Codes

Rahimi¹

2015

IJFCC

View full text Add to dashboard Cite

Abstract-In this paper, we propose an efficient way of finding the exact distance in sequence comparison by using Huffman coding method for alphabets with uniform symbol probabilities. The approach is proposed as a refinement for word pair comparison in D2 statistics, though it can readily be generalised. Two given sequences with identical lengths are encoded to Huffman binary codes by which we are able to calculate Hamming Distance using binary operations efficiently. This method is applied on D2 statistics to compare k-tuples faster than its original version. The evaluation on emprical sequences showed that the method is faster than original D2; especially, when re-using the encoded sequences which resulted in better performance.

show abstract

RL-huffman encoding for test compression and power reduction in scan applications

Cited by 116 publications

References 27 publications

Efficient test compression technique based on block merging

Efficient test compression technique based on block merging

A Multi-agent System for Image Compression

Efficient Sequence Comparison Using Binary Codes

Contact Info

Product

Resources

About