JPH0754356B2 - Calendar device - Google Patents

Description

TECHNICAL FIELD The present invention relates to a calendar device that automatically counts and displays years, days, and days of the week in addition to hours, minutes, and seconds.

(Prior Art) Conventionally, as this type of calendar device, for example, a memory for storing data, an input device for correcting time and date, a display device for displaying time, date and day of the week, and arithmetic processing A central processing unit (hereinafter referred to as a CPU) that controls the memory, the input device, and the display device as well as
Those with and have been proposed.

This type of calendar device uses the CPU to carry the minutes in 60-second cycles and the hour in 60-minute cycles for 12 hours or
In addition to performing a counting operation for one cycle in 24 hours, it has a day display function of a 7-ary cycle and displays it on a display device. In addition, the CPU counts the dates to find the month, adjusts the end of the big month and the end of the small month, and adjusts the leap year at the end of February to display them on the display device. Here, the leap year is detected by a method in which the year that is divided by 4 is the leap year, and the end of February is adjusted based on the detection result. Furthermore, the calculation of the day of the week is also calculated and displayed by the correspondence between the number of days from the reference date and the day of the week.

(Problems to be Solved by the Invention) However, in the calendar device having the above configuration,
It is easy to count the minutes, seconds, and days of the 7-day cycle and display them, but since the date display and the counting function that switches from the last day of the month to the first day of the next month are complicated and not sufficient, You have to manually fix them as
It was a disadvantage.

SUMMARY OF THE INVENTION The present invention provides a calendar device that solves the problems of the above-mentioned conventional techniques regarding the complexity of the date display and the counting function for changing from the last day of the month to the first day of the next month, and the necessity of correction due to it. .

(Means for Solving Problems) In order to solve the above problems, the present invention relates to a calendar device including a memory, an input device for time and date correction, a display device, and a CPU, and a fixed year. Period (eg,
Data between leap years in the year 1904 to year 2096) and the day of the week of January 1st of that year, and the day of the week data of the first day of the month (1st) corresponding to the day of the week of January 1st ,
In addition to being stored in the memory, a program for causing the CPU to sequentially execute the following first to fifth processes is stored in the memory.

Here, the first process is to add the date by one day when the carry is made from 11:59 pm to 0:00 am, and if it is December 32, the date is January 1, the following year, otherwise. The second processing determines whether or not the year is a leap year, and if the year is not a leap year, a year that is close to the year is requested, and the third processing If the year is a leap year, the day of the week of January 1 of the year is calculated based on the corresponding data. If the year is not a leap year, the leap year close to the year and January of the year based on the corresponding data. It asks for the day of the week. In the fourth processing, the addition result in the first processing is corrected at the end of the month, the month and day of the year are calculated, and the first day of the month is calculated based on the day of the week data. The fifth processing is The day of the week on the date is calculated.

(Operation) According to the present invention, since the calendar device is configured as described above, by executing the first to fifth processing programs by the CPU, leap year determination and day of the week calculation are facilitated, and thereby, every day. It is possible to display the date and change the daily change operation from the end of the month to the first of the following month. Therefore, the above problems can be eliminated.

(Embodiment) FIG. 1 shows in detail an operation flowchart of a calendar device showing an embodiment of the present invention, in particular, leap year conversion / month, day addition / day of week calculation operation. FIG. 2 is a schematic configuration diagram of a calendar device that performs the operation of FIG.

The calendar device shown in FIG. 2 has a microcomputer 1 for counting time and date, and the microcomputer 1 has a time and date correction key 2 as an input device and a time, date and day of the week display as an output device. Display device 3
And are connected. The microcomputer 1 includes a CPU that performs various kinds of arithmetic processing and the like, and a memory that has a flag and that stores a program for executing the operation flowchart of FIG. 1 and read-only memory data (hereinafter referred to as ROM data). The CPU in this microcomputer 1 is
Input reference signal φ according to the program stored in the memory
Seconds, minutes, hours, months, and days are counted based on, and the time from 23:59 to 0:00 for a 24-hour counter, or from 11:59 pm for a 12-hour counter It has a function to automatically count the date when it is 0:00 pm. The time, date, and day of the week output from the computer 1 are displayed on the display device 3.

FIG. 3 is a diagram showing correspondence data between a leap year and a day of the week of January 1. In this figure, for example, 1904 to 20
The correspondence between the leap year of 1999 and the day of the week of January 1st of that year is shown. Here, Z ₀ is the day of the week on the first day of the leap year, and Z is numerical data corresponding to each day of the week.

