Sorter structure based on shiftable content memory
US5504919A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Jul 5, 1995 |
| Grant date | Apr 2, 1996 |
| Priority date | — |
| Expiry date | Jul 5, 2015 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99937
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An optimized high-speed sorter has a plurality of process elements connected in series. Each process element includes a sorting unit used to store a sorted item, and a comparing/controlling unit coupled to the sorting unit. In this sorter, all sorted items are compared with the input item simultaneously, and then are divided into an LE-group wherein the sorted items are less than or equal to the input item, and a G-group wherein the sorted items are greater than the input item. We assume that the sorted items are arranged in a descending sequence from left to right. In the insertion operation, the sorted items in the LE-group are shifted rightwards simultaneously, and the input item is loaded in the position between the LE-group and G-group. In the deletion operation, only the sorted items in the LE-group are shifted leftwards simultaneously. In order to accelerate the operation speed, the sorter adopts a pre-shift strategy.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.