Content addressable memory array having flexible priority support
作者： Michael J. Miller , Mark Baumann
DOI:
关键词: Computer hardware 、 Routing (electronic design automation) 、 Index (economics) 、 Variable (computer science) 、 Content-addressable memory 、 Signal 、 Algorithm 、 Prefix 、 Computer science 、 Value (computer science) 、 Encoder
摘要: A method for processing addresses having variable prefix lengths, including (1) applying an input address to a plurality of CAM blocks; (2) assigning different sets blocks store prefixes lengths; (3) generating hit signal and index with each the in response address; (4) programming routing values; (5) signals priority encoder order determined by (6) output signals; (7) selecting one values as value signal; (8) value. Circuitry implementing is also provided.
lens.org 参考文章(4)
M. Kobayashi, T. Murase, A. Kuriyama, A longest prefix match search engine for multi-gigabit IP processing international conference on communications. ,vol. 3, pp. 1360- 1364 ,(2000) , 10.1109/ICC.2000.853719
Jose Pio Pereira, Method and apparatus for re-assigning priority in a partitioned content addressable memory device ,(2000)
James A. Pasco-Anderson, Eugene B. Nusinov, CAM array and method of laying out the same ,(1995)
Bindiganavale S. Nataraj, Varadarajan Srinivasan, Sandeep Khanna, Jose Pio Pereira, Row redundancy in a content addressable memory ,(2000)