首页> 外文期刊>IEEE Transactions on Aerospace and Electronic Systems >Data path synthesis in digital electronics. II. Bus synthesis
【24h】

Data path synthesis in digital electronics. II. Bus synthesis

机译:数字电子学中的数据路径综合。二。总线综合

获取原文
获取原文并翻译 | 示例
           

摘要

For pt. I see ibid., vol. 32, no. 1, p. 1-15 (1996). Common buses are an extremely efficient structure for achieving area minimization so that the bus-oriented interconnection of registers and data operators plays an important role in data path synthesis. The overriding design goal is efficiently allocating the minimum number of buses and gating elements (i.e. multiplexers) for achieving communication between the data path elements. New efficient algorithms for the automated allocation of buses in data paths have been developed. The entire allocation process can be formulated as a graph partitioning problem. This formulation readily lends itself to the use of a varieties of heuristics for solving the allocation problem We present efficient algorithms which provide excellent solutions to this formulation of the allocation problem The operation of the algorithms is clearly demonstrated using detailed examples.
机译:对于pt。我看同上。 32号1页1-15(1996)。公用总线是实现面积最小化的极其有效的结构,因此寄存器和数据运算符的面向总线的互连在数据路径合成中起着重要作用。首要的设计目标是有效分配最少数量的总线和选通元件(即多路复用器),以实现数据路径元件之间的通信。已经开发了用于在数据路径中自动分配总线的新的有效算法。整个分配过程可以表述为图分区问题。这种表述易于使用各种启发式方法来解决分配问题。我们提出了有效的算法,为分配表述的这种表述提供了极好的解决方案。使用详细的示例清楚地演示了算法的操作。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号