JPS59202028A - Combination selecting device of combined balance - Google Patents

Abstract

PURPOSE:To shorten selecting time of combination by a parallel processing through distribution with a combination pattern of combination computation of each measuring value. CONSTITUTION:Per each address from on address counter 5, a combination pattern generating units 6a-6c deliver different partern signals allowing a measuring value selectors 7a-7c to be controlled. And, combinations of measurements of each item subjected to be measured is selected through a hopper by passing through balances 21-2n from memory elements 41-4n selected by selectors 7a- 7c. These combined measuring values are subjected to additional computation in parallel by computers 9a-9c and combinations nearest to the pre-set weight by a target weight setter 8 are selected. Further, after selection by these individual computers 9a-9c, the combinations nearest to the preset weight are selected by an overall computer 10. By the parallel computing process involving a plurality of computers, selection time of combination is shortened.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention involves weighing individual items such as confectionery, fruits, vegetables, etc. (hereinafter referred to as lumps), and weighing them to obtain the desired weight. The present invention relates to a combination selection device for a combination weighing machine used to find an optimal combination and ultimately pack a plurality of lumps into bags.

Even if an attempt is made to group a set amount of lumps whose individual weights vary, the individual weights will vary, resulting in variations in the cumulative value and an error between the set weight and the set weight. For this reason, a combination weighing device has conventionally been used as a device that always reduces the error from the set weight as much as possible and gathers all the weights together.

That is, in the combination needle rat device, as shown in FIG. 1, a plurality of lumps are sequentially supplied to a plurality of weighing hoppers 11 to 1n, and measuring devices 2□ to 2n provided for each weighing hopper 1□ to 1n, Weigh each of the plurality of contained lumps, input the measured values of each weighing device 2□ to 2n into the calculator 3, calculate the combined weight for each combination, and calculate the combined weight of all the combinations obtained by the calculation. The combination of weighing hoppers with the smallest difference from the set weight is selected. Then, the lumps in the plurality of weighing hoppers in the combination selected in this way are discharged into the collecting chutes and collected together.

However, in conventional combination weighing devices of this type, all combination calculations are performed by one computing unit, so when there are many weighing hoppers, the number of combinations is extremely large and the calculation time becomes long. There were drawbacks.

SUMMARY OF THE INVENTION An object of the present invention is to provide a combination selection device for a combination weighing machine that overcomes the above-mentioned drawbacks and enables combination selection in a short time.

An embodiment of the present invention will be described below with reference to the drawings. FIG. 2 is a schematic configuration diagram showing an embodiment of the present invention.

In the same figure, reference numeral 4 denotes an actual measurement value storage circuit, in which each measurement value signal 01 to Gn is sent from each weighing device 21 to 2n for measuring the weight of the object to be weighed in each of the N weighing hoppers 1□ to 1n. It is provided with N storage elements 41 to 4-n, each for temporarily storing . 5 is an address counter that sequentially generates address values consisting of binary numbers. Numerals 6a, 5b, and 5c store in advance different non-overlapping combination patterns of weighing hoppers corresponding to addresses, and each time an address signal from the address counter 5 is received, N represents a different combination pattern corresponding to the address. It is a combinatorial pattern generator that generates a signal of bits.

FIG. 3 shows an example of combination patterns stored in advance in the combination pattern generators 6a, 6b, 6C in correspondence with addresses.

For example, the combinatorial pattern generator da corresponds to a binary number of 1 consisting of N bits of 5 address counters.

6b and 6c each store a binary number of 1.2.3, and corresponding to the binary number of 2 of the address counter 5, a combination pattern generator (5a, 6b, 6c stores a binary number of 4.5.6, respectively).
Combination pattern generators 6a't6b and 6c store binary numbers 7, 8, and 9 in correspondence with the binary number 6 of the address counter 5, and similarly, the output of the address counter 5 is 1. Each increase is 10.11.1 in binary
2, ... and three combination pattern generators Qa,
It stores the values assigned to 6b and 5c in order. That is, if the binary number of the address counter 5 is p, then the combination pattern generator Oa is 3X(p-1)+1, the combination pattern generator 6b is 3X(p-1)+2, and the combination pattern generator Oc is 3X( p-1)+3 binary numbers are stored in correspondence.

7a, 7b, and 7c are combination pattern generators 6, respectively.
Upon receiving the combination pattern signals from a, 6b, and 60, N
This is a metric value selector that selectively passes the metric value signals G□ to Gn stored in the storage elements 41 to 4-n corresponding to each bit that is "1" in the bit combination pattern signal. 8 is a target weight setting device, 9a, 9b, 9c are memory elements 4
The measurement value selector 7 a selects the measurement value signals 01 to Gn stored in the addresses 1 to 4n for each address signal of the address counter 5.
This is an arithmetic unit that adds the combination selected by %7b%7C and stores the added value (combination M amount) closest to the target weight set in the target weight setting device 8 and its combination pattern.

Reference numeral 10 denotes a general calculator which compares the combination weights stored in the calculators 9a, 9b, and 9c, selects the combination weight closest to the target weight, and outputs the combination pattern.

Next, the operation of the combination sorting device according to the above embodiment will be explained.

