In this paper, we design a new class of self-testing checkers, self-te
sting nonincreasing order checkers, for the first time. The self-testi
ng nonincreasing order checker is a critical component to design concu
rrent checking VLSI sorters because it is capable of checking whether
an arbitrary long sequence of numbers has been sorted, as well as test
ing itself during normal system operation.