JPS59205668A - Electronic sales data processor - Google Patents

Abstract

PURPOSE:To shorten the retrieving time in a register mode by discriminating the number of pieces of sales data in a non-register mode and setting again the memory positions of sales data, etc. so that a large number of sales data is retrieved quickly in a register mode. CONSTITUTION:The keys including a ten-key 1a which feeds the amount data and the PLU (price look-up) number code and a mode change over switch 1d are provided on a keyboard of an input part of an electronic register. In case the switch 1d is set at a Z mode showing the adjustment, the memory format is permuted to rearrange the memory sequence in the row direction of a PLU totalization memory 6M in the order of larger number of sold units. Then the adjustment processing is carried out. In such a way, the format is permuted in the order of larger number of units in a non-register mode. Therefore the PLU number codes are retrieved in accordance with said order for the PLU register at and after the permutation of format. This can shorten the retrieving time.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field of the Invention] The present invention relates to an electronic sales data processing device such as an electronic cash register.

[Prior art]

Conventionally, in electronic cash registers where PLU (Price Look Up) registration is possible, PL'U
A large number of PLU numbers and unit prices are preset for each product in a one-to-one correspondence with the product in the total memory, and
When the PLU number code is entered during PLU registration,
The preset unit price corresponding to the PLU number code is PLU
It is read out from the total memory and registration is executed based on this preset unit price.

[Four problems with the prior art] However, in this type of device, when reading the preset unit price from the PLU total memory, first, the PLU total memory is searched for a number code that matches the input PLU number code. However, in this case, in advance,
The PLU number codes set and stored in the PLU total memory in the order of their addresses are sequentially read out in the order of the addresses above, and this number code is compared with the input number. The farther back the PLU number code is, the more time it takes to search for that PLU number code. As a result, if the product corresponding to the PLU number food that takes a long search time is a low-selling product, there will be no particular problem, but if the product is a very popular product, the search time will take a long time each time the product sells. This has the disadvantage of requiring a long registration time.

[Purpose of the invention]

This invention was made against the background of the above-mentioned circumstances, and its purpose is to search for classification codes such as PLU numbers stored in advance in a storage area such as the PLU total memory at the time of registration. An object of the present invention is to provide an electronic sales data processing device that greatly reduces search time. [Summary of the Invention] In order to achieve the above-mentioned object, this invention sequentially reads out sales data when not registered. The main point is that the classification code and the storage device for the sales data are reset so that the size of the number of items is determined, and based on the results of this determination, items with a large number of items are retrieved quickly at the time of registration. It is something.

[First Embodiment] Hereinafter, a first embodiment of the present invention will be specifically described with reference to FIGS. 1 to 5. FIG. 1 shows a block circuit diagram 2 of an electronic register to which this expansion is applied. The input section 1 of this electronic register includes a numeric keypad 1a for inputting amount data, PLU number code, etc. on the keyboard, function keys for four arithmetic operations, and department keys for specifying product departments, such as cash sales and credit sales. It is configured to include various keys 1b such as transaction keys, a PLU key IC used for inputting a PLU number, and a mode changeover switch 1d for switching between various modes. The mode selector switch 1d is Z (payment), X (inspection), REF (return), REG (registration), 0FF (power 0FF), PRG.
(setting) mode. Key manual data output from this input unit 1 in response to the operation 1 key and mode designation data output in response to each switching position of the mode changeover switch 1d are transmitted via the input buffer IB of the input control unit 2. and is input to the CPU (central processing circuit) 3.

The CPU 3 controls all operations of the electronic register, such as input processing, registration processing, payment processing, etc., and includes a ROM (read only memory) 3a in which various microinstructions are stored in advance; A RAM (random access memory) 3b having an X register for numeric values and Y, Z...N registers for calculation or calculation assistance, and e1m.
The configuration includes an address data storage section 3c having an sn register, an ALU (logical operation circuit) 3d that executes registration operations, judgment operations, etc., and a CN (control section) 38 etc. that outputs instruction data etc. at a predetermined timing. It has become. A bar food reader 5 is connected to this CPU 3 via a bar code input control section 4 . The barcode reader 5 is constituted by a hand scanner capable of manual scanning, and for example, irradiates a black and white barcode recorded on a label with light and converts the difference in reflectance into an electrical signal. This electric signal is sent to the barcode input control section 4 and converted into a logic signal, which is then sent to the CPU 3.
is input. Therefore, in this embodiment, it is possible to appropriately select whether to input data by key operations on the input unit 1 or by using the barcode reader 5 as the data input means.

