SU478303A1 - Device for comparing n binary numbers - Google Patents

Description

The invention relates to automation and computing and can be used in the implementation of technical equipment of discrete automation and computing, and there are natural devices for comparing F binary numbers, containing F ring shift registers, the inputs of which are interconnected and connected to the input bus of the device 4. Direct the outputs of all annular shift registers are connected to the inputs of the first OR circuit, and the inverse outputs to the inputs of the second OR circuit, the outputs of the OR circuit are connected to the inputs of the AND, tl circuits of equivalence. The purpose of the invention is to expand the class of tasks. For this, in the proposed device, the direct output of each ring register is connected to one of the inputs of the corresponding equivalence circuit, the other input of each of which is connected to the control bus, the control inputs of the equivalence circuit are connected to the output of the AND circuit, and their outputs are connected to the reset inputs of the corresponding storing annular shift registers. The proposed device scheme allows you to automatically allow the selection of the " most or least of the compared numbers. The drawing shows a block diagram of the proposed device. The device for comparing the L Binary numbers contains one controlled equivalence scheme 1 for each shift register 2, the AND 3 and OR 4 and 5 schemes. The proposed device works as follows. When a shift pulse is applied to the device input, the numbers in shift registers 2 are shifted by one position in the direction of the higher bits. In this case, the direct and inverse signals from the output of each shift register 2 are fed to the inputs of the OR .4 and 5 circuits, respectively. At the output of the AND 3 circuit, an inequality signal arises if an inequality is detected in the compared bit. This signal is fed to the control input of each equivalence circuit 1. At the output of any equivalence circuit 1, a reset signal is generated for the corresponding shift register in the event that the information in the compared bit of the shift register 2 is the same as the information on the sample bus of the largest or smallest numbers

For example, when sampling the smallest of a number of numbers on the sample resolution bus, there should be a unit potential.

When an inequality signal arrives from an AND 3 circuit and a single signal at the direct output of this shift register 2, information is reset in it, since, at both inputs of this equivalence circuit 1, there are identical individual signals.

When choosing the largest of a number of numbers on the sample resolution bus, there should be zero potential. When an inequality signal arrives from an AND 3 circuit and a zero signal at the direct output of this register 2, information is reset in it, since at both inputs of this circuit

1 identical zero signals.

Subject invention

A device for comparing P binary numbers containing fl ring-shaped shift registers, the inputs of which are connected to each other and connected to the device input bus, the direct outputs of all the shift registers are connected to the inputs of the first OR circuit, and the inverse outputs with the inputs of the second OR circuit, outputs ; Eat OR are connected to the inputs of the AND,; / equivalence circuits, characterized in that, in order to expand the class of tasks to be performed, it has a direct output of each ring register connected to one of the inputs of the corresponding equivalence scheme, another input of each of i that is connected to the control bus, i: the most important inputs equivalence schemes; are connected to the input of the AND circuit, and their outputs are connected to the reset inputs of the corresponding ring shift registers.

J

about

D

"I

p

"T tI-J

D