JPH06188744A - Method for generating error verification and correction code incorporated bit array - Google Patents

Abstract

PURPOSE:To obtain a method for generating the bit array in which a simple code capable of verifying and correcting a one-bit error, occurring at the time of the transmission and reception of the bit array of an electronic computer and a communication system, at a high speed. CONSTITUTION:An array code 3 is generated from a position code 2 of a basic bit array 1, a bit array characteristic positive code 4 is generated from the array code, and a bit array characteristic complementary code 4 is generated from the bit array characteristic positive code. Then a bit array 6 is generated by connecting the bit array characteristic complementary code 5 to the basic bit array 1, odd or even parity is set for the bit array 6 and added to generate the error verification and correction code incorporated bit array 8.

Description

Detailed Description of the Invention

[0001]

[Industrial application] Verification and correction of bit errors that occur during transmission and reception of bit strings in electronic computers and communication systems.

[0002]

2. Description of the Related Art There is no simple method for incorporating a simple code for verifying and correcting a bit error in a bit string in transmission and reception.

[0003]

SUMMARY OF THE INVENTION A simple code capable of verifying and correcting one bit error occurring in transmission / reception of a bit string in an electronic computer or a communication system is incorporated by a simple method mainly composed of logical operations. How to generate a bit string.

[0004]

In FIG. 1, first, an array code (3) is created from a position code (2) of a basic bit string (1), and a bit string characteristic positive code (4) is created from the array code. A bit string characteristic complementary code (5) is created from the bit string characteristic positive code. Next, a bit string (6) is formed by concatenating the bit string characteristic complementary code (5) to the basic bit string (1), and odd or even parity is set in the bit string (6), and the parity bit (7) is added. An error verification / correction built-in bit string (8) is created.

[0005]

First, the error-verification-correction built-in bit string is (1) (2 n + n + 2) with respect to the basic bit string having a length of (2 n-th power), and the error-verification correction is performed as the length of the basic bit string increases. The length ratio of the embedded bit string to the basic bit string becomes small. The relationship is shown in Table 1. 2) Bit code 1 is always an odd number from the start bit position to the (nth power of 2 + 1) th bit position, that is, up to the most significant digit of the basic bit string and the bit string characteristic complementary code (called the main bit string). And the next bit position is (2 to the nth power +
2) From the 2nd bit position to the bit position of the (nth power of 2 + n + 2) th end point, that is, the part excluding the highest digit of the bit string characteristic complementary code and the parity bit (called a sub bit string) are bit codes. 1 is an even number if the parity of the error verification and correction code embedded bit string is an odd parity, and an odd number if the parity is an even parity. Next, 1-bit error verification in transmission / reception is as follows. 3) First, if the error verification / correction code embedded bit string has a parity error and the received main bit string has an even number of bit codes 1, It is verified that a bit error has occurred in the sub-bit string. If the bit code 1 in the sub-bit string is odd-numbered parity and odd-numbered, and even-numbered parity is even number, a bit error occurs in the sub-bit string. Verify that The correction when there is a 1-bit error in the received main bit string is 4) First, the code of the highest digit of the received bit string characteristic complementary code is converted into a complementary binary number (called code A). ), And a bit string characteristic positive code is created from a portion corresponding to the basic bit string of the received main bit string (referred to as code B). Next, the code A and the code B are digitized in the same order to form an EOR code, and a binary code in which each digit of the code is converted into a complementary binary number (called a code C). Then, when all the digits of the code C have become 0, the code A is made a part of the received bit string characteristic complementary code to correct the bit error. 5) If all the digits of the code C are not 0, a bit string characteristic positive code is created from the part corresponding to the basic bit string of the main bit string (referred to as code D). Then, the digit D and the received bit string characteristic complementary code are arranged in the same order of the digits, and E
An OR code is created, and each digit of the code is converted into a complementary binary number to create a binary code (referred to as code E). Then, the code E becomes a bit position code indicating the bit position of the bit error in the part corresponding to the backbone bit string of the main bit string, and the bit code at the bit position of the part corresponding to the backbone bit string shown is the complementary binary number. Correct the bit error by converting to. Next, if there is a 1-bit error in the received sub-bit string, the correction is as follows: 6) A bit string characteristic complementary code is created from the part corresponding to the basic bit string of the received main bit string Correct the bit error by exchanging the part.

