The design of fast totally self-checking Berger code checkers based on Berger code partitioning

The authors develop several key theorems on Berger code partitioning on which a novel totally self-checking Berger code checker design is based. This design can handle any information length. It is shown that the design exhibits a tradeoff between the number of gates and the number of gate levels. In particular, the minimum-cost realization of the design achieves a speed improvement of approximately 50%, while the increase in the number of gates is less than 30% for information length or=15 while achieving almost the same speed improvement. >