JP3458853B2 - Communication system and communication method - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention uses BC for transmission data.
The present invention relates to a communication system and a communication method for adding an error correction code by an H (n, k ) code and performing scramble coding by an exclusive OR operation.

[0002]

2. Description of the Related Art When a transmitter and a receiver communicate with each other, a synchronization code is first transmitted, and subsequently an identification code for identifying a communication partner and transmission data to be transmitted to the communication partner are transmitted. For example, a communication message format when using low power radio is shown in FIG.

In the figure, a bit synchronization code 131 is a code for synchronizing the bit timing between the transmission device and the reception device, and repeats "0101 ..." About 100 bits.

The frame synchronization code 132 is a code for aligning the positions of communication message formats between the transmission device and the reception device. For example, in FIG. 13, the reception device detects the frame synchronization code 132 and the identification code 133 comes next. Judge and perform reception processing. Therefore, it is desirable that the frame sync code has a high randomness so that other signals are not mistakenly determined as the frame sync code, and a pseudo random code is used. Pseudo-random code is (2 ^ N) -1 bit (N is a natural number), and 31-bit pseudo-random code is often used in low power radio.

The identification code 133 is a system identification code 13
4, a receiver identification code 135, and a sender identification code 136. The system identification code 134 is an identification code unique to each communication system. The system identification code specifies a communication system that transmits and receives a communication message and does not interfere with other communication systems. Receiver identification code 135, sender identification code 1
36 is an identification code unique to each receiving device and transmitting device,
The receiver identification code 135 determines the receiving apparatus that should receive the communication message, and the sender identification code 136 determines the receiving apparatus that transmitted the communication message.

That is, the receiving device stores the system identification code and its own identification code in advance, confirms that these identification codes match the system identification code and the recipient identification code in the received communication message, and confirms that the transmission data is transmitted. 137 is received.
If the system identification code and the recipient identification code do not match, the data is not received.

By the way, the identification code 133 and the transmission data 1
In some cases, scramble coding may be performed on 37. The purpose of scramble coding is two-fold, one is to keep the confidentiality of data, and the other is to restrict the same bit value from continuing.

Explaining the latter, there is a case where communication becomes difficult when the same bit value continues in the data depending on the communication system and the configuration of the transmitter / receiver. For example, in the FSK (Frequency Shift Keying) modulation method for low power wireless transmission, since a DC component cannot be transmitted, "0000 ... 001
When data such as "00 ... 0000" is transmitted, the halfway "1" may be regarded as "0" by the receiving side. This depends on the content of the data to be transmitted, but data such as 1 byte (8 bits) all "0" is often used intentionally, and if these 1 byte data continue, "0" may continue for several tens of bits. Comes out. Similarly, data such as 1 byte (8 bits) all “1” is often used intentionally, and “1” may continue for several tens of bits. In order to avoid these, it is necessary to perform scrambling coding to limit the same bit value from continuing for a long time.

Regarding the scramble coding, for example,
There is JP-A-6-291759. An exclusive OR operation (hereinafter, XOR operation) is performed using a pseudo random code, and the original data can be obtained by performing an XOR operation using the same pseudo random code in the transmitting device and the receiving device.

As shown in FIG. 14A, the transmitter XORs the data to be transmitted and transmits the data, and the receiver XORs the received data to analyze the received contents.
When the data that is all “0” is XORed with the scramble code, the same code string as the scramble code (pseudo random code) is obtained, and “0” and “1” are randomly arranged. Also, as shown in (b), the data that is all "1" is X
When the OR operation is performed, it becomes a bit inversion code of the scramble code, which is also a pseudo-random code in which "0" and "1" are randomly arranged.

Here, as shown in (c), the data of the same code string as the scramble code is all "0" by the XOR operation.
However, the probability that the data happens to be the same as the scramble code (that is, the pseudo-random code) is small, and the probability approaches 0 as the code length of the scramble code increases. Similarly, if there is data in the bit-reversed string of scramble codes as shown in (d), all will be "1" by the XOR operation, but this probability is also small.

By the way, Japanese Patent Laid-Open No. 6-291759 discloses that if the same code as the frame synchronization code is used for the scramble code, it is not necessary to prepare a large number of pseudo random codes and it is efficient.

