Modular implementation of efficient self-checking checkers for the Berger code |
| |
Authors: | D A Pierce Jr P K Lala |
| |
Institution: | (1) Department of Electrical Engineering, North Carolina A&T State University, 27411 Greensboro, NC, USA |
| |
Abstract: | A technique for designing efficient checkers for conventional Berger code is proposed in this paper. The check bits are derived by partitioning the information bits into two blocks, and then using an addition array to sum the number of 1's in each block. The check bit generator circuit uses a specially designed 4-input 1's counter. Two other types of 1's counters having 2 and 3 inputs are also used to realize checkers for variable length information bits. Several variations of 2-bit adder circuits are used to add the number of 1's. The check bit generator circuit uses gates with fan-in of less than or equal to 4 to simplify implementation in CMOS. The technique achieves significant improvement in gate count as well as speed over existing approaches. |
| |
Keywords: | totally self-checking checkers CMOS technology conventional Berger code Berger code partitioning 1's counters fully-testable circuits |
本文献已被 SpringerLink 等数据库收录! |