Optimal Common Sub-Expression Elimination Algorithm of Multiple Constant Multiplications With a Logic Depth Constraint

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences - Japan
doi 10.1093/ietfec/e91-a.12.3568
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Related search

Global Optimization of Common Subexpressions for Multiplierless Synthesis of Multiple Constant Multiplications

2008English

Efficient Substitution of Multiple Constant Multiplications by Shifts and Additions Using Iterative Pairwise Matching

1994English

A New Algorithm for Optimal Constraint Satisfaction and Its Implications

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Depth-Optimal Low-Complexity Distributed Wireless Multicast Algorithm

Computer Journal
Computer Science
2011English

Optimal Testing of Multiple Hypotheses With Common Effect Direction

SSRN Electronic Journal
2008English

Multiple-Constraint Synthesis of Rotationally Symmetric Sparse Circular Arrays Using a Hybrid Algorithm

Progress In Electromagnetics Research M
OpticalElectronicCondensed Matter PhysicsMagnetic Materials
2019English

Optimal Fixed-Time Orbital Transfer With a Radial Constraint

English

On Termination of Constraint Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

On Some Optimal Stopping Problems With Constraint

SIAM Journal on Control and Optimization
ControlApplied MathematicsOptimization
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy