发明名称 |
Method and means for character string pattern matching for compression and the like using minimal cycles per character |
摘要 |
A method and means for ascertaining maximal length pattern matches of K characters per cycle between character strings in a reduced amount of time using a pipeline like concurrent dataflow model in which a recursive exhaustive greedy comparison matching between the strings in consistent direction yields a parsing of the longest matches, the recursion being constrained by relations among K, the match length L, and a tracking variable J, said constraints governing further recursions ascertaining prefix extensions from one string to another and any intra-string pattern matches. Embodiments processing K equal to one, two, or three characters at a time are disclosed.
|
申请公布号 |
US5525982(A) |
申请公布日期 |
1996.06.11 |
申请号 |
US19940228321 |
申请日期 |
1994.04.15 |
申请人 |
INTERNATIONAL BUSINESS MACHINES CORPORATION |
发明人 |
CHENG, JOE-MING;CHENG, YANCY |
分类号 |
G06F5/00;G06T9/00;H03M7/30;H03M7/46;(IPC1-7):H03M7/30 |
主分类号 |
G06F5/00 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|