JP3166163B2 - Cyclic code transmission method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field] The present invention is applied to a transmission system using a cyclic code. In particular, the present invention relates to a digital signal band compression unit.

〔Overview〕

According to the present invention, in a system for transmitting and receiving data as a cyclic code, the transmission efficiency can be improved by reducing the number of transmission bits by a cyclic code logical operation.

[Conventional technology]

Conventionally, no scheme has been proposed in which bits of a transmission signal are discounted and transmitted without losing information, and means for digital signal band compression has not been implemented.

[Problems to be solved by the invention]

Usually delivery, the method of transmitting the transmission signal, as a signal to be output to the transmission path, the transmission signal polynomial M (x) M (x) = i 0 + i 1 x + i 2 x 2 + ... + i k-1 x k-1 There is a method in which the bit is not transmitted based on a comparison with a previously transmitted signal using a method of band compression technology of a digital signal.

However, since the amount of information to be transmitted does not change because the transmission signal is not discounted, the latter has a disadvantage that the bits cannot be discounted at all times, and the bandwidth cannot be compressed due to the constant reduction of bits.

An object of the present invention is to eliminate such a drawback and to provide a cyclic code transmission system having band compression means.

[Means for solving the problem]

The present invention relates to a transmitting apparatus including a cyclic code generation unit that converts an original signal, which is a codeword having k elements, to generate a cyclic code represented by a k−1-th order polynomial M (x). In a cyclic code transmission system including a receiving device having decoding means for decoding a signal coming from a transmitting device into the original signal,
The transmitting device includes a compression transmitting unit that compresses and transmits the information amount of the cyclic code generated by the cyclic code generating unit, and the receiving device decompresses the signal from the compressed transmitting unit to generate the decoding unit. The present invention is characterized in that it is provided with an elongating means.

Here, the compression transmitting means includes a first division means for dividing the polynomial M (x) by the number n of possible divisions by the m-th generation polynomial G (x) to obtain a quotient polynomial Q (x) ^{′ n} ; When it is determined that the value of the quotient polynomial Q (x) ^{′ n} is equal to or larger than the arbitrarily determined value of the A-th order A and is greater than this value, the j-th order generator polynomial J ( x) divided by the number of times h that can be divided by quotient polynomial Q (x) ^'n'h
, A quotient polynomial Q (x) ^'n'h , a remainder polynomial R (x) obtained in the division process of the first division means and the second division means, and an information bit indicating the number of divisions as an information signal. It is desirable to include a transmitting means for transmitting to the transmission line as a polynomial I (x).

Further, the decompression means is adapted to receive the received information signal polynomial I
In the quotient polynomial Q (x) ^'n'h of (x), the generator polynomial J
(X) is multiplied by the remainder polynomial obtained in the division process of the second division means, and the first multiplication means for obtaining the quotient polynomial Q (x) ^'n by executing the operation over the number h. An operation for adding the remainder polynomial obtained in the division process of the first division means to the result of multiplying the quotient polynomial Q (x) ^'n obtained by the multiplication means by the generator polynomial G (x) is performed over the number of times n. And a second multiplication means for obtaining a polynomial M (x).

[Action]

The transmission signal polynomial Μ (x) has an order of 1 by one division.
, Which means that 1-bit bandwidth has been compressed. Further, among the effects, the quotient polynomial composed of the k- で -1 order is divided by the j-th generator polynomial, so that at least 2-bit band compression can be performed in one process.

〔Example〕

 Hereinafter, an embodiment of the present invention will be described with reference to the drawings.

In this embodiment, as shown in FIG. 1, an original signal which is a codeword having k elements is converted to obtain a polynomial of degree k-1.
Cyclic code generating means for generating a cyclic code indicated by (x)
And a receiving device 2 having a decoding unit 21 for decoding a signal coming from the transmitting device 1 into the original signal. Further, as a feature of the present invention, a transmitting device 1 includes a compression transmission unit 12 for compressing and transmitting the information amount of the cyclic code generated by the cyclic code generation unit 11, and the receiving apparatus 2 decompresses the signal from the compression transmission unit 12 to the decoding unit 21. And a stretching means 22 for providing the same. Here, the compression transmitting means 12 divides the polynomial Μ (x) by the number n of possible divisions by the m-th order generating polynomial G (x) to obtain a first division means 13 for obtaining a quotient polynomial Q (X) ^{′ n.} When it is determined that the value of the product polynomial Q (X) ^{′ n} is equal to or greater than the value of the arbitrarily determined h-order A, the j-th order generating polynomial J A second dividing means 14 for obtaining a quotient polynomial Q (X) ^'n'h by dividing over the number of times h which can be divided by (x); a quotient polynomial Q (X) ^'n'h; a first dividing means 13; And a transmitting means 15 for transmitting the remainder polynomial R (x) obtained in the division process of the second dividing means 14 and information bits indicating the number of divisions to the transmission line as an information signal polynomial I (x). The expansion means 22 multiplies the result obtained by multiplying the quotient polynomial Q (X) ^'n'h of the received information signal polynomial I (x) by the generator polynomial J (x) in the process of division by the second division means 14. First multiplication means for executing the operation of adding the obtained remainder polynomial over the number h to obtain a quotient polynomial Q (X) ^'n
23 and the quotient polynomial Q (X) obtained by the first multiplication means 23
^'N is multiplied by a generator polynomial G (x) and a remainder polynomial obtained in the division process of the first divider 13 is executed over n times to obtain a polynomial Μ (x). And

 Next, the operation of this embodiment will be described.

