Exclusive or Reduction Algorithm
Original Publication Date: 1986-Jun-01
Included in the Prior Art Database: 2005-Mar-09
This algorithm determines a reduced implementation of a multiple-input multiple-output exclusive-OR network when limited by technology to a two-input exclusive-OR gate. The steps involved in each iteration of the exclusive-OR reduction algorithm are outlined below. What follows is a detailed description of each step preceded by definitions of terms and variables used in the description. STEPS 1. Create the output matrix. 2. Determine the most frequently occurring combinations. 3. Determine the disjoint combinations. 4. Replace the disjoint combinations with pseudo-inputs. 5. Save the pseudo-input information in the save matrix 6. Check if each output is a function of only one input yes no solution DEFINITION OF TERMS Exclusive-OR - Logical function described by modulo-two addition and denoted by O.