By Topic

A fast algorithm for optimum syndrome space compression

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tung, C.-H. ; Dept. of Electr. & Comput. Eng., Iowa Univ., Iowa City, IA, USA ; Robinson, J.P.

A procedure for multiple-output combinational circuits is presented that yields the optimum space compressor while using counting for time compression. The procedure is intended for the built-in selftest environment where output response data compression is appropriate. Optimum is defined as the minimum number of error patterns missed by the combination of space and time compression. The procedure uses the fast Walsh transform to determine the number of errors missed by each linear combination for all possible space-compression combinations. A illustrative example is included to show the effectiveness of the algorithm. A comparison between cases with and without space compression is included

Published in:

Computers, IEEE Transactions on  (Volume:37 ,  Issue: 2 )