First, a target M electric value is set in the target weight setting device 8.

Subsequently, the objects to be weighed are supplied to N weighing hoppers 11 to 1n. Each weighing hopper1. Measuring device 2 installed every ~1n
Measurement value signals G□-Gn are outputted from 1 to 2n, respectively, and stored in the memory storage elements 4-1 to 4-n of the measurement value storage circuit, respectively. The measured value signals 01 to Gn are input in parallel to selectors 7a, 7b, and 7c.

On the other hand, the address counter 5 has an address value of 1.2 in binary.
．． 6, ......, the combination pattern generators 6a, Ob, 6C sequentially output the N-bit combination turn signals shown in FIG. Output to 7a, 7b, 7C. The weighing value selectors 7a, 7b, and 7C first select the weighing values of the storage elements corresponding to the bits that are 1 of the N-bit combination pattern signals from the combination pattern generators (3a, 5b, and 6C) to the computing unit 9a, respectively. , 9b, and 9C are selectively passed.

That is, as shown in FIG. 6, when the output of the address counter 5 is, for example, a binary number 1 (exit...0001), the output signal of the combination pattern generator 6a is 0...
Based on 0001, only the measurement value signal G1 is input to the calculator 9a, and the calculation result G□ is obtained, and the output signal of the combination pattern generator 6b is output to the calculator 9b...0010
Only the weighing value signal G2 is input based on the calculation result G2.
is obtained, and the arithmetic unit 9C receives G□, G2 based on the output signal O...0011 of the combination pattern generator 6C.
is input and the calculation result G, +02 is obtained.

In each of the calculation units 9a, 9b, and 9C, the address value output from the address counter 5 is sequentially counted up from 1 until it reaches 2n/6, and the combination weight is calculated in parallel and sequentially in the combination pattern corresponding to the address. , the combination weight and combination turn closest to the target weight input from the target weight setter 8 are updated and stored.

Address counter 5 starts from address 1 and is 3
The combined weights of seeds are compared and the combined weight that is closest to the target weight is output. Then, the weighing hoppers corresponding to this combination pattern are opened and the weighing hoppers are collected together.

Like this (=6 combination pattern generators 6a.

Three computing units 9 based on the combination pattern of 6b and 6C
Since a, 9b, and 9C perform calculations in parallel, the calculation speed is reduced to one third of that in the conventional case.

In the above embodiment, processing is performed in parallel using six rows of combination pattern generators and arithmetic units, but the number can be arbitrary as long as there are more than one, and if there are P arithmetic units, the calculation time will be reduced to 1/P. be shortened.

Further, in the above embodiment, a case is shown in which all the combination patterns from ncm to nCn are stored in the combination pattern generators 6as6b and 6c in advance, but there are cases where the combination pattern does not yield a combination weight close to the target weight, for example, n weighing hoppers. By storing combination patterns in which combinations such as n-1 combinations, combinations of only two items, combinations of only one item, etc. are excluded in advance, the calculation time can be further reduced.

In the above embodiment, the arithmetic units 9 a % 9 b 19
Although each measured value is added in step c, each measured value may be subtracted from the target weight value to obtain a combination pattern that is closest to zero.

In addition, as a combination using the weighing hopper, if the weighed object is discharged and stored in the memory hopper and the weighing hopper is used to weigh the next object, select a combination from both the weighing hopper and the memory hopper. You can also do it like this.

As described above, the present invention can distribute the combination calculation of each measurement value to a plurality of calculation units according to the combination pattern and process them in parallel in time, so that the calculation time can be significantly shortened.

[Brief explanation of the drawing]

Figure 1 is a schematic configuration diagram showing a conventional combination weighing device, Figure 2
The figure is a block diagram showing one embodiment of the present invention, and FIG. 6 is a diagram showing an example of a combination pattern. 11-1n...Weighing hopper, 21-2n...Measuring instrument, 3... Arithmetic unit, raw...Measuring value storage circuit, 7I-1
~Cow. ...Storage element, 5...Address counter, 5
a, 5b, 5c... combination pattern generator, 7a, 7
b, 7C1...Measuring value selector, 8...Target weight setting device, 98% 9 bs, 9C...Calculating unit, 10...
...Comprehensive arithmetic unit. Patent applicant: Anritsu Electric Co., Ltd. Agent: Makoto Hayakawa, patent attorney

Claims (1)

[Claims] a weighing value storage circuit for storing weighed values of objects to be weighed supplied to a plurality of weighing hoppers; an address counter for selecting a combination pattern of weighing hoppers; a plurality of combination pattern generators that generate stored combination pattern signals of different weighing hoppers; provided corresponding to each of the combination pattern generators, each receiving a combination pattern signal value from each of the combination pattern generators; a plurality of weighing value selectors for selecting the weighing values stored in the storage circuit for each weighing hopper corresponding to the combination pattern; a plurality of computing units that calculate a combined weight by adding or subtracting each weighing value selected by the above, and output the optimal combined weight closest to the target weight and its combination pattern; A combination selection device for a combination weighing machine, comprising a comprehensive computing unit that compares combination weights and selects a combination turn closest to a target weight.