Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지

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

개선된 자동정리증명 기법에 기초한 유한체상의 디지털논리시스템 구성

  • 박춘명 (충주대학교 전기.전자 및 정보공학부 컴퓨터공학)
  • Published : 2006.10.31
Download PDF
⟨ Previous Next ⟩

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.

본 논문에서는 개선된 자동정리증명 기법에 기초하여 유한체상의 디지털논리 시스템을 구성하는 방법을 제안하였다. 제안한 방법은 먼저 유한체상의 중요한 학적 성질을 논의하였고 자동정리증명기법의 개념과 기본 성질을 서술하였다. 그리고 개선된 자동정리증명기법을 적용하기 위해 몇 가지 정의를 하였으며 이를 근간으로 디지털논리 시스템의 Building Block을 제안하였다. 또한, 디지털논리 시스템을 구성하기 위한 중요한 관계를 정의하였으며 최종 유한체상의 디지털논리시스템을 개선된 자동정리 증명 기법에 의해 구성하였다.

Keywords

References

  1. 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
  2. W.C.Kabat, 'Automated Design of Combinational Networks under Specific Constraints: A Theorem Proving Approach,' IEEE Proc. 13th ISMVL, pp.366-396, May. 1983
  3. 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 https://doi.org/10.1109/TC.1985.1676600
  4. V.J.Sanchez and W.C.Kabat, 'Automated Synthesis of Algorithmic State machines,' IEEE Proc. 16th ISMVL, pp.265-272, May. 1986
  5. 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 https://doi.org/10.1109/TC.1986.1676676
  6. V.S.Stokkermans, 'Representation Theorems and Theorem Proving in Non-Classical Logics,' IEEE Proc. 29th ISMVL, pp.242-247, May 1999
  7. V.S.Stokkermans, 'Representation Theorems and the Semantics of (Semi)Lattics-based Logics,' IEEE Proc. 31 th ISMVL, pp.125-135, May 2001
  8. 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