JPS58197512A - Recording data compression system - Google Patents

Abstract

PURPOSE:To reduce a storage area by storing data which are stored at a specific period all the time selectively and successively at optional recording intervals greater than the specific period of the input when an event occurs. CONSTITUTION:For example, when 60 data are stored invariably in the storage area at intervals of one second before an event generation command CR, data from 59 to 0 sec are stored in addresses 22-81. When the data are shifted up by one, those data are stored in the addresses 21-80 and new data is stored in the address 81. After the occurrence of the event, the data in the addresses 22-57 are selected at intervals of five seconds and shifted up to addresses 1-8 and the data (1-second interval) in the addresses 62-81 are shifted up to addresses 9-28. Data 0 sec after the event occurrence is written in the address 29. Thus, the storage area is reduced.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a device for recording plant-like mt before and after an event occurs, and relates to a ninth recording data compression method that stores data with a minimum storage capacity according to the number of data recording points. .

Fig. 1 shows the recording interval of data to be recorded, Fig. 2 shows the flow of the conventional method, and Fig. 3 shows the configuration of the storage area of the conventional method. As shown in Figure 1, the reading period TM from outside the device is
When outputting the data captured by the samurai with the arbitrary recording amount MN+, N*, etc. set before and after the occurrence of the event generation command C wind, conventionally, g
Rounded storage area MA that stores data at any time like aa
It has an endless counter that scans this area in a loop and indicates the current address of the memory area M, and a memory area M1 to P for storing data after the occurrence of an event generation command. The flow is as shown in Fig. 182. In step 1, the event generation command C1 is checked. If there is no event generation command C1, the data is stored in the address of the storage area M indicated by the endless counter in step 2, and the data is stored at any time before a certain period of time Ty. After the event generation command C 凰 occurs, the endless counter stops updating and stores the final address, and in step 3 new data is stored in the memory area M1 at regular intervals, and the data is At the time of output, in the storage area Mm, the endless counter is decremented by the recording interval N, , N, and in the storage area Mm, data is selected and output at the recording interval -Ns, Na.

In this method, the storage area Mm/MmK does not have to store data t- which is not necessary for recording output, and the storage area becomes large.

An object of the present invention is to provide software for recording data with a small storage capacity depending on the number of data recording points.

FIG. 4 shows 70-, #! according to the present invention. Figure 5 shows the AI of data processing in the storage area before the event occurred frame/do C1.
[', Jl! 6fl indicates #R responsibility for data execution in the storage area after the event generation command Cm occurs. In the fourth case of 70-, event generation command C at step l
Check m, and if there is no event generation command Cm, in step 2, the previous stored data is shifted to the upper storage area by 1sj, and in step 3, new data is taken in, and the loop ends. Slow mode always stores data up to a certain time TytU, and also imports interesting data.After the occurrence of the event generation command C, as step 5, from the data up to one time, Wara Kajime construction 6 is performed. Data t- is selected using @N, N, and is amplified in memory area 1. In step 3, the poor data is deposited in the next memory area, and one loop is completed. After that, the flow is Steps 1 → 4 → 6 → 3, and the m-hour memory area is updated until the recording time Ti+.
Accurate data is acquired at recording intervals N,, N,. During power generation, data is output sequentially from the storage area.

The % length of this @Akira is the treatment t of steps 2, 4, 5, and 6 of the above flow.
By composing the storage area for the previous data and the relevant data, and by importing the data for the occurrence of the event command C1 at the recording interval N,, the storage area can be reduced compared to the conventional method. There is a particular thing.

Next, the present invention is applied to a steel watch that records at intervals of 17 sections. llt deviate. Figure 8 is the flow of an application example, #+
49. The time relationship between the address of the storage area and the data that is being ignored is given to him as an event generation command Cm generation - 0. Before the event generation command 01 occurs, 60 data points at 1 second threshold intervals are always stored in the storage area.

At this time, 70- is the deployment address 22~ as step 2.
The data from 59 to 0 seconds stored in 81 is shifted up to memory addresses 21 to 80, and in step 3, 1 kan of poor data is stored in memory address 81. After the event teacher command Cm occurs, I & first step l → 4 → 5 → 6
→The flow is 3. Memory address 2 as step 5
Select data from 2 to 57 at 5 second intervals and store it at memory address 1.
~8, and in step 6, the data at storage addresses 62 to 81 are amplified to storage addresses 9 to 28 by 77 times, and in step 3, the event generation command Cm @
Input * 0 seconds of data into 2nd address 29.

The following is 20 minutes after the event occurrence command Cm occurs! Until the event occurs, it is 70- of steps 1 → 4 → 7 → 3, and data at 1 second intervals is stored in 200 million addresses 30 to 49, and 2
From 5 seconds to 180 seconds, step 8 is 712 times 1-
Judgment of salmon kajikaku after sunset, 5 sand I
! In one bite, step 1 → 4 → 7 → 8 → 3 is applied to 70-V, and data for each bite is changed to t-guidance addresses 50 to 81 for 5 seconds.

[Brief explanation of the drawing]

#41 The bad thing is the data layout, Figure 2 is the conventional method 1-
The 70-1 3rd figure of the Medai Renriki style is the traditional method of Kidouk 1 Noah's #I place, and the 70-, l of the 4th Kuhon Sakimei
1j45 is the event occurrence frame 7 according to the present invention.
C1% Data execution in the memory worker 177 while alive, 6th stage is an event generation piece according to the present invention / C Otori% / +:, 1 of the sky
Data processing in my area, as shown in Figure 7, is due to the implementation of the present invention.
The problem is the processing flow, FIG. 9, address and distribution of μkIX area; l・~8...Brutal Stenno. Figure 4 Figure 5 Figure 6 Plan 70 Figure 8

Claims (1)

[Claims] 1. In a device that records plant-like Ilt when an event occurs, human input from outside the device is always stored up to a certain period of time at a predetermined cycle, and when an event occurs, it is recorded at an arbitrary recording interval that includes the input cycle. By selecting the stored data, compressing the storage area, and storing the input after an event occurs in the free storage area sequentially at the required recording interval, data can be recorded with the minimum storage capacity. Record data to perform pressure force formula.