A Parallel Processing Model for Selecting Prime Implicants of a Logic Function for a Near Minimal Sum of Products Form

논리 함수를 최소의 Sum of Products와 가까운 형태로 나타내기 위한 프라임 임프리컨트 선택 별렬 처리 모델

In this paper, we propose a parallel processing model for the efficient selection of Prime Implicants of Logic Functions. This model consists of simple parallel processing nodes, connections between them, Max Net (a part of Hamming Net) and quasi essential Prime Implicant selection standard in simplified cost form. Through these, this model selects essential Prime Implicants in a certain period of time regardless of the number of given Prime Implicants and minterms and also selects quasi essential Prime Implicants in short time.