Design of High-Speed Checkers for Berger Codes

Methods are proposed for the construction of high-speed self-checking k-out-of-n checkers, designed as check circuits that decide the membership of a binary vector in a Berger code. It is shown that maximum-speed $k$-out-of-$n$ checkers have circuits with four levels of elements. The methods are adapted for application of programmable logic arrays. The minimum number of arrays that can be used to implement $k$-out-of-$n$ checkers is 2.