Further, a sales totalizer 6 is bidirectionally connected to the CPU 3. This sales totalizer 6 is constituted by a RAM, and executes writing and reading operations under the control of the CPU 3. Therefore, the sales totalizer 6 is the PLU total memory lJ6M.
, department, transaction, etc., has a total memory of 6m. The PLU total memory 6M is arranged in the row direction and has a large number of address areas corresponding to addresses "1" to "'N+1", and each address area has a PLU number code that corresponds to the product one-to-one. storage area C
(n), a storage area K(n) for sales quantity, and a storage area T(n) for unit price. In this case, the PLU number code of area C(n) and the unit price of area T(%) are preset data arbitrarily set by the user in advance, and the sales quantity of area K(n) is , is the total sales data that is accumulated every time PLU is registered. Note that the "N+1" address area is an auxiliary address area used for temporarily saving data. In this embodiment, each address area of the PLU total memory 6M is sequentially addressed starting from the initial address 61'', and its contents are read out in the order of the specified addresses.

On the other hand, the amount data etc. output from the CPU 3 are transferred to the display buffer HB in the display control section 7, and then sent to the display section 8, where they are digitally displayed electro-optically. In addition,
The display section 8 uses a fluorescent display tube or liquid crystal. Further, the amount data etc. output from the CPU 3 are transferred to the print buffer PB in the print control section 9, and then sent to the printing section 10, where they are printed on receipt paper and journal paper. Note that the printing unit 10 is configured by a thermal printer or the like.

The electronic register of this embodiment is connected as a POS terminal to a data collection device (not shown) on the head office center side using a telephone line, and is connected to the data collection device side via the transmission control unit 11. In response to a data transfer request signal inputted to the CPU 3 from the CPU 3, the CPU 3 reads various sales data from the sales totalizer 6, and transmits the data to the data collection device side via the transmission control section 11. 6- This allows the data collection device to
Sales data sent from the terminal is aggregated.

Next, set the PLU number code, etc., PLU registration, PLU
The operation at the time of payment will be explained. Here, a case will be described using as an example a case where various data are inputted by key operations on the input unit 1 as the data input means. First, P
To set the unit price corresponding to the PLU number food that specifies the type of product in the LU total memory 6M, switch the mode changeover switch ゝ1d to the rPRGJ position and set it to the setting mode. In this setting mode, the user inputs the PLU number code to be set and operates the FLU key 1c, then inputs the unit price of the product corresponding to the PLU number and operates the PLU key IC. In addition, to perform PLO registration, mode selector switch 1
Switch d to the rREGJ position and set to registration mode. In this registration mode, the PLU number code is entered and the FLU key 1c is operated. Furthermore, the FLU total total memo 9 C mode changeover switch 1d is switched to the "Z" position to set the settlement mode. In this payment mode, PLU
Operate key 1d.

When the PLU key 1d is operated in various modes as described above, the CPTJ 3 starts to perform operations according to the flow shown in FIG. 2. First, in step S1, the set state is determined according to mode designation data output from the mode changeover switch 1d of the input section 1. In this case, in this embodiment, the PLU key IC is operated for the above-mentioned setting "PR", registration "REG",
Since this is a case of three types of payment modes "Z", step S1 is to determine the set state of the three types of modes. Here, if it is determined that the mode is rPRJ mode, the process proceeds to step S, and a process of setting the input data in the PLU total memory 6M is executed.

In other words, the entered PLU @ code and unit price are stored in the corresponding area C(n) of the PLU total memory 6M,
T(n) in turn. This duck match, the input P
LU numbers and unit prices are entered in the order in which they are entered.
They are set sequentially from the initial address area of the LU total memory 6M. Therefore, the user can arbitrarily preset the PLU valley code and unit price of the product desired by the user.

Next, if the rREGJ mode is determined in step S1, the process moves to the registration process according to step Ss-Sa''.Here, steps 83 to S match the input PLU number code. PL the number code
It executes the process of searching from the U total memory 6M. That is, first, the initial address "1" is set in the n register.
) L% Next, read the number code in area C(n) of the PLU total memory 6M that is addressed by the contents of this n register, transfer it to the X register, and then read the number code in this X register. and the number code entered into the X register to check whether they match or not. If rNOJ, increment the contents of the n register by 1, and then return to step S4L. Therefore, the search process in this case is executed by sequentially reading out the number codes from the PLU total memory lJ6M starting from the initial address. On the other hand, in step S, r
If the answer is ``YES'' and the corresponding secular code is retrieved, the process proceeds to step S, where the unit price corresponding to the retrieved number code is read out. According to the read unit price, in the next step S8, the unit price is added to the subtotal register, and the unit price is sent to the display section 8 to be displayed digitally, and also sent to the printing section 10 and printed on receipt paper. Ordinary PLU that prints on journal paper and increases the number of sales in the PLU total memo IJ6M by 1.
Registration processing is executed.

