US3363233A - Digital comparison element - Google Patents

Digital comparison element Download PDF

Info

Publication number
US3363233A
US3363233A US613686A US61368667A US3363233A US 3363233 A US3363233 A US 3363233A US 613686 A US613686 A US 613686A US 61368667 A US61368667 A US 61368667A US 3363233 A US3363233 A US 3363233A
Authority
US
United States
Prior art keywords
circuits
signals
signal
circuit
input
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
US613686A
Other languages
English (en)
Inventor
Petzold Dieter
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Licentia Patent Verwaltungs GmbH
Original Assignee
Licentia Patent Verwaltungs GmbH
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Licentia Patent Verwaltungs GmbH filed Critical Licentia Patent Verwaltungs GmbH
Application granted granted Critical
Publication of US3363233A publication Critical patent/US3363233A/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/02Comparing digital values
    • G06F7/026Magnitude comparison, i.e. determining the relative order of operands based on their numerical value, e.g. window comparator

Definitions

  • the present invention relates to a digital comparison element.
  • a comparison element is a circuit component which is used, for various purposes, in digital con trol and computing systems whenever two binary numbers, a and b, are to be compared in order to establish whether these two numbers are equal to each other or, if they are unequal, the algebraic sign of their difference.
  • the numbers are, for example, represented by direct current voltage signals which correspond to the binary numbers O and L, the capital letter L being used to represent the number 1 in the binary system.
  • FIGURES 1 and 2 show comparison elements according to the prior art. Each is shown as an element capable of comparing binary numbers consisting of four binary digits, the number a having digits a a a a and the number b having digits b b b h
  • the comparison elements have outputs at which appear the signals P N K as well as the antivalents or negated signals a o s o, s/o- When:
  • a negated signal will be 0 if its corresponding affirmative signal is L, and L if its corresponding affirmative signal is O.
  • the passive stages are the AND-circuits and the OR-circuits, while the active stages are the negated or NOT-stages.
  • the negated stages which may, in practice, be constituted by a first transistor, are shown by the black rectangles.
  • Each AND function is represented by the ampersand 8t and each GR function by v. Where appropriate, the & and v are indexed by means of subscripts.
  • the Signals representing the four-digit binary numbers a and b namely, the signals a,, to a b to 12 as well as their negates E to 5 and h to 3 are applied to the AND/ NOT/NOT-circuits & to &7.
  • the outputs of circuits & to 8: are applied to the inputs of further AND/NOT/ NOT-circuits 8: to 8: whose outputs, in turn, are.
  • the comparison element according to FIGURE 2 comprises eight AND/NOT-circuits & to 8: with the circuits 8: and 8: having applied to their inputs the signals corresponding to the highest-order digits of the binary numbers, with the next AND/NOT-circuits 8: & having applied to their inputs the signals pertaining to the next
  • the stages following the stages of the highest-order digits are additionally controlled by all preceding stages.
  • the outputs of the AND/NO'Lcircuits 8: and 8: are applied to AND/ NOT/NOT-circuits 8: and 8: at which appear the output signals P F and N K respectively.
  • Connected to the afiirmed outputs of circuits 8: and & are the inputs of a further AND/NOT/NOT-ci-rcuit & at whose outputs appear the signals K KB
  • the time required for forming the comparison signal is, for all practical purposes, set by the number of transistors connected in the cascade, this being represented by the white and black rectangles.
  • the signal K is formed after six transistor switchings, while in the circuit of FIGURE 2, the same signal is formed after eight transistor switch ings.
  • Each of these switchings takes a certain time, so that it takes relatively long, once the input signals have been applied to the comparison element, to obtain a useful output signal which gives the desired indication.
  • the primary object of the present inventi-on to provide a comparison element which is simpler than heretofore known comparison elements and which produce the desired output signals, namely, the signals representing the existence of coincidence, i.e., equality between the numbers being compared, or the signals representing the algebraic sign of the difference between the two numbers, more quickly than do the prior art comparison elements. Accordingly, the present invention resides in a comparison element which is characterized by the following features:
  • each group of digits control a set of two logic input circuits.
  • One of these puts out a single intermediate signal that indicates whether the two digit groups are coincident, i.e., equal, to each other, whereas the other of the two logic input circuits puts out a signal which indicates whether there exists a positive or negative difference between the two groups of digits.
  • Two logic output circuits have their inputs connected to the outputs of the input circuits of each digit group for combining the intermediate results produced by each set of two input circuits.
  • the input circuits have their outputs connected to auxiliary logic circuits, whose outputs are connected to the above-described output circuits. That is to say, the output circuits do not have the information applied to them directly by the input circuits, instead, the set of input circuits are combined into larger groups .and have their signals passed on to the auxiliary or intermediate logic circuit, and it is the output of these auxiliary logic elements which are then applied to the final output circuits.
  • FIGURES 1 and 2 are block diagrams of comparison elements according to the prior art.
  • FIGURE 3 contains block diagrams of the six logic circuits for producing the K, N and P output signals, each of which circuit is capable of handling 2-digit numbers.
  • FIGURE 4 contains two block diagrams of logic circuits similar to FIGURE 3 but capable of handling 3- .digit and 4-digit numbers, respectively.
  • FIGURE 5 contains block diagrams of logic circuits for obtaining, ultimately, the final output signals from intermediate values.
  • FIGURE 6 contains block diagrams of other logic circuits for producing ultimate output signals from intermediate values.
  • FIGURE 7 contains block diagrams of logic circuits for combining intermediate signals.
  • FIGURES 8 through 12 are block diagrams of comparison elements capable of handling numbers having up to 12 digits.
  • FIGURE 13 is a block diagram of a modified version of a part of the circuitry of FIGURE 10.
  • FIGURE 14 is a block diagram of a modified version of a part of the circuitry of FIGURE 12.
  • FIGURES 15 and 16 are block diagrams of modified versions of part of the circuitry of FIGURES and 12.
  • FIGURES 17 and 18 are block diagrams of modifications of the circuitryof FIGURES and 16.
  • FIGURE 19a is a block diagram of a part of the c0mparison element.
  • FIGURE 1% is a block diagram of a simplified version of the circuit of FIGURE 19a.
  • the numbers to be compared will be considered to be the numbers a and b having digits a a a b b b with the index 0 identifying the lowest-order digit of the number, the index 1 the next higher-order digit, and so on.
  • the digits are represented by correspondingly referenced DC. voltage signals, which are identified by O and L.
  • the numbers a and b to be compared have to be so encoded that, when a b, the binary value Binarv Totrad Representation value ofthe Decimal Encoded in Natural (each decimal digit Tetrad Number Binary Code encoded in Natural Represen- Binary Code) t tiou at the left a, 912"- LLLOOLOOOO LOOL OOOL OOLO 2,322 b, 857 -- LLOLOLLOOL LOOO OLOLOL OLLL 2,135
  • the decimal number can be encoded in another suitable code, so long as the above limitation is observed.
  • the reference K represents coincidence
  • the reference P represents a positive deviation, i.e., a difference which, for purposes of result, will be considered a positive difference
  • the reference N represents a negative difference.
  • Circuits S and S of FIGURE 3 show how the functions may be realized, for numbers having a width of 2 bits, by using AND-circuits whose outputs are connected to the inputs of an OR/NOT-circuit.
  • the response conditions for K are better since here the number of the individual components progresses arithmetically only and the number of inputs to each component remains constant (equal to 2).
  • FIGURE 4 shows two further circuits S and S each likewise consisting of AND-circuits whose outputs are connected to an OR/NOT-circuit, for realizing the from the drawing; for example, the first AND-circuit 8:
  • the functions (5 and (6) are used to obtain a signal indicating the negative, or non-negative, difference, with circuits S 'and S of FIGURE 3 showing how these functions may be realized.
  • Functions (7), (8), (9) and (10) are functions for forming the signals indicating positiveor negative differences, which functions difier. from those set forth above.
  • These functions (7) to (10) which are realized by a chain or cascade of serially connected logic circuits, can be rewritten, for example, as functions (11) and (12) in which the solid zig-zag line representsthe switching function of a circuit which uses input AND-circuits throughout, whereas the dashed zig-zag line represents the switching function of a circuit which uses an QR/ NOT-circuit in its lowest-order digit. 2
  • the numbers to be compared are divided into groups of digits.
  • the groups of digits have assigned to them input circuits which are controlled by signals a, b, these inputs circuits being arranged to produce the above switching functions.
  • Functions (13), (14), (15), (16), (17) and (18) are the functions of these further circuits i.e., the auxiliary or intermediate circuits which are controlled by the signals P, N, F, F, appearing at the outputs of the circuits which themselves are controlled by the input signals a and b.
  • the indices are shown in parentheses, this being intended to indicate that the functions apply, accordingly, in the event the individual intermediate results are each formed for a plurality of bits.
  • the index can be replaced by the index (2/0) and the index (1) can be replaced by the index 5/3, in which case the final result would be
  • the further logic circuits connected to these input circuits will be circuits having the switching functions and FIGURE 5 shows the circuitry for realizing the switching functions to obtain the final or ultimate output signals when there is coincidence, or positive or negative difference, from two or three, intermediate results (i.e., comparison by groups), the logic circuits being controlled by the P and N signals of the preceding logic circuits.
  • the circuits S and S are the coincidence or K circuits
  • circuits S to S are the P circuits
  • circuits S to S are the N circuits.
  • FIGURE 6 shows other logic circuits for combining intermediate results.
  • the circuits of FIGURE 6 diifer from those of FIGURE 5 in that the control signals applied to them are the P and K signals, rather than the P and N signals, as was the case in FIGURE 5.
  • Circuits S to S of FIGURE 6 are the K circuits.
  • Circuits S to S are the P circuits, the same being controlled by the P and K output signals of the preceding logic circuits.
  • Circuits S to S are the N circuits.
  • FIGURE 7 shows logic circuits S to S for the P circuit, adapted, respectively, for combining the results of 4, 5 and 6 group comparisons which produce, as intermediate results, the P and N signals.
  • FIGURES 8 through 12 show comparison elements for comparing numbers consisting of 12 binary digits each.
  • FIGURE 8 shows an element in which the intermediate results (group comparison) are formed of 4 bits each.
  • the coincidence circuit consists of three groups S to S which are constructed in accordance with function (2).
  • the P circuit consists of groups S to S which are constructed in accordance with function (11). Circuits S to 8, for the group comparison are controlled directly by the input signals a, b, with the circuits S to S being assigned to the four lowest-order digits, S to S being assigned to the next four digits, and S to S being assigned to the four highest of the twelve digits.
  • the output signals of the groups of the K and P circuits are applied to circuit S operating in accordance with function (21), and to circuit S operating in accordance with function (19).
  • FIGURE 9 shows an element in which each intermediate result is constituted by 3 bits.
  • the coincidence circuit consists of four circuits S to S operating in accordance with function (2), and the P circuit consists of circuits S to S perating in accordance with function (3).
  • the signals representing the intermediate results again control the output circuits S and S operating in accordance with functions (21) and (19), respectively.
  • the negated outputs of S and S are connected to the inputs of an AND/NOT/NOT-circuit S FIGURES 10, 11 and 12 show comparison elements in which the first logic input circuits, to which the signals a, b, are applied, are combined into groups of 2 bits each.
  • Figure Circuit Logic Function 10 Input circuits $55-$61 (P). (4) Input circuits 862-357 (N) (5) Output circuit S (13) Output circuit S 9 (17) 11 I. Input circuits 811-515 (I?) (3) Input circuits S11-S 2 (N) (5) Output circuit Si; (13) Output circuit S (15) 12 Input circuits Sue-S91 (P) (4) Input circuits Spa- 97 (K) (2) Output circuit Sgt; (19) Output circuit Sug (21) The output circuits which are controlled directly by signals representing the intermediate results have connected to their outputs an AND/NOT/NOT-circuit S (FIGURE 10), S (FIGURE 11), S (FIGURE 12).
  • the signal K is obtained after two transistor switchings, and the signal K after three switchings.
  • the circuits S to S of FIGURE 10 can be replaced by a logic circuit arrangement such as is shown in FIG- URE 13.
  • further auxiliary values are formed from the intermediate values put out by the input circuits which are controlled by the input signals, this being effected by means of circuits S to S and only these auxiliary signals are applied to further logic circuits S and S to whose outputs is connected the AND/NOT/NOT-circuit S which circuits S to S put out the final results P, N and K.
  • the circuitry of FIGURE 13 is used in the element of FIGURE 10, the indices (0), (1), (2) and (2/()) must be replaced, respectively, by the indices l/O, 3/2, 5/4 and 5/0, and so on.
  • FIGURE 14 shows a circuit arrangement which can be used in place of circuits S to S of FIGURE 10.
  • auxiliary signals are formed from the P and K results which appear as intermediate values (circuits S to S).
  • the logic circuits S and S form, from the auxiliary signals, the final results for P and K, and the AND/NOT/NOT-circuit S forms the final signals for N.
  • FIGURES 15 and 16 show circuit arrangements in which, as in the case of FIGURES 13 and 14, auxiliary signals, used in forming the final output signals, are first derived from the intermediate signals produced by the input circuits, this being effected by circuits S to S in the arrangement of FIGURE 15 and by the circuits S to in the arrangement of FIGURE 16.
  • the circuit of FIGURE 15 can be replaced by the circuit of FIGURE 17, and the circuit of FIGURE 16 by that of FIGURE 18.
  • the auxiliary circuits S to S in and S143 to S in 18, have applied to them the signals of the input circuits, representing the intermediate signals, have connected to their outputs further auxiliary circuits S to in FIGURE 17 and S to S in FIGURE 18. Only those signals which are put out by the last-mentioned auxiliary circuits are applied to the final output circuits.
  • FIGURE 19a shows, as does FIGURE 15, a circuit arrangement for that part which is connected to the input stages, without, however, being divided into auxiliary and output circuits.
  • FIGURE 19b shows how the arrangement of FIGURE 19a can be simplified.
  • the present invention resides, basically, in a comparison element for comparing multiple-digit binary numbers to determine coincidence thereof, or in the case of non-coincidence, the algebraic sign of their diiference, the numbers to be compared being divided into groups of digits each of which digits is represented by a signal.
  • the comparison element itself comprises a plurality of logic input circuit means, cor- E 8 responding in number to the number of groups of digits into which each of the numbers to be compared is APPENDIX divided. Each set is connected to receive the Signals which [Logic functims] represent the digits that are part of the two groups of 60 8:50 (an &bD) Ko (1) digits to be compared by the respective set.
  • Each set f 5 (E & E0 & a & 51) V (an & b0 & E1 & 51) V (in & so & a1 & b1) v (M & b0 input circuit means has first and second input circuits, 8w!
  • &bx K1/0 the first input circuit indicating coincidence of the two 3,, & & 5, 5, & E, 3, E v (a0 3; be & 3 & B & 5 a; 5, v 3,, & 5, 5; groups of digits and the second input circuit indicating a a1 & b1 & E1 & E) v (30 & b0 & a1 & 13161 El & El) v (3 & E0 & 1 a: El positive or negative difference between the two groups of & a; & D!) v (20 e & 1 1 61 2 & 2) v (E0 & Eu & at & b1 & a: 8: digits.
  • This number is compared with the nominal position of the g gfig gg 3fg;fi & M V (hast m work tool, i.e., the position which the work tool should 1 v a m M 0 V Z 1 an m occupy relative to the work piece as dictated by the (6) program.
  • This nominal position may itself be expressed aWEFN-O as a digital number.
  • the digital numbers representing, a pvm als yB B,& E,&B respectively, the actual and the nominal position of the (am 52) v (art: 4 at) v (ai 2.16: Fe) v (am ant: 51) v (at & B1 & an) v work tool relative to the work piece, and which, in prac- 5 W (526: m &a1&FO)V 2 1 & 1) v 1 tice, may have some twenty digits each, are then com- &a)v(b&E1&E) m/ pared with each other. If they are equal, the position of d the work tool is in agreement with the position dictated (7) by the program.
  • a digital comparison element for comparing two series of signals which represent numbers, which series of signals are arranged in multiple-digit signal groups, there being first means for testing whether or not there is coincidence of signal representation of said numbers and forming a first intermediate signal, second means for testing the algebraic sign of the difference between said signal representations of said numbers and forming a second intermediate signal, said first and second means being constituted, respectively, by two logic input circuits which each signal group has associated with it and which input circuits are controlled by the signals of the respective signal group, there further being third means for putting out a coincidence signal and an algebraic sign signal, said third means being constituted by two logic output circuits which are controlled by the intermediate signals of all of said logic input circuits, wherein the improvement comprises the arrangement that each signal group encompasses two or three binary digits and each logic input circuit for testing for coincidence has, for each binary digit of the signal group, two input AND- circuits which are controlled by the signals of the respective signal group, there being OR/NOT-circuit means for combining the output signals of all of

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Logic Circuits (AREA)
  • Measurement Of Current Or Voltage (AREA)
US613686A 1963-04-22 1967-02-02 Digital comparison element Expired - Lifetime US3363233A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DEL0044691 1963-04-22
DEL0044690 1963-04-22

Publications (1)

Publication Number Publication Date
US3363233A true US3363233A (en) 1968-01-09

Family

ID=25985659

Family Applications (1)

Application Number Title Priority Date Filing Date
US613686A Expired - Lifetime US3363233A (en) 1963-04-22 1967-02-02 Digital comparison element

Country Status (4)

Country Link
US (1) US3363233A (xx)
CH (1) CH431145A (xx)
GB (1) GB1024025A (xx)
NL (1) NL6404426A (xx)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3825895A (en) * 1973-05-14 1974-07-23 Amdahl Corp Operand comparator
US3955177A (en) * 1975-03-26 1976-05-04 Honeywell Information Systems Inc. Magnitude comparison circuit
US4112498A (en) * 1976-02-24 1978-09-05 Siemens Aktiengesellschaft Digital correlation receiver
US4728927A (en) * 1984-09-28 1988-03-01 Aman James A Apparatus and method for performing comparison of two signals

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US2885655A (en) * 1954-04-09 1959-05-05 Underwood Corp Binary relative magnitude comparator

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US2885655A (en) * 1954-04-09 1959-05-05 Underwood Corp Binary relative magnitude comparator

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3825895A (en) * 1973-05-14 1974-07-23 Amdahl Corp Operand comparator
US3955177A (en) * 1975-03-26 1976-05-04 Honeywell Information Systems Inc. Magnitude comparison circuit
US4112498A (en) * 1976-02-24 1978-09-05 Siemens Aktiengesellschaft Digital correlation receiver
US4728927A (en) * 1984-09-28 1988-03-01 Aman James A Apparatus and method for performing comparison of two signals

Also Published As

Publication number Publication date
CH431145A (de) 1967-02-28
GB1024025A (en) 1966-03-30
NL6404426A (xx) 1964-10-23

Similar Documents

Publication Publication Date Title
US3610906A (en) Binary multiplication utilizing squaring techniques
US4761760A (en) Digital adder-subtracter with tentative result correction circuit
GB1045425A (en) Improvements relating to arithmetic and logic units
GB1455275A (xx)
US3711693A (en) Modular bcd and binary arithmetic and logical system
US3363233A (en) Digital comparison element
US3757098A (en) Carry generation means for multiple character adder
US4110831A (en) Method and means for tracking digit significance in arithmetic operations executed on decimal computers
US3196262A (en) Binary comparator
US3976866A (en) Addition control system
US2989237A (en) Coded decimal adder subtractor
US3257549A (en) Subtracting arrangement
US3584207A (en) Arrangement for carrying out alternatively addition or one of a number of logical functions between the contents in a position of two binary words
US3244864A (en) Subtraction unit for a digital computer
US3198939A (en) High speed binary adder-subtractor with carry ripple
US3751651A (en) Dimension comparator for machine tools
US4860241A (en) Method and apparatus for cellular division
US3305831A (en) Inequality comparison circuit
US3271566A (en) Adding system for binary coded excess three numbers
US3227865A (en) Residue checking system
US3394249A (en) Apparatus for adding numbers using a decrementer and an incrementer
EP0442220B1 (en) Decoder
US2904252A (en) Electronic calculating apparatus for addition and subtraction
US3275811A (en) Binary register control unit
DE3702204C2 (xx)