EP0223458A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Deep trap machine
Assignee: HP Inc
•
Filing: 1986-10-29
•
Granted: —
•
Expires: 2006-10-29
Abstract
Abstract Provided is an apparatus for digital filtering of sequences of data units, such as sequences of bytes. The apparatus provides for the parallel application of more than one filter and stores the results of applying all filters to a whole sequence of data units. The apparatus involves the interaction of random access memories. Hence, filters are programmable. In addition, individual data units in a sequence may be trapped for comparison solely as a function of their ordinal position in the sequence.
Inventors
- 👤 Gordon Arvid Jensen
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-27 23:24
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/02; G06F16/00; G06F16/90; G06F16/903; G06F16/90335; G06F16/90344; G06F2207/00; G06F2207/02; G06F2207/025
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
136 words
A deep trap machine for filtering data-sequences of binary data-units travelling along a transmission medium, comprising: reader-controller means for reading data-units of a data-sequence from the transmission medium for filtering, and for generating control signals; a comparison-means, connected to said reader-controller means and having a plurality of segments, for storing in parallel user-defined filters to be applied to data-sequences read by said reader-controller means, and for generating output signals indicative of the results of said filtering; memory-mapping means, connected to said comparison means, for counting the ordinal position of each data-unit of a data-sequence, and for generating output signals for mapping each data-unit as a function of its ordinal position onto a user-predetermined segment of said comparison means; and latch means, connected to said comparison means, for storing the output signals generated by the comparison means.
Claim 2
Dependent Claim
136 words
A deep trap machine for filtering data-sequences of binary data-units travelling along a transmission medium, comprising: reader-controller means for reading data-units of a data-sequence from the transmission medium for filtering, and for generating control signals; a comparison-means, connected to said reader-controller means and having a plurality of segments, for storing in parallel user-defined filters to be applied to data-sequences read by said reader-controller means, and for generating output signals indicative of the results of said filtering; memory-mapping means, connected to said comparison means, for counting the ordinal position of each data-unit of a data-sequence, and for generating output signals for mapping each data-unit as a function of its ordinal position onto a user-predetermined segment of said comparison means; and latch means, connected to said comparison means, for storing the output signals generated by the comparison means.
Claim 3
Dependent Claim
71 words
A deep trap machine as in claim 1, wherein: the comparison means comprises a programmable random access memory configured into equi-sized segments of equi-sized binary words; each segment is equal in length to one data-comparison parameter; each segment holds as many data-comparison parameters in parallel as there are bits in said equi-sized binary words of said segments; and the segments taken as a whole constitute parallel sequences of data comparison parameters.
Claim 4
Dependent Claim
68 words
A deep trap machine as in claim 2, wherein: each said sequence of data comparison parameters constitutes a single filter such that the comparison means as a whole may hold as many filters in parallel as there are bits in each equi-sized binary word of each segment; and each filter may have a length in data comparison parameters equal to the number of segments of said comparison means.
Claim 5
Dependent Claim
23 words
A deep trap machine as in claim 1, wherein the memory mapping means comprises a binary counter and a programmable random access memory.
Claim 6
Dependent Claim
54 words
A deep trap machine as in claim 4, wherein the binary counter is clocked via control signals from said reader-controller means to increment with the reading of each data-unit of a data sequence such that the output of said counter consists of counter values corresponding to the ordinal positions of data-units in said data-sequence.
Claim 7
Dependent Claim
79 words
A deep trap-machine as in claim 5, wherein: the output of said binary counter drives the address-select lines of said programmable random access memory such that successive counter values access successive programmable random access memory addresses; and resident at said addresses are user-predetermined pointers to said comparison means segments such that a given data-unit of a given data-sequence may be mapped as a function of that data-unit's ordinal position in that data-sequence onto a segment of said comparison means.
Claim 8
Dependent Claim
72 words
A deep trap machine as in claim 1, wherein: the latch means comprises a bank of electronic latches having one latch per filter of said comparison means; each latch of said bank holds a single binary bit value; and each said latch is configured such that if said latch is externally set to true it will flip to false only on false input and will remain false until externally reset to true.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.