• Journal of the Korean Institute of Telematics and Electronics
• /
• v.4 no.4
• /
• pp.19-21
• /
• 1967

A technique is illustrated for the selection of basis rows from a cyclic prime implicant table. This technique is more systematic and effective than a trial and process, and the results of this technique agree well with the ones solved by Gimpel's Luccio's reduction technique.

• 전기의세계
• /
• v.28 no.12
• /
• pp.33-40
• /
• 1979

This mininzation of the multi-output switching function becomes a difficult task when the input varibles and the number of functions increase. This paper describes the optimal selection of prime inplicats for the multi-output switching function by using the Inter-section Table. This procedure is applicable to both manual and computhe programmed realization without complesith. The algorithm is implemented by a computer program in the standard FORTRAN iv language.

• 전기의세계
• /
• v.28 no.6
• /
• pp.61-77
• /
• 1979

This paper is concerned with minimization process of the binary logic function. This paper describes an algorithm called the SIMPLE TABLE METHOD that well suited to minimization a switching function of any number of variables. For the Simple Table construction, a theorem based upon the numerical properties of the logic function is derived from the relationships governing minterms of the given function. Finally the minimal sum of products can be obtained in terms of the Direct Method or the Indirect Method from the table and table characteristics derived from the Simple Table. The properties and table characteristics used in this paper are described. All the minterms of a switching function are manipulated only by decimal numbers, not binary numbers. Some examples are used as a vehicle to guide the readers who are familiar with the Karnaugh map and Quine-McCluskey tabular method to this New method. These examples not only treat how to handle Don't Care miterms but also show the multiple output functions.

• 전기의세계
• /
• v.30 no.2
• /
• pp.101-111
• /
• 1981

This paper describes two methods which generate all the prime implicants (PI's) quickly by using the directions of adjacency tavle (DA-table) that gives the knowledge of adjacency relations among the given minterms. One is a graphical method that enables us to generate PI's by hand, the other is a checking method that determines the existance of PI's quickly when it is programmed on a digital computer. And a fast minimization algorithm will be shown in this paper that can be implemented with reduced computational effort by selecting essential prime implicants (EPI's) first of all and using the concept of the integration of the PI identification and selection procedure. The procedure, proposed in this paper, has all the advantage of Karnaugh mapping, so the procedure is simple and easy.

• Proceedings of the KIEE Conference
• /
• 1979.08a
• /
• pp.26-28
• /
• 1979

The optimal selection of Prime Implications for the multi-output switching function is difficult task, as the input variables increase. This paper is concerned with the technique for the minimization of the multi-output switching function using the intersection table. This procedure is applicable to both manual and computer-programmed realization without complexity.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.5 no.4
• /
• pp.1-8
• /
• 1968

A TANT network is a three-level network composed solely of NAND gates having only true(i.e. uncomplemented) inputs. The paper presents a technique for finding for any given Boolean function a least-cost TANT network. The first step of the technique is to determine essential prime implicants(EPI) by Quine-McCluskey procedure or other methods and generate prime implicants(PI) hving the same head as any one of EPI by consensus operation. The second step is to select common factors among the usable tail factors. The selcetion phase is analogous to the use of C-C table. The last step is to minimize inputs by deleting the redundant PI. the technique permits hand solution of typical five-and six-variable problems.

• Korean Journal of Oriental Medicine
• /
• v.14 no.3
• /
• pp.11-22
• /
• 2008

The prime minister(樞密相公) Choi jongjun writes"Eouichwaryobang(御醫撮要方)"A.D. 1226 that is a Goryeo Period (A.D.$918{\sim}1392$). But today that has vanished, now. Inspite of the important worth of that book in Korea Traditional Medicine, there is no study about writer. So I research all the historical source about him. And I confront a historical source with the era for making a chronological table of Choi jongjun. I beliebe this survey make a great contribution towards the historical research of KTM. Now to conclude, In A.D. 1226, Choi Jongjun was Jung chuwonbusa(中樞院副使) or Chumseowonsa(簽書院事).

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.4 no.3
• /
• pp.2-8
• /
• 1967

A method is illustrated for minimizing the number of internal states in incompletely specified sequential networks. The starting point for minimizing technique in this paper is the set of maximal compatibility classes which covers the original flow table and the minimal covering can be obtained directly by employing three rules. The reduction techniques for prime implicant table or covering and closure table are not employed in this paper. Although the minimizing technique is applied to some specific problems, it is believed that the concepts are general in nature and can be applied to any type of incompletely specified flow tables.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.1
• /
• pp.5-14
• /
• 2014

Searchable encryption systems provide search on encrypted data while preserving the privacy of the data and the search keywords used in queries. Recently, interest on data outsourcing has increased due to proliferation of cloud computing services. Many researches are on going to minimize the trust put on external servers and searchable encryption is one of them. However, most of previous searchable encryption schemes provide only a single keyword boolean search. Although, there have been proposals to provide conjunctive keyword search, most of these works use a fixed field which limit their application. In this paper, we propose a field-free conjunctive keyword searchable encryption that also provides rank information of search results. Our system uses prime tables and greatest common divisor operation, making our system very efficient. Moreover, our system is practical and can be implemented very easily since it does not require sophisticated cryptographic module.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.95-102
• /
• 2015

This paper proposes a simple algorithm for circuit minimization. There are currently two effective heuristics for circuit minimization, namely manual Karnaugh maps and computable Quine-McCluskey algorithm. The latter, however, has a major defect: the runtime and memory required grow $3^n/n$ times for every increase in the number of variables n. The proposed algorithm, however, extracts the prime implicants (PI) that cover minterms of a given Boolean function by deriving an implicants table based on frequency. From a set of the extracted prime implicants, the algorithm then eliminates redundant PIs again based on frequency. The proposed algorithm is therefore capable of minimizing circuits polynomial time when faced with an increase in n. When applied to various 3-variable and 4-variable cases, it has proved to swiftly and accurately obtain the optimal solutions.