As is clear from Figure 3, leap year 1 from 1904
The day of the week on the first day of the month has a cycle of 24 years. Then, such corresponding data of FIG. 3 is stored in advance in the memory in the microcomputer 1 of FIG.

FIG. 4 is a correspondence diagram between the numerical data Z and the day of the week in FIG.

FIG. 5 is a diagram showing the day of the week data of each month corresponding to the day of the week of January 1. In addition, () in the figure shows the day of the week in a leap year. As you can see from this figure,
The day of the week on January 1st of each year can be easily found. Such day-of-week data is also stored in advance in the memory of the microcomputer 1 shown in FIG.

If the first day of each month is Sunday, the 10th must be Tuesday and 20
The day is always Friday, and the 30th is a must. Such correspondence can be easily expressed as a difference of the numerical data Z by using the numerical data Z of FIG.

Next, the automatic date counting operation of the calendar device of FIG. 2 will be described with reference to FIG.

The flowchart of FIG. 1 includes the first to fifth processing procedures, and the microcomputer 1 of FIG.
Carry out the minutes in seconds, carry the hours in 60 minutes, and perform one counting operation in 12 hours or 24 hours. In the 12-hour counter, the digits from 11:59 pm to 12:00 am When rising,
In the 24-hour counter, the first process starts at the carry from 23:59 to 0:00.

The first process consists of steps 10 to 13, and the first step is
In step 11, the date is added, and then in step 11, it is judged whether it is December 32 or not. If it is December 32, the year is added in step 12 and set on January 1 of the following year. If it is other than the 32nd of the month, proceed to step 13 together with the added year, month and day. In step 13, initial data is set in x in 1904, y in the current year, that is, the current year, and 0 in the cycle Z ₀ of the day of the week of January 1 of the leap year, and the second process is performed.

The second process is composed of steps 20 to 25, step 26 branching from step 20 and steps 27 to 31 branching from step 21. In steps 20 to 25, it is determined whether the current year y is a leap year. If it is a leap year, the leap year flag of the memory in the microcomputer 1 is set in step 26 to proceed to the third processing. If it is not a leap year, in steps 27-31 it is less than the current year y and It is determined which year is the closest leap year, and the process proceeds to the third processing.

The third process is composed of steps 41 to 45. In step 41, it is judged whether or not the current year y is a leap year, and if it is a leap year, the corresponding data of FIG. 3 stored in the memory of the microcomputer 1. Since the day of the week of January 1 of the current year y can be determined, the process proceeds to the fourth process as indicated by the symbol x in FIG. If the current year y is not a leap year in step 41, steps 42 to 45 perform the cycle Z _{0 of} FIG. 3 and the numerical data of FIG. 4 on the day of January 1 of the closest leap year obtained in the second process. Corresponds to Z and the numerical data Z
To correspond to the current year y. This makes the current year y
Since the day of the week of January 1 is determined, the process proceeds to the fourth process.

The fourth processing is composed of steps 50 to 54, and at the step 50, the month and day end correction processing including the leap year added in the first processing is performed. For example, 2 for leap years
The month end correction of each month is performed like 28th of February, 29th of February, and 1st of March of February 29. Since the current year, month, and day are determined here, in step 51, it is judged from the day of the week data shown in FIG. If it is not a leap year after judging whether or not it is a leap year, the routine proceeds to step 54, and if it is a leap year, step 53 adds 1 to the day difference value a from the first day of the relevant month and proceeds to step 54. Step 54
Then, the day difference value a on the 1st day of the relevant month is added to the numerical data Z on the 1st day of the relevant year by the seven-digit correction (Z + a). With this, the day of the week corresponding to the current year, month, and day can be determined, and the process proceeds to the fifth process.

The fifth processing is composed of steps 60, 61, 62-1 to 62-4, 63, and based on the relevant year, month, day, month, day data, step 60.
Then, the day difference value b of the first digit of the day is calculated, and then step 61
The day difference value c of the tenth digit of the day is determined by the following, based on the day difference c, the seven-decimal correction addition value E is obtained in steps 60-1 to 62-4, and the numerical data Z and the addition value E are calculated in step 63.
And 7-ary correction addition is performed. As a result, the day of the week can be determined, and the date counting operation is completed. Upon completion of the date counting operation, the microcomputer 1 causes the display device 3 to display the current year, month, day and day of the week. The display device 3 also displays the time as in the conventional case.

Here, two specific examples (1) and (2) of the date counting operation will be described.

