SU1589400A1 - Device for isolating binary code combinations of arbitrary weight - Google Patents

Abstract

The invention relates to computing and microelectronics and is intended for building high-speed matrix processors. The purpose of the invention is to simplify the design of the device. This is achieved by the fact that the device contains an element OR 1, an element AND 5, an element NOT 6, N-2 majority elements 2-4, N-1 elements PROHIBIT 7-10, N inputs 11-15 and N + 1 outputs 16-21 where N is the binary word size. The complexity of the device (according to the number of inputs of logic elements) is equal to N 2 + 2N-1, and the speed, determined by the depth of the circuit, is 2Τ, where Τ is the valve delay. The apparatus for counting the number of units in a binary word works as follows. The device inputs receive bits X 1 - X N of a binary word, and a unitary binary code of the number of units contained in the set {X 1, X 2, ..., X N} is formed at its outputs. The signal of a logical unit at the Kth output (K = 1,2, ..., N + 1) indicates the presence of exactly K-1 units in the input binary word. 1 ill., 1 tab.

Description

: element 5, element 6, n-2 major elements 2–4, n-1 elements BANKS 7–10, n inputs 11–15 and n + 1 outputs 16–21, where n is the binary word width. The complexity of the device (in terms of the number of inputs of logic elements) is n2 + 2n-1, and the fast speed of 21, defined by the depth of the circuit, is -2-С, where C is the valve delay. The device for counting the number of units in a binary word works as follows. The inputs of the device receive bits x - x of a binary word, and at its outputs a unitary binary code of the number of units contained in the set x "Xr, ..., x is formed. The signal of logical unity at the k-th output (, 2, ..., h + 1) indicates the presence of exactly K-1 units in the input binary word. 1 ill., 1 tab.

j The invention relates to computing | and microelectronics: and is intended to build high-speed matrix processors. ; The purpose of the invention is to simplify the design;

: In the drawing, the diagram of the device is presented as an example at. The device for counting the number of units in a binary word contains the element IGSCH 1, the majority element 2-4 element AND 5, the element NOT 6, element 7-10 BANGE, inputs 11-15, n- | -1 6 outputs 16-21. And the majority elements 2–4 have thresholds of two, three, and even, 1pe, respectively.

A device for counting the number of units in a binary word works as follows.

The inputs 11 - 15. The device receives bits x ... x binary word. At the outputs 16-21 of the device, a unitary binary code of the number of units contained in the fflox x ,, x, xj, x, x is generated. The signal of the logical unit at the kth output (, 2, ..., 6) indicates the presence of exactly k-1 units in the input binary word.

Obviously, on the 1st (, 2, ...

.4777

P + 1; the output of the proposed device implements elementary symmetric Boolean functions S.,., (x ,, Xj, ..., X |), the values of which are shown in the table for.

The device is synthesized according to the following ratios:

, VX, V ... VX,

(x, ,,) lT (x, K ,.

Xp),, 2, ... n-1

) -Xr.

20

- 25 30

 . f,

45

50

55

where M is the function of the n-input majority element with a threshold t, defined as follows: Mj (x ,, x,.,., x)

1, if, - t; ,

p9

Oh if

i i

Here it is necessary to take into account the fact that MI (X, x, ..-, x) x, vx, v ... vx,

Claims (1)

Mj (x, x ,, ... ,, x. ... x „. I Formula from A device for extracting binary code combinations of arbitrary weight, containing a group of prohibition elements, an AND element, the output of which is connected to (n + 1) th, where n is the binary word width, the device output, the j-ro output where, 2, ..., p-2, is connected to (j + 1) -M output-. The house of the device, the p-th code of which is connected to the output of the (p-1) -th element of the PROHIBITION, characterized in that, to simplify the design of the device, external major-2 elements, the OR element and the HE element, whose output is connected, are introduced with the first exit, home device, i-th entrance, where, 2,. . ,, n, the device is connected to the i-th input of the first element OR, the input of the j-ro major element and the ith input of the element AND, the output of the element OR is connected to the input of the element NOT and the direct input of the first element BAN, the output j-ro the BANCH element is connected to the direct input (j + 1) -ro of the BAN element and the inverse input of the j-ro element of the BAN, the output of the element P is connected to the inverse input of the (n-2) -th element of the BAN; 51589400 The truth table of logical functions implemented by the device for sub - “- counting the number of units in a binary word, with