Fault detection in bitonic sorting networks

A new fault detection algorithm for bitonic sorting networks is proposed. A single fault on the comparison elements or links can be detected and diagnosed by inserting O(log/sub 2/N) sets of testing vectors. The basic testing vectors consist basically of subsets and combinations of ascending (0,1,2,3,) and descending (...,3,2,1,0, i.e., reverse) identify vectors.