SU525948A1 - Device for sorting combinations - Google Patents

Description

ki to zero state 14, direct output 15 and inverse output 16, element 17, delay element 18, distributor 19, clock bus 2O, installation bus 21 and bus 22. The device works as follows. The search of a combination of M elements by N is replaced by a search of two combinations, each of which has the full basic combination as the initial ones. A complete basic combination is such a combination, from which M (including the original) of various combinations can be obtained due to the cyclic shift of the initial combination. For example, from the combination / L 111 ... 11000 .... 00 it is possible to get another M-1 combination thanks to its cyclic shift. Basic combinations are selected according to certain rules. For some values of M and values of N (from O to N), all the basic combinations will be equal to: 001111L 0111 3 OlOlllU 4 1111 4 Oil Oil) D M 5 011111 5 00000 About mill 6 00001 1 00011 OOlOl 001114 OlOllj 01111 4 11111 5 For any values of N and M, binary basic combinations are obtained by all the combinations with the corresponding ishch base combinations, For example, for M 6 and 12, the following basic combinations correspond (R 5, T 7): 11OOO 1111000 11111 1OOOO 11OOO 111010O 11110 1100OOO 11000 1110010 11110 1010000 11110 10О100О110ОО 11011OO 111OO 1110000110OO 1101О10 11100 1101OO 10100 1111000 11100 110O1OO1O100 111O10O 11100 11O001O1010O 111O01O 11100 10101OO1O10O 1101100 1101O101OO1O10O 1101100 1101O 110100010000 1101100 11010 1101100 10000 vyv vyyu 11010 1101100 10000 in other 11010 1100010 ). At the same time, the initial basic combinations have the S – T (R + T M) size. The maximum number of combinations that can be obtained from a double base is RT (including the double base combination itself). The order of obtaining all the combinations of double base is as follows. Initially, one of the combinations is shifted cyclically; if it contains T bits, it is shifted (T-1) times, and then the first and second constituent combinations are simultaneously shifted cyclically. This procedure is repeated N times. Consider the operation of the device using the example of iterating combinations with M 12, N 6, H 5 and T 7. Before starting the operation, the device is reset to clay 20. The trigger 12 is set to one, the dispenser 19 is in the first position, and the brute force blocks 2 and 5 to the zero state. The search block 2 has five bits and the first five outputs of memory block 1 are connected to its inputs. The enumeration block 5 has seven bits, and the seven last outputs of the memory block 1 are connected to its inputs. Next, clock pulse starts to arrive on bus 20. Since prior to the arrival of the first clock pulse, trigger 12 is in a single state, the element 17 is opened, and the first clock pulse through the element 17 is fed to advance the distributor 19. The valve 19 is transferred to the second position, and at its first output the impulse that reads the first line from memory 1. The contents of the first line from memory 1 are written in the enumeration blocks 2 and 5. As a result, in the search 2 block there is a basic combination 11111, and in the search 5 block a basic a combination of 1,000,000. Busting blocks 2 and 5 carried out a cyclic shift of their contents. The signal at the control inputs 4 or 7 of the enumeration blocks 2 or 5 appears if all the digits of the enumeration block are all 1 or all zeros from memory 1, and also if the contents of the block are shifted cyclically by a value equal to the block size reduced by one, i.e. for block 2, after shifts, and for block 5, after six shifts. At outputs 3 and 6, enumeration blocks 2 and 5, combinations of twelve elements of six each appear. After the first clock pulse at outputs 3 and 6 of enumeration blocks 2 and 5 there will be the first combination 1111110000OO, Since the pulse from the output of the element And 17 arrived on the delay of the delay element 18, before the arrival of the second clock pulse trigger 12 is in the slit state and the element And 11. The next six clock pulses received via bus 20 will pass through element 11 on advancing the intercepting block and input on element 10. And element 10 will be open if there is a signal on control 7 of block 7 of search 5. Thus, by six subsequent clock pulses, we get the following combinations: Sch110100000 111110010000 111110О01000 11111000010О 111110000010 1111100ОО001 Thus, six cyclic shifts of the search block 5 have occurred. After that, the control input 7 of the search block 5 appears. As there is a signal at control input 4 of block 2, an element 8 is assembled, and on the leading edge of the signal a trigger 12 is moved from its output to a single position and the search blocks 2 and 5 are reset to zero position through the first delay element 9. Next A pulsed pulse through element I 17 of the lane leads the distributor 19 to the third position, and the second row of memory block 1 is read. As a result, at outputs 3 and 6 of enumeration blocks 2 and 5,

is a combination of 1111011OOOOOO.

60 Research Institute busting combinations. The trigger 12 is transferred from the pulse element 18 to the zero state and the W 11 element opens. six times, a control signal appears at control input 7, which opens element AND 10. The next clock pulse will cycle the contents of search module 2 and the contents of search module 5. At the same time, On Go 7 of the search block 5, the signal disappears and the shift by this clock pulse is not included in the calculation of the shift pulses for issuing a signal at control input 7. As a result, we get the next combination 011111100OOO. The next six clocks are sent to advance only the enumeration block 5 and as a result we get six more from twelve six by four: The subsequent six clock pulses cyclically shift only the contents of the enumeration block 5, and so on. as long as the control inputs 4 and 7 simultaneously receive the signals. After that, the contents of the search blocks 2 and 5 are reset and the next clock pulse received via bus 20 advances the distributor 19 to the next position and the next line of memory 1 is read into search blocks 2 and 5. Next, Shifting the contents of the enumeration blocks 2 and 5. This process is repeated until all the rows of memory block 1 have been read and the bus 22 (the last output of the distributor 19) does not receive a pulse signaling the end of the formula and the invention

A device for enumerating combinations containing a memory block whose control inputs are connected to the outputs of the distributor, and the outputs are connected to the corresponding inputs of two enumeration blocks, AND elements, delay elements and a trigger, characterized in that, to increase speed, the inputs of the blocks busting is connected to the inputs of the first element I, the output of which is connected to the reset input of the distributor and through the element delay to the input reset 8

sa of the enumeration blocks, the control input of the First of which is connected to the output of the second element I, one of the inputs of which is connected to the output of the second enumeration unit, and the other input with its control input and with the output of the third element I, one of the inputs of which one from the inputs of the fourth element I are connected to the clock clock, and their other inputs are connected to the corresponding outputs of the trigger, the inputs of which are connected to the output of the first element I and through another delay element to the control input of the distributor and to the output quarter element I.

21 o