Multiple Match Resolvers: A New Design Method
- 1 December 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (12) , 1317-1320
- https://doi.org/10.1109/t-c.1974.223856
Abstract
After a brief review of alternative techniques, this correspondence presents an approach to multiple-match resolver design which is significantly faster than ones which have hitherto been published. The approach involves the repeated use of a standard functional block to build resolver tree structures capable of generating addresses or logic vectors. Several example designs are shown to illustrate the concept, but the basic intent is to provide a method which can be used effectively under many logic family and physical constraints. For activity vectors of N bits, the scheme produces resolvers with speeds of around log2 N unit gate propagation delays.Keywords
This publication has 5 references indexed in Scilit:
- Integrated-circuit content-addressable memoriesIEEE Journal of Solid-State Circuits, 1970
- Determination of Priority in Associative MemoriesIEEE Transactions on Computers, 1968
- A Destructive-Readout Associative MemoryIEEE Transactions on Electronic Computers, 1965
- Proposals for Ordered Sequential Detection of Simultaneous Multiple ResponsesIEEE Transactions on Electronic Computers, 1963
- A content addressable distributed logic memory with applications to information retrievalProceedings of the IEEE, 1963