A simple and efficient algorithm for locating multiple faults in parity check circuits is presented. It is based on a new concept called "Minority Bit"
and the fault location test set so obtained is optimal.The length of the test sequence is equal to the number of primary inputs plus one. The implementation of automatic generating the optimal test set and fast locating all the faults is also discussed.