Patent US673746A successfully refreshed from Google Patents.
Patent US2599463A successfully refreshed from Google Patents.
Patent US5168567A successfully refreshed from Google Patents.
US5168567A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data sorting circuit
Assignee: Tektronix Inc
•
Filing: 1989-05-30
•
Granted: 1992-12-01
•
Expires: 2009-05-30
Abstract
Abstract A circuit for software performance analysis implements a balanced binary tree in hardware. This circuit consists of a number of "levels", each containing two (sets of) latches, a RAM, and a digital comparator. One of the latches, the data latch, is used to hold the data element being evaluated. The other latch, the results latch, stores partial results based on the comparisons performed on higher levels. The RAM is addressed by the contents of the results latch on the preceding level in combination with the output of the comparator on that same preceding level. The output of the RAM is compared by the digital comparator with the contents of the data latch, to produce an additional bit of results information for the next level. On each level, the RAM is preprogrammed with twice as many midpoint addresses as is the RAM on the preceding level. The outcome of the comparison done on any particular level is used, along with the results from preceding levels, as an address to access a RAM on the next level. Eventually, the last level is reached and there is only one range for each address generated on that level. This address is then applied to a count-holding RAM, and the contents of that RAM at that location is incremented to indicate that the incoming data element was within this data range.
Inventors
- 👤 Dennis D. Everson
- 👤 Philip R. Lantz
- 👤 Stanley R. Koslowski
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 16:49
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/22; G06F7/24; G06F2207/00; G06F2207/22; G06F2207/222; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99936
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
173 words
A circuit for sorting into a plurality of contiguous data ranges a plurality of data items arriving over time, the circuit having a plurality of levels coupled in series, the levels comprising: a data storage element with an input receiving a data item form a data storage element output on an immediately preceding level, the data storage element storing the data item and providing the data item as an output; a RAM preprogrammed with information regarding the boundaries of the plurality of contiguous data ranges and defining decision points of a binary tree, the RAM being addressed by address data from an immediately preceding level to access a stored value and supply the stored value as an output; a comparator coupled to compare the output of the data storage element and the output of the RAM and producing an additional address bit for a next level; and a results storage element with an input receiving address data from the immediately preceding level and an output providing the address data to the next level.
Claim 2
Dependent Claim
173 words
A circuit for sorting into a plurality of contiguous data ranges a plurality of data items arriving over time, the circuit having a plurality of levels coupled in series, the levels comprising: a data storage element with an input receiving a data item form a data storage element output on an immediately preceding level, the data storage element storing the data item and providing the data item as an output; a RAM preprogrammed with information regarding the boundaries of the plurality of contiguous data ranges and defining decision points of a binary tree, the RAM being addressed by address data from an immediately preceding level to access a stored value and supply the stored value as an output; a comparator coupled to compare the output of the data storage element and the output of the RAM and producing an additional address bit for a next level; and a results storage element with an input receiving address data from the immediately preceding level and an output providing the address data to the next level.
Claim 3
Dependent Claim
296 words
A circuit for sorting and counting a plurality of data items arriving over time, the circuit comprising: a first level having: a preprogrammed storage element containing initial decision information regarding a central boundary of a plurality of contiguous data ranges and defining a first decision point in a binary tree, the preprogrammed storage element providing the initial decision information at an output, and a comparator comparing a data item to the output of the preprogrammed storage element to produce an additional address bit for a next level; one or more intermediate levels, each having: a data storage element with an input receiving a data item from a data storage element output on an immediately preceding level, the data storage element storing the data item and providing the data item as an output; a RAM preprogrammed with information regarding the boundaries of the plurality of contiguous data ranges and defining decision points of a binary tree, the RAM being addressed by address data from an immediately preceding level to access a stored value and supply the stored value as an output, the address data including the additional bit; a comparator coupled to compare the output of the data storage element and the output of the RAM and producing an additional address bit for a next level; and a results storage element with an input receiving address data from the immediately preceding level and an output providing the address data to the next level; and means for storing and incrementing a plurality of counts, to increment a count stored at a location identified by the address data form the immediately preceding level, the address data including the additional bit, to produce an incremented stored count indicative of the number of data item occurrences within a particular data range.
Claim 4
Dependent Claim
296 words
A circuit for sorting and counting a plurality of data items arriving over time, the circuit comprising: a first level having: a preprogrammed storage element containing initial decision information regarding a central boundary of a plurality of contiguous data ranges and defining a first decision point in a binary tree, the preprogrammed storage element providing the initial decision information at an output, and a comparator comparing a data item to the output of the preprogrammed storage element to produce an additional address bit for a next level; one or more intermediate levels, each having: a data storage element with an input receiving a data item from a data storage element output on an immediately preceding level, the data storage element storing the data item and providing the data item as an output; a RAM preprogrammed with information regarding the boundaries of the plurality of contiguous data ranges and defining decision points of a binary tree, the RAM being addressed by address data from an immediately preceding level to access a stored value and supply the stored value as an output, the address data including the additional bit; a comparator coupled to compare the output of the data storage element and the output of the RAM and producing an additional address bit for a next level; and a results storage element with an input receiving address data from the immediately preceding level and an output providing the address data to the next level; and means for storing and incrementing a plurality of counts, to increment a count stored at a location identified by the address data form the immediately preceding level, the address data including the additional bit, to produce an incremented stored count indicative of the number of data item occurrences within a particular data range.
Claim 5
Dependent Claim
349 words
A circuit for sorting and counting a plurality of data items arriving over time, the circuit comprising: a first level having: a data storage element having an input receiving a data item and storing the data item upon an occurrence of a clocking signal and producing the data item at an output; a preprogrammed storage element containing initial decision information regarding a central boundary of a plurality of contiguous data ranges and defining a first decision point in a binary tree, the preprogrammed storage element providing the initial decision information at an output; and a comparator for comparing the output of the preprogrammed storage element and the output of the data storage element to produce an additional address bit for a next level; one or more intermediate levels, each having: a data storage element with an input receiving the data item from the immediately preceding level and storing the data item upon the occurrence of the clocking signal and providing the data item as an output; a RAM preprogrammed with information regarding boundaries of the plurality of contiguous data ranges and defining decision points of a binary tree, the RAM being addressed by address data from an immediately preceding level to access a stored value and supply the stored value as an output, the address data including the additional bit; a comparator coupled to compare the output of the data storage element and the output of the RAM and producing an additional address bit for a next level; and a results storage element with an input receiving address data from the immediately preceding level, the results storage element storing the address data upon the occurrence of the clocking signal and providing the address data to the next level; and means for storing and incrementing a plurality of counts, to increment upon the occurrence of the clocking signal a count stored at a location identified by the address data from the immediately preceding level, the address data including the additional bit, to produce an incremented stored count indicative of the number of data item occurrences within a particular data range.
Claim 6
Dependent Claim
349 words
A circuit for sorting and counting a plurality of data items arriving over time, the circuit comprising: a first level having: a data storage element having an input receiving a data item and storing the data item upon an occurrence of a clocking signal and producing the data item at an output; a preprogrammed storage element containing initial decision information regarding a central boundary of a plurality of contiguous data ranges and defining a first decision point in a binary tree, the preprogrammed storage element providing the initial decision information at an output; and a comparator for comparing the output of the preprogrammed storage element and the output of the data storage element to produce an additional address bit for a next level; one or more intermediate levels, each having: a data storage element with an input receiving the data item from the immediately preceding level and storing the data item upon the occurrence of the clocking signal and providing the data item as an output; a RAM preprogrammed with information regarding boundaries of the plurality of contiguous data ranges and defining decision points of a binary tree, the RAM being addressed by address data from an immediately preceding level to access a stored value and supply the stored value as an output, the address data including the additional bit; a comparator coupled to compare the output of the data storage element and the output of the RAM and producing an additional address bit for a next level; and a results storage element with an input receiving address data from the immediately preceding level, the results storage element storing the address data upon the occurrence of the clocking signal and providing the address data to the next level; and means for storing and incrementing a plurality of counts, to increment upon the occurrence of the clocking signal a count stored at a location identified by the address data from the immediately preceding level, the address data including the additional bit, to produce an incremented stored count indicative of the number of data item occurrences within a particular data range.
References Cited (Backward Citations)
US3815083A
Cited
US4425617A
Cited
US4475237A
Cited
US4692897A
Cited
US4774681A
Cited
US4809158A
Cited
US4991134A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-12-01 | 1996-06-01 | 1996-12-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-12-01 | 2000-06-01 | 2000-12-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-12-01 | 2004-06-01 | 2004-12-01 | $7700.00 | Window Closed / Lapsed |