[0013]

When a frame synchronization code (m bits) is used as the scramble code, if m bits of consecutive "0" data is XORed and transmitted, it becomes the same as the frame synchronization code. The receiving device may erroneously determine that this portion is a frame synchronization code.

Regarding the confidentiality of the data, it is a condition that the scramble code is shared only between the transmitting device and the receiving device, and the third party does not know the code. In the case of an open communication protocol, the code content of the frame synchronization code and the scrambling encoding method are public, so that if the same code as the frame synchronization code is used for the scrambling code, the confidentiality of the data is lost.

As described above, making the scramble code the same as the frame synchronization code is efficient because it is not necessary to prepare a large number of pseudo-random codes, but there remains a problem.

[0016]

In order to solve the above problems, the present invention provides a communication system comprising at least one transmitting device and one receiving device, wherein the transmitting device and the receiving device are:
The transmission device is provided with BCH (n, k), each of which is provided with a synchronization code storage means for storing an m-bit frame synchronization code and a scramble code generation means for generating a scramble code from a code obtained by adding 1 bit to the frame synchronization code. A first arithmetic means for performing an exclusive OR operation on a transmission data to which an error correction code using a code and a 1-bit parity code is added with a scramble code and outputting a transmission signal, and a transmission signal from the first arithmetic means And a second calculating means for outputting the received data by performing an exclusive OR operation on the received signal received by the receiving means with a scramble code, and a receiving means from the second calculating means. and a received data analysis means for analyzing the error correction code in the received data, the code length of the scrambling code (m + 1) is 1 bit to the code length n BCH code The length obtained by adding a parity code (n
+1) .

According to the above invention, since the transmission data is the error correction code using the BCH (n, k) code and the 1-bit parity code , the transmission data has (n + 1) bits or more "0" consecutively. No data is generated. in addition,
The code length (m + 1) of the scramble code is the length (n +) obtained by adding the 1-bit parity code to the code length n of the BCH code.
Since it is equal to 1) , the positional relationship between the consecutive positions and the position of the scramble code is fixed when "0" continues for n bits, and the exclusive OR operation is performed with the scramble code generated from the frame synchronization code. Also, the same code as the frame synchronization code does not appear in the transmission signal.

Then, as an error correction code, BCH (n,
k) scrambling by adding 1-bit parity code to the code
1 bit as a frame code
And becomes 2 ^ N bits (N is a natural number) and handled by a microcomputer
The number of bits is easy.

[0019]

BEST MODE FOR CARRYING OUT THE INVENTION The present invention can be implemented in the modes described in each claim.

That is , as in the invention described in claim 1 ,
In a communication system including at least one transmitting device and one receiving device, the transmitting device and the receiving device include a synchronization code storage unit that stores an m-bit frame synchronization code, and a code obtained by adding 1 bit to the frame synchronization code. And a scrambling code generating means for generating a scrambling code from the BCH (n,
k) first arithmetic means for performing an exclusive OR operation on the transmission data to which the error correction code using the code and the 1-bit parity code is added with the scramble code and outputting the transmission signal; and the first arithmetic means. And a transmission means for transmitting a transmission signal from the receiving device, the receiving device, the second arithmetic means for performing an exclusive OR operation on the received signal received by the receiving means with the scramble code to output the received data, And a received data analysis means for analyzing an error correction code in the received data from the second operation means, wherein the code length (m + 1) of the scramble code is 1 bit pari to the code length n of the BCH code.
It has a length (n + 1) added with a tee code .

Then, as an error correction code, BCH (n,
k) By adding a 1-bit parity code to the code and adding 1 bit to the frame synchronization code as a scramble code, 2 ^ N bits (N is a natural number) becomes a bit number that can be easily handled by a microcomputer.

Further , as in the invention described in claim 2,
In the communication system according to Item 1, the frame synchronization code length
m = 31 bits, BCH (n, k) code is n = 31 bits
, K = 16 bits.

Then, as an error correction code, BCH (3
1, 16) code with 1-bit parity code
Add 1 bit to frame sync code as rumble code
By doing so, both become 2 ^ 5 = 32 bits and handled by the microcomputer.
The number of bits is easy.

