Low multiplicative complexity logic minimisation over the basis (AND, XOR, NOT)

J. J. Tay, M. L. Dennis Wong, C. Zhang, I. Hijazin

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Logic minimisation over the basis (AND, XOR, NOT) has received much attention in recent years. Heuristic logic minimisation methods based on the notion of multiplicative complexity c (f) have reported impressive results for well-explored applications such as cryptographic S-Boxes. However, the heuristic involves randomised selections in part of its algorithm. Studying the heuristic from a consistency perspective is carried out here. Enhancements to improve different aspects of the algorithm are proposed. The benefits of the proposed enhancements are demonstrated through experimental results in comparison with the original algorithm.

Original languageEnglish
Pages (from-to)1438-1440
Number of pages3
JournalElectronics Letters
Volume52
Issue number17
Early online date26 Jul 2016
DOIs
Publication statusPublished - 18 Aug 2016

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this