JPS59191200A - Method for checking program data - Google Patents

Abstract

PURPOSE:To enable correct execution of program data by correcting erroneous part of data to correct value basing on the result of logical processing when read parity check does not coincide with parity check for inspection. CONSTITUTION:Read check codes S0a-S5a and check codes for inspection S0b-S5b are logical operated. When no error is found in the read content, read out parity check APa coincides with parity check for inspection APb, and the result of exclusive logical sum addition of read out check codes S0a-S5a and check codes for inspection S0b-S5b is logic ''0''. When there is error of one bit in read out program data D1a-D63a, parity checks APa, APb are incongruent and the result of exclusive logical sum addition is a value other than 0. In this case, bits of bits D1a-D63a corresponding to the value of result of exclusive logical sum addition are inverted and corrected.

Description

[Detailed Description of the Invention] Technical understanding Thursday 16th does not check program data,
If an incorrect 'IZ'L1 item is found in the program data, it will be corrected)) Regarding the person.

BACKGROUND TECHNOLOGY This kind of program data is not changed based on the calculation result during deletion, and if such program data is read and executed by mistake, it may be damaged by a microprocessor, etc. ! 1111 works go out of control. Therefore, if there is an error in the program code read (IA), it is desirable to correct the WT automatically.

Purpose: The purpose of 1itl is to find out that some of the program data for which 6 was issued is incorrect.
The purpose is to provide 111 people who can check program data by automatically correcting missing parts.

Brahma's expansion and effect + invention 1 is to take out part of program 7, check code, parity check, and kit>c from memory, and calculate J according to the program data, point 4)! Create the first check code, perform logical processing on the read check code and the check code for point (τ), and create a parity check for checking at least the program data. and the parity check for checking), and when the parity check is inconsistent, [)i[1ξ result in the article processing IJij], (then ffit c outputs the correct value of the program data) ni i
n',! This is a method of checking the 1-column take with i'fr: # & rlJi.

Then, in the memory, I store the ``crum take, check code, parity check, and t store, and then read it from this memory to the 7t bu IJ//zum data'' and attack L'I; ” checked coat, r fi
=Su, this 1171 i-Sniffed Chikoni Sokko F
and point (, 'J 111 discussion with Nae Nkucode, l
lj, -1: The parity check stored on
・August” Parity Check Sakae 1/l 31. -b' If the Barry r check and the inspection harity check do not match and the result is 65, i'Hil note + i, ii
i]l! Place()1! K11: Exit G after 4 in frustration
rL 7j program gym take incorrect part k,
'iJE Lili&' This allows the program data to be executed without error.

Example FIG. 1 is a block diagram of an example of a single sieve according to the present invention.