[0006]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Referring to FIG. 2, first, from a basic bit string (9) to an odd parity error verification correction code embedded bit string (1
0) is created and transmitted. Then, the verification and correction in the case where a 1-bit error occurs in the transmission path and it becomes (11) when received is shown. First, it is verified that a bit error has occurred because (11) is an even parity, and further, from (11) to the main bit string (12) and the sub bit string (1).
3), if the part (14) corresponding to the basic bit string and the part (15) of the bit string characteristic complementary code are created, since the bit code 1 of (12) is an even number, a bit error has occurred in the main bit string. Verify that. Therefore, the code A (1
6) and the code B (17) are created, and the code C (19) is created from the EOR code (18). And (19)
Since all the digits of 0 are 0, (20) which is a part of the bit string characteristic complementary code received from (16) becomes a corrected error verification correction code embedded bit string. Next, an odd-parity error-verification-correction-code-embedded bit string (22) is created from the basic bit string (21) and transmitted. Then, the verification and correction in the case where a 1-bit error occurs in the transmission path and it becomes (23) when received is shown. First, since (23) has an even parity, a bit error has occurred, and since the bit code 1 of the main bit string (24) of (23) is an even number, a bit error has occurred in the main bit string. To verify. Therefore, the code C (25) is set as described above.
make. Then, since all the digits of (25) are not 0, the code D (27) is created from the part (26) corresponding to the basic bit string of (24), and the part of the bit string characteristic complementary code of (27) and (23). Create a sign (29) of EOR with (28). Then, a code E (30) is further created from (29), and the bit code at the bit position of (26) shown therein is converted into a complementary binary number, and (31) becomes a corrected error verification correction code embedded bit string. .

[0007]

EFFECT OF THE INVENTION A bit string incorporating a simple code capable of verifying and correcting a 1-bit error that occurs during transmission / reception of a bit string in an electronic computer or a communication system is a simple one mainly composed of logical operations. It can be created at high speed depending on the circuit configuration.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of the present method, an upper portion is a block diagram showing each element of the configuration, and a lower portion is a block diagram showing an example of an 8-bit bit string.

FIG. 2 is a block diagram showing an embodiment using an error verification / correction code embedded bit string generated by this method as an example of an 8-bit bit string.

[Explanation of symbols]

(1) is a basic bit string (2) is a position code (3) is an array code (4) is a bit string characteristic positive code (5) is a bit string characteristic complementary code (6) is a bit string in which the bit string characteristic complementary code is connected to the basic bit string ( 7) is a parity bit (8) is an error verification correction code embedded bit string (9) is a basic bit string (10) is an error verification correction code embedded bit string before bit error (11) is an error verification correction code after 1-bit error The built-in bit string (12) is the main bit string (13) is the sub bit string (14) corresponds to the backbone bit string (15) is the bit string characteristic complementary code (16) is the code A (17) is the code B (18) Is the code of the EOR result (19) is the code C (20) is the error verification and correction code in which the bit error is corrected (21) is the basic bit string (22) is the error verification and correction code before the bit error The embedded bit string (23) is an error verification correction code after a 1-bit error. The embedded bit string (24) is the main bit string (25) the code C (26) corresponds to the basic bit string (27) is the code D (28). Bit string characteristics Complementary code part (29) is the code of the EOR result (30) is the code E (31) Error verification correction code embedded bit string in which the bit error is corrected

─────────────────────────────────────────────────── ───

[Procedure amendment]

[Submission date] May 11, 1992

[Procedure Amendment 1]

[Document name to be amended] Statement

[Correction target item name] 0004

[Correction method] Change

[Correction content]

[0004]

In FIG. 1, first, an array code (3) is created from a position code (2) of a basic bit string (1), and a bit string characteristic positive code (4) is created from the array code. A bit string characteristic complementary code (5) is created from the bit string characteristic positive code. Next, a bit string (6) is formed by concatenating the bit string characteristic complementary code (5) to the basic bit string (1), and odd or even parity is set in the (6) and the parity bit (7) is added. Is an error verification / correction code built-in bin string (8).

Claims (1)

[Claims] 1. A bit-sequence characteristic positive code and a bit-sequence characteristic complementary code 1) First, a target bit sequence whose length is 2 raised to the n-th power (referred to as a backbone bit sequence) is arranged in a certain direction at its bit position. The number of digits to be displayed, starting from the bit position of the starting point, the highest digit of the same number of digits corresponding to each bit position is 1, and the remaining digits are binary numbers such as 1000, which are all 0 in binary. Is a binary number 1 that increases sequentially by 1 from the binary number of n + 1 digits in the order of the bit position by the addition of the binary system.
A binary number of n + 1 digits (called a position code) with the same number of digits to be displayed as 001, 1010 is created, and the position code is multiplied by a binary code of 0 or 1 of the bit code of the bit position to obtain 0000, Displayed as 1010, a binary number of n + 1 digits is created with the same number of digits as the position code (called an array code). 2) The digits of the array code are arranged in the same order to form an n + 1 digit binary number of the exclusive OR (EOR) (called a bit string characteristic positive code). 3) A binary number of each digit of the bit string characteristic positive code is converted into a complementary binary number (called a bit string characteristic complementary code). Error verification / correction code embedded bit string 4) Then, a bit string of (2 to the power of n + n + 1) bit positions in which the bit string characteristic complementary code is concatenated to the basic bit string is created, and parity bits of odd parity or even parity are added to the bit string. Set and attach it (2 to the nth power +
A bit string of (n + 2) bit positions is created (referred to as an error verification / correction code embedded bit string). In this way, the portion from the bit position of the starting point to the bit position of the highest digit of the bit string characteristic complementary code is bit code 1
Is always an odd number, and the bit code 1 of the bit string from the next bit position to the end bit position is an even number or an odd number depending on the odd parity or the even parity, respectively. A method for generating an error-verification-correction-code-embedded bit string, characterized in that this bit string characteristic complementary code is concatenated to a basic bit string.