SU892715A1 - Parallel pyramidal counter-decoder of quantity of unities in n-digit binary code - Google Patents

Description

I

The invention relates to computing and is intended for performing a parallel counting-decoding operation on the number of units in the n-bit binary code.

A device for counting and deciphering the number of pulses based on a shift register is known. In this device, counted pulses are applied to the clock inputs of the shift register, in the zero bit of which one is recorded. When k pulses are applied to its inputs, this unit advances to the kth bit, which ensures counting the decoding of the number of incoming pulses l}.

A disadvantage of the known device is the impossibility of using it for counting-deciphering the number of pulses in parallel channels, as it becomes necessary to turn them into successive pulses, which requires additional time and equipment.

The closest in technical essence to the proposed is a pyramidal stranded decoder, in each k-th floor of which there are 2 two-input elements I. Some of the inputs of adjacent odd (t) and even (m + l) elements And the k-th are connected respectively, to the single and zero inputs of the respective Rus. The second inputs of these ale, vm + t

cops And connected to the outputs - the elements of M (K-1) then Russ. Wherein

also the inputs of the first rus are its exits.

A known device can be used to calculate and decipher the number of units in n-bit binary codes if its outputs for all input codes with the same number of units are combined with OR elements. The total cost of the number of diodes is determined by the expression

() t2r (S) -2l

 K 0LVK: O / J The disadvantage of the known device is that the reliability is not high enough, since the number of diodes increases significantly with increasing bit depth.

The purpose of the invention is to increase reliability by simplifying the device.

The goal is achieved by the fact that in a parallel pyramidal counter-decoder the number of units in the n-bit binary code, containing in the first, second, ..., nth Russe, respectively, 0,4,6, ...,; 2 n two-input elements I, and in each k-TOM floor the first inputs are odd and the second inputs are even

elements And are connected respectively to the zero and single inputs of this Russa the second and first inputs of the first and second (2k-1) -th and 2k elements of H are connected respectively to the first and k-th outputs of the (kl) -th Rus, outputs of the first and 2k - Moreover, the AND elements are connected to the device outputs, the outputs of the second and third, ..., (2k-2) -th and (214-1) elements of the AND elements through the two-input elements OR the connection to the outputs. The second and first inputs of the third and fourth / go, respectively, ,, ,, (2k -3) -th and (2k -2) -th elements, And ..

The drawing shows a diagram of a parallel pyramidal counter; ka decoder the number of units in the p-bit binary code. .

The device contains single inputs 1, zero inputs 2, elements 3 AND, elements 4 OR, outputs 5 of the device.

The inputs of the odd elements and Yi of each tus are connected to zero

the inputs of your rus, the inputs are even

And- (.

elements and

Chkazhdogo Rus

podkl ocheny to individual inputs of their Rusy. Other inputs of adjacent elements And odd -. L - and. Odd

4ND -1 connected to - l. -j outs

(k-1) - Russ. The outputs of the first and last t2k-oro) -elements 3 directly, and the second, third, ..., (2k ×) of its elements 3 through elements 4 are connected to the inputs of (k + l) -ero rus and the outputs of the k-th rus .

The device works in the following way.

Each g-th output of the k-th russ is connected to two, controlled single and zero inputs, (k + 1) -th rus, (2d-1) -th and 2d -th elements 3, and the outputs of these elements directly (the first and last) and through element 4 are connected respectively to the d-th and 9 + 1-th outputs of the (k + l) -th rus, and if the d-th output of the k-th russ is excited in one state, it is transmitted to the d- or (g + l) are the outputs of the k-th Rus and the output of the device. Accordingly, when excited to the single state of the zero or single input {k +}) - oro of the rus, it is transmitted to the (2d-1) th and 2d-th elements of the 3 (k + l) ororus. The inputs of the first Russ are at the same time their outputs and on one of them there is necessarily a single combination.

Thus, the introduction into the proposed device of additional OR elements and the described links allows solving the problem of parallel counting-decryption of the number of units in a n-bit binary code with a cost of 0.5n (nl) of two-input elements OR and n (n + l) - 2 two-input elements AND, i.e.

 N rMCV) -f)) - 23

diodes. Substituted in the expressions O) and (2), for example, and, we are surely convinced that the proposed device (306, N2 1216) is much simpler known (| 1 12256, N-e 12582440) and can find a wide

yo

application in solving many applied problems of information processing.

Claims (2)

1. Encyclopedia of cybernetics. Kiev, 1974, p. 423, fig. Behind. 2. Reference digital computing. Edited by B. N. Malinovsky. Kiev, Technique, 1974, p. 166, fig. 4.9. PB i n