The problem of two-block disjoint decomposition of completely specified Boolean functions is considered. Recently a good method in functional decomposition category was proposed. This method is based on using the ternary matrix cover approach. Due to investigation and analysis of this method and to search for an appropriate partition, a computer program was developed. After running the program on thousands of systems of Boolean functions, experimental results show that more than 95% of the inspected systems are decomposable. To obtain a solution of the task in decomposable systems, an efficient technique is also proposed. Using this technique, investigation of one partition was enough to determine decomposability of the inspected systems.
목차
Abstract 1. Introduction 2. Main Definitions and Setting the Problem 3. Introducing Cover Map and Compact Table 4. Search for an Appropriate Partition 5. Implementation and Results 6. Conclusion and Future Works Acknowledgements References
보안공학연구지원센터(IJAST) [Science & Engineering Research Support Center, Republic of Korea(IJAST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Advanced Science and Technology
간기
월간
pISSN
2005-4238
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Advanced Science and Technology Vol.55