Further, as in the invention of claim 3, produced according to claim 1 or 2, wherein the communication system, the scrambling code generating unit performs a frame synchronization code rows station operation, different scrambling codes for each communication system To do.

[0025] Then, it is easily possible to generate a plurality of scrambling codes by the frame synchronization code rows Tesho <br/> down operation. A large number of scramble codes can be obtained by changing the rotation operation for each communication system, and the confidentiality of data can be obtained by the scramble code different for each communication system.

Further, as in the invention of claim 4, wherein, stored in the communication method between at least one transmitter and a receiver, a frame synchronization code of the transmitting device and each m bits the receiving device, said frame 1 for sync code
Generate a scramble code from a code with bits added,
The transmission device performs an exclusive OR operation on the transmission data to which the error correction code using the BCH (n, k) code and the 1-bit parity code are added with the scramble code to transmit the transmission signal, and the reception device. Performs an exclusive OR operation on the received signal received by the receiving means with the scramble code to analyze the error correction code in the received data, and the code length (m + 1) of the scramble code is 1 for the code length n of the BCH code.
It is equal to the length (n + 1) added with the bit parity code .

Then, as an error correction code, BCH (n,
k) By adding a 1-bit parity code to the code and adding 1 bit to the frame synchronization code as a scramble code, 2 ^ N bits (N is a natural number) becomes a bit number that can be easily handled by a microcomputer.

According to the invention of claim 5 , in the transmitting device communicating with at least one receiving device, m
A synchronous code storage means for storing a frame synchronous code of bits, a scramble code generating means for generating a scramble code from a code obtained by adding 1 bit to the frame synchronous code, and an error correction code using a BCH (n, k) code. And 1
A first arithmetic means for performing an exclusive OR operation on the transmission data to which the bit parity code is added with the scramble code and outputting a transmission signal; and a transmission means for transmitting the transmission signal from the first arithmetic means. The code length (m + 1) of the scramble code is 1 bit per the code length n of the BCH code.
It is equal to the length (n + 1) added with the priority code .

As an error correction code, BCH (n,
k) By adding a 1-bit parity code to the code and adding 1 bit to the frame synchronization code as a scramble code, 2 ^ N bits (N is a natural number) becomes a bit number that can be easily handled by a microcomputer.

According to the invention of claim 6 , in the receiving device communicating with at least one transmitting device, m
A synchronization code storage means for storing a frame synchronization code of bits, a scramble code generation means for generating a scramble code from a code obtained by adding 1 bit to the frame synchronization code, and a scramble code exclusive for a reception signal received by the reception means. A second arithmetic means for performing a logical OR operation to output the received data; an error correction code using the BCH (n, k) code in the received data from the second arithmetic means;
A scramble code having a code length (m + 1) obtained by adding a 1-bit parity code to the code length n of the BCH code.
It is equal to (n + 1) .

Then, as an error correction code, BCH (n,
k) By adding a 1-bit parity code to the code and adding 1 bit to the frame synchronization code as a scramble code, 2 ^ N bits (N is a natural number) becomes a bit number that can be easily handled by a microcomputer.

A seventh aspect of the present invention is a recording medium recording a program for causing a computer to function as all or part of the means according to any one of the fifth and sixth aspects. Since the program is a recording medium, a computer can be used to easily realize some or all of the transmitting device and the receiving device of the present invention. You can easily distribute and install the program.

[0033]

Embodiments of the present invention will be described below with reference to the drawings.

(Embodiment 1) FIG. 1 is a block diagram showing the configuration of a transmitting apparatus according to Embodiment 1 of the present invention. The transmitter 1 includes a synchronization code storage means 2 for storing a bit synchronization code and a frame synchronization code, a scramble code generation means 3 for generating a scramble code from the frame synchronization code, and an identification code for the data output from the transmission buffer 4. B to the transmission data (a) with
An error-correction code generation means 5 for adding an error-correction code using a CH (n, k) code, and an exclusive OR operation of the transmission data (b) with error-correction code from the error-correction code generation means 5 with a scramble code And a transmission signal generation means 7 for adding a bit synchronization code and a frame synchronization code to the scramble coded transmission data (c) from the first calculation means 6, and a transmission code generation means. A transmitter 9 that modulates a transmission signal (d) from the antenna 7 and transmits a radio signal (e) through an antenna 8, and an identification code storage that stores a system identification code, an identification code of the transmission device itself, and an identification code of a communication partner. It comprises the means 10.

