Asynchronous sum‐of‐products logic minimization and orthogonalization

Abstract

We propose a method of the asynchronous sum-of-products (SOP) logic simplification that comprises of minimization and orthogonalization. The method is based on a transformation of the conventional single-rail SOP synchronous logic into the dual-rail asynchronous one operating under so-called modified weak constraints. We formulate and prove the product terms constraint that ensures a correct logic behavior. We have processed the MCNC benchmarks and generated the asynchronous SOP logic. The complexity of the logic obtained is compared with the state-of-the-art representation. Using our approach, we achieve a significant improvement.