KR20060101039A - An interleaving method using elements rearrangement of galois field - Google Patents

Abstract

The present invention relates to an interleaving method of a data communication system using elemental rearrangements of Galois Fields (GFs), and particularly, to perform block interleaving using a matrix of (p-1) × (n-1). In this case, a sequence matrix for interleaving is generated by rearranging the order of elements (p, n) of the Gallias field GF, and then interleaving the input bits using the generated sequence matrix. Through such block interleaving, the present invention can convert a block error into a random form even if a block error exceeding an interleaving matrix size and a jamming signal having a specific period (matrix size and number of rows) are generated, thereby reducing performance degradation at a receiving end. It can be improved.

Gallias Field, Block Interleaving, Element Rearrangement

Description

Interleaving method using element rearrangement of gallois field {AN INTERLEAVING METHOD USING ELEMENTS REARRANGEMENT OF GALOIS FIELD}

1 is a diagram illustrating an example of a matrix form used for conventional block interleaving and an output order of interleaved bits.

FIG. 2 is a diagram illustrating an example of a neighboring bit error occurring when conventional block deinterleaving is performed when a 40-bit burst error is generated by jamming. FIG.

3 is a diagram illustrating an example of a neighboring bit error occurring when conventionally performing block deinterleaving when an error of 20 bits is generated by periodic jamming.

4 is a diagram illustrating a procedure for generating a sequence set generated by using element rearrangement of a gallois field in the present invention.

FIG. 5 is a diagram illustrating a sequence matrix generated using element rearrangement of a gallois field in the present invention. FIG.

FIG. 6 is a diagram showing an example of adjacent bit errors generated when performing block deinterleaving in the present invention when a 40-bit burst error is generated by jamming. FIG.

7 is a diagram illustrating an example of adjacent bit errors generated when performing block deinterleaving according to the present invention when a 20-bit error is generated by periodic jamming.

The present invention relates to interleaving in a data communication system, and more particularly to an interleaving method using elemental rearrangement of Galois Field.

In general, interleaving is a type of channel coding technique that randomizes an input data stream in order to effectively improve adjacent bit errors caused by concentrating bit errors in one place. Types of such interleaving techniques include block interleaving and random interleaving. Among them, block interleaving is known as the simplest and easiest interleaving method.

Figure 1 shows the form of the matrix used for block interleaving and the output order of the interleaved bits. Referring to FIG. 1, each input data is sequentially written for each row of the interleaving matrix, and when the input data is converted into the interleaved data, the data on the matrix is sequentially read from the first column.

However, the conventional random interleaving technique cannot implement a real time random interleaver, and the block interleaving technique is simple and easy to configure, but as shown in FIG. If the size exceeds 10 bits (40 bits), adjacent bit errors occur repeatedly during block deinterleaving, and the receiving end cannot convert the error into a random form. This burst error occurs in the case of jamming where a high power error occurs randomly.

In addition, in the block interleaving scheme, as shown in FIG. 3, when an error occurs with a repetition period equal to the row size (number of rows) by periodic jamming, an adjacent bit error equal to the row size when the block is deinterleaved. There is a disadvantage that (block error) occurs.

Accordingly, an object of the present invention is to provide a new sequence of interleaving matrices for solving adjacent bit errors and an interleaving method using the same.

In order to achieve the above object, in a data communication system which performs block interleaving using a matrix of (p-1) × (n-1), the present invention provides an element (p, n) of the Gallias field GF. Reorder the sequences to generate a sequence matrix for interleaving and then interleave the input bits using the generated sequence matrix. Where p is a prime number and n is an integer.

Preferably, the input bits are filled in the element number order of each row of the sequence matrix sequence upon interleaving.

And performing a module p operation by multiplying the elements of the GF (p) by power. Generating a basic sequence by arranging the calculation results in ascending order and arranging only exponents; Rearranging each element of the GF (n) to generate an initial element sequence, and calculating the basic sequence and the initial element sequence to generate an extended element sequence; It is generated by sequentially arranging the initial and expanded element string in a matrix form.

Preferably, the initial elemental sequence is generated by rearranging the elements of the GF (n) in even-odd or odd-even order.

Preferably, the extended element sequence is generated by adding the respective basic sequence values to the initial element sequence and then performing modulo n-1 operations.

Hereinafter, preferred embodiments of the present invention will be described in detail.

The present invention proposes a method of generating a sequence matrix for block interleaving using elemental rearrangements of Galois Fields (GF), and performing block interleaving using the same. The new sequence matrix is determined such that the data bit order input for each row does not have a specific pattern as much as possible.

Hereinafter, preferred embodiments of the present invention will be described in detail.

The present invention first creates a matrix sequence for block interleaving using primitive elements rearrangement of gallois field (GF).

). In general, when the matrix size of the interleaver to be designed is (p-1) × (n-1), gallois fields GF (p) and GF (n) are used. Where p is a prime number and n is any integer. If a 10 × 10 interleaver matrix is designed, GF (p = 11) is used, and the GF (11) is {0,1,2,3,4,5,6,7,8,9,10. } Has a primitive element. Therefore, the power multiplier of 2, which is the smallest number among the primitive elements of the GF 11, is obtained as shown in Equation (1). The result is the result of Galois Field theory and is the same as the result of performing Modulo 11 operation on general algebraic result (for example,

).