According to the invention of claim 7, a claim is made.
A computer is made to function as the transmitting device according to item 5.
Is a recording medium on which a program for recording is recorded. Claims
As the invention according to claim 8, as the receiving device according to claim 6,
A program for operating a computer is recorded
It is a recording medium. Then, since it is a recording medium in which the program is recorded, the transmission device of the present invention is used by using a computer.
The receiving device can be easily realized. You can easily distribute and install the program.

Next, the communication message format is shown in FIG. Transmission signal (d), reception signal (f), scramble coded transmission data (c), scramble coded reception data (g), error correction code added transmission data (b) and error correction code received data in order from the top. (H), BCH
(31, 16) code, transmission data (a) and reception data (i).

Here, BCH (n, k) code is B
The description will be made using the CH (31, 16) code. BCH (n, k)
The code n is the total bit length of one data unit and the error correction code and is called the code length, and k is the bit length of one data unit and is called the information bit length. In the BCH (31, 16) code, a 15-bit error correction code (32 in the drawing) is added to each 16-bit data (31 in the drawing), and up to 3 bit error in the 31 bits can be corrected.

The target of the data to which the error correction code is added is the identification code and the transmission data. This is divided into 16-bit units and a BCH error correction code is added. The identification code includes a system identification code, a receiver identification code, and a sender identification code. For example, the system identification code includes all 48 bits "0" and all "1". Further, the transmission data may include "0" or "1" in which several tens of bits are continuous.

However, in the BCH (31, 16) code, since a 15-bit error correction code is added to 16-bit data, even if all 16 bits of data are "0", "0" is not continuous in the error correction code. . When the error correction code is consecutive "0", there is a bit string with data ("0"
Is not continuous). From the above, BCH (31,
In the 16) code, the consecutive "0" has the longest error correction code of 15 bits + the next 16 bits of data with 31 bits.

Next, the scramble code will be described.
FIG. 4 shows 31 types of scramble codes. These are 3
1-bit frame synchronization code "00011011101
01000010010110011111 "is obtained by left rotation bit by bit. For example, in the figure, the scramble code (1) is the same as the frame synchronization code, and the scramble code (2) is the 1 bit left rotation of the frame synchronization code. One of them is selected as a scramble code.

Since the scramble code is obtained from the frame synchronization code which is a pseudo random code, it has the characteristics shown in FIG. The bit difference between different scrambling codes is always 16
Become a bit. Here, only the comparison between the scramble codes (1) and (2) and between the scramble codes (1) and (3) is shown, but the bit difference is always 16 bits regardless of which scramble code is compared.

Therefore, as shown in FIG. 6, if the scramble code for transmission and the scramble code for reception are different, about half of 31 bits are different between transmission and reception. As a result, the received data cannot be analyzed if the scramble code is different between transmission and reception. That is, confidentiality of data is obtained. In addition, what is marked with "*" in FIG. 6 is "0" or "1".

Now, the merits of using the BCH (n, k) code and the scramble code in combination will be described. Since the code length m of the scramble code is made equal to the code length n of the BCH code, the positional relationship between the BCH code and the scramble code is fixed.

For example, FIG. 6 shows a case where both the BCH code and the scramble code have 31 bits. The first bit of the BCH code always performs the first bit of the scramble code and the XOR operation, and the 31st bit of the BCH code always performs the XOR operation of the 31st bit of the scramble code. At this time, as shown in FIG. 7A, if the BCH (31, 16) code is continuous, 31 bits of "0" may appear continuously in 15 bits of the error correction code and 16 bits of the transmission data.
However, since the positional relationship with the scramble code is fixed,
As shown in (a), this 31-bit continuous "0" is the latter half 15 bits + the first half 16 bits of the scramble code and XO.
R calculation is performed, and as a result, a code string different from the frame synchronization code is obtained.

Conventionally, since the positional relationship with the scramble code has not been determined, when a frame synchronization code (m bits) is used as the scramble code, XOR may be performed depending on the positional relationship between m bits of consecutive "0" and the scramble code.
The result of the calculation is the same as the frame synchronization code, and there is a possibility that the receiving device may mistake this portion as the frame synchronization code.

