找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Logic Synthesis and Optimization; Tsutomu Sasao Book 1993 Springer Science+Business Media New York 1993 CAD.FPGA.FPGA design.Field Program

[复制链接]
楼主: Racket
发表于 2025-3-26 22:06:45 | 显示全部楼层
发表于 2025-3-27 02:27:42 | 显示全部楼层
发表于 2025-3-27 08:02:40 | 显示全部楼层
发表于 2025-3-27 09:28:57 | 显示全部楼层
发表于 2025-3-27 17:27:36 | 显示全部楼层
And-Exor Expressions and their Optimization,eed-Muller expressions, Kronecker expressions, pseudo Reed-Muller expressions, pseudo Kronecker expressions, generalized Reed-Muller expressions and exclusive-or sum-of-products expressions (ESOPs). Relations between these classes are shown. The number of products to realize several classes of funct
发表于 2025-3-27 21:05:16 | 显示全部楼层
A New Technology Mapping Method Based on Concurrent Factorization and Mapping,hree steps: factorization, cell selection and estimation of constraints. By taking the close relationship of these three steps into account, this method can accommodate detailed constraints because the information in the technology library is accessed during the mapping as well as during the factori
发表于 2025-3-28 01:32:16 | 显示全部楼层
Gate Sizing for Cell-Based Designs,ch to the gate sizing problem in cell-based logic designs. Our algorithm picks from the cell library one out of several functionally-identical cells for every gate of a combinational Boolean logic circuit so that the circuit delay meets a user-specified constraint while the total gate size is minimi
发表于 2025-3-28 06:09:01 | 显示全部楼层
Delay Models and Exact Timing Analysis,ay model there is a natural time quantum such that on each integer-multiple bounded interval of the quantum every signal is a constant. Algorithms for exact delay computation for both floating mode and transition mode delay are given. An implementation for the floating mode model yields practical results on large benchmark circuits.
发表于 2025-3-28 07:27:05 | 显示全部楼层
And-Exor Expressions and their Optimization,ng ternary decision diagrams (TDDs). The conventional method requires memory of O(3.) to simplify an n-variable expression, and is only practical for functions of up to n = 14 variables. The method presented here uses TDDs, and can optimize considerably larger problems. Experimental results for up to n = 39 variables are shown.
发表于 2025-3-28 11:52:51 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 11:21
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表