Bounding error masking in linear output space compression schemes

Based on the principle of linear output space compression we present a design method for concurrent checkers such that the masking probability of errors caused by faults of a given set of circuit faults is below a given bound, while keeping the space compression ratio, defined as the ratio of the number of circuit outputs to the number of outputs of the space compressor, as high as possible. Experiments performed on the ISCAS-85 benchmark circuits show that the compression ratios achieved with compression functions computed with this method can be very high, even for very low bounds for the error masking probability and large fault sets