首页 | 本学科首页   官方微博 | 高级检索  
     


Asynchronous sum‐of‐products logic minimization and orthogonalization
Authors:Igor Lemberski  Petr Fišer  Ruslan Suleimanov
Affiliation:1. Baltic International Academy, Riga, Latvia;2. Faculty of Information Technology, Czech Technical University in Prague, Prague, Czech Republic
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. Copyright © 2012 John Wiley & Sons, Ltd.
Keywords:logic synthesis  asynchronous logic  sum‐of‐   products logic  minimization
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号