It should be noted in the present invention that some scramble codes cannot be used. This corresponds to the scramble code (17) in FIG. 4, and the latter 15 bits of the scramble code are the first half 1 of the frame synchronization code as shown in FIG. 7B.
When the first half 16 bits of the scramble code is 5 bits and the latter half 16 bits of the frame sync code, the scramble coded data becomes the same as the frame sync code in the 31-bit continuous "0" part. Therefore, the k-bit left rotation (or nk-bit right rotation) of the frame synchronization code needs to be removed from the scramble code.

As described above, since the transmission data is added with the error correction code using the BCH (31,16) code, continuous data of 32 bits or more "0" does not occur in the transmission data. Since the transmission data is added with the error correction code using the BCH (n, k) code, no continuous data of "0" or more is generated in the transmission data. In addition, since the code length m of the scramble code is made equal to the code length n of the BCH code, when n bits of "0" continue, the positional relationship between the continuous position and the scramble code position is fixed, and the frame synchronization code The same code as the frame synchronization code does not appear in the transmission signal even if the exclusive OR operation is performed with the scramble code generated from.

Also, the scramble code generating means can easily generate a plurality of scramble codes by copying the frame synchronization code and performing a rotation operation. A large number of scramble codes can be obtained by changing the rotation operation for each communication system, and the confidentiality of data can be obtained by the scramble code different for each communication system.

Therefore, by using the system identification code, the scramble code generating means can easily change the scramble code for each communication system by changing the rotation operation according to the system identification code. For example, 4
If the scrambling code is assigned to the lower 5 bits of the 8-bit system identification code, the confidentiality of the data will be obtained if the system identification code is unknown even if the code content of the frame synchronization code and the scrambling coding method are public. Is obtained.

At this time, the k-bit left rotation of the frame synchronization code is not used as a scramble code. It is the exclusive OR when the latter half (n−k) bit “0” continuation of the BCH (n, k) code and the first half k bit “0” continuation of the next BCH (n, k) code continue. This is because the same code as the frame synchronization code appears when the calculation is performed. When “0” continues for n bits, the scramble code in which the same code as the frame synchronization code appears as a result of the exclusive OR operation is removed in advance.

(Second Embodiment) By the way, when the BCH (n, k) code is used, the data with error correction code and the scramble coded data are handled in units of n bits. If error correction code processing and XOR operation processing are performed by a microcomputer, n is (2 ^ N) -1 bit (N is a natural number), which is a difficult number to handle, and is preferably 4 bits or 8 bits. Therefore, BCH (n,
k) There is a method of adding a 1-bit parity code to a code and handling it with 2 ^ N bits.

For example, in the BCH (31,16) code,
By adding a 15-bit error correction code and a 1-bit even parity code to the 16-bit transmission data, it is possible to correct up to a 4-bit error in these 32 bits. The communication message format is shown in FIG. Transmission signal (d), reception signal (f), scramble coded transmission data (c), scramble coded reception data (g), error correction code added transmission data (b) and error correction code received data in order from the top. (H), BCH (31, 16) code + parity code, transmission data (a) and reception data (i).

Next, the scramble code will be described.
FIG. 9 shows 31 scramble codes. These are 3
It is obtained by rotating the 1-bit frame synchronization code one bit to the left and adding 1 bit of "0" at the end. For example, the scrambling code (1) in the figure is the frame synchronization code + "0", the scrambling code (2). Is 1 bit left rotation of frame synchronization code + “0”. One of them is selected as a scramble code.

Since the scramble code is obtained from the frame synchronization code which is a pseudo random code, it has the characteristics shown in FIG. The bit difference between different scramble codes is always 1
It will be 6 bits. Here, only the comparison between the scramble codes (1) and (2) and between the scramble codes (1) and (3) is shown, but the bit difference is always 16 bits regardless of which scramble code is compared.

Therefore, as shown in FIG. 11, when the scramble code for transmission and the scramble code for reception are different, half of 31 bits are different between transmission and reception. As a result, the received data cannot be analyzed if the scramble code is different between transmission and reception. That is, confidentiality of data is obtained.

