A method for data path synthesis using neural networks
Presents a deterministic parallel algorithm to solve the data path allocation problem in high-level synthesis. The method is based on the modified Hopfield neural network model of computation and the McCulloch-Pitts binary neuron model. The proposed algorithm has a running time complexity of O(1) fo...
Saved in:
| Main Author: | Harmanani, H. (author) |
|---|---|
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5486 http://dx.doi.org/10.1109/CCECE.1999.807241 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ieeexplore.ieee.org/abstract/document/807241/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A neural networks algorithm for data path synthesis
by: Harmanani, Haidar M.
Published: (2003) -
A data path synthesis method for self-testable designs
by: Harmanani, Haidar
Published: (2017) -
An evolutionary approach for data path synthesis
by: Harmanani, H.M.
Published: (2017) -
A genetic algorithm for testable data path synthesis
by: Harmanani, H.
Published: (2017) -
An approach for redesigning in data path synthesis
by: Harmanani, Haidar
Published: (2017)