A controller 1 for processing a microprocessor or the like is connected to a driver-only memory 2 and a random access memory 3. The REIT ONLY MENU 2 includes the program data read from bits v1 to J) 63 as shown in FIG. 2 (1), check codes shown by bits SQ to S5, and parity check AP. Stored 1
ing. Due to the operation of the processing circuit 1, when the program is executed, the stored contents are read from the IJ-only memory 2 to the random access memory 3, and then accessed as shown in FIG. 2 (2). Stored in memory 3.

)' In FIG. 21(2), the subscript a is ←j− corresponding to each bit shown in FIG. 21(1). The processing circuit 1 includes another random access memory 4 for calculations, and is connected to an error detection circuit 5 at the core 'f'.The check code s0=85 indicates the program data data.
)1 to D63. Parid check A
, P I '; , program data 1) 1 to j) 6
Created based on 3. This parity check AP
+ (J:, program data 1) 1 ~]) 63 and parity check APr 1 [-1'' including the parity check APr 1, . . . so that the number of bits is an even number.
:B,l'l! f shift is determined.

f! (C came out) "" program deli D la~
IJ 63 a fortune teller (according to 7, bisoto S Q IJ
-S 51.1 to IJ point, create a check code for toss Iv"?, issued check coat S Oa~S5・1, dot side)" check code S0
1] ~ s5b, 1: Cloth'' 1 performance - Ll [Procedure 1j11
do. This logic 71ga (g'7.44p Kawaguchi yo, 1hi toe is like 'h: I candy theory']' l Waka,
: 7 or 9 is fine in 61iU work, that (ya Q 0
) There may be 7 works. - Yota f! 9'e I-Wasato,/Koso"-J Clam Chilli 1) i a~I Noro 3
・Make Jl (followed by r:j iii1 (j parity inaekku A P l) 2 for I.

When there is no error in the readout t″1.fr shown in FIG. 2 (2), the parity check A with M elements
P a and the inspection parity check API (I) match, and the check code FSo a~S
5a and the inspection check code SQb~S 51) Exclusive OR addition crystal vermilion is theory 1: li! r o” and 4
゜Read out program data 1)■a~D 63
When there is only one bit error in a, the parity checks A P a and A P b i do not match,
The result of the discursive discursive sum addition is [F] in a straight line different from zero. At this time, the hits of the bits Dln to D63a, which are 6 times higher than the value of the result of the addition of the L-alternative logic t4ij, are checked and corrected.

If there is one error in 2Y bits of program data Dla to IJ 63 a, parity check AP a
, A P L does not match, but the check code S
Q'a +JS5a and inspection check coat SQb~S
The logical disjunctive addition result obtained by 5b and 5b is zero and (
are different 11σ. In this way, when there is an error of more than 2 bits, it is impossible to correct it by exclusive OR addition, but the possibility of such an error of more than 2 bits occurring is extremely rare.
Therefore, if it is possible to make a 1-bit correction, the actual
The old five is almost enough. The bit error correction procedure using such a disjunctive OR addition may be performed using a Hammink code, which is well known to those skilled in the art as information theory.

The error detection circuit 11-5 detects when a runaway in the processing circuit 1 or a block error in the memory 3 occurs, and the processing circuit 11 detects that the abnormality occurs regularly. When the processing circuit 1 recognizes all 4 layers of redundancy due to the abnormality, it processes the solo program in the 4th row of the current ''! Step n l in Figure 3 Step 112 Foot 1,
'-TesTtsubu n 3 has more I, 1 jit's; Tadani j
Of course, I'll let you know if it works or not. 1 pint 1-1
・In 1 race, ・, bow 1, suit-゛tsubu 1) 4
Then continue processing the narrow tube with (too many, erroneous bits rT('', +1). When 1 bit μ7 is wrong, i':j n step n 3 (4th error)
1 and 1, we will explain how to prepare the check code S□-85, which is applied to exclusive logic 4.

Each bit D1 to IJ63 of the program data is referenced 6
As shown by r 1. ri l I ], 011
0...IO", each bit jJ l~
The binary value of 4 corresponding to the numeric position υ63 (1σ is made as shown by reference numeral 7, eg, the fourth bit 1) is determined by roooloooJ. Bit D, l~J) 6
3, the theory (bit IJ that is 1n r l J]
, , JJ 4, I)5, 1. ) 7,
JJ 8. ..., D62 7 power [doku1 ('shi, its addition gi'') is expressed as a binary value, and each digit is a bit S (] ~ S5 of the check code.A program that is easy to write. Data 1 → 1 to 1163 and read i
When the taken D l a to iJ f'i 3 a match, (the check codes S to S5 and check codes 5Oa to 85a match.Program data L) l to 1) When one bit out of 63 is mistakenly used as program data Dla-D63a (rd, check), the code S O~S 5 and 5Q
a-S5a [Direct is different. When the difference between the check codes So to S5 written at this time and the check codes SQa to S5a read out is calculated, the difference is determined by the read program data I) l a -D'' (33
3-Respond to the complaint about the incorrect bit of a. This widens the bit that is on f + A (contrary to the vertical logic l! ii j direct) and presses F1 g V output A n fc bu Y1 g D / l / I) la ~IJ53a f into the correct 1 direct. be able to.

”-mentioned “Ji/1iji l 11 and 6 sun, parity check AP is bu 11 grams deku 1) 1 to J) 63
The tl, rt, and bali eye f-nik A, PI) created on the basis of the divination were read out.・Rokulam Dig 1) 1 Ru ~ IJ 63i 1 If, 1 Te 1 will be formed t% 1c, but as Honkomyo's song Fire 1 Bow Lire 1], Paris Eye Check AP is Zologram Rag. iJ
l~1)63 and check U-1:SO~F35
k'f Nino 1, then created 111, this time Variter Check A 1. ' b f yo f.

1. Cogram data D l a ~ D (i 3 and check code S Oa ~ 8521) may then be created.

4. Drawing 1) ij, +14 (Situation: '4, 11, 1, 1, 1 -) 41 examples of block 1
゛4, Figure 2 is memory 2, ;'3 self-answer t'l'7 success display 1-Figure, 314 is L gong work Rong 1. νl
Figure 4 is a diagram illustrating a method for creating check codes S□~S5, 1iQl)~S51].

■...Processing 1 Taji, 2...Leat only Me Shichiri, 3
・・・Random access memory, 4・Memory, 5...
Error detection circuit, j)1~I)6j・su)''included pro'/UA 7'-Yu, D l a~JJ 631
...The read program take, SO~S5...
(1-) Contained Cheno 9':l-)-1S
Q +i~S5a..., check coat with ε exposed t', '-'0'~S5'...jijj:
';:1L TeQ: Run fC check code, AP
...11; Includes 7F Shida parity check, jLP+↓
...Reading error, parity check, AI' b,
, calculated and combined n parity check instead of p
Reif Ushi Song 1st Dan Kei Part 1st Figure 2nd Figure 3 Gourmet Study Risatake So 515253 S455

Claims (1)

[Claims] Read out the frame data, check code, and parity check from the memory, create a point (return check code?) based on the program data, and compare the read check code and point (1 month) with the new link code. Field treatment i
J+! *Not attached, at least] "If the point is based on the taram data ((1 parity check 't: ('
IE, jj”L out tl, Tahariti Naek and point 4
・When the parity check is inconsistent with the validity check for H, the iii memory logic is processed. A program data checking method characterized by correcting the program data that appears as a result.