By Topic

An O(n+k) algorithm for ordered retrieval from an associative memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lee, D. ; Dept of Comput. Sci., York Univ., North York, Ont., Canada ; Davis, W.A.

The problem of retrieving an ordered list of k words that satisfy a given search condition from an associative memory of m words of n bits each is addressed. A fast ordered retrieval algorithm is proposed, along with a logic design for a cellular associative memory which mechanizes the algorithm. The algorithm is of time complexity O(n+k). By contrast, the fastest previously known algorithms, by M.H. Lewis (see RCA Rev., vol.23, p.215-29 (1962)) and C.V. Ramamoorthy, J.L. Turner, and B.W. Wah (see ibid., vol.27, no.9, p.800-15 (1978)), are of time complexities O( k×log n) and O(k×n), respectively

Published in:

Computers, IEEE Transactions on  (Volume:37 ,  Issue: 3 )