Note that 1 is inserted to make 32 bits.
The bit may be "1" instead of "0". Also 1
The bit insertion position may be at the beginning or the middle of the frame synchronization code, not at the end.

The advantages of using the BCH (n, k) code + parity code and scramble code in combination will now be described. BCH as error correction code
Since the 1-bit parity code is added to the (n, k) code and the 1 bit is added to the frame synchronization code m bits as a scramble code to make (m + 1) and (n + 1) equal, the BCH code and the scramble code are The positional relationship of is fixed.

For example, FIG. 12 shows a case where both the BCH code + parity code and the scramble code are 32 bits.
The first bit of the BCH code always performs the first bit of the scramble code and the XOR operation, and the parity code always performs the second bit of the scramble code and the XOR operation. At this time, as shown in FIG. 12A, BCH (31, 16) code +
When the parity codes are continuous, 16 bits of the error correction code and 16 bits of the transmission data may continuously appear as a 32-bit “0”. However, since the positional relationship with the scramble code is fixed, as shown in FIG. 12A, the 32-bit consecutive "0" means the latter 16 bits of the scramble code +
An XOR operation is performed with the first half 16 bits, resulting in a code string different from the frame synchronization code.

In the case of a BCH (31, 16) code and a scramble code of 31 bits, XO as shown in FIG.
There was a scramble code that could not be used because the result of the R operation was the same as the frame sync code, but this method with 1 bit added can be used without problems as shown in FIG. 12 (b), so attention must be paid to scramble code generation. There is no.

As described above, the BCH is used as the error correction code.
Add a 1-bit parity code to the (31, 16) code,
By adding 1 bit to the frame synchronization code as a scramble code, both become 2 ^ 5 bits, which is a bit number easy to handle by a microcomputer. BCH as error correction code
By adding a 1-bit parity code to the (n, k) code and adding 1 bit to the frame synchronization code as a scramble code, 2 ^ N bits (N is a natural number) are obtained, which is a bit number that can be easily handled by a microcomputer.

The scramble code may be obtained by right rotation in FIGS. 4 and 9.

[0062]

As is apparent from the above description, according to the present invention, the scramble code generated from the frame synchronization code can restrict the continuation of the same bit value and can obtain the confidentiality of the data. .

Since the error correction code using the BCH (n, k) code and the 1-bit parity code are added to the transmission data, no continuous data of (n + 1) bits or more "0" is generated. In addition, the code length (m + 1) of the scramble code is 1 bit longer than the code length n of the BCH code.
Since the length is equal to the length (n + 1) added with the priority code, when n bits of "0" continue, the positional relationship between the consecutive position and the scramble code position is fixed, and the scramble code generated from the frame synchronization code is fixed. Even if the exclusive OR operation is performed, the same code as the frame synchronization code does not appear in the transmission signal.

As an error correction code, BCH (n,
k) By adding a 1-bit parity code to the code and adding 1 bit to the frame synchronization code as a scramble code, 2 ^ N bits (N is a natural number) becomes a bit number that can be easily handled by a microcomputer.

[Brief description of drawings]

FIG. 1 is a block diagram of a transmission device in a communication system according to a first embodiment of the present invention.

FIG. 2 is a block diagram of a receiving device in the system.

FIG. 3 is a diagram showing a communication message format in the system.

FIG. 4 is a diagram showing a scramble code in the same system.

FIG. 5 is a diagram showing characteristics of a scramble code in the same system.

FIG. 6 is a diagram showing an effect of a scramble code in the same system.

FIG. 7A is a diagram showing an effect of a scramble code in the same system, and FIG. 7B is a diagram showing an effect of another scramble code in the same system.

FIG. 8 is a diagram showing a communication message format in the communication system according to the second embodiment of the present invention.

FIG. 9 is a diagram showing a scramble code in the same system.

FIG. 10 is a diagram showing characteristics of a scramble code in the same system.

FIG. 11 is a diagram showing an effect of a scramble code in the same system.

FIG. 12 is a diagram showing an effect of scramble code in the same system.

FIG. 13 is a diagram showing a communication message format in a conventional communication system.