Furthermore, if it is determined in step S1 that the mode is "Z", the process first proceeds to steps S to S13, and P
After executing the memory format reorganization process of rearranging the storage order in the row direction of the LU total memory lJ6M in descending order of the number of sales, the process proceeds to step SI4, where a settlement process is executed. That is, the above reorganization process first sets the initial address "'1" in the e register, and then sets the P L
Among the address areas of the U Hf memory 6M, execute the process of searching for the address area with the largest number in the area K(n) after the address value e (the process of flow A shown in the 31st ffl(A) described later). After that, the FLU number code, quantity, and unit price in the address area searched by this are sent to Elina C (g), K specified by the address value e.
(6), processing to write to T(g) (third [ff1(B)
Flow B processing shown in ) is executed.

After incrementing the contents of the e register by 1, the contents of register 4 become P.
, is the final address value N of the FLU total memory 6M. If "NO" here, the process returns to step Stc. This kind of processing is the final dress value N
As a result, the data in the PLU total memory 6λx, which was arbitrarily preset in step S2 described above, is rewritten in descending order of the number of units sold. Figures 4(A) and 4(B) show this state. As shown in Figure 4(A), PLU number codes " 1
01J, [102J..."515J is moved from its initial address to area C(n
), and if the number of units sold in area K (n) is as shown in No. 41 J (A), the contents of the PLU total memory 6M will be as follows by executing the memory format reorganization process described above. As shown in Fig. 4(B), the initial address area is set with data containing the maximum number "124", and the address area of 415J is set with data containing the minimum number rOJ. When such reorganization processing is completed and rYEsJ is determined in step SI3, the process moves to the settlement processing in step SI4.Here, first, P
The contents of the LU total memory 6M are read out in descending order of PLU number and printed on journal paper as shown in FIG. That is, the PLU number, e.g.
Corresponding to PLJ, sales quantity r12J, sales amount “24
00" is printed for each PLU number. In this case, the sales amount is obtained by multiplying the number of units sold by the unit price each time the PLUZ number is read. Next, the contents of the PLU total memory 6M are sent 5 to the data collection device via the transmission control unit 11, and the contents of the PLU total memory 6M are
Each sales quantity is cleared respectively.

Next, with reference to FIG. 3(A), the processing of Flow A in Section 1 will be explained in detail. In this case, a specific explanation will be given based on the memory format shown in FIG. 4(A). First of all,
In step S1, the contents of the e register, initially an initial address "1", are set in the m and n registers, respectively. Next, the number data is read from area K(m) of the address area specified by the contents of the m register, and is set in the X register as the maximum number data up to the present time (step S2). Initially, the X register contains the initial 7')
- The number data "12" in the response area is set. Next, the number data rOJ is read from area K(n + 11) of the next address area specified by adding 1 to the contents of the n register, initially from K(2), and is compared with the contents of the X register. It is set in the X register as comparison data (step S).

The thus set X and the contents of the X register are compared in the next step S4, and it is determined whether the contents of the X register are greater than or equal to the contents of the X register. In this case, since "12" is set in the X register and "0" is set in the X register, the determination is "YES" and the process proceeds to the next step S. Here, `` executes the process of transferring the address data of n+1 to the n register, and as a result, in the next step S6, the contents of the n register are transferred to the PLU.
It is determined whether the final address value N of the total memory 6M has been reached. In this case, since the determination is "No", the process returns to step s3 and the process of searching for the maximum number is repeated. In the memory format of Fig. 4 (A), if piece count data larger than the number ``12J'' is stored in the address area ``33'', until this piece count data ``124'' is set in the X register. The voltage detection operation is repeated. When this number data "124" is set in the X register, rNOJ is set in step s4.
Therefore, the process sequentially proceeds to step 571S8. This step s7 transfers the contents of the X register to the X register and rewrites the maximum number data up to the present time, and step S8 transfers the address value km register of the area where the maximum number data was stored. It is to be transferred. Therefore, in this case, the contents of the X register are "124J" and the contents of the m register are "66". Then, the process returns to step S, and the above-described operation is repeated until rYEsJ is determined in step S6.

Now, after the address area "63", the number 1-124J
If there is no larger one, the contents of the X and m registers remain unchanged without being rewritten. In this way, the maximum number and the address area in which it was stored are retrieved.

Next, the processing of the above flow B will be explained in detail with reference to FIG. 3(B). In this case, a specific explanation will be given based on the memory format shown in FIG.

First, in step S, it is determined whether the contents of the m and n registers are equal.

Here, the case where it is determined "NO" means that the address value g
This is a case where there is no number larger than the number data corresponding to the address value e in the subsequent area. In such a case, the subsequent processing is invalid, but if there is, the contents of the m register are written. Since it has been changed, the determination is "YES" and the process proceeds to the next step s2. This step S2 is m
Areas C(m), K specified by register contents
(m), data in T(m) to address value (n+1'
), the auxiliary areas C(N+1) and K(N
+1), and executes the process of saving to T(N+1).

In this case, the contents of the m register are "36", so the areas with address value 33 are C(33), K(33), and T<3.
The contents of 3) are saved and the corresponding engineering space becomes blank.