FIG. 2 and FIG. 3 are flowcharts showing the encoding and decoding algorithms of the compression transmission system using the cyclic code according to the present invention.

On the transmitting side, the k-1 order transmission signal polynomial Μ (x) is represented by m
The quotient polynomial G (x) is divided by the following, and the resulting quotient polynomial Q (X) is divided as much as possible by the generator polynomial G (x).
When the value of (x) ^'n (n is a natural number and indicates the number of divisions) is equal to or greater than a predetermined value A, the division is performed as much as possible by the j-th generation polynomial J (x). carry out. The remaining quotient polynomial Q (x) ^{'n ·' h} , the remainder polynomial R (x) obtained in each division process, and information bits indicating the number of divisions are transmitted to an arbitrary transmission line as an information signal polynomial. On the receiving side, the received information signal polynomial I
Quotient polynomial Q (x) in (x) ^'
The generator polynomial J (x) consisting of the following is multiplied, and the remainder polynomial R (x) ^{′ h} is added thereto, and the above-mentioned multiplication is performed on the (h−1) -th quotient polynomial obtained. At this time, the operation is repeatedly performed for the information bits indicating the division circuit, and the quotient polynomial Q
(X) ^'n is obtained. This is multiplied by an arbitrary m-order generator polynomial G (x), and a remainder polynomial R (x) ^{′ n} is added to perform the above-described multiplication on the (n−1) -th quotient polynomial obtained. This is repeatedly performed for the information bits indicating the division circuit, and finally when the condition is satisfied, the transmission signal polynomial Μ (x) of the element is obtained.

That is, on the transmission side, a transmission signal (k-1 order polynomial) Μ (x) = i ₀ + i ₁ x + i ₂ x ² +... + I _k-1 x ^k-1 (1) G (x) = g ₀ + G ₁ x + g ₂ x ² + ... + g _m x ^m (2)

Μ (x) / G (x) = Q (x) + R (x) (3) where Q (x) is a quotient polynomial of km−1 order, and R (x) is m− This is a first-order remainder polynomial.

_{Q (x) = q 0 +} q 1 x + q 2 q 2 + ... + q km-1 q km-1 ... (4) R (x) = r 0 + r 1 x + r 2 x 2 + ... + r m-1 x m-1 (5) Here, if Q (x) ≧ G (x), the operation of dividing by the m-th order generator polynomial G (x) is represented by Q (x) <Q (x) (6) Repeat until ^If the value of Q (x) ^{′ n} obtained by the equation (7) is arbitrarily determined A with respect to the h-th order A, then Q (x) ^{′ n} ≧ A (8) The second generator polynomial of J (x) J (x) = j ₀ + j ₁ x + j ₂ x ² +... + J _h r ^h (9) where Q (x) ^{′ n} ≧ J (x) (8) Repeating division until it is no longer true, From this, the information signal polynomial is And information indicating how many times the division was repeated L ₀ = log ₂ (n + 1) + log ₂ (h + 1) (12) To the transmission path.

On the receiving side, the information signal polynomial I received from the transmission path
(X) quotient polynomial Q (x) ^{'n ·' h} and remainder polynomial R
(X) ^'h to the quotient polynomial Q (x) ^{' n}
Multiply by a generator polynomial J (x) consisting of: Q (x) ^{′ n−1 · ′ h−1} = J (x) Q (x)
^{'N ·' h} + R (x) ^{· 'h} (14) When the repetition is performed until the secondary side of the information bit L ₀ indicating the number of repetitions of the multiplication is satisfied, And the quotient polynomial Q (x) ^'n and the remainder polynomial R
From (x) ^'n , a quotient polynomial Q (x) ^{' n} is multiplied by an arbitrary m-order generator polynomial G (x), and Q (x) ^'n-1 = G (x) Q (x) ^{' n} + R (x)
^'N (15) When the repetition is performed until the primary side of the information bit L ₀ indicating the number of repetitions of the multiplication is satisfied, And the transmission signal polynomial Μ (x) ′ of order k−1 is obtained.