(1) February 12, 1987 (Thursday) 11:59 pm to February
Date counting operation at 0:00 am on 13th (Friday) (i) First processing In step 10, February 12 is incremented by +1 to February 13. In step 11, it is judged whether it is December 32 or not. Since it is not December 32, the process moves to step 13, and in this step 13, the initial data is set to set the base year x = 1904, the day of the week of January 1, leap year. The cycle Z ₀ = 0 and the current year y = 1987.

(Ii) Second processing In step 20, it is determined whether x = y. Since 1904 ≠ 1987, the process proceeds to step 21. In step 21, it is determined whether y <x. Step for y = 1987> x = 1904
In step 22, x + 4 = 1904 + 4 = 1908 is added, and in step 23, the cycle Z ₀ is added, and Z ₀ = Z ₀ + 1 = 0 + 1
After setting = 1, it is determined in step 24 whether the cycle Z ₀ (= 1) is 7. Since Z ₀ ≠ 7, the process returns to step 20 and the above operation is repeated. The operations of steps 20 to 25 are repeated a plurality of times, and when the reference year x = 1988, the process moves to step 21 through step 20, and in this step 21, y = 1987 <x
== 1988, so move to step 27. Moving from step 20 to step 26 without moving to step 26 means that the current year y = 1987 is a normal year, not a leap year. At this time, the cycle Z ₀ is set to 0 in step 25.

After the average year flag of the memory is set in step 27, the reference year x (= 1988) is subtracted in step 28, and x = x
-4 = 1988-4 = 1987, and in step 29, the cycle Z ₀
(= 0) is subtracted, Z ₀ = Z ₀ −1 = 0−1 = −1 is set, and the process proceeds to step 30. In step 3, it is judged whether or not the cycle Z ₀ = -1, and because of yes, in step 31, the cycle Z _{0 =}
(= -1) is set to 6. By the operations of steps 27 to 31, it is determined that the leap year that is less than the current year y = 1987 and is the closest is 1984.

(Iii) Third processing In step 40, the value of the cycle Z ₀ is determined, and since Z ₀ = 6, the cycle Z ₀ is set to 0, and the leap year x obtained in the second processing x
Cycle Z _{0 in} Fig. 3 on the day of January 1st (= 1984)
The value is associated with the numerical data Z value in FIG. Next, at step 41, it is judged whether or not the current year y = 1987 is a leap year. Since it is a normal year, the routine proceeds to step 42, where the numerical data Z = 0 in FIG. 3 when Z ₀ = 6 at step 40 Then, in step 42, +1 is added to Z = Z + 1 = 0 + 1.
After setting = 1, in step 43, the numerical data Z is incremented by +1
Addition is performed to set Z = Z + 1 = 1 + 1 = 2. In steps 42 and 43, the addition operation of the 7-ary correction is performed. Next, in step 44, the current year y = 1987 minus -1 is subtracted,
After setting y = y-1 = 1987-1 = 1986, in step 45, x
= Y is determined. Since x = 1984 and y = 1986, the process returns to step 42 and the operations of steps 42 to 45 are repeated a plurality of times. When y = 1984 and Z = 4, step 45
Then x = 1984 = y, and the process proceeds to the fourth process. In these steps 42 to 45, the numerical data Z in the normal year is set to the current year 1987.
The current day of January 1987 is determined as the day of the week (= Thursday).

(Iv) Fourth process In step 50, the end of the month and day added in step 10 is processed. However, since the result of addition in step 10 is February 13, the end of month processing is skipped and the process proceeds to step 51. The process moves to this step 51, and this step 51 determines the month. Two
Since it is a month, the day-of-the-week difference value a of the corresponding month (= 2) is a =
As step 3, in step 54, the seven-digit correction addition of the numerical data Z on January 1 of the corresponding year (= 1987) Z = z + a = 4 + 3 =
Perform 7 → 0. From FIG. 4, since the numerical data Z = 0 is Sunday, the day of the week (February 1) in the current year (1987) (=
Date) can be determined.

(V) Fifth processing This processing is to determine the day of the week on February 13, firstly in step 60, the day difference value b = 3 for the 1st digit “3” of the day on the 13th is obtained, and then in step 61. Calculate the day difference value C = 1 of the 10th place of the day on the 13th, and the corresponding step
In 62-2, the 7-ary correction addition value E = b + 2 = 3 + 2 = 5 is calculated. After that, in step 63, the seven-digit correction addition Z
= Z + E = 0 + 5 = 5, and this numerical data Z = 5
From FIG. 4, it can be determined that the 13th day is Friday, and the date counting operation is ended.

