Associative memory capable of matching a variable indicator in o

Static information storage and retrieval – Magnetic bubbles – Guide structure

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395600, 365 49, 364DIG2, G06F 1540, G06F 704, G11C 1500

Patent

active

053197623

ABSTRACT:
An associative memory that finds the location of at least one string of characters in the associative memory that matches a string of characters presented sequentially as an input to the associative memory. The string of characters in the associative memory, the input string of characters, or both may include a specially marked characters, or set of characters, that acts as a "variable indicator." The specially marked character, or set of characters, will "match" a portion of the other string. A flag is set in the associative memory at either the starting locations or the ending locations of the matching strings. Flags are provided only at locations of stored matching strings of characters found within a selected addressable area or areas. Each flag can be moved from a first byte to a second byte in the associative memory that has a predetermined location relative to the first byte. A selection circuit selects one of the matching stored strings of characters by enabling a test signal which selects one of the flags to propagate through the associative memory circuit in a daisy-chain manner. The daisy-chain path is segmented in order to decrease the propagation time of the test signal. A summation circuit, useful in neural network applications, adds a number presented as at least one input byte to the associative memory to a number stored as at least one byte in the associative memory at the location of a stored string of characters that matches the input string.

REFERENCES:
patent: 4118788 (1978-10-01), Roberts
patent: 4296475 (1981-10-01), Nederlof et al.
patent: 4575818 (1986-03-01), Almy et al.
patent: 4598385 (1986-07-01), Kessels et al.
patent: 4852059 (1989-07-01), Oates
patent: 4958377 (1990-09-01), Takahashi
patent: 5122984 (1992-06-01), Strehler
patent: 5175860 (1992-12-01), Yamada
Barr et al, The Handbook of Artificial Intelligence, vol. II, Chpt. VI.C4: "Programming Languages for AI Research" and Pattern Matching, 1982, pp. 58-64.
Chisvin et al., Content-Addressable and Associative Memory: Alternatives to the Ubiquitous RAM, Computer Jul. 1989, pp. 51-64.
Caxton C. Foster, Determination of Priority in Associative Memories, IEEE Transactions on Computers, Aug. 1968, pp. 788-789.
Michael J. Foster, E. T.: A Laser-Programmed Language Recognizer Chip, 1984 Conf. on Adv. Research in VLSI, M.I.T., Jan., 1984, pp. 171-178.
Alfred C. Hartmann, Software or Silicon? The Designer's Option, Proceedings of the IEEE, vol. 74, No. 6, Jun., 1986, pp. 861-873.
DeWitt Landis, Multiple-Response Resolution in Associative Systems, IEEE Transactions on Computers, vol. C-26, No. 3 Mar., 1977, pp. 230-235.
Richard G. Naedel, "Intelligent Associative Memory (IAM) An Overview," pp. 61-68, Information Science, DS200lt, 1989.
S.Y.W. Su et al., The Architectural Features and Implementation Techniques of the Multicell CASSM, IEEE Transactions on Computers, vol. C-28, No. 6, Jun., 1979, pp. 430-445.
K. I. Yu et al., Pipelined for speed: The Fast Data Finder system TRW Electronic and Defense Sector, Quest, winter 1986, pp. 5-19.
TRW Group Defense Systems, Fast Data Finder 1000 & 2000, 1988, pp. 1-2.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Associative memory capable of matching a variable indicator in o does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Associative memory capable of matching a variable indicator in o, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Associative memory capable of matching a variable indicator in o will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-800542

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.