JPH06124190A - Bit string conversion for bit string eor characteristic code - Google Patents

Abstract

PURPOSE:To convert a bit string with a characteristic code composing of bits by converting the bits with the characteristic code of exclusive OR (EOR) to the arrangement of bit codes in the bit string. CONSTITUTION:A binary code 1000 is made correspondent to the first bit position of a bit string 11001001, a binary code 1001 is made correspondent to the second bit position and continuously, binary codes 1010, 1011, 1100, 1101, 1110 and 1111 are successively made correspondent. Bit codes at those respective bit positions are multiplied to those binary codes, binary codes 10, 11, 12, 13, 14, 15, 16 and 17 are prepared, and EOR 18,0010 samely positioning those digits is defined as the bit string EOR characteristic code of a bit string (1). Next, in the case of converting binary codes 19, 1000 to a bit string defined as the bit string EOR characteristic code, first of all, EOR 20,1010 of 18 and 19 is prepared. Next, the original bit string (1) is converted to a bit string 21 by turning a bit code 0 at the bit position showing 20 corresponding to (1) to a complementary binary code 1.

Description

DETAILED DESCRIPTION OF THE INVENTION (A) Purpose of the invention [Industrial field of application] Bit string conversion in an electronic computer.

[Prior Art] There is no method for converting a bit string with a characteristic code created from the bit string.

[Problems to be Solved by the Invention]

The bit string is converted by the characteristic code of the exclusive OR of the bit code array of the bit string.

(B) Structure of the Invention [Means for Solving the Problems] FIG. 1 shows an example of a bit string. First, the first bit of the original bit string 11001001
Binary code in the th bit position. 1000, the binary code 1001 at the second bit position, and the subsequent bit positions sequentially at 1010, 1011, 1100,
1101, 1110, 1111 are made to correspond to each other, their binary codes are multiplied by the bit codes of their respective bit positions, and binary codes (10), (11), (12), (13)
Make ▼, ▲ 14 ▼, ▲ 15 ▼, ▲ 16 ▼, ▲ 17 ▼,
Exclusive OR with the same scale of those digits ▲ 18
Let 0010 be the bit string EOR characteristic code of the bit string. Next, as an example of the operation for the bit string EOR characteristic code, an arbitrarily set binary code (19) 1000
Shows the operation and bit string conversion for converting to a bit string having the bit string EOR characteristic code. First, an exclusive OR (20) 1010 of (18) and (19) is created. Then, the bit code 0 at the bit position indicated by (20) is converted into a complementary binary code 1 to convert the original bit string into the bit string (21). The bit string EOR characteristic code becomes the set <19>.

[Action]

1) The number of digits of the bit string EOR characteristic code of the bit string having a length of 2 to the n-th power is n + 1.

2) The bit string can be converted into a bit string having an arbitrarily set bit string EOR characteristic code.

(C) Effect of the Invention A simple method for converting a bit string by an electronic computer.

[Brief description of drawings]

FIG. 1 is a block diagram showing [means for solving the problem].

Claims (1)

[Claims] Indicates the order for each bit position in the bit string,
The binary code of the exclusive OR (EOR) of the binary code obtained by correlating the binary code of the same digit number with the code of the highest digit being 1 and multiplying the binary code by the bit code of the bit position is a bit string. An EOR characteristic code is used, an operation is performed on the bit string EOR characteristic code, and the bit string at the bit position indicated by the resulting binary code is converted to a complementary binary code to convert the bit string. Bit string conversion characterized by this bit string EOR characteristic code.