Heuristic datapath allocation for multiple wordlength systems

@inproceedings{Constantinides2001HeuristicDA,
  title={Heuristic datapath allocation for multiple wordlength systems},
  author={George A. Constantinides and Peter Y. K. Cheung and Wayne Luk},
  booktitle={DATE},
  year={2001}
}
This paper introduces a heuristic to solve the combined scheduling, resource binding, and wordlength selection problem for multiple wordlength systems. The algorithm involves an iterative refinement of operator wordlength information, leading to a scheduled and bound data-flow graph. Scheduling is performed with incomplete wordlength information during the intermediate stages of this refinement process. Results show significant area savings over known alternative approaches. 
Highly Cited
This paper has 54 citations. REVIEW CITATIONS
34 Citations
3 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

54 Citations

051015'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Synthesis and Optimization of Digital Circuits

  • G. DeMicheli
  • McGraw-Hill, New York
  • 1994
Highly Influential
4 Excerpts

Word-length optimization for highlevel synthesis of digital signal processing systems

  • K. Kum, W. Sung
  • Proc. IEEE International Workshop on Signal…
  • 1998
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…