Optimisation of Fixed Polarity Canonical Or-Coincidence Expansions

نویسندگان

  • Meng Yang
  • Jiarong Tong
  • Jinmei Lai
چکیده

An efficient minimisation method is presented to find the best polarity of fixed polarity canonical orcoincidence (COC) expansions. The method derives one COC fixed polarity expansion from another adjacent polarity expansion. To reduce CPU time, it utilises bitwise operation and Gray code. Furthermore, it counts the number of “0”s in the polarity matrix rather than polarity matrix multiplication. As a result, it makes minimisation for large functions within reasonable time practical. The space complexity of the proposed algorithm is O(M) and time complexity is O(2(MlogM+M)) (n and M are the number of input variables and the number of on-set COC maxterms).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of Fixed-polarity Reed-muller Circuits Using Dual-polarity Property*

In the optimization of canonical Reed-Muller (RM) circuits, RM polynomials with different polarities are usually derived directly from Boolean expressions. Time efficiency is thus not fully achieved because the information in finding RM expansion of one polarity is not utilized by others. We show in this paper that two fixed-polarity RM expansions that have the same number of variables and whos...

متن کامل

On the Calculation of Generalized Reed-muller Canonical Expansions from Disjoint Cube Representation of Boolean Functions

A new algorithm is shown that converts disjoint cube representation of Boolean functions into fixed-polarity Generalized Reed-Muller Expansions (GRME). Since the known fast algorithm Ihal generates the GRME based on the factorization or thc Reed-Muller transform matrix always starts from the truth table (minterms) of Boolean function, then the described method has the advantages due to smaller ...

متن کامل

A New Exact Algorithm for Highly Testable Generalized Partially Mixed Polarity Reed Muller Forms

Generalized Partially Mixed Polarity Reed Muller GPMPRM expansions are a canonical sub family of Generalized Reed Muller GRM expansions and super family of Fixed Polarity Reed Muller FPRM expansions The main motivation to study GPM PRM forms is their very high testability similar to FPRM forms and better than GRMs which are also highly testable Since GPMPRM sub family of ESOP is much larger tha...

متن کامل

Algorithms in computer-aided design of VLSI circuits

With the increased complexity of Very Large Scale Integrated (VLSI) circuits, Computer Aided Design (CAD) plays an even more important role. Top-down design methodology and layout of VLSI are reviewed. Moreover, previously published algorithms in CAD of VLSI design are outlined. In certain applications, Reed-Muller (RM) forms when implemented with AND/XOR or OR/XNOR logic have shown some attrac...

متن کامل

Coincidence point and common fixed point results via scalarization function

The main purpose of this paper is to obtain sufficient conditions for existence of points of coincidence and common fixed points for three self mappings in $b$-metric spaces. Next, we obtain cone $b$-metric version of these results by using a scalarization function. Our results extend and generalize several well known comparable results in the existing literature.

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCP

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2013