Browse > Article

Construction of the Digital Logic Systems based on the Improved Automatic Theorem Proving Techniques over Finite Fields  

Park, Chun-Myoung (충주대학교 전기.전자 및 정보공학부 컴퓨터공학)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.10, no.10, 2006 , pp. 1773-1778 More about this Journal
Abstract
This paper propose the method of constructing the Digital Logic Systems based on the Improved Automatic Theorem Proving Techniques(IATP) over Finite Fields. The proposed method is as following. First, we discuss the background and the important mathematical properties for Finite Fields. Also, we discuss the concepts of the Automatic Theorem Proving Techniques(ATP) including the syntactic method and semantic method, and discuss the basic properties for the Alf. In this step, we define several definitions of the IAIP, Table Pseudo Function Tab and Equal. Next, we propose the T-gate as Building Block(BB) and describe the mathematical representation for the notation of T-gate. Then we discuss the important properties for the T-gate. Also, we propose the several relationships that are Identity relationship, Constant relationship, Tautology relationship and Mod R cyclic relationship. Then we propose Mod R negation gate and the manipulation of the don't care conditions. Finally, we propose the algorithm for the constructing the method of the digital logic systems over finite fields. The proposed method is more efficiency and regularity than my other earlier methods. Thet we prospect the future research and prospects.
Keywords
Finite Fields; Automatic Theorem Proving Techniques; Digital Logic Systems; Building Block etc.;
Citations & Related Records
연도 인용수 순위
  • Reference
1 W.C.Kabat and A.S.Wojcik, 'Automated Synthesis of Combinational Logic using Theorem-Proving Techniques,' IEEE Trans. Comput., voI.C-34, no.7, pp.610-632, Jul. 1985   DOI   ScienceOn
2 V.J.Sanchez and W.C.Kabat, 'Automated Synthesis of Algorithmic State machines,' IEEE Proc. 16th ISMVL, pp.265-272, May. 1986
3 V.S.Stokkermans, 'Representation Theorems and Theorem Proving in Non-Classical Logics,' IEEE Proc. 29th ISMVL, pp.242-247, May 1999
4 V.S.Stokkermans, 'Representation Theorems and the Semantics of (Semi)Lattics-based Logics,' IEEE Proc. 31 th ISMVL, pp.125-135, May 2001
5 W.C.Kabat and A.S.Wojcik, 'Automated Synthesis of Combinational Logic using Theorem Proving Techniques,' IEEE Proc. 12th ISMVL, pp.178-199, May. 1982
6 H.Ganzinger and V.S.-Stokkermans, 'Chaining Techniques for Automated Theorem Proving in Many-Valued Logic,' IEEE Proc. 30th ISMVL, pp.337-344, May 2000
7 D.Snyers and A.Thayse, 'Algorithmic State Machines Design and Automatic Theorem Proving: Two Dual Approach to the Same Activity,' IEEE Trans. Comput., voI.C-35, no.10, pp. 853-861, Oct. 1986   DOI   ScienceOn
8 W.C.Kabat, 'Automated Design of Combinational Networks under Specific Constraints: A Theorem Proving Approach,' IEEE Proc. 13th ISMVL, pp.366-396, May. 1983