| Autor: |
Xu, Ning-Shou, Wu, Zhang-Lei, Jia, Rui-Xin, Zhang, Hong |
| Zdroj: |
IFAC-PapersOnLine; June-July 1996, Vol. 29 Issue: 1 p7195-7200, 6p |
| Abstrakt: |
The reduction problem of the required memory size is essential to CMAC-type associative memory system (AMS). Although the conventional hash-coding and hash-addressing scheme can solve the problem effectively, it may cause data collision problem resulting in the loss of useful information previously stored. To overcome this drawback, a new content-addressing mechanism is proposed. The main idea is as follows: One of the data stored in each set of ρ association memory locations is chosen to be a "master weight", and all the remaining "slave weights". It has been found that, in the case of regular training, all the slave weights are identical to the master one, and hence may be simply removed without loss of useful information. Utilizing this tact, a new algorithms for encoding, retrieval and training have been developed, and the required memory size can be reduced to 1/ρ of its original value without the data collision problem. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
