US3742460A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Search memory
Assignee: Unisys Corp
•
Filing: 1971-12-20
•
Granted: 1973-06-26
•
Expires: 1991-12-20
Abstract
Abstract A Search memory organization using as the designator words, which words are the words that are stored in the Search memory and that are compared to the one search word held in the search register, words that are generated from blocks of data words is disclosed. Each of the (block) designator words includes two portions: a first common portion that includes the binary data that are common to all the data words of the block; and, a second word portion that includes the binary data that are not common to all the data words of the block. Thus, all the data words in each block are represented by only a single block designator word whereby only one block designator word need be searched for comparison to the one search word rather than all the data words of the block.
Inventors
- 👤 R Englund
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 22:36
CPC Classifications
G; G11; G11C; G11C15/00; G11C15/04; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99937
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
390 words
The method of performing a block search upon a plurality of data words, comprising: assembling a plurality of data words, each of said data words comprising two portions of ordered bits; a first common portion of ordered N-bits in length; and, a second word portion of ordered W-bits in length; generating a lesser plurality of block designator words from a greater plurality of said data words, each of said block designator words comprising; a first common portion of ordered N-bits in length that includes binary data that are common to all the data words represented by said block designator word; a second coded portion coded into a 1-of-C code of ordered Cbits in length, only one C-bit coded for identifying a separate one of all the data words that are represented by said block designator word; storing in a search register a single search word comprising; a first common portion of ordered N-bits in length; and, a second word portion of ordered W-bits in length; storing in a Search memory said plurality of block designator words; encoding the ordered W-bits of the second word portion of said search word into an ordered 1-of-C code of C-bits in length; coupling each separate one of the ordered N-bits of the common portion of said search word in said search register to each separate like-ordered one of the like-ordered N-bits of the common portion of the block designator words in said Search memory; coupling each separate one of the ordered C-bits of said ordered 1-of-C code of the encoded portion of said search word to each separate like-ordered one of the like-ordered C-bits of said ordered 1-of-C code of the second coded portion of the block designator words in said Search memory; comparing bit-by-bit each separate one of the like-ordered Nbits of the first common portion of the search word to each separate like-ordered one of the like-ordered N-bits of the first common portion of the block designator words in said Search memory; comparing bit-by-bit each separate one of the like-ordered Cbits of the ordered 1-of-C code of the encoded portion of said search word to each separate like-ordered one of the ikeordered C-bits of the ordered 1-of-C code of the second coded portion of the block designator words in said Search memory; generating match/mismatch signals indicating the results of said bit-by-bit comparison.
Claim 2
Independent Claim
390 words
The method of performing a block search upon a plurality of data words, comprising: assembling a plurality of data words, each of said data words comprising two portions of ordered bits; a first common portion of ordered N-bits in length; and, a second word portion of ordered W-bits in length; generating a lesser plurality of block designator words from a greater plurality of said data words, each of said block designator words comprising; a first common portion of ordered N-bits in length that includes binary data that are common to all the data words represented by said block designator word; a second coded portion coded into a 1-of-C code of ordered Cbits in length, only one C-bit coded for identifying a separate one of all the data words that are represented by said block designator word; storing in a search register a single search word comprising; a first common portion of ordered N-bits in length; and, a second word portion of ordered W-bits in length; storing in a Search memory said plurality of block designator words; encoding the ordered W-bits of the second word portion of said search word into an ordered 1-of-C code of C-bits in length; coupling each separate one of the ordered N-bits of the common portion of said search word in said search register to each separate like-ordered one of the like-ordered N-bits of the common portion of the block designator words in said Search memory; coupling each separate one of the ordered C-bits of said ordered 1-of-C code of the encoded portion of said search word to each separate like-ordered one of the like-ordered C-bits of said ordered 1-of-C code of the second coded portion of the block designator words in said Search memory; comparing bit-by-bit each separate one of the like-ordered Nbits of the first common portion of the search word to each separate like-ordered one of the like-ordered N-bits of the first common portion of the block designator words in said Search memory; comparing bit-by-bit each separate one of the like-ordered Cbits of the ordered 1-of-C code of the encoded portion of said search word to each separate like-ordered one of the ikeordered C-bits of the ordered 1-of-C code of the second coded portion of the block designator words in said Search memory; generating match/mismatch signals indicating the results of said bit-by-bit comparison.
Claim 3
Dependent Claim
96 words
The method of claim 1 further comprising: locking out the bit-by-bit comparison of the like-ordered C-bits of the ordered 1-of-C code of the encoded portion of said search word with the like-ordered C-bits of the ordered 1-of-C code of the encoded portion of any one of said block designator words in said Search memory if the bit-by-bit comparison of the like-ordered N-bits of the first common portion of said search word determines a mismatch of any one of the like-ordered N-bits of the first common portion of said one block designator word in said Search memory.
Claim 4
Dependent Claim
276 words
A block search processor, comprising: a search register for storing a single search word comprising two portions of ordered bits; a first common portion of ordered N-bits in length; and, a second word portion of ordered W-bits in length; encoder means for encoding the W-bits of the word portion of said search word into a 1-of-C code of ordered C-bits in length; a Search memory for storing a plurality of block designator words, each block designator word associated with a block of data words and comprising two portions of ordered bits; a first common portion of ordered N-bits in length that includes the binary data that is common to all the data words of the block; and, a second word portion coded into a 1-of-C code of ordered C-bits in length, only one ordered C-bit coded for identifying a separate one of the data words of the block; each separate block designator word having a separately associated Search memory output line for providing as outputs thereof match/mismatch signals that indicate the results of a bit-by-bit comparison of the ordered bits of said search word to the like-ordered bits of each of said block designator words; means for coupling each separate one of the ordered N-bits of the common portion of said search word in said search register to each separate like-ordered one of the like-ordered N-bits of the common portion of the block designator words in said Search memory; and, means for coupling each separate one of the ordered C-bits from said encoder means to each separate like-ordered one of the like-ordered C-bits of the coded portions of the block designator words in said Search memory.
Claim 5
Dependent Claim
276 words
A block search processor, comprising: a search register for storing a single search word comprising two portions of ordered bits; a first common portion of ordered N-bits in length; and, a second word portion of ordered W-bits in length; encoder means for encoding the W-bits of the word portion of said search word into a 1-of-C code of ordered C-bits in length; a Search memory for storing a plurality of block designator words, each block designator word associated with a block of data words and comprising two portions of ordered bits; a first common portion of ordered N-bits in length that includes the binary data that is common to all the data words of the block; and, a second word portion coded into a 1-of-C code of ordered C-bits in length, only one ordered C-bit coded for identifying a separate one of the data words of the block; each separate block designator word having a separately associated Search memory output line for providing as outputs thereof match/mismatch signals that indicate the results of a bit-by-bit comparison of the ordered bits of said search word to the like-ordered bits of each of said block designator words; means for coupling each separate one of the ordered N-bits of the common portion of said search word in said search register to each separate like-ordered one of the like-ordered N-bits of the common portion of the block designator words in said Search memory; and, means for coupling each separate one of the ordered C-bits from said encoder means to each separate like-ordered one of the like-ordered C-bits of the coded portions of the block designator words in said Search memory.
Claim 6
Dependent Claim
213 words
The block search processor of claim 3 wherein: each of the true of each of the ordered N-bits of the common portion of said search word in said search register and each of the complement of the like-ordered bits of the ordered N-bits of the common portion of each of said block designator words in said Search memory are coupled to a separately associated NAND gate and thence to the one associated block designator word Search memory output line; each of the complement of each of the ordered N-bits of the common portion of said search word in said search register and each of the true of the like-ordered bits of the ordered N-bits of the common portion of each of said block designator words in said Search memory are coupled to a separately associated NAND gate and thence to the one associated block designator word Search memory output line; only the true of each of the ordered C-bits from said encoder means and only the complement of each of the like-ordered bits of the ordered C-bits of the coded portion of each of said block designator words in said Search memory are coupled to a separately associated NAND gate and thence to the one associated block designator word Search memory output line.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1976-06-25 | 1976-12-25 | 1977-06-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1980-06-25 | 1980-12-25 | 1981-06-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1984-06-25 | 1984-12-25 | 1985-06-26 | $7700.00 | Window Closed / Lapsed |