KR101486376B1 - Methods of joint coding in mobile communication system - Google Patents

Abstract

A joint coding method in a mobile communication system according to the present invention is a method of performing a first minimum Hamming to block-code first data of k1 bits and second data of k2 bits requiring different reception signal qualities, Constructing a first block code generation matrix that satisfies a distance, and constructing a second block code generation matrix that satisfies a second minimum hamming distance, wherein the first block code generation matrix, the second block code generation matrix, And constructing a third block code generation matrix including a zero matrix. Two data requiring different signal qualities can be encoded and transmitted through one coding scheme through the above-described unicoding method, so that a received signal quality required for each data can be obtained at the time of decoding.

Coding, RM Code, Minimum Hamming Distance, LTE, CQI

Description

[0001] The present invention relates to a joint coding in mobile communication system,

BACKGROUND OF THE INVENTION 1. Field of the Invention [0002] The present invention relates to a data mining method in a mobile communication system, and more particularly, to a method of coding two data having different received signal qualities using a single coding method.

In the communication system, information that the transmitting side and the receiving side exchanges includes control information and data information. The data information refers to user data corresponding to a payload, and the control information refers to information for transmitting / receiving data information on a transmission channel such as a system configuration, modulation, and coding scheme. In order to efficiently use the limited radio resources, the control information is generally configured to have a minimum length. However, due to the influence on the system performance, the control information is subjected to a strong encoding scheme for error on the radio channel.

The coding schemes are generally classified into a block coding scheme, a convolutional coding scheme, and a turbo coding scheme. The block coding scheme encodes an input sequence in units of one block at a time without using a memory. This means that the length of the codeword is not variable but has a length of fixed codeword, unlike the convolutional coding scheme. The most widely used block codes include a Hamming code, a Reed-Solomon code, and a Reed Muller code.

Convolutional coding uses a shift register, which is a type of memory, and is mainly used for encoding voice data. The turbo coding scheme is performed by a combination of a recursive systematic convolutional (RSC), interleaving, and iterative decoding, and is mainly used to encode user data, not voice data .

These various encoding schemes may be classified into various coding schemes depending on the contents of the input data to be encoded, repetition allowability of input data transmission, sensitivity of transmission delay and importance of transmission contents, Is to be used.

In the 3GPP mobile communication system, which is a standardization organization of the 3G mobile communication system, a short-length block coding method, a tail-biting convolutional coding method, a simplex method, A code repetition coding method or the like is used.

In these various coding schemes, it is determined which coding scheme is applied according to the target signal quality of the control information transmitted at the receiving side as described above. Generally, control information encoded in a specific encoding scheme is generally required to satisfy the same signal quality (e.g., block error rate, etc.).

As described above, in the case of coding the control information of the mobile communication system, the control information requesting the specific signal quality can not be encoded like the control information requesting the different received signal quality.

It is an object of the present invention to provide a method of coding data requiring different received signal quality in a mobile communication system using a single coding scheme .

Another object of the present invention is to improve the efficiency of a system by encoding a plurality of data with a smaller transmission power.

In one aspect of the present invention, a method of block coding of first data of k1 bits and second data of k2 bits, which require different received signal qualities, is described. To this end, a first block code generation matrix satisfying a first minimum Hamming distance and a second block code generation matrix satisfying a second minimum hamming distance are constructed, and the first block code generation matrix, Block code generation matrix including a two-block code generation matrix and a zero matrix having a specific size, and encoding the serial combination data of the first data and the second data into n-bit length by the third block code generation matrix do.

Preferably, the first block code generator matrix is divided into a first sub-matrix and a second sub-matrix each having a third minimum Hamming distance and a fourth minimum Hamming distance that are equal to or greater than the first minimum Hamming distance.

Preferably, the received signal quality required for the second data is higher than the received signal quality required for the first data.

Preferably, the last n2 columns (coloumn) of the third block code generation matrix are subjected to the remaining columns and column permutation.

Preferably, the column n2 is a column size of the second block code generation matrix.

According to the embodiments of the present invention, the following effects can be obtained.

First, two pieces of data requiring different signal qualities can be encoded and transmitted by one encoding technique, so that the received signal quality required for each data can be obtained when decoding.

Secondly, it is possible to satisfy the quality of the received signal of two transmission data even with a small transmission power, thereby increasing the efficiency of the system.

Hereinafter, the structure, operation and other features of the present invention will be readily understood by the embodiments of the present invention described with reference to the accompanying drawings. The following detailed description, together with the accompanying drawings, is intended to illustrate exemplary embodiments of the invention and is not intended to represent the only embodiments in which the invention may be practiced.

The embodiments of the present invention described below are applicable to a multi-carrier multiple access system considering mobility of a terminal, for example, a mobile communication system using OFDM (hereinafter referred to as an 'OFDM mobile communication system'). Also, the present invention is applicable to multi carrier (MC) -CDMA, single carrier-FDMA, Walsh-Hadamard-FDMS, and DFT (Discrete Fourier Transform) spread OFDMA.