When the result value of Equation (1) is arranged in ascending order, it is expressed as Equation (2) below.

={0,1,8,2,4,9,7,3,6,5}를 얻어 낼 수 있는데, 여기서

는 본 발명에서 얻고자 하는 시퀀스 매트릭스의 기본 시퀀스로 사용된다.In the result value of Equation (2), if only the exponent representing the power of 2 is taken and the set is formed in order

= {0,1,8,2,4,9,7,3,6,5}, where

Is used as a basic sequence of the sequence matrix to be obtained in the present invention.

가 획득되면 본 발명은 GF(n=11)의 원소를 짝수-홀수 순 또는 홀수-짝수 순으로 재배열하여, 또 다른 집합

= {0,2,4,6,8,1,3,5,7,9,}를 생성한다(초기 원소열 생성). 두 집합

와

가 모두 생성되면, 본 발명은

와

를 이용하여 도 4와 같은 연산을 수행하여, 다음 식(3)과 같은 다수의 시퀀스(sequence) 집합(확장 원소열)을 생성한다. First

Is obtained, the present invention rearranges the elements of GF (n = 11) in even-odd or odd-even order, and another set.

= {0,2,4,6,8,1,3,5,7,9,} (initial element string generation). Two sets

Wow

Once all are generated, the present invention

Wow

By using the same operation as shown in Figure 4, to generate a plurality of sequence set (extension element string), such as the following equation (3).

Therefore, if the sequence sets are represented by one matrix, a new sequence matrix for block interleaving is generated, as shown in the following equation (4).

In summary, the expression of generating a new sequence matrix for block interleaving may be expressed as in Equations (5) and (6).

결과값을 오름차순으로 정리한 집합을 나타내고, 상기 p는 prime number이며, n은 임의의 정수이다.Where

It represents a set of result values arranged in ascending order, where p is prime number and n is any integer.

In addition, the present invention performs block interleaving using the generated new sequence matrix. In this case, as shown in Fig. 5, the input bits are filled in the element number order of each row according to the sequence shown in equation (4), and outputted when all the input bits are filled to fit the matrix size. The bits are read out in column order.

As described above, the present invention can effectively overcome the problems of the conventional block interleaving technique by performing block interleaving using a new matrix sequence. That is, as shown in FIG. 6 and FIG. 7, the present invention can convert a block error into a random form even if a jamming signal having a specific period (matrix size and row number) and a block error exceeding an interleaving matrix size are generated. Therefore, there is an effect that can improve the performance degradation at the receiving end.

Although the present invention has been described with reference to the embodiments shown in the drawings, this is merely exemplary, and it will be understood by those skilled in the art that various modifications and equivalent other embodiments are possible. Therefore, the true technical protection scope of the present invention will be defined by the technical spirit of the appended claims.

Claims (10)

In a data communication system for performing interleaving using a matrix of (p-1) × (n-1), Rearranging the order of the elements (p, n) of the Gallias field (GF) to generate a sequence matrix for interleaving; Interleaving input bits using the generated sequence matrix. Where p is a prime number and n is an integer. The method of claim 1, wherein the interleaving is Interleaving method characterized by indicating block interleaving. The method of claim 1, wherein the input bits An interleaving method, characterized in that the interleaving is filled in the element number order of each row of the sequence matrix sequence. The method of claim 1, wherein generating the sequence matrix Performing a power-up of the elements of the GF (p) to perform a module p operation; Generating a basic sequence by arranging the calculation results in ascending order and arranging only exponents; Rearranging each element of the GF (n) to generate an initial element sequence, and calculating the basic sequence and the initial element sequence to generate an extended element sequence; And arranging the initial and expanded element strings in a matrix form. The method of claim 4, wherein the initial elemental sequence And rearranging the elements of GF (n) in an even-odd or odd-even order. The method of claim 4, wherein the expansion element string And adding each elementary sequence value to the initial element sequence, and then performing modulo n-1 operation. In a data communication system for performing interleaving using a matrix of (p-1) × (n-1), Power multiplying the elements p of the Gallias field to perform a module p operation; Arranging the calculation results in ascending order and arranging exponents to generate a basic sequence; Rearranging elements (n) of the Gallias field to generate an initial element sequence, and calculating the basic sequence and the initial element sequence to generate an extended element sequence; Generating a sequence matrix by arranging the initial and extended element sequences in a form; Interleaving input bits using the generated sequence matrix. Where p is a prime number and n is an integer. 8. The method of claim 7, wherein the interleaving is Interleaving method characterized by indicating block interleaving. The method of claim 7, wherein the initial elemental sequence And rearranging the elements of GF (n) in an even-odd or odd-even order. The method of claim 7, wherein the expansion element string And adding each elementary sequence value to the initial element sequence, and then performing modulo n-1 operation.

Images