Interconnection optimization in data path allocation using minimal cost maximal flow algorithm-Reference-Cited by-同舟云学术

Interconnection optimization in data path allocation using minimal cost maximal flow algorithm

Published:2002-09 Issue:9 Volume:33 Page:749-759
ISSN:0026-2692
Container-title:Microelectronics Journal
language:en
Short-container-title:Microelectronics Journal

Author:

Zhu H.W.,Jong C.C.

Publisher

Elsevier BV

Subject

General Engineering

Reference33 articles.

1. High-Level Synthesis: Introduction to Chip and System Design;Gajski,1992

2. Synthesis and Optimization of Digital Systems;De Micheli,1994

3. An evolutionary approach for data path synthesis;Harmanani;Proceedings of the 2000 IEEE Canadian Conference on Electrical and Computer Engineering,2000

4. Solving large scale assignment problems in high-level synthesis by approximative quadratic programming;Balasa;Proceedings of the IEEE 11th Great Lakes Symposium on VLSI,2001

5. Method for data path synthesis using neural networks;Harmanani;Proceedings of the 1999 IEEE Canadian Conference on Electrical and Computer Engineering,1999

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Adoption of Appropriate Construction Technology for Western Rural Areas Based on Cost Compensation Method;Advanced Materials Research;2011-05

2. On the complexity of the Port Assignment Problem for Binary Commutative Operators in high-level synthesis;2009 International Symposium on VLSI Design, Automation and Test;2009-04

3. Binding Refinement for Multiplexer Reduction;IPSJ Transactions on System LSI Design Methodology;2009

4. Register binding and port assignment for multiplexer optimization;ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)