FIG. 5 shows an example of the effect of the compression transmission system using the cyclic code of the present invention. This example shows a case where the generator polynomial G (x) is of the third and fifth order.

〔The invention's effect〕

As described above, the transmission system using the cyclic code according to the present invention employs a transmission signal polynomial Μ
(X) becomes a k-2 degree polynomial by one division,
Since the transmission signal polynomial is a polynomial of degree k−1, an effect of compressing one bit band by one division can be expected, and a quotient polynomial composed of degree k−m−1 among the effects is expected. Is divided by a generator polynomial of order j, and becomes a polynomial of order k−m−2, which, when combined with the effect described above, has the effect of enabling at least 2-bit band compression in one process.

This effect has an effect proportional to the number of divisions. The information signal polynomial is expressed as follows: Μ (x) −n (bit) = I (x) However, since there are division bits, M (x) −n (bit) + L ₀ = I (x) Expect an effect where the amount shown by (1) is excessive.

[Brief description of the drawings]

FIG. 1 is a block diagram showing the operation of the embodiment of the present invention. FIG. 2 is a block diagram showing the operation of the embodiment of the present invention. FIG. 3 is a block diagram showing the configuration of the embodiment of the present invention. FIG. 4 is a correlation diagram showing the effect of the embodiment of the present invention. DESCRIPTION OF SYMBOLS 1 ... Transmitting apparatus, 2 ... Receiving apparatus, 11 ... Cyclic code generation means, 12 ... Compression transmission means, 13 ... First division means, 14 ...
... Second division means, 15 ... Sending means, 21 ... Decoding means, 22
... decompression means, 23 ... first multiplication means, 24 ... second multiplication means.

Claims (3)

(57) [Claims] 1. A transmitting apparatus comprising a cyclic code generating means for converting an original signal, which is a codeword having k elements, to generate a cyclic code represented by a k-1 order polynomial M (x); In a cyclic code transmission system comprising: a receiving device having decoding means for decoding a signal arriving from the transmitting device into the original signal; wherein the transmitting device has an information amount of a cyclic code generated by the cyclic code generating means. Compression means for compressing and transmitting the signal, and the receiving apparatus comprises expansion means for expanding the signal from the compression transmission means and applying the expanded signal to the decoding means. The compression transmission means converts the polynomial M (x) 'a first dividing means for obtaining ^n, the quotient polynomial Q (x)' quotient polynomial Q (x) by dividing over the number n capable divided by m order of the generating polynomial G (x) to the value of ⁿ is any Includes a value equal to the value of A of the specified h order and is greater than When it is determined that a have value, j following generator polynomial J (x) with possible division number of times h
'A second dividing means for obtaining ^N'h, quotient polynomial Q (x)' division to the quotient polynomial Q (x) over ^N'h, remainder polynomial obtained by dividing the course of the first dividing unit and the second dividing means R
(X) and transmission means for transmitting an information bit indicating the number of divisions as an information signal polynomial I (x) to a transmission path. 2. A transmitting apparatus comprising a cyclic code generating means for converting an original signal, which is a codeword having k elements, to generate a cyclic code represented by a k-1 order polynomial M (x); In a cyclic code transmission system comprising: a receiving device having decoding means for decoding a signal arriving from the transmitting device into the original signal; wherein the transmitting device has an information amount of a cyclic code generated by the cyclic code generating means. Compression means for compressing and transmitting the information signal, and the receiving apparatus comprises expansion means for expanding the signal from the compression transmission means and applying the expanded signal to the decoding means, wherein the expansion means receives the received information signal polynomial I ( The quotient polynomial Q (x) ^'n'h in x) is multiplied by the generator polynomial J (x), and the remainder polynomial obtained in the division process of the second division means is added over the number h. to obtain a quotient polynomial Q ^{(x) 'n} Te A first multiplying means, the generator polynomial G to the quotient polynomial Q obtained in the first multiplication means (x) ^'n
Second multiplication means for obtaining a polynomial M (x) by executing an operation of adding the remainder polynomial obtained in the division process of the first division means to the result of multiplication by (x) over a number n of times. Cyclic code transmission method. 3. A decompression means for multiplying a quotient polynomial Q (x) ^'n'h of a received information signal polynomial I (x) by a generator polynomial J (x) and a second division means. First multiplication means for executing an operation of adding the remainder polynomial obtained in the division process over a number of times h to obtain a quotient polynomial Q (x) ^'n ;
The quotient polynomial Q (x) ^'n obtained by the first multiplying means is multiplied by the generator polynomial G (x) and the remainder polynomial obtained in the division process of the first dividing means is added to the result n times.
And a second multiplying means for obtaining a polynomial M (x) by performing the following.