FIG. 14A is a diagram showing an effect of a scramble code of data which is all “0” in the conventional communication system. FIG. 14B is a diagram showing an effect of a scramble code of data which is all “1” in the same system. ) A diagram showing the effect of the scramble code of the same code string data as the scramble code in the same system.

[Explanation of symbols]

1 transmitter 2, 22 sync code storage means 3,23 scramble code generation means 5 Error correction code generation means 6 First computing means 7 Transmission signal generation means 9 Transmission means 10 identification code storage means 21 Receiver 25 Receiving means 26 Synchronous processing means 27 Second computing means 28 identification code storage means 29 Received data analysis means

─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Masahiro Yamamoto 1006 Kadoma, Kadoma City, Osaka Prefecture Matsushita Electric Industrial Co., Ltd. (56) References JP-A-10-66157 (JP, A) JP-A-6- 291759 (JP, A) (58) Fields surveyed (Int.Cl. ⁷ , DB name) H04L 9/18 H04L 1/00 H04L 7/08 JISST file (JOIS)

Claims (8)

(57) [Claims] 1. A communication system comprising at least one transmitting device and one receiving device, wherein the transmitting device and the receiving device have a synchronization code storage means for storing an m-bit frame synchronization code, and one for the frame synchronization code. And a scramble code generating means for generating a scramble code from a code to which bits are added.
First operation means for performing an exclusive OR operation on the transmission data to which the error correction code using the CH (n, k) code and the 1-bit parity code is added with the scramble code to output a transmission signal; A second transmission means for transmitting a transmission signal from one calculation means, wherein the reception device performs an exclusive OR operation on the reception signal received by the reception means with the scramble code to output reception data. Computation means and reception data analysis means for analyzing an error correction code in the reception data from the second computation means are provided, and the code length (m + 1) of the scramble code is the BCH code length n.
Length (n + 1) obtained by adding the 1-bit parity code to
Communication system equal to. 2. A frame synchronization code length m = 31 bits, B
The communication system according to claim 1, wherein the CH (n, k) code is n = 31 bits and k = 16 bits. 3. A scrambling code generating unit performs the Rothe Shon operating the frame synchronization code, a communication system according to claim 1 or 2, wherein generating different scrambling codes for each communication system. 4. A communication method between at least one transmitting device and at least one receiving device, wherein each of the transmitting device and the receiving device stores an m-bit frame synchronization code, and a code obtained by adding 1 bit to the frame synchronization code. A scramble code is generated, and the transmission device performs an exclusive OR operation on the transmission data to which the error correction code using the BCH (n, k) code and the 1-bit parity code are added with the scramble code to obtain a transmission signal. Then, the receiving device analyzes the error correction code in the received data by performing an exclusive OR operation on the received signal received by the receiving means with the scramble code, and the code length (m + 1) of the scramble code is A communication method in which the BCH code length n is made equal to the length (n + 1) obtained by adding the 1-bit parity code. 5. A transmission device communicating with at least one reception device, wherein a synchronization code storage means for storing an m-bit frame synchronization code and scrambling for generating a scramble code from a code obtained by adding 1 bit to the frame synchronization code. Code generation means and a first calculation for performing an exclusive OR operation on the transmission data to which the error correction code using the BCH (n, k) code and the 1-bit parity code are added with the scramble code to output the transmission signal. Means and transmitting means for transmitting a transmission signal from the first arithmetic means,
The code length (m + 1) of the scramble code is the BCH
A transmitting device in which the code length n is equal to the length (n + 1) obtained by adding the 1-bit parity code. 6. A receiving device communicating with at least one transmitting device, wherein a sync code storing means for storing an m-bit frame sync code and scrambling for generating a scramble code from a code obtained by adding 1 bit to the frame sync code. BCH in the received data from the code generating means, the second operating means for performing exclusive OR operation on the received signal received by the receiving means with the scramble code to output the received data, An error correction code using an (n, k) code and a received data analysis means for analyzing a 1-bit parity code are provided, and the code length (m + 1) of the scramble code is the BCH code length n with the 1-bit parity code. A receiving device having a length equal to the added length (n + 1). 7. A recording medium recording a program for causing a computer to function as the transmitting device according to claim 5 . 8. A computer as the receiving device according to claim 6.
A recording medium that records a program for operating the data
body.