Recursive Algorithm for More-Than-One-On Checker
Original Publication Date: 1987-Nov-01
Included in the Prior Art Database: 2005-Feb-02
A tester or decoder generates a MTOO (more-than-one-on) checker of N signals by recursively applying the function to subsets of K signals. Specifically, for each three (K=3) signals, two functions are generated: MTOO (corresponds to a carry of a full adder), and OOMO (one-or-more-on, which corresponds to an OR of the three inputs). The OOMO signals are treated as single signals to be further combined three at a time. All the MTOO signals are ORed to comprise the MTOO final signal. Other values of K can be used recursively for improved efficiency (fewer components and/or fewer levels of gating). For example, the multiple selection circuit described in the IBMTechnical Disclosure Bulletin 17, 2432 (January 1975), generates a MTOO of 8 (=K) signals (ignoring the "no selection signal").