Abstract | ||
---|---|---|
A comprehensive strategy for bidirectional associative memories (BAMs) is presented, which enhances storage capacity greatly. The design strategy combines the dummy augmentation encoding method with optimal gradient descent algorithm. The proposed method increases the storage capacity performance of BAM to its upper limit compared with original Kosko method and optimal gradient descent algorithm. Computer simulations and comparison are given based on three methods to demonstrate the performance improvement of the proposed strategy. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/11427391_63 | ISNN (1) |
Keywords | Field | DocType |
bidirectional associative memory,performance improvement,original kosko method,design strategy,new strategy,storage capacity,comprehensive strategy,proposed strategy,storage capacity performance,optimal gradient descent algorithm,gradient descent,computer simulation | Gradient method,Design strategy,Gradient descent,Associative property,Search algorithm,Bidirectional associative memory,Computer science,Algorithm,Encoding (memory),Performance improvement | Conference |
Volume | ISSN | ISBN |
3496 | 0302-9743 | 3-540-25912-0 |
Citations | PageRank | References |
9 | 0.65 | 5 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Gengsheng Zheng | 1 | 10 | 2.02 |
Sidney Nascimento Givigi | 2 | 64 | 12.40 |
Weiyu Zheng | 3 | 9 | 0.65 |