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

Abstract

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=32, compared to the design given by M.A. Marouf and A.D. Friedman (1978). The minimum-cost realization uses 30% to 40% fewer gates than the cost-effective realization of the S.J. Piestrak's design (1987) for information length I>or=15 while achieving almost the same speed improvement.<<ETX>>