US5129042A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Sorting circuit using neural network
Assignee: Samsung Electronics Co Ltd
•
Filing: 1990-07-09
•
Granted: 1992-07-07
•
Expires: 2010-07-09
Abstract
Abstract A sorting circuit for arranging data in sequence according to the magnitudes of the data values, uses the concept of a neural network. The sorting circuit is constructed of shift registers, magnitude comparators, binary counters, binary bit separators and registers.
Inventors
- 👤 Ho-sun Jeong
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 21:41
CPC Classifications
G; G06; G06N; G06N3/00; G06N3/02; G06N3/06; G06N3/063; G06F; G06F15/00; G06F15/16; G06F7/00; G06F7/22; G06F7/24; G06F9/00
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
209 words
A sorting circuit for arranging M input data of N-bits in sequence according to the magnitude of the M input data, comprising: M shift registers for converting said serial M input data of N-bits to parallel data; M magnitude comparators for outputting an excited state if the input data is greater than or equal to a reference data, and outputting a ground state if the former is less than the latter, after receiving the input data of N-bits from each of said M shift registers; a binary counter for supplying reference data whose magnitude is changed in sequence according to a clock pulse to said M magnitude comparators; a binary bit separator, having M output terminals which have respective ranking numbers, for receiving respective output signals from said M magnitude comparators, and then driving to the ground state the output terminals whose ranking numbers are smaller than or equal to the number of the magnitude comparators outputting the excited state and driving the remaining output terminals to excited states; and M registers respectively connected to the respective M output terminals of said binary bit separator, for storing the reference data of the binary counter when said M registers are enabled upon the state transition of the corresponding output terminals.
Claim 2
Dependent Claim
209 words
A sorting circuit for arranging M input data of N-bits in sequence according to the magnitude of the M input data, comprising: M shift registers for converting said serial M input data of N-bits to parallel data; M magnitude comparators for outputting an excited state if the input data is greater than or equal to a reference data, and outputting a ground state if the former is less than the latter, after receiving the input data of N-bits from each of said M shift registers; a binary counter for supplying reference data whose magnitude is changed in sequence according to a clock pulse to said M magnitude comparators; a binary bit separator, having M output terminals which have respective ranking numbers, for receiving respective output signals from said M magnitude comparators, and then driving to the ground state the output terminals whose ranking numbers are smaller than or equal to the number of the magnitude comparators outputting the excited state and driving the remaining output terminals to excited states; and M registers respectively connected to the respective M output terminals of said binary bit separator, for storing the reference data of the binary counter when said M registers are enabled upon the state transition of the corresponding output terminals.
Claim 3
Dependent Claim
137 words
A sorting circuit as claimed in claim 1, wherein each of said M magnitude comparators comprises: one output line; N inverters for inverting said input data; first synapses for connecting a first power source voltage to said output line as each of the connecting strength of weighting value according to the input data inverted by said inverter; second synapses for connecting a second power source to said output line as each of the connecting strength of weighting value according to said reference data; and a neuron for outputting an excited if the summation of connecting strength of the first synapses is greater than or equal to that of the second synapses, and for outputting a ground state if the former is less than the latter, in the driving state, the neuron being connected to said output line.
Claim 4
Dependent Claim
161 words
A sorting circuit as claimed in claim 2, wherein said binary bit separator comprises M input lines; M output lines which cross said input lines; M inverters for inverting and inputting the output of said magnitude comparator to said each input line; input synapses for connecting the first power source voltage to said output line as the unit connecting strength according to the output of said inverter at each cross section between said input line and output line; bias synapses for biasing the output lines by connecting the second power source voltage to said M output lines as the connecting strength according to each sequential ranking order; and neurons for outputting an excited state if the summation of connecting strength of the input synapses in the driving state is greater than or equal to that of the drived bias synapse, and for outputting a ground state if the former is less than the latter, which are connected to said each line.
Claim 5
Dependent Claim
27 words
A sorting circuit as claimed in claim 3, wherein said first input synapses comprise PMOS transistors, and said second input synapses and bias synapses comprise NMOS transistors.
Claim 6
Dependent Claim
40 words
A sorting circuit as claimed in claim 4, wherein the connecting strength of said synapses is determined by a geometrical aspect ratio, that is, a width of a channel to a length of a channel (W/L) of a MOS transistor.
Claim 7
Dependent Claim
34 words
A sorting circuit as claimed in claim 5, wherein the unit connecting strength of said synapses is determined as W/L of 6μm2μm in the PMOS transistors and W/L of 2μm2μm in the NMOS transistors.
Claim 8
Dependent Claim
21 words
A sorting circuit as claimed in claim 3, wherein said neuron comprises a CMOS buffer which connects two CMOS inverters serially.
Claim 9
Dependent Claim
35 words
A sorting circuit as claimed in claim 1, wherein said binary counter performs a down counting in order to arrange the data in sequence starting from the larger value and ending with the smaller value.
Claim 10
Dependent Claim
80 words
A sorting circuit as claimed in claim 1, wherein said binary counter performs an up counting in order to arrange the data in sequence starting from the smaller value and ending with the larger value, and said magnitude comparators output an excited state if the magnitude of N-bit input data received from said each shift register is smaller than or equal to that of the reference data, and output a ground state if the former is greater than the latter.
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) | 1995-07-07 | 1996-01-06 | 1996-07-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-07-07 | 2000-01-06 | 2000-07-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-07-07 | 2004-01-06 | 2004-07-07 | $7700.00 | Window Closed / Lapsed |