The present invention can also be applied to the IEEE 802.16e system and the IEEE 802.16m system, which are standard specifications for the OFDM mobile communication system. [Related standards are IEEEStd 802.16e-2005 and http://www.ieee802.org/16/ published.html]. The present invention can also be applied to other similar mobile communication systems such as Evolved Universal Terrestrial Radio Access (E-UTRA), also referred to as Long Term Evolution (LTE).

The E-UMTS system evolved from the existing WCDMA UMTS system and is currently undergoing basic standardization work in the 3rd Generation Partnership Project (3GPP). For details of the technical specifications of UMTS and E-UMTS, refer to Release 7, Release 8 and Release 9 of "3rd Generation Partnership Project (Technical Specification Group Radio Access Network)" respectively. It can also be applied to IMT-A systems such as LTE-A (Advanced). Also, the present invention can be used in various communication systems including a method using a single antenna and multiple antennas.

Communication systems are generally deployed to provide various communication services such as voice, packet data, and the like. This technique can be used for a downlink or an uplink. The downlink means communication from the base station to the terminal, and the uplink means communication from the terminal to the base station. A base station generally includes a network excluding a terminal in a communication system including not only a physical transmission terminal but also an upper layer, which is a fixed point communicating with the terminal. Therefore, in the present invention, the network and the base station have the same meaning as a part symmetrical to the terminal. The terminal may be fixed or mobile.

FIG. 1A shows a joint coding method for coding two data proposed by an embodiment of the present invention into one coding scheme. More specifically, the embodiment of FIG. 1A shows a structure of a block-coded code word generation matrix capable of providing a minimum Hamming distance for two different data, respectively. In order to construct the codeword generating matrix of FIG. 1A, a code C = (n, k) is designed which can provide different minimum hamming distances for two different input data. In this case, n = n1 + n2 and k = k1 + k2. k1 denotes the length of the first data, and k2 denotes the length of the second data to be encoded. Preferably, in the present embodiment, block coding may be used as a method of generating the code C.

In the following embodiments, designing the code C = (n, k) means designing a block code generation matrix for encoding k bits of input data to be encoded into a length of n bits by a block coding method. And a code C = (n, k) (also referred to simply as code C) denotes a set of codewords generated from the block code generation matrix and the input data. This will be described in detail in Equation (1).

C = (n, k)

 Where n denotes the length of the generated codeword and k denotes the length of the input data to be encoded. Generally n? K.

In this case, the codeword C = (n, k) (briefly codeword C) means that a codeword having a length n (one of 2 ^k that can be generated) is generated when data having a length k is encoded by a specific block coding method to be.

C = (n, k, d)

N and k used in Equation (2) are the same as in Equation (1), and d means the minimum hamming distance between each codeword in the set of codewords C that can be generated. The Hamming distance is the number of positions whose bits are different from each other in the position of each bit in different binary bit sequences. That is, if X = {10101} and Y = {00000}, the Hamming distance of X and Y is 3. In this case, the Hamming distance between the two bit sequences is equal to the Hamming weight value corresponding to the number of 1 in the result of exclusive-ORing the two bit sequences. The minimum Hamming distance means the minimum Hamming distance of the Hamming distance between any two bit sequences in three or more different bit sequences.

It is well known that the error correction characteristic on the radio channel for the input data is better as the codeword having the smallest Hamming distance between the variable input data having a predetermined length and the codeword generated from the specific block code generating matrix is good. In the following embodiment, designing the code C = (n, k, d) designates a block for generating one codeword from a codeword set having a length n where the minimum Hamming distance is d for variable input data of length k Code generation unit, specifically, a block code generation matrix.

In this embodiment, the code C = (n, k), which provides different minimum hamming distances for the first data to be encoded (i.e., the first input data) and the second data to be encoded For designing, the code C ₁ = (n ₁ , k, d ⁽¹⁾ _min ) 210 and 220 and the code C ₂ = (n ₂ , k ₂ , d ⁽²⁾ _min ) 230 are designed first.

The code C ₁ is further divided into sub-codes C _{1 , 1} = (n ₁ , k ₁ , d ^(1,1) _min )

And the sub-codes of the sub-codes C _{1 , 2} = (n ₁ , k ₂ , d ^(1,12 _min )) 220 and has the minimum Hamming distance characteristics of Equations (3) and (4), respectively.

d ^(1,1) _min ? d ⁽¹⁾ _min

That is, the minimum hamming distance of sub-code C _{, 1, 1} is equal to or greater than the minimum hamming distance of code C ₁ .

d ^(1,2) _min ? d ⁽¹⁾ _min

That is, the minimum Hamming distance of the set of sub-codes C _{, 1, 2} is equal to or greater than the minimum Hamming distance of the code C ₁ .

Also it generates a zero matrix 240, the row k1, n2 columns (i.e. k ₁ × n _2).

The C ₁ code generation matrix, the C ₂ code generation matrix and the zero matrix, which are designed and generated as described above, are combined as shown in FIG. 1, so that two data requiring different reception signal qualities, A block code generation matrix for encoding by the method of FIG.

At this time, the sub-code C _{, 1,1} generation matrix, sub-code C _{, 1,2} generation matrix, code C ₂ generation matrix and zero matrix are referred to as a base matrix of the block code generation matrix. 1B shows a block code generation matrix according to an embodiment of the present invention.

As shown in FIG. 1B, the code C generating matrix may be divided into two generating sub-codes S ₁ = (n, k ₁ ) and S ₂ = (n, k ₂ ). Equation (5) represents S ₁ and S ₂ .

In Equation (5 ⁾ , C _i ^(1,1) , C _j ^(1,2) and C _j ⁽²⁾ are the codes C _{1 and} C _{1 , the} generating matrix C _{1 , the} generating matrix C ₂ , ≪ / RTI > In Equation ^{_{5 C i, k (1,1)}} , C j, k (1,2)) refers to the k-th element of a selected row of each code C _{1, 1} generation matrix.

2 shows classification of a codeword set in a codeword generation method according to another embodiment of the present invention.

As shown in FIG. 1B, the sub-codeword resulting from block coding of the first input data of length k ₁ using the block code generation matrix 250 for generating the sub code S ₁ is expressed as S _i ^{( 1)} and the second input data of length k ₂ is block-coded using the block coding matrix 260 for generating the sub-code S ₂ , the sub-codeword resulting from the block coding of the length k ₂ is expressed as S _j ⁽²⁾ .

The sum coded value lost by performing an exclusive-OR sum between the elements of each codeword of S _i ⁽¹⁾ and S _j ^{(2) corresponds to} the sum of the first input data and the second input data, Is generated by block coding using a block coding generation matrix for generating a code C with data (connecting first input data and second input data). This is obtained from the characteristics of a linear block coding matrix. FIG. 2 illustrates a method of classifying a code word set of code C, which codes two different data using a single coding scheme, using the characteristics of the linear block coding matrix.

In FIG. 2, the sum of codewords refers to a vector sum that performs an exclusive-OR sum between elements of each codeword. A total of 2 ^k2 codewords can be generated from the second input data having the length k2. In the embodiment of FIG. 2, a class is created based on a codeword that can be generated from the second input data, and exclusive-OR is performed on both the second input data and the codewords that can be generated from the first input data in each class. As described above, all of the codewords are generated when one input data (hereinafter referred to as coupled input data) to which the first input data and the second input data are connected in series passes through the block coding generation matrix for generating the code C .

) 각각을 원소 대 원소의 exclusive-OR 합을 한 모든 경우를 나타낸다.Class 0 shown in Fig. 2 Total 2 ^k2 of creatable control codeword first code of for a second input data ^(S ₀ ⁽²⁾⁾ and the total possible generation of a first input data 2 ^k1 codeword (S ₀ ⁽¹⁾ , S ₁ ⁽¹⁾ , ...,

) Are all exclusive-ORed together.

Class 1 is a total of 2 ^k2 capable of generating control code words of the second code to the second input data ^(S ₁ ⁽²⁾⁾ of the total possible production of the first input data ^k1 second codeword exclusive- of the element for each element Indicates all cases with OR sum. In this way, class 2 ^k2 -1 can be expressed.

Here, an exclusive-OR sum between the codeword represented by the exclusive-OR sum between the selected sub-codewords S ₁ and S ₂ in an arbitrary class and another sub-codeword S ₁ and S ₂ selected within the same class The Hamming distance between the other codewords can be expressed by Equation (6).

In Equation (6), d (a, b) represents the Hamming distance between the codeword a and the codeword b, and w (a) represents the Hamming weight of the codeword a.

Hamming weight refers to the number of nonzero elements among elements of an arbitrary codeword. The Hamming weight of an arbitrary codeword is equal to the Hamming distance from a codeword having only 0 of the same length.

Equation (6) means that a codeword represented by an exclusive-OR sum between sub-codewords S ₁ and S ₂ selected in a certain class and another sub-codeword S ₁ and S ₂ selected within the same class exclusive-OR represent the sum is equal the humming distance between the selected sub-code words among the different code words with a Hamming weight exclusive-OR, this value is also the selected two sub-codes of the class word S ₁ (i.e., S _i ^{( 1)} and S _j ⁽²⁾ ) (the exclusive-OR sum of two identical S _t ⁽²⁾ is zero, so there is no influence on the calculation of the Hamming weight).

The Hamming weight of the sub-code of the selected sub-code S _{1 and} the sub-code of the sub-code S _{2 in} the class will of course be equal to or greater than the minimum hamming distance d ^(1,1) of the sub-code S ₁ , D ^(1,1) will be greater than or equal to d ⁽¹⁾ _min . That is, the minimum Hamming distance (Intra-class minimum) within a certain class can be expressed by Equation (7).

In the same way, two different classes, class t ₁ , class t ₂ (t ₁ ≠ t ₂ ) is given by Equation (8).

Equation (8) shows that even if a hamming distance between any two codewords is the same as the Hamming weight of the two codewords and the row and column of the linear block code generation matrix are exchanged to generate a codeword, the matrix characteristics such as the minimum hamming distance are the same ≪ / RTI > That is, the minimum Hamming distance (Inter-Class minimum hamming distance, d _min ^(inter) ) between arbitrary different classes can be expressed by Equation (9).

S _i ⁽¹⁾ + S _j ⁽¹⁾ and S _t1 ⁽²⁾ + S _t2 ^{(2) shown} in Equations ^{(6) and (8)} can be expressed by Equation (10).

In Equation (10 ⁾ , c _u ⁽¹⁾ and c _v ⁽¹⁾ are the codewords of the code C ₁ and c _w ^{(2) shown} in FIG. c _{u, k} ⁽¹⁾ is the mean k (0≤k≤n ₁ -1) of the code word c _u ⁽¹⁾ th element, and c _{v, k} ⁽¹⁾ is the codeword c _v ⁽¹⁾ k ⁽ _K ≤ n ₁ -1) element and c _{w , k} ⁽²⁾ means k (0 ≤ k ≤ n ₂ -1) th element of c _w ⁽²⁾ n ₁ denotes the length of the codeword of the code C ₁ , and n ₂ denotes the length of the codeword of the code C ₂ .

From equations (6) to (10), it is possible to minimize the minimum number of codes C = (n, k, d _min ) in FIG. 1A for coding two input data requiring different signal qualities for one purpose, The Hamming distance is expressed by Equation (11).

That is, since the codewords generated from the code C block code generation matrix of FIG. 1A are the same as the codewords obtained from the classes shown in FIG. 2, the minimum Hamming distance of the code C is the minimum Which is equal to the smaller of the Hamming distance (Intra-class minimum hamming distance) and the minimum Hamming distance between any different classes obtained from equation (9).

In another embodiment of the present invention, when two input data are encoded by one coding scheme, when there is a superiority of signal quality required between input data, input data requiring a higher signal quality has a larger minimum hamming distance Suggest a plan. For this purpose, when input data having different received signal qualities are encoded, the same minimum Hamming distance exists between the codewords existing in any class shown in FIG. 2, but different codewords existing in different classes are different It is necessary to design a block code generation matrix having the characteristics as in Equation (12) while having the minimum Hamming distance characteristic.

인 서브부호 C_{1 ,1} 과 부호 C₁을 각각 선택할 수 있다. 이를 위해 부호 C₁의 블록 코드 생성 행렬을 먼저 설계하고, 이후

의 관계를 갖도록 부호 C₁을 서브부호 C_{1 ,1} 과 서브부 호C_{1, 2} 로 분할할 수도 있다.In order to satisfy the above requirements,

The sub-codes C _{1 , 1} and C ₁ can be selected. For this purpose, the block code generation matrix C ₁ is designed first,

So as to have a relationship of the code it may be divided into sub-code C ₁ C _{1, 1} and the sub unit No. C _{1, 2.}

When the condition of Equation (12) is satisfied, the probability of erroneously decoding the codeword other than the class in the course of decoding the specific codeword of the code C becomes smaller than the probability of erroneously decoding the codeword in the class. This results from the classification of the class scheme shown in FIG. 2 and the different minimum Hamming distance characteristics between the classes.

The particular class is selected for the first input data and second input data are each encoded sub-code language codes of S ₁ and the sub-code S ₂ sub-codes, as shown in Figure 2 for purposes of explanation S ₁ and the sub-code S ₂ The codeword of the code C denoted by exclusive-OR of the codeword C is transmitted on the radio channel. If a codeword of the transmitted code C is decoded by the receiving side, the codeword of the received code C is erroneously lost due to a loss in the wireless transmission process. If an error occurs in the codeword of the code C, The probability that the probability of being decoded by the class is decoded in the transmitted specific class to the codeword of the sub-code S _{1 that} is not transmitted instead of the codeword of the correct sub-code S ₁ becomes large. That is, the codeword of sub-code S ₂ is more error-resistant codeword than the codeword of sub-code S ₁ .

Using this characteristic, input data requesting a higher received signal quality than the codeword of sub-code S ₁ is allocated to the codeword of sub-code S ₂ .

FIG. 3 shows a flowchart of a joint encoding procedure according to an embodiment of the present invention. FIG. 3 illustrates a joint coding procedure for coding two input data requiring different reception qualities in accordance with the embodiments shown in FIGS. 1A and 2 with one coding technique.

Let the first input data be the first input data and the second input data be the second input data. It is also assumed that the received signal quality of the second input data is better than the received signal quality of the first input data.

The first input data has a length k ₁ When encoded as bits, n ₁ And the second input data is a code word having a length k ₂ When encoded as bits, n ₂ Lt; / RTI > n = n ₁ + n ₂ And k = k ₁ + k ₂ to be. Although the first input data and the second input data are treated as one input data and one codeword is generated using one encoding technique in the present embodiment, a procedure in which each input data is encoded to satisfy different received signal qualities .

1, a block coding generation matrix is designed indirectly by designing a plurality of basic matrices and combining them, instead of designing a block coding generation matrix for directly generating a combined code for such a joint coding scheme. do. A description of the specific procedural flow follows.

A first input data and the minimum Hamming distance for the combination of the input data k-bit length corresponding to the total length of the bit sequence of the second input data d ⁽¹⁾ n is _{1 min} A block code generation matrix C ₁ capable of generating a codeword having a bit length is designed (S310). The minimum Hamming distance with respect to the first input data from C ₁ d ^(1,1) _min of n ₁ A block code generation matrix C _{1 , 1} capable of generating a codeword having a bit length is selected (S320). These C _1, k ₁ is selected as a C ₁ to C _{1, 1 1} It can also be called bases.

Next, for the second input data, n ₂ ⁽ _min A block code generation matrix C ₂ capable of generating a codeword of a bit length is designed (S330).

In order to satisfy the condition that the received signal quality of the second input data must be higher than the received signal quality of the first input data when designing the block code generation matrix in S310 and S330, Equation (12) ). ≪ / RTI >

Next, as shown in FIG. 1A, a matrix of k rows, including a zero matrix (k ₁ x n ₂ ) of a predetermined size, n A linear block coding generation matrix for a code C having a column is designed (S340).

In operation S350, one codeword is generated using the generated linear block coding generation matrix and the combined input data having one row k columns.

When the generated codeword is wirelessly transmitted, there is a possibility that a severe error occurs in a specific codeword region due to fading on a radio channel. Although the specific codeword region is coded so as to satisfy the better received signal quality as in the embodiment of FIG. 3, there is a possibility that the codeword region is focussed intensively and the decoding of that portion fails. Another embodiment of the present invention proposes a solution to such a problem.

FIG. 4 illustrates a method of constructing a block coding generation matrix proposed by another embodiment of the present invention.

(C _{1 , 1,} C _{1 , 2} , C ₂ ) of the block coding generation matrix for the code C = (n, k) shown in the embodiment of FIG. The minimum Hamming distance characteristic of the finally generated code C is not affected even if the data is performed. That is, the codewords obtained from the input data and all possible generating matrix structures obtained by the row / column permutation of the base generating matrix have the same characteristics as those obtained from the block coding generating matrix of the original code C and the input data.

If a burst error occurs in the last n ₂ bits of the second input data having a high degree of importance using this property, the ability to correct an error occurring in the second input data is largely lost. Such characteristics are shown in Fig.

As shown in FIG. 4, it can be seen that the second half (C ₂ .Y) of the final generated codeword corresponds to the codeword for the second input data. In order to prevent the second input data from being decoded due to a concentrated channel error occurring in this portion, in the other embodiment of the present invention, the last n ₂ columns of the block coding generation matrix are permutated (preferably n _One And the C ₂ generator matrix portion is appropriately distributed in the entire column to generate a new code.

FIG. 5 illustrates a block diagram for performing a coder encoding process according to an embodiment of the present invention. The first input data of k ₁ bits requiring a specific received signal quality and the second input data of k ₂ bits requiring a specific received signal quality higher than the first input data are input to one unified encoder so that an n- .

At this time, it has been described that the first input data is arranged in the first half of the combined encoder and the second half of the second input data is arranged in the second half to make one bit sequence. Of course, if the first input data requires a higher received signal quality, it can be disposed and processed in the latter half as opposed to the above example.

Hereinafter, embodiments of the present invention are applied to a 3GPP LTE system which is a fourth generation mobile communication system. Hereinafter,

In the 3GPP LTE system, the terminal transmits information on the current channel state to the base station. This is referred to as a channel quality indicator (CQI). Specifically, the UE transmits a CQI to a base station through a physical uplink control channel (PUCCH). A block error rate, the received signal quality information CQI (targer quality) required when received on the reception side of the base station ^10-1 to ^10-2.

In the 3GPP LTE system, Hybrid Automatic Request Repeat (HARQ) is applied. In the 3GPP LTE system, it is necessary to inform the transmitter whether the receiver has normally received the data block for the data block transmitted by the transmitter. (Hereinafter referred to as " AI "). AI is the received signal quality information (quality targer) the block error rate is required when received on the reception side of the base station ^10-2 to ^10-3. Therefore, AI information requiring higher received signal quality should be encoded by a sub-code having a larger minimum Hamming distance. That is, the present invention is applied to the following embodiments in which CQI information is used as first input data and AI information is used as second input data.

1. LTE Application First Embodiment

The basic assumptions of the first embodiment are as follows.

A first input _{data: CQI (k 1 = 8,} n 1 = 15)

Second input data: AI (k ₂ = 2, n ₂ = 5)

Code C ₁ = (15,10) Encoding method: (16,11) A part of the second order Reed Muller code (second RM code) is selected.

Code C ₂ = (5,2) Encoding: (7,4) Systematic hamming code. (For details of the second order Reed-Muller coding scheme and the systematic Hamming coding scheme, see "Theory of the error correcting codes, North Holland, 1972" by FJ Mac Williams and NJASloane " The above embodiment is applied.

를 위한 블록 코드 생성 행렬을 설계한다. 이를 위해 (16,11) 2차 RM 부호의 11개의 기초 행들(bases) 가운데 1개의 기초 행을 제외한 나머지 10개의 기초 행들을 선택하고, 다시 이들로부터 하나의 공통 비트를 제거하여 15행 10열(15,10)의 생성 행렬의 기초 행을 구성한다. 일례로, (16, 11) 2차 RM 부호의 11개의 기초 행들 가운데 모든 원소가 1인 기초 행을 우선 제거하면, 선택된 10개의 기초 행들 가운데 하나의 공통 비트는 항상 0이 되어, 이들 10개의 기초 행들로 구성되는 부호어에서 해당 비트를 제거하여도 전체 부호어의 해밍 무게 분포에는 영향을 미치지 않게 된다. 도 6에 도시된 블록 코드 생성 행렬의 기초행들( d[i], i=0, 1,..., 10 )은 이와 같은 과정을 통해 얻은 기초 행들이다.Priority code

We design a block code generation matrix. To this end, the remaining 10 base lines except for one base line among the 11 base lines of the (16, 11) second-order RM code are selected, and one common bit is removed therefrom, 15,10). ≪ / RTI > For example, if the base row of all the 11 basic rows of the (16, 11) second-order RM code is removed first, one common bit of the selected 10 base rows is always 0, The removal of the corresponding bit in the codeword composed of the rows does not affect the hamming weight distribution of the entire codeword. The base rows d [i], i = 0, 1, ..., 10 of the block code generation matrix shown in FIG. 6 are the basic rows obtained through this process.

을 위한 선형 블록 코딩 생성 행렬은 부호 C₁의 생성 행렬 중 10개의 기초 행들 가운데 다시 두 개의 기초 행들을 추가적으로 제거한 나머지 8개의 기초행들로 구성되어 진다. 일례로, 이는 도 6에 도시된 부호 C₁의 생성 행렬의 기초 행들 가운데 2차 기초 행들에 해당하는 마지막 2개의 기초 행들들을 제거하여 얻을 수 있다.FIG. 6 shows a block code generation matrix according to the first embodiment of LTE application of the present invention. Then,

A linear block coding generation matrix for generating a linear block coding matrix is composed of the remaining 8 basic rows, which are obtained by further removing two base rows among 10 base rows among the generation matrix of the code C ₁ . For example, this can be obtained by removing the last two base rows corresponding to the second base rows among the base rows of the generator matrix C ₁ shown in FIG.

At this time, the reason why the second basis matrix of the second RM code is removed is because the number of codewords having a minimum Hamming distance in the Hamming weight distribution of the codeword obtained after the removal can be further reduced. The block code generation matrix of C ₁ and C _{1 , 1} obtained through the above process is as shown in FIG.

As shown in FIG. 6, the code C ₁ consists of 10 base lines (10 bases of C _{1 in} FIG. 6), and the sub-code C _{1 , 1} consists of 8 base lines (8 bases of C _{1 , 1} )

At this time, it can be understood that the minimum hamming distances of the code C ₁ and the sub codes C _{1 , 1} are as follows as shown in the following equation (13).

Next, the block code generation matrix C ₂ = (5, ₂ ) is designed. The C ₂ block coding generation matrix in the present embodiment can be defined as basic codes obtained by shortening (7, 4) systematic Hamming codes to (5, 2) codes as described above The above-mentioned method is described in "Theory of the error correcting codes, North Holland, 1972" by FJ McWilliams and NJASloane.

In this embodiment, the basic rows as shown in Equation (14) are used as the block coding generation matrix of the code C ₂ . Different baselines may be used depending on the usage environment.

m '[0] = [1,0,1,0,1] m' [1] = [0,1,1,1,1]

에 해당하게 되므로 수학식 12의 조건을 충족하게 되므로 제 2 입력 데이터가 더 높은 수신 신호 품질을 갖추게 된다.In this case, d ⁽²⁾ _min = 3. therefore

The condition of Equation (12) is satisfied, so that the second input data has a higher received signal quality.

The code generation geochimyeon the above step C _1, C ₂ code based on the code C = (20,10) of the basic generator matrix as in Fig. 1a for combined coding _{(C 1, 1, C 1} , 2, C ₃ , zero matrix) to construct a block code generation matrix. The final generated block code generation matrix for this embodiment is shown in Fig.

FIG. 7 illustrates a block code generation matrix according to the first embodiment of LTE application of the present invention. The base rows u [i], i = 0, 1, ..., 10 of the block code generation matrix finally generated according to the procedures shown in Fig. 7 are divided into C _{1 ,} The base rows of the matrix or the base rows of the sub-codes C _{1 , 2} and the code C ₂ generation matrices. Also, the block code generation matrix generated above can be used as another block code generation matrix by performing interline / hot permutation according to system conditions as described above.

Next, the 8-bit CQI information is allocated to the first input data, the 2-bit AI information is allocated to the second input data, and the first input data is placed in the first half and the second input data is arranged in the second half, And generates a codeword using the generated block code generation matrix.

FIG. 8 shows reception performance at a receiving side when a codeword is generated according to the first embodiment of LTE application of the present invention and is transmitted through a wireless channel. In the embodiment of FIG. 8, a codeword obtained by subjecting CQI information (8 bits) and AI information (2 bits) to a joint coding is transmitted according to the first embodiment of LTE application, and the receiver side performs ML (Maximum Likelihood) decoding And a block error rate (BLER) of each of the obtained CQI information and AI information.

The modulation scheme is Binary Phase Shift Keying (BPSK), and the transmission channel is an AWGN (Additive White Gaussian noise) channel. As shown in FIG. 8, each of the CQI information and the AI information satisfies the received signal quality only by the transmission energy of Eb / No = 2.5 dB.

2. LTE Application Example 2

The basic assumptions of the second embodiment are as follows.

A first input _{data: CQI (k 1 = 9,} n 1 = 15)

Second input data: AI (k ₂ = 1, n ₂ = 5)

Code C ₁ = (15,10) Encoding method: (16,11) Construct partly from 2nd RM codes.

Code C ₂ = (5,1) sign method: Defined as the base line of the repetition code.

를 위한 블록 코딩 생성 행렬을 설계한다. For convenience of description, in the same manner as LTE Embodiment 1,

We design a block coding generation matrix for

생성 행렬은 부호

생성 행렬의 10개의 기초 행들 중에서 하나의 기초행을 추가로 제거하여 생성하는데 본 실시예에서는 맨 아래 기초 행을 추가로 제거한 나머지 9개의 기초항들로 구성하였다. 시스템 상황에 따라 다른 방식의 적용도 가능하다. 이와 같은 과정을 통해 구해진 부호 C₁과 서브 부호 C_{1 ,1}의 블록 코드 생성 행렬은 도 9에 도시된 바와 같다.Then,

The generator matrix

One of the 10 basic rows of the generator matrix is generated by further removing one base row. In this embodiment, the basic base row is further removed and the remaining 9 basic terms are constructed. Different methods can be applied depending on the system situation. The block code generation matrix of the code C ₁ and the sub code C _{1 , 1} obtained through the above process is as shown in FIG.

FIG. 9 shows a block code generation matrix according to the second embodiment of LTE application of the present invention. At this time, the minimum Hamming distance of the code C ₁ and the sub code C _{1 , 1} can be found as shown in Equation (15) as follows.

Next, the block code generation matrix C ₂ = ( _5, 1) is designed. In the present embodiment, the code C ₂ The block code generation matrix can be defined as a basic row of a simple repetition code.

이다.For example, when Ack is 1 and Nak is 0 in AI information, the repetition code of Ack is [1,1,1,1,1] and the repetition code of Nak is [0,0,0,0,0]. Therefore, d ⁽²⁾ _min = 5 and therefore

to be.

In this embodiment, the base row is selected as [1,1,1,1,1].

Next, a block code generation matrix C = (20,10) code as shown in FIG. 1A is designed using the generated code C ₁ generation matrix, code C ₂ generation matrix and zero matrix. An example of the configuration of the generated block code generation matrix is shown in Fig.

FIG. 10 shows a block code generation matrix according to the second embodiment of LTE application of the present invention. Also, the block code generation matrix generated above can be used as another block code generation matrix by performing interline / hot permutation according to system conditions as described above.

In this case, the block coding generation matrixes of FIGS. 7 and 10 are all the same except for the last five columns, and thus can be implemented as one basic row structure.

Next, 9-bit CQI information is allocated to the first input data, 1-bit AI information is allocated to the second input data, and the first input data is placed in the first half and the second input data is arranged in the second half, And generates a codeword using the generated block code generation matrix.

FIG. 11 shows reception performance at a receiving side when a codeword is generated and transmitted over a wireless channel according to the second embodiment of the LTE application of the present invention. In the embodiment of FIG. 11, a codeword obtained by subjecting CQI information (9 bits) and AI information (1 bit) to a joint coding is transmitted according to the second embodiment of LTE application, and the receiver performs ML (Maximum Likelihood) decoding And a block error rate (BLER) of each of the obtained CQI information and AI information.

The modulation scheme is Binary Phase Shift Keying (BPSK), and the transmission channel is an AWGN (Additive White Gaussian noise) channel. As shown in FIG. 8, each of the CQI information and the AI information satisfies the received signal quality with only the transmission energy of about Eb / No = 2.7 dB.

3. LTE Application Example 3

The basic assumptions of the third embodiment are as follows.

A first input _{data: CQI (k 1 = 9,} n 1 = 16)

Second input data: AI (k ₂ = 1, n ₂ = 4)

Code C ₁ = (16,10) Sign method: (16,11) Constructs a part of the second RM code.

Code C ₂ = (5, 1) code system: It can be defined as the base line of the repetition code.

을 위한 블록 코딩 생성 행력을 설계한다. 이를 위해 (16,11) 2차 RM 부호의 11개의 기초 행들(bases) 가운데 1개의 기초 행을 제외한 나머지 10개의 기초행들을 선택하는데 모든 원소가 1인 기초행을 제거한다.Priority code

We design blockcoding generation power for. To do this, the base row with all the elements 1 is selected to select the remaining 10 base rows excluding one base row among the 11 base rows of the (16, 11) second-order RM code.

생성 행렬은 부호

생성 행렬의 10개의 기초 행들 중에서 하나의 기초행을 추가로 제거하여 생성하는데 본 실시예에서는 맨 아래 기초 행을 추가로 제거한 나머지 9개의 기초항들로 구성하였다. 시스템 상황에 따라 다른 방식의 적용도 가능하다. 이와 같은 과정을 통해 구해진 부호 C₁과 서브부호 C_{1 ,1}의 블록 코딩 생성 행렬은 도 12에 도시된 바와 같다.Then,

The generator matrix

One of the 10 basic rows of the generator matrix is generated by further removing one base row. In this embodiment, the basic base row is further removed and the remaining 9 basic terms are constructed. Different methods can be applied depending on the system situation. The block coding generation matrix of the code C ₁ and the sub code C _{1 , 1} obtained through the above process is as shown in FIG.

12 shows a block code generation matrix according to the LTE application third embodiment of the present invention. The basic rows m [1] to m [10] in FIG. 12 include the remaining 10 rows excluding m [11] = [1,1, ..., 1] among the base rows of the (16,11) They are basics. From the hamming weight distribution analysis, it can be seen that the minimum Hamming distance between the code C ₁ and the sub code C _{1 , 1} is as follows, as shown in the following equation (16).

13 is a diagram comparing block code generation matrices of each code C ₁ and sub code C _{1 , 1} defined according to LTE application example 1 and LTE application example 3 of the present invention. As shown in FIG. 13, since LTE application example 1 and LTE application embodiment 3 are composed of common base lines (i.e., part of the (16,11) second order RM code base rows), one implementation It is possible to implement only the basic row structure.

Next, the block code generation matrix C ₂ = (4,1) is designed. In the present embodiment, C ₂ The block coding generation matrix can be defined as a basic row of a simple repetition code as in Embodiment 2 of LTE application.

이다.For example, when Ack is 1 and Nak is 0 in AI information, the repetition code of Ack is [1,1,1,1] and the repetition code of Nak is [0,0,0,0]. Therefore, d ⁽²⁾ _min = 4 and therefore

to be.

In this embodiment, the base row is selected as [1,1,1,1].

Next, a block code generation matrix C = (20,10) code as shown in FIG. 1A is designed using the generated code C ₁ generation matrix, code C ₂ generation matrix and zero matrix. An example of the structure of the generated block code generation matrix is shown in Fig.

FIG. 14 shows a block code generation matrix according to the third embodiment of the LTE application of the present invention. Also, the block code generation matrix generated above can be used as another block code generation matrix by performing interline / hot permutation according to system conditions as described above.

Next, 9-bit CQI information is allocated to the first input data, 1-bit AI information is allocated to the second input data, and the first input data is placed in the first half and the second input data is arranged in the second half, And generates a codeword using the generated block code generation matrix.

FIG. 15 shows reception performance at a receiving side in a case where a codeword is generated according to the second embodiment of LTE application of the present invention and transmitted through a wireless channel. In the embodiment of FIG. 11, a codeword obtained by subjecting CQI information (9 bits) and AI information (1 bit) to a joint coding is transmitted according to the second embodiment of LTE application, and the receiver performs ML (Maximum Likelihood) decoding And a block error rate (BLER) of each of the obtained CQI information and AI information.

The modulation scheme is Binary Phase Shift Keying (BPSK), and the transmission channel is an AWGN (Additive White Gaussian noise) channel. As shown in FIG. 8, each of the CQI information and the AI information satisfies the received signal quality with only the transmission energy of about Eb / No = 2.7 dB. In the embodiments described in the above description, the block coding matrix is used as a generation matrix of the second RM code, but various block coding schemes can be used.

Although the foregoing description has been made in order to facilitate the description of the present invention and the embodiments thereof, the transmission side may be a base station of a terminal or a network, and the receiving side may be a base station or a terminal of a network have. The terms used in this document may be replaced by other terms having the same meaning. For example, the terminal may be replaced with a mobile station, a mobile terminal, a communication terminal, a user equipment or a device, and the base station may be replaced with a term such as a fixed station, a Node B (NB), or an eNB.

It will be apparent to those skilled in the art that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. Accordingly, the above description should not be construed in a limiting sense in all respects and should be considered illustrative. The scope of the present invention should be determined by rational interpretation of the appended claims, and all changes within the scope of equivalents of the present invention are included in the scope of the present invention.

FIG. 1A shows a joint coding method for coding two data proposed by an embodiment of the present invention into one coding scheme.

1B shows a block code generation matrix according to an embodiment of the present invention.

2 shows classification of a codeword set in a codeword generation method according to another embodiment of the present invention.

FIG. 3 shows a flowchart of a joint encoding procedure according to an embodiment of the present invention.

FIG. 4 illustrates a method of constructing a block coding generation matrix proposed by another embodiment of the present invention.

FIG. 5 illustrates a block diagram for performing a coder encoding process according to an embodiment of the present invention.

FIG. 6 shows a block code generation matrix according to the first embodiment of LTE application of the present invention.

FIG. 7 illustrates a block code generation matrix according to the first embodiment of LTE application of the present invention.

FIG. 8 shows reception performance at a receiving side when a codeword is generated according to the first embodiment of LTE application of the present invention and is transmitted through a wireless channel.

FIG. 9 shows a block code generation matrix according to the second embodiment of LTE application of the present invention.

FIG. 10 illustrates a block code generation matrix according to a second embodiment of the LTE application of the present invention.

FIG. 11 shows reception performance at a receiving side when a codeword is generated and transmitted over a wireless channel according to the second embodiment of the LTE application of the present invention.

12 shows a block code generation matrix according to the LTE application third embodiment of the present invention.

13 shows a comparison of the block code generation matrix structure according to the LTE application embodiments of the present invention.

FIG. 14 shows a block code generation matrix according to the third embodiment of the LTE application of the present invention.

FIG. 15 shows reception performance at a receiving side when a codeword is generated and transmitted through a wireless channel according to the third embodiment of LTE application of the present invention.

Claims (6)

A method for block coding first data of k1 bits and second data of k2 bits requiring different reception signal qualities, Constructing a first block code generation matrix that satisfies a first minimum Hamming distance; Constructing a second block code generation matrix that meets a second minimum Hamming distance; Constructing a third block code generation matrix including the first block code generation matrix, the second block code generation matrix and a zero matrix of a specific size; And And encoding the serial combination data of the first data and the second data to an n-bit length using the third block code generation matrix Wherein the first block code generator matrix comprises a first partial matrix having a third minimum Hamming distance greater than or equal to the first minimum Hamming distance and a second partial matrix having a second minimum Hamming distance greater than or equal to the first minimum Hamming distance, Divided into a matrix, Wherein in the third block code generation matrix, the zero matrix is located on the right side of the first partial matrix, and the second block code generation matrix is located on the right side of the second partial matrix. delete The method according to claim 1, And the received signal quality required for the second data is higher than the received signal quality required for the first data. The method of claim 3, At least a part of a first sub-code word generated as a first sub-code generation matrix corresponding to k1 rows of the first data and the third block code generation matrix and at least a part of the second data and the remainder of the third block code generation matrix the minimum Hamming distance in each class in the class corresponding to the exclusive-OR operation set between at least a part of the second sub-code generated from the second sub-code generation matrix corresponding to row k2 is smaller than the minimum hamming distance between the classes / RTI > The method according to claim 1, And performing a column permutation on the last n2 columns of the third block code generation matrix and the n2 is a column size of the second block code generation matrix. The method according to claim 1 or 3, Wherein the first data is a channel quality indicator (CQI) and the second data is an ACK / NAK indicator (Acknowledgment of a HARQ process indicator).

Images