Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
DEVICE AND METHOD FOR DETERMINING SEARCH STARTING POINT
Document Type and Number:
WIPO Patent Application WO/2012/090584
Kind Code:
A1
Abstract:
The objective of the present invention is to effectively detect a longer character string from among objects to be searched such that a plurality of character strings of different lengths having the same portion exist therein. The present invention includes: a repeated data search circuit (21) which, with a certain character as a starting point, assesses a consecutive match between character data which have been input and character data within a CAM cell array (26) in order to output OFRB-0, which indicates the presence or absence of the consecutive match, and MADR-0, which indicates the address of the consecutive match; and trace circuits 1001, …, 100K, which assess consecutive matches with characters which have been shifted by one character each as starting points in order to output OFRB-1, …, OFRB-K, which indicate the presence or absence of the consecutive matches and MADR-1, …, MADR-K, which indicate the addresses of the consecutive matches. Then, the circuit which has output the signal that was the longest consecutive match among the OFRB-0, …, OFRB-K is identified, and the address among MADR-0, …, MADR-K which was output by the circuit is used as the address of the longest matching character string.

Inventors:
NISHINO KIYOSHI (JP)
TANAKA NOBUYOSHI (JP)
DOHJI HIROSHI (JP)
Application Number:
PCT/JP2011/075170
Publication Date:
July 05, 2012
Filing Date:
November 01, 2011
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
IBM (US)
NISHINO KIYOSHI (JP)
TANAKA NOBUYOSHI (JP)
DOHJI HIROSHI (JP)
International Classes:
H03M7/40; G06F17/30; G11C15/04
Foreign References:
JP2005175940A2005-06-30
JPH08242176A1996-09-17
JP2010268146A2010-11-25
JPH07114577A1995-05-02
Attorney, Agent or Firm:
UENO Takeshi et al. (JP)
Tsuyoshi Ueno (JP)
Download PDF:
Claims: