We present a low-cost (hardware-efficient) and fast totally self-checking (TSC) checker for m-out-of-n code, where m ≥ 3, 2m + 1 ≤ n ≤ 4m. The checker is composed of four special adders which sum the 1s in the primary inputs added by appropriate constants, two ripple carry adders which sum the outputs of the biased-adders, and a k-variable two-rail code checker tree which compares the outputs of the two ripple carry adders, where k = [log 2 (n - m) + 1]. All the modules are composed of 2-input gates and inverters. Compared with previous nonmodular methods, our TSC checker has a lower hardware and time complexity: Our method reduces the hardware complexity and circuit delay of the checker from O(n 2) to O(n) and from O(n) to O(log 2 n), respectively. Compared with recent modular methods, our TSC checker has about the same hardware and time complexity, but is applicable to a much broader range of n. In summary, our method is superior to existing methods for the considered range of n. In addition, our TSC checker can easily be tested (the test set size of our TSC checker is relatively small) and implemented in VLSI for its modular structure.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics