Improved heuristics for finite word-length polynomial datapath optimization

Conventional high-level synthesis techniques are not able to manipulate polynomial expressions efficiently due to the lack of suitable optimization techniques for redundancy elimination over Z 2 n . This paper, in comparison with, presents 1) an improved partitioning heuristic based on single-variab...

Celý popis

Podrobná bibliografia

Vydané v:	2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers s. 739 - 744
Hlavní autori:	Alizadeh, B., Fujita, M.
Médium:	Konferenčný príspevok..
Jazyk:	English Japanese
Vydavateľské údaje:	IEEE 02.11.2009
Predmet:	Algebra Application software Arithmetic Delay Design optimization High level synthesis Modular Optimization Multi-output Polynomial Datapath Optimization Permission Polynomials Signal design Very large scale integration
ISSN:	1092-3152
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!