Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Cover

    Uploaded by

    R Wan
    This code iterates through each product term in a sum of products expression, finds the index of the prime implicant covered by that term, marks that index and the term itself as "kept" if the prime implicant is covered uniquely by that term, and if any prime implicants remain uncovered, it marks the entire array as kept.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Cover

    Uploaded by

    R Wan
    6 views1 page
    This code iterates through each product term in a sum of products expression, finds the index of the prime implicant covered by that term, marks that index and the term itself as "kept" if the prime implicant is covered uniquely by that term, and if any prime implicants remain uncovered, it marks the entire array as kept.

    Original Description:

    Original Title

    cover.txt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This code iterates through each product term in a sum of products expression, finds the index of the prime implicant covered by that term, marks that index and the term itself as "kept" if the prime implicant is covered uniquely by that term, and if any prime implicants remain uncovered, it marks the entire array as kept.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    6 views1 page

    Cover

    Uploaded by

    R Wan
    This code iterates through each product term in a sum of products expression, finds the index of the prime implicant covered by that term, marks that index and the term itself as "kept" if the prime implicant is covered uniquely by that term, and if any prime implicants remain uncovered, it marks the entire array as kept.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    for qq=1:numPI

    cover = find(EPI(:,qq));
    if length(cover) == 1
    keepidx(cover) = logical(1);
    mintermidx(find(EPI(cover,:))) = logical(1);
    end
    end

    if any(~mintermidx)
    keepidx(:) = logical(1);
    end

    You might also like