Abstract :
This correspondence gives a method which generates prime implicants in a simple one-pass procedure. Starting from the lowest (or highest) points in the function lattice, it generates successive subcubes in a unique sequence. Each subcube is formed only once.
Keywords :
i-cube, logic minimization, prime implicant, prime implicant generation, Quine-McCluskey algorithm.; Computer science; Iterative algorithms; Lattices; Logic; Minimization methods; i-cube, logic minimization, prime implicant, prime implicant generation, Quine-McCluskey algorithm.;