(2) 19:00 pm, Monday, February 29, 1988 (leap year)
Date counting operation from 59 minutes to 0:00 pm on Tuesday, March 1st (i) First processing If +1 day is added to February 29th in step 10, it becomes February 30th, and x = in step 13 1904, y = 1988, set Z ₀ = 0.

(Ii) Second processing Steps 20 to 25 are repeated a plurality of times, and when x = 1988 and Z ₀ = 0, the determination x = y in step 20 becomes YES, it is determined to be a leap year, and in step 26, the leap year flag in the memory. Is set and the process proceeds to the second process.

(Iii) Third process Since Z ₀ = 0 in step 40, it is set to Z = 5, and the leap year determination in step 41 results in YES, and the code x
The process proceeds to the fourth process as shown by.

(Iv) Fourth processing Since the end of the month processing is performed in step 50, February 30 is corrected to March 1, and in step 51 the day difference value a corresponding to March is set.
= 3 is required. Next, since the leap year determination in step 52 is YES, in step 53, the seven-digit correction addition a = a + 1 = 3 + 1 = 4 for the day of the week difference value a is performed.
At 54, the 7-digit correction addition of the numerical data Z Z = Z + a = 5 + 4 =
9 → 2 is performed.

(V) Fifth processing In step 60, the day difference value b = 1 for the first digit of the day is obtained for March 1st, and then in step 61, the day 10
The day difference value c of the place digit becomes 0, and the 7-ary correction addition E = b + 6 = 1 + 6 = 7 → 0 is performed in step 62-1. After that, in step 63, the 7-digit correction addition of the numerical data Z is performed Z = Z +
E = 2 + 0 = 2 is performed, it is determined that March 1st is Tuesday, and the date counting operation is ended.

In the present embodiment, by executing the program stored in advance in the memory, it is possible to easily determine the leap year from 1904 to 2099 AD and calculate the day of the week, thereby providing an automatic calendar device with no leap year and day of the week correction. . Also, the processing procedure for calculating the leap year / day of the present embodiment can be applied to various things such as a clock and other automatic date devices.

The present invention is not limited to the illustrated embodiment, and various modifications can be made, for example, by modifying the operation flowchart of FIG. 1 so that the counting year can be applied to a period of the year 2099 or more.

(Effects of the Invention) As described in detail above, according to the present invention, since the first to fifth processing programs are stored in the memory, a complicated counting function is required by executing the programs by the CPU. The leap year determination and the calculation of the day of the week can be simplified and easily and accurately performed.
Therefore, it is possible to expect an effect that the daily display and the daily change operation from the last day of the month to the first day of the next month are uncorrected.

[Brief description of drawings]

FIG. 1 is an operation flowchart of a calendar device showing an embodiment of the present invention, FIG. 2 is a schematic configuration diagram of a calendar device for performing the operation of FIG. 1, and FIG. 3 is a correspondence between a leap year and a day of the week of January 1. FIG. 4 is a diagram showing the data, FIG. 4 is a diagram showing the day of the week and its numerical data, and FIG. 5 is a diagram showing the day of the week data of each month corresponding to the day of the week of January 1. 1 ... Microcomputer, 2 ... Time and date correction key, 3 ... Display device.

Claims (1)

[Claims] 1. A memory for storing data, an input device for correcting time and date, a display device for displaying time, date and day of the week, and a memory for performing arithmetic processing and the memory, input device and display. In a calendar device having a central processing unit for controlling the device, correspondence data between a leap year in a fixed year period and a day of the week of January 1 of the year, and a day of the first day of each month corresponding to the day of the week of January 1 The data and are stored in the memory, and the date is added by one day at the time of the carry from 11:59 pm to 0:00 am the next day. If it is December 32, it will be January 1 of the following year. Other than the above, the first processing is performed with the date added, and whether or not the year is a leap year is determined, and when the year is not a leap year, the year leap year close to the year is requested. Processing of the If the degree is a leap year, the day of the week of January 1 of the relevant year is calculated based on the correspondence data. If the year is not a leap year, the leap year that is close to the year and January 1 of the year based on the correspondence data. The third process for determining the day of the week and the month end correction of the addition result in the first process to determine the month and day of the year, and the fourth day of the week for the first day of the month based on the day of the week data. A calendar device, wherein a program for causing the central processing unit to sequentially execute a process and a fifth process for determining a day of the week of the date is stored in the memory.