By forming such a blank area, in the next steps 83 to S6, the data from the area with address value l to the blank area with address value m is incremented one address at a time to fill the blank area, and the address value is e
Shift processing is executed to make the area blank. That is, in step $3, each area C(m), K(m), and T(m) specified by the contents of the m register is
Previous area C(m-1), K(m-1), T(m-1
) is executed. Next, in step S4, the 7' address °'m-1''' is transferred to the m register. Next, in step S, m and l
It is determined whether the contents of the registers match, in other words, whether the process of shifting the data in the area of address aa e has been completed. If "NO", step S is performed.
3, and the above-described operations are repeated until the process is completed.

If it is determined "YES" in step S6, the process proceeds to step S, and areas C(N+1), I
((N+1), T(N+1)c Area C(a, K(of, T(d)
will be forwarded to. As a result, for example, as shown in FIG. 4(B), the data stored in the area with the address value 1'33'' will be written into the corresponding area with the initial address value ``1'°. 0 Such processing is performed at step 8 of the flow shown in Figure 6.
As a result of being repeated until rYEsj is determined in step 13,
The storage order shown in FIG. 4(A) is reorganized in descending order of the number of items as shown in the memory format of [W(B)]. Therefore, in the PLU registration after reorganization, the PLU number hood is searched in that order, so the search time can be significantly shortened.

[Second Embodiment] Next, a second embodiment of the present invention will be described with reference to the flowchart shown in FIG. This embodiment is a simplified version of the first embodiment, in which each quantity data is compared with a predetermined reference value (average number of units sold) to determine its size, and if A is larger than the reference value. The number including the number is reset in the upper address area G of the memory, and the number /h is reset in the lower address area.

In the settlement mode, when the PLU key is operated, the force 5 action force 5 according to the flow shown in Fig. 6 is executed. First, in step S1, the total number data in the PLU total memo 1) 6M is read out. In the next step S2, the average value (reference value) is calculated and transferred to the X register (based on the calculation result data number). Next, in step S3, the PLU total memory 6
The initial address value of M is also stored in the IEn register.
Initialize to set the winter address value N in the m register respectively 1'''''''Real 0816.00'' 3.1
108'') IJ 6~i upper side address area is n
The lower address area is addressed by the contents of the m register, and the lower address area is addressed by the contents of the m register, but both address areas are not fixedly set in advance and are based on the above average. The range changes depending on the comparison result with the value.

After the above-mentioned initialization process is completed, steps S4 and S are sequentially executed. That is, in the area K (m) specified by the contents of the n register, first, the number data is read from the area with the initial address "1",
The data is transferred to the Y register and compared with the average value data in the X register to determine whether the data is greater than or equal to the average value. Here, “YE
If it is determined that "S", proceed to step S+O, and
After incrementing the contents of the register by 1 (carrying down the address), the process returns to step S4. Then, if the number data less than the average value is retrieved and it is determined "NO" in step S5, the above-mentioned Stella 7'
Step S6 to perform the same processing as S l+ and Sa
, S progresses to area K(m) specified by the contents of m register, At first, the number data is read from the area of f1 end address "N', transferred to Z register, and stored in X register. It is determined whether or not it is less than the average value by comparing it with the average value data.If it is determined as YESJ, the process proceeds to step 811, where the increment processing (carrying up the address) of the contents of the m register by -1 is performed. ) is executed, and at the same time, in the next step 812, a judgment process is executed to determine whether the address value of the m register is greater than or equal to the address value of the n register, and the judgment is "NO" here. and,
The process returns to step S6. Then, if the number data equal to or greater than the average value is retrieved, and it is determined in step S that "rNO" is determined, the process proceeds to step S8.

Therefore, step S8 is executed when the number data of less than the average value is retrieved in step S, and the number data of more than the average value is retrieved in step S, respectively.

As a result, in step S8, areas C(m), K
(m), contents of T (m) and areas C(fi), K (
n) and T (n), data containing 2 items less than the average value is transferred to the lower address area, and data containing more than the average value is transferred to the upper address area. This reorganization process is executed.

The contents of the a and m registers are decremented by 1 and the address is incremented (step S,), and then the address is decremented (step S+o). 'i: After sequential execution,
The process returns to step S4. When such processing is repeatedly executed and the address value of the m register becomes greater than or equal to the address value of the n register, it is determined that step S, r[YEsj, and the process moves to step S13, where the payment process similar to the first embodiment is performed. is executed.

In this embodiment, if the number data specified by the address value of the n register is above the average value, it is left as is, but if it is less than the average value, it is specified by the address value of the m register. Since the number data determined to be equal to or higher than the average value is set, the upper address area will be set to the average value or higher, and the lower address area will be set to the lower than the average value. . Therefore, such block division can also significantly reduce the search time during PLU registration.

In each of the above embodiments, the reorganization process of the PLU total memory is performed at the time of checkout, but if the PLO registration is not performed, the total sales number is It may be any time, such as when a certain value is reached or when a predetermined period of time has elapsed.

Further, in each of the above embodiments, the unit price is preset in the PLU total memory, but in the memory for each product number, only the product code may be preset and the unit price may not be set. Furthermore, the memory is not limited to rtAM, but may also include magnetic tape, FDD (floppy day disk), and the like.

Furthermore, in the explanation of the operation of each of the above embodiments, an example was given in which the key was manually assembled as the data manual means, but the same applies to the case where the barcode reader 5 is used.
R (optical character reading device@) etc. can also be implemented.

In addition, in the second embodiment, the reference value is the average value of all the numbers, but the reference value can be set in advance by the number setting operation.
・It may be a method of determining Also, f? The LU total memory is divided into two address areas, upper and lower.
For example, multiple reference values may be provided and the blocks may be divided into smaller blocks. In this case, it is possible to perform processing substantially similar to the flow shown in FIG. 6.

In addition, the method of determining the size of the number data and resetting it in ascending order can be modified and applied in various ways without departing from the scope of the present invention. Further, the present invention is not limited to electronic cash registers, and may be applied to other sales data processing devices.

〔Effect of the invention〕

As explained in detail above, this invention, at the time of non-registration,
While reading the sales data sequentially, it determines the size of the number of items, and based on this determination result, the classification code and sales data are stored and reset so that items with a large number of items can be searched quickly when registering. Because of this, the search time at the time of registration can be significantly shortened, and the registration process can be performed quickly.

[Brief explanation of the drawing]

Figures 1 to 5 show a first embodiment of the present invention, with Figure 1 being a block circuit diagram of an electronic cash register to which the invention is applied, Figures 2 and 3. is a flowchart to explain the operation), the fourth [J(5), ■
5 is a memory format, FIG. 5 is a print format, and FIG. 6 is a diagram 7 for explaining the operation of the second embodiment of the present invention.
0-Chart. 1...Input section, 3...CPU, 3a.
...ROM. 3b...RAN, i, 3C...Address data storage section, 3d...Logic operation circuit, 3e
...Control unit, 6M...PLU total memory. Patent applicant Casio Computer Co., Ltd. Figure 2 Figure 3 (A) Figure 3 (B) Figure 5 Figure 6

Claims (1)

[Claims] a storage means for storing a classification code and sales data including sales quantity data corresponding to the classification code, and for searching in a predetermined order for classification codes that match the classification code input at the time of registration; a determination means for reading out the sales data and determining whether the number data is large or small when the sales data is not being used; and based on the result of this determination, the classification code and the storage location of the sales data are searched faster for the one with the larger number take. an electronic sales data processing device comprising: a setting means for resetting the order in which the data is to be processed;