Timing-Constrained Area Minimization Algorithm for Parallel Prefix Adders.
Taeko MatsunagaYusuke MatsunagaPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2007)
Keyphrases
- parallel implementation
- learning algorithm
- cost function
- detection algorithm
- np hard
- dynamic programming
- k means
- significant improvement
- linear programming
- matching algorithm
- worst case
- computational cost
- preprocessing
- experimental evaluation
- computational complexity
- neural network
- particle swarm optimization
- image processing algorithms
- optimal solution
- bit parallel
- parallel version
- similarity measure
- improved algorithm
- times faster
- objective function
- tree structure
- image restoration
- segmentation algorithm
- theoretical analysis
- expectation maximization