전자공학회논문지 (Journal of the Institute of Electronics and Information Engineers)

대한전자공학회 (The Institute of Electronics and Information Engineers)
권호 표지
DOI QR코드

DOI QR Code

고효율 스위칭회로

Construction of Highly Performance Switching Circuit

  • 박춘명 (한국교통대학교 컴퓨터공학과)
  • Park, Chun-Myoung (Department of Computer Engineering, Korea National University of Transportation)
  • 투고 : 2016.08.30
  • 심사 : 2016.11.18
  • 발행 : 2016.12.25
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 유한체의 수학적 성질과 그래프이론을 바탕으로 GF(P)상의 선형디지털스위칭함수구성을 효과적으로 구성하는 한가지 방법을 제안하였다. 제안한 방법은 주어진 임의의 디지털스위칭함수의 입출력 사이의 연관관계특성으로 부터 DCG를 도출한 후에 노드의 개수를 인수분해한다. 이때 행렬방정식을 해당 차수보다 낮은 기약다항식으로 인수분해하여 그 결과를 부분회로실현한 다음 선형결합함으로써 최종 선형디지털스위칭함수를 구성하였다. 그 결과 기존의 방법에 비해 선형디지털스위칭함수구성을 상당히 간단화 할 수 있었으며 회로구성은 유한체 GF(P)내에서 정의된 가산기와 계수곱셈기를 사용하여 용이하게 실현 할 수 있다.

This paper presents a method of constructing the highly performance switching circuit(HPSC) over finite fields. The proposed method is as following. First of all, we extract the input/output relationship of linear characteristics for the given digital switching functions, Next, we convert the input/output relationship to Directed Cyclic Graph using basic gates adder and coefficient multiplier that are defined by mathematical properties in finite fields. Also, we propose the new factorization method for matrix characteristics equation that represent the relationship of the input/output characteristics. The proposed method have properties of generalization and regularity. Also, the proposed method is possible to any prime number multiplication expression.

키워드

참고문헌

  1. S. J. P, A. Rajeswaran, N. P Bhatt, R. Pasumarthy etl., 'A novel approach for phase identification in smart grids using Graph Theory and Principal Component Analysis, ' 2016 American Control Conference (ACC), pp.5026-5031, 2016.
  2. S. Yang, D. Chen, X. Han and Y. Chen, 'A novel and fast connected component count algorithm based on graph theory, ' 2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD), pp. 643-647, 2016.
  3. R. E. Bryant, "Graph-Based Algorithms for Boolean Function manipulations," IEEE Trans. Comput., vol.C-35, no.8, pp.677-691, Aug. 1986. https://doi.org/10.1109/TC.1986.1676819
  4. D. B. West, Introduction to Graph Theory, Prentice-hall, 1996.
  5. M. A. Thornton, 'Simulation and Implication Using a Transfer Function Model for Switching Logic, ' IEEE Transactions on Computers, pp.3580-3590, vol.64, No.12, Dec. 2015. https://doi.org/10.1109/TC.2015.2401034
  6. A. Bernasconi, V. Ciriani, G. Trucco, and Ti. Villa, 'Using Flexibility in P-Circuits by Boolean Relations, ' IEEE Transactions on Computers, pp. 3605-3618, vol.64, No.12, Dec. 2015. https://doi.org/10.1109/TC.2015.2409849
  7. P. Li, D. J. Lilja, W. Qian, M. D. Riedel, and K. Bazargan, 'Logical Computation on Stochastic Bit Streams with Linear Finite-State Machines, ' IEEE Transactions on Computers, pp. 1474-1486, vol.63, No. 6, June 2014. https://doi.org/10.1109/TC.2012.231
  8. S. Gilliland, P. Govindan and J. Saniie, 'Architecture of the reconfigurable ultrasonic system-on-chip hardware platform, ' IET Circuits, Devices & Systems, pp. 301-308, Vol. 10, No. 4, 2016. https://doi.org/10.1049/iet-cds.2015.0146
  9. D. Green, Modern Logic Design, Addison-Wesley Publishing Company, 2008.
  10. R. J. McEliece, Finite Fields for Computer Science and Engineers, Kluer Academic Publishers, 2007.