← Back to Patent Explorer
US4101968A Expired / Lapsed US ⏱️ 0.0 years remaining

Sorter with overlap operation

Assignee: Raytheon Co
•
Filing: 1977-04-04
•
Granted: 1978-07-18
•
Expires: 1997-04-04
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An initial input list in a series of sequential dependent input lists is clocked through a first sort stack and written into a first buffer as Q groups of P numbers each. The P numbers are in numerical order within each group with the smallest number in the first location of each group. The first number in each group is loaded into a second sort stack which arranges them in numerical order, causing the smallest number in the input list to form the first number in the initial output list. A replacement number is numerically sorted into the second stack from the Q groups each time the smallest remaining number is clocked out. Each replacement number is from the next location of the same Q group as the most recently clocked out number. Thus, the smallest remaining number in any of the Q groups of the first buffer is always available to the second stack and appears as the smallest remaining number in the second stack is always in the first location of the second stack. As the contents of the first buffer are inserted in to the second stack, the first sort stack processes a next input list into a second buffer. The buffers read and write in overlap manner permitting both sort stacks to process input lists simultaneously. As each smallest remaining number of the initial list becomes available at the output of the second stack, it may be updated and returned to the input of the first stack as an element of the subsequent dependent list. The double buffer overlap operation approximately doubles the throughput rate and permits updating of the dependent lists.

Inventors

  • 👤 Judit Katalin Florence

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 20:46
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/22; G06F7/24; G06G; G06G7/00; G06G7/12; G06G7/16; G09; G09G; G09G5/00; G09G5/42

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 240 words
A two stage sorter which receives dependent sequential scan line lists each having N or less initial data items, and sorts the data items according to one position coordinate thereof to form raster scan lines of ordered data for displaying edges of polygon faces on a raster scan display device in which thhe direction of scan is parallel to the one position coordinate, the two stage sorter comprising: means for grouping the N or less data items of each scan line list into Q groups of data items; a first stage sorter means for numerically ordering the data items within each of the Q groups according to the one position coordinate; interstage storage means for holding the Q groups of ordered data items; a second stage sorter means for forming a single ordered scan line list of all of the N or less data items, by receiving from the interstage storage means and sorting the first data item of each group, and then continuously outputting the first data item in the second sorter and receiving and sorting the next data item from the same group as the previously outputted data item; and dependent item means responsive to the N or less data items in the single order scan line list from the second sorter means for providing dependent data items and forwarding the dependent data items to the means for grouping to be sorted into a subsequent scan line list.
Claim 2
Dependent Claim 240 words
A two stage sorter which receives dependent sequential scan line lists each having N or less initial data items, and sorts the data items according to one position coordinate thereof to form raster scan lines of ordered data for displaying edges of polygon faces on a raster scan display device in which thhe direction of scan is parallel to the one position coordinate, the two stage sorter comprising: means for grouping the N or less data items of each scan line list into Q groups of data items; a first stage sorter means for numerically ordering the data items within each of the Q groups according to the one position coordinate; interstage storage means for holding the Q groups of ordered data items; a second stage sorter means for forming a single ordered scan line list of all of the N or less data items, by receiving from the interstage storage means and sorting the first data item of each group, and then continuously outputting the first data item in the second sorter and receiving and sorting the next data item from the same group as the previously outputted data item; and dependent item means responsive to the N or less data items in the single order scan line list from the second sorter means for providing dependent data items and forwarding the dependent data items to the means for grouping to be sorted into a subsequent scan line list.
Claim 3
Dependent Claim 79 words
The two stage sorter of claim 1, wherein the interstage storage means comprises a pair of interstage storage buffers which simultaneously process a subsequent scan line list and a preceding scan line list by alternately writing the Q groups of sorted data items from the subsequent scan line list from the first stage into one buffer and reading the Q groups of sorted data items from the preceding scan line list into the second stage from the other buffer.
Claim 4
Dependent Claim 52 words
The two stage sorter of claim 2, wherein the two scan line lists are adjacent scan lines, and the dependent item means is responsive to selected data items from the preceding scan line list from the output of the second stage for providing dependent data items for the subsequent scan line list.
Claim 5
Dependent Claim 31 words
The two stage sorter of claim 3, wherein each of the initial data items has a key portion, which is arranged into numerical order by the sorters, and a nonkey portion.
Claim 6
Dependent Claim 38 words
The two stage sorter of claim 4, wherein the dependent item means selectively provides dependent items in response to the nonkey portion of the data items in the preceding scan line list from the second stage sorter means.
Claim 7
Dependent Claim 110 words
The two stage sorter of claim 5, wherein the nonkey portion of each of the N or less initial data item contains the starting value of the one position coordinate of a particular edge of a face to be displayed on the raster scan display device, and further contains the number of scan lines (L) required to display the entire particular edge, and the dependent item means further comprises: decrement means for decrementing L by one each time a dependent item is provided for the particular edge so that the nonkey portion of each dependent item contains the number of scan lines left to be displayed for the particular edge.
Claim 8
Dependent Claim 69 words
The two stage sorter of claim 6, wherein the nonkey portion of each data item contains the change in the one position coordinate (DELTA) of the particular edge over the distance between adjacent scan lines, and the dependent data item means further comprises: increment means for incrementing the one position coordinate by DELTA to form the one position coordinate for the dependent item in the next scan line list.
Claim 9
Dependent Claim 31 words
The two stage sorter of claim 7, wherein the means for grouping groups N data items into S2 equal groups of S1 data items each wherein S2 × S1 = N.
Claim 10
Dependent Claim 41 words
The two pass sorter of claim 7, wherein the means for grouping groups the less than N data items into less than S2 equal groups of S1 data items each plus a single remainder group of less than S1 data items.
Claim 11
Dependent Claim 28 words
The two stage sorter of claim 9, wherein the first stage sorter means has S1 sorting locations for ordering the S1 or less data items in each group.
Claim 12
Dependent Claim 34 words
The two stage sorter of claim 10, wherein the second stage sorter means has S2 sorting locations for ordering each replacement data item from each of the S2 groups in the interstage storage means.
Claim 13
Dependent Claim 57 words
The two stage sorter of claim 11, wherein the one position coordinate in each data item is the X coordinate along the horizontal direction, and DELTA is the change in the X position coordinate per standard change in the Y position coordinate as defined by the vertical spacing between scan lines on the raster scan display device.
Claim 14
Dependent Claim 36 words
The two stage sorter of claim 12, wherein a pair of nonkey storage means retains the nonkey portion, and a nonkey pointer means provides the nonkey storage address of each nonkey portion to the first stage.
Claim 15
Dependent Claim 160 words
The two stage sorter of claim 13, wherein each of the stages includes a sorting stack comprising: stack input means for sequentially receiving each of the numbers stored in one of the preceding pair of buffers; comparing means for comparing each currently received number to the previously received numbers currently in the sorting stack; pushdown storage means for inserting each currently received number into proper numerical order among the previously inserted numbers, which pushdown storage means progressively fills up from a first position to a last position as each currently received number is inserted; interstage output means for advancing the current number in the last position to the next stage; and pointer means for identifying the next-to-be received number from one of the preceding pairs of buffers which is the next number from the same group as the current number in the last position; and output means for receiving the ordered numbers from the sorting stack in the last stage.
Claim 16
Dependent Claim 71 words
The two stage sorter of claim 14, wherein the first stage includes a sorting stack comprising: stack input means for sequentially receiving all of the numbers within each of the groups; comparing means for comparing each currently received number to the previously received numbers from the same group; and stack storage means for inserting each currently received number into proper numerical order among the numbers previously received from the same group.

References Cited (Backward Citations)

US3996585A Cited
US4030077A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1981-07-17 1982-01-16 1982-07-18 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1985-07-17 1986-01-16 1986-07-18 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1989-07-17 1990-01-16 1990-07-18 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag