KR100672347B1 - Flexible data rate Matching Method in 3GPP2 - Google Patents

Abstract

The present invention relates to the next generation mobile communication, and more particularly, to a variable data rate matching method for supporting a variable data rate when using a turbo code on a physical layer. In the variable data rate matching method according to the present invention, in the process of interleaving the channel coded coding sequence to be mapped to the physical layer,

The channel coded coding sequence is divided into two types of code groups having different bit patterns such that the coded sequences of different bit rates channel coded with the turbo code have a constant symbol rate, and thus different code groups in each code group. Each bit is repeated and interleaved by the repetition factor. Therefore, the energy distribution can be given uniformly to each of the two turbo code constituent encoders, thereby improving the decoding performance.

Turbo code, code group, offset

Description

Flexible data rate matching method in 3GPP2}

1 is a block diagram of an encoder for a general turbo code method.

2 illustrates a variable data rate matching method according to the prior art.

3 illustrates a problem of variable data rate matching when using a quarter rate turbo code according to the prior art.

4 is a diagram illustrating a repeating pattern when code groups are not divided.

5 is a diagram illustrating a repeating pattern for a case where code groups are divided according to the present invention.

The present invention relates to the next generation mobile communication, and more particularly, to a variable data rate matching method for supporting a variable data rate when using a turbo code on a physical layer.

In next generation mobile communication (3GPP2), channel coded data needs to be adjusted to the desired data rate in the system in order to be mapped to the physical layer.                         

To this end, the system supports a fixed data rate and a variable data rate method. In particular, among the data transmission modes, the variable data rate method may support an arbitrary data rate in addition to the standard data rate supported by each radio structure of the next generation mobile communication (3GPP2). It is the transmission method to make it possible.

Particularly, at a bit rate of 19.2kbps or higher of next generation mobile communication (3GPP2), a turbo code can be supported by a channel encoding method through a supplemental channel.

This turbo code is provided through two overlapping systematic convolutional (hereinafter referred to as RSC) encoders 10 and 11 and an interleaver 12 having random characteristics. It is configured by connecting in parallel.

Configuration of Turbo Codes Currently Defined on Next Generation Mobile Communication (3GPP2) The RSC encoders 10 and 11 are RSC encoders having a coding rate of 1/3, and the polynomial of the feedback component is octal in '13. ', And the polynomial for parity uses' 15' and '17'.

As the interleaver 12 of the turbo encoder, an interleaver using a linear congruential sequence method is used.

Therefore, since the conventional technology has a structure in which the constituent encoders of 1/3 rate are connected in parallel, the output rate of the basic turbo encoder has 1/6 rate.

However, in practice, the code rates of encoders that can be provided in each radio structure of the next generation communication system (3GPP2) are 1/2, 1/3, and 1/4, and a puncturing pattern for supporting them is required.

Therefore, conventionally, the puncturing pattern according to Table 1 and Table 2 is performed, and bit puncturing is performed on data or tail.

Rate 1/2 Rate 1/3 Rate 1/4 X _k 1111 1111 1111 Y _k 1010 1111 1111 Z _k 0000 0000 1010 X _k '' 0000 0000 0000 Y _k '' 0101 1111 0101 Z _k '' 0000 0000 1111

Rate 1/2 Rate 1/3 Rate 1/4 X _k 1111 1111 1111 Y _k 1111 1111 1111 Z _k 0000 1111 1111

Currently, puncturing techniques to support variable data rates are achieved by combining symbol repetition and uniform puncturing. First of all, the symbol is repeated by a certain factor to make the number larger than the size of the channel interleaver we want to use. Punching removes the part larger than the size of the channel interleaver.

However, a problem may occur when the symbol repetition and puncturing techniques according to the prior art are applied to a turbo code.

That is, the decoder for the turbo code is performed by connecting two Maximum A Posteriori decoders serially through an interleaver and a deinterleaver, and then performing an iterative decoding process, in order to achieve the best performance after decoding. The encoding performance of each component encoder of FIG. 1 should be made identical.

That is, in order to balance the performance of the two decoders of the receiver, it is possible to carry uniform energy in the output parity coded strings of the component encoders 10 and 11 of the transmitters entering the two decoders.

In addition, it can be predicted that the overall performance of the decoder will be optimal only if the energy distribution of each decoder has a uniform distribution on the trellis.

For example, as shown in FIG. 3, all puncturing occurs by gathering only the last parity bit of the second constituent encoder, which results in a problem of degrading the decoding performance of the second decoder.

Therefore, it can be judged that it will adversely affect the overall decoding performance.

Accordingly, an object of the present invention is to provide a variable data rate matching method for a turbo code, which is made in view of the above-mentioned problems of the prior art.

delete

delete

delete

delete

delete

delete

delete

delete

delete

delete

delete

delete

및

을 만족하는 ni 번째 비트에 대하여는 제 2 반복 팩터를 적용하여 반복을 수행하고, 만족하지 아니하는 비트에 대하여는 제 1 반복 팩터를 적용하여 비트 반복을 수행하는 단계와, j 를 0 으로 초기화 하는 단계와, (d)

및

를 만족하거나,

및

를 만족하는 경우,

번째 비트에 대하여, 제 2 반복 팩터를 적용하여 비트 반복을 수행하고, 그 이외의 경우에는, 제 1 반복 팩터를 적용하여 비트 반복을 수행하는 단계와, (e) 상기 (d) 단계를 반복 수행하되, 상기 j 가 n-1 이 되기까지 반복 수행하는 단계 및 (f) 상기 (a)~(e) 단계를 반복 수행하되, 상기 i 가 I-1 이 되기까지 반복 수행하는 단계를 포함하여 비트 반복을 수행하는 단계를 포함하여 이루어진다. 단, 상기

는 제 2 타입 코드 그룹의 수, 상기

은 상기 제 1 타입의 코드 그룹 내에서, 제 2 반복 횟수를 적용하여 반복을 수행하는 비트 수, 상기 I 는 상기 입력 비트열의 길이, n 은 코딩 레이트의 역수, 상기

는 i 번째 코드 그룹에 상응하는 오프셋을 의미한다.
또한, 본 발명은, 가변 데이터 레이트에 적용되는 레이트 매칭 방법에 있어서, 입력 비트열에 대하여 소정의 코딩 레이트로 채널 코딩을 수행하는 단계 및 상기 채널 코딩된 비트 열은 적어도 하나의 제 1 타입 코드 그룹 및 적어도 하나의 제 2 타입 코드 그룹으로 이루어지고, 상기 제 1 타입 코드 그룹에 속하는 비트에 대하여, a 개의 비트는 제 1 반복 횟수만큼 반복하고, b 개의 비트는 제 2 반복 횟수만큼 반복하고, 상기 제 2 타입 코드 그룹에 속하는 비트에 대하여, c 개의 비트는 제 1 반복 횟수만큼 반복하고, d 개의 비트는 제 2 반복 횟수만큼 반복하는 단계를 포함하여 이루어진다. 단, a+b = c+d = n, n 은 코딩 레이트의 역수이다.
또한, 본 발명은, 가변 데이터 레이트에 적용되는 레이트 매칭 방법에 있어서, 입력 비트열에 대해 채널 코딩을 수행하는 단계와, 상기 채널 코딩된 두가지 타입의 코드 그룹에 대하여, 서로 다른 반복 규칙을 적용하여 비트 반복을 수행하는 단계 및 상기 비트 반복된 비트열에 대해, 인터리빙을 수행하는 단계를 포함하여 이루어진다.
이하 본 발명의 바람직한 일 실시 예에 따른 구성 및 작용을 첨부된 도면을 참조하여 설명한다.According to an aspect of the present invention, there is provided a rate matching method applied to a variable data rate, the method comprising: performing channel coding on an input bit stream at a predetermined coding rate; According to an application rate, dividing into a first type code group corresponding to a first application rate and a second type code group corresponding to a second application rate; and for the first type code group, applying the first application Performing bit repetition by applying the first repetition number and the second repetition number according to a ratio, and for the second type code group, the first repetition at a rate applied to the second type code group And performing bit repetition by applying the number of times and the second number of repetitions.
In addition, the present invention provides a rate matching method applied to a variable data rate, the method comprising: performing channel coding on an input bit string at a predetermined coding rate and on the channel coded bit string, a first type bit group and a second type Performing bit repetition, initializing i to 0 according to the bit group of (a)

And

Performing a repetition by applying a second repetition factor to the ni-th bit that satisfies, and performing a repetition of the bit by applying a first repetition factor to a bit not satisfied, and initializing j to 0; , (d)

And

Or satisfy

And

If you satisfy

Performing bit repetition by applying a second repetition factor to the first bit, otherwise performing bit repetition by applying a first repetition factor, and (e) repeating step (d) However, the step of repeatedly performing the j until the n-1 and (f) repeating the steps (a) to (e), but repeatedly performing the step until the i is I-1 bit Performing an iteration. However, the above

Is the number of second type code groups, said

Is a number of bits for performing repetition by applying a second number of repetitions within the code group of the first type, wherein I is the length of the input bit string, n is the inverse of the coding rate, and

Denotes an offset corresponding to the i th code group.
In addition, the present invention provides a rate matching method applied to a variable data rate, the method comprising: performing channel coding on an input bit string at a predetermined coding rate, wherein the channel coded bit string includes at least one first type code group; For bits belonging to at least one second type code group and belonging to the first type code group, a bit is repeated a first number of times, b bits are repeated a second number of times, and For bits belonging to the two type code group, c bits are repeated by a first number of repetitions and d bits are repeated by a second number of repetitions. However, a + b = c + d = n, n is an inverse of the coding rate.
In addition, the present invention provides a rate matching method applied to a variable data rate, the method comprising performing channel coding on an input bit stream and applying different repetition rules to the two types of coded code groups. Performing an iteration and performing interleaving on the bit repeated bit stream.
Hereinafter, a configuration and an operation according to an exemplary embodiment of the present invention will be described with reference to the accompanying drawings.

In the present invention, in the design of a rate matching process for supporting a variable data rate scheme of a channel coded coding sequence using a turbo code, a two-step rate matching process consisting of symbol repetition and puncturing is used. Rather, rate matching is performed through uniform repetition in one step to adjust the length of the desired interleaver.

To this end, the present invention first defines a code group.

The code group defined in the present invention is defined as a group of output bits of the channel encoder for one information bit input.

In other words, in the case of an encoder having a 1/4 rate, one code group is composed of four code bits.

For example, the output of the channel encoder for one information bit input is a code rate of 1/4 rate (x, y, z, z ^' , x, y, In the case of a form such as y ^' , z ^' , the code group defined in the present invention is expressed as a group of four.

As a result, if the length of the entire data coding string is defined as L, the number of code groups is defined as (L / n), and the number of code groups is the length of the input bit string I of the channel encoder.

In order to prevent repetitive intensive repetition of only the coded sequence output from one polynomial among the code bits of the entire coded sequence, different repetition factors for each code group are used. Let the bit repeat with.

Therefore, in the present invention, different repetition factors M ₁ and M ₂ are defined as follows in Equation 1 and Equation 2 as follows.

Hereinafter, I is the length of an input string of a channel encoder including a cyclic overlap code (CRC) and a tail, and L is the length of an output string of the encoder. n is the value of the inverse of the coding rate, and N is the depth of the desired interleaver size.                     

In the present invention, symbol repetition is performed by repeating each bit with different symbol factors according to the following equations (1) and (2).

는 x를 넘지 않는 최대 정수값이다.From here

Is the maximum integer not exceeding x.

Where LCEIL {x} RCEIL is the smallest integer value greater than or equal to x.

The total number of bits allocated to the first type by dividing the code group output in different bit patterns for the entire output string of the encoder into a first type and a second type is calculated by the following equation.

The total number of bits allocated to the second type is calculated by the following equation.

In this case, in order to uniformly arrange the code group of the first type and the second type with respect to the entire output string, first, a number to be the second type code group among the total number of code groups is calculated by Equation 5 below.

In Equation 5, the number of the second type code groups among the entire code groups has a remainder obtained by dividing the interleaver size N by the length I of the channel encoder input string.

In the present invention, the following equation 6 is used to calculate the number of bits having a repetition factor of M ₂ in a first type code group consisting of N bits, and likewise repetition of M ₂ in a second type code group. The number of bits having a factor is defined as in Equation 7 below.

Next, the offset value to be used in the i th code group is defined by Equation 8 below.                     

That is, Equation 8 is an offset value which is the number of code bits having a repetition factor of M ₂ , which is a result of performing a test up to the (i-1) th group when performing a test in the code group i. By using the above algorithm, a uniform bit repetition process is performed on the entire channel coded coded sequence through the following algorithm.

for (i = 0; i <I; i ++) {

if (((i + 1) K _{1, R2} ) mod I <k _{1, R2} ) {

for (j = 0; j <n; j ++) {

if ((7j + O _i ) mod n <K _{1, GR2} )

repeat (n * i + j) ^th bit with repetition factor M ₂ else repeat (n * i + j) ^th bit with repetition factor M ₁

}

} Selecting the second type code group

else {

for (j = 0; j <n; j ++) {                     

if ((7j + O _i ) mod n <K _{1, GR1} )

repeat (n * i + j) ^th bit with repetition factor M ₂

else repeat (n * i + j) ^th bit with repetition factor M ₁

} Choosing a Type 1 Code Group

}

In the algorithm, a test is performed for every number of the second type code groups for all code groups so that the bits having the second repetition factor are uniformly distributed with respect to the channel coded coding sequence, and an integer multiple of the number of the second type code groups. If the remainder divided by the input bit string of the channel coding coding sequence is smaller than the number of the second code group, the second type code group is selected to perform bit repetition with different half-width factors at corresponding code group positions.

In addition, the remainder obtained by dividing (7j + offset) by n for the index j in which the index of each bit increases from 0 to n in n bits allocated to the selected second type code group is determined in the second type code group. If it is smaller than the number of bits having two repetition factors, the repetition of the corresponding bits is performed by the second repetition factor, and the remainder obtained by dividing (7j + offset) by n is the second repetition in the second type code group. When the number is greater than or equal to the number of bits having a factor, a method of performing the repetition of the corresponding bit by the first repetition factor is used.                     

Meanwhile, the first type code group is selected when a remainder obtained by dividing an integer multiple of the number of the second type code groups by an input bit string of the channel coding coding sequence is greater than or equal to the number of the second code group.

If the remainder of dividing (7j + offset) by n for the index j is smaller than the number of bits having the second repetition factor in the first type code group, repetition of the corresponding bit is performed by the second repetition factor. And if the remainder of dividing (7j + offset) by n is greater than or equal to the number of bits having the second repetition factor in the first type code group, repetition of the corresponding bit is performed by the first repetition factor. I used a way to lose.

For example, consider the case where L = 20, n = 4, and I = 5. In this case, the length of the desired interleaver is N = 45. Then M ₁ = 2 and M ₂ = 3.

At this time, if a uniform repetition algorithm is used without dividing the code groups, a repetition pattern of the form shown in FIG. 4 can be obtained.

In FIG. 4, the shaded portions represent positions of bits having a repetition factor of M ₂ = 3, and the remaining portions represent positions of bits having a repetition factor of M ₁ = 2.

As can be seen in FIG. 4, the positions of bits into which M ₂ = 3 repetitions are concentrated are concentrated in the y bit string, and this repetition pattern may be considered to have an adverse effect on the uniformity of energy distribution.

At this time, if the uniform repetition algorithm of the code group unit devised in the present invention is used, the repetition pattern as shown in FIG. 5 can be obtained.

As can be seen from FIG. 5, the reason for multiplying j by 7 of M ₂ = 3 is as follows.

Currently, there are three kinds of code rates supported by radio structures: 1/2, 1/3, and 1/4. At this time, if the turbo code of 1/4 rate is considered, it has a value from j = 0 to 3. Assume that if 7 is not multiplied.

And suppose that K ₁ value per group is 2. The bit position selected in each code bit group then repeats (0,1), (2,3), (0,1), (2,3), which also causes an unbalanced energy distribution. You can think of it as a pattern. So if we multiply by 7 and think about it, we will repeat the patterns of (0,3), (1,2), (0,3), (1,2), and thus a more uniform form of repetition. It can be seen that it is possible to obtain a pattern.

If only the code of the 1/4 code rate is considered, the most preferable method is not to multiply the bit index j by 7, but to define the bit-reversing operation for the bit index j.

That is, in the case of a 1/4 rate code, it is most preferable to perform the test by changing the index of (0,1,2,3) to (0,2,3,1). However, this method cannot be applied to codes of 1/3 rate, so we wanted to give uniformity by multiplying 7, the smallest prime number larger than 5.

The algorithm can be thought of as an algorithm that does not take into account the importance for each code bit.

Therefore, in order to maximize the performance of the turbo code, it is desirable to give a kind of priority to the systematic bit component in allocating positions having a repetition factor larger than other bits in the repetition process. To this end, we propose another algorithm as described above.

for (i = 0; i <I; i ++) {

if ({((i + 1 ) × K 1, R2) mod I≥K 1, R2} && {K 1, GR1 = 0}) repeat ni th bit with factor M 1; Bit repetition by repeat factor M ₂ preferentially for systematic bits

else ni ^th bit with repetition factor M ₂

for (j = 0; j <n; j ++) {

if ({((i + 1) × K _{1, R2} ) mod I <K _{1, R2} } && {(j + | O _i |) mod (n-1) ≤K _{1, GR1} -1}) ∥

({((i + 1) × K _{1, R2} ) mod I≥K _{1, R2} } && {(j + | O _i |) mod (n-1) <K _{1, GR1} -1})

repeat (n × i + j) ^th bit with repetition factor M ₂ otherwise repeat (n × i + j) ^th bit with repetition factor M ₁

}; Bit repetition is equalized by repeating factor M ₁ or M ₂ for the remaining bits

}

The method used in the above algorithm first assigns the repetition factor of M _{2 to} the systematic bit position in determining the position that should have the repetition factor of M ₂ for each code group. It is a method of allocating the repetition factor to the bits of the group in an equal manner.

In order to apply this principle, the number of code bits having the second repetition factor from the (i-1) th code group to the code group index i that increases from 0 to (the length of the input bit string of the channel coded coding string-1) Is the number of bits having a second repeated vector in i * first type code group-1 and "(the number of second type code groups for i * channel coded coding string) divided by the input bit string of the channel coding coding string. Use an offset that is calculated as the sum of "

Using this offset, the algorithm performs a test on the channel coded coding sequence.                     

Accordingly, a remainder obtained by dividing an integer multiple of the number of second type groups for the channel coding coding sequence by the input bit string of the channel coding coding sequence is greater than or equal to the number of the second type groups for the channel coding coding sequence, and the first type code. When the number of bit repetitions by the second repetition factor in the group is zero, the first repetition factor is used to perform bit repetition on the corresponding bits.

Or the remainder obtained by dividing an integer multiple of the number of second type groups with respect to the channel coding coding sequence by an input bit string of the channel coding coding sequence is smaller than the number of second type groups with respect to the channel coding coding sequence, or within the first type code group. In the case where the number of bit repetitions due to the second repetition factor is not 0, bit repetition is performed on the systematic bits in the current code group by the second repetition factor.

On the other hand, for an index j in which the index of each bit increases from 1 to (n-1) in n bits allocated to each code group, the integer multiple of the number of the second type groups with respect to the channel coded coding sequence The remainder divided by the input bit string of the channel coding coding sequence is smaller than the number of second type code groups for the channel coding coding sequence, and the remainder obtained by dividing (absolute value of j + offset) by (n-1) is (first type code group). Is less than or equal to the number of bits having a second repetition factor-1) or an integer multiple of the number of the second type group with respect to the channel coded coding sequence is divided by the input bit string of the channel coding coding sequence. Is greater than or equal to the number of groups of the second type code for the channel coding coded sequence, and the remainder obtained by dividing the absolute value of the (j + offset) by (n-1) has a second repetition factor in the first type code group. It is smaller than the number of bit 1) and to perform a systematic bit repeated for the systematic bits in the current code group.

Or an integer multiple of the number of second type groups with respect to the channel-coded coded sequence with respect to the index j in which the index of each bit increases from 1 to (n-1) in the n bits allocated to each code group. The remainder divided by the input bit string of the coding coding sequence is greater than or equal to the number of second type code groups for the channel coding coding sequence, or the remainder obtained by dividing (absolute value of j + offset) by (n-1) is (first type code). Greater than the number of bits having a second repetition factor in the group-1), and an integer multiple of the number of the second type group with respect to the channel coded coding sequence divided by the input bit string of the channel coding coding sequence is the channel. The ratio less than the number of groups of the second type code for the coding coded sequence or dividing (absolute value of j + offset) by (n-1) is a ratio having a second repetition factor in the first type code group. If greater than the number of -1), or as is to carry out the bit repetition by 1 in the bit repetition factor.

As described above, when the turbo code is used in the current 3GPP2 system, the energy distribution is designed by designing an iteration algorithm in units of code groups when designing an iteration algorithm for supporting a flexible data rate. Can be given uniformly to each of the two component encoders, thereby improving the decoding performance.

Those skilled in the art will appreciate that various changes and modifications can be made without departing from the spirit of the present invention.                     

Therefore, the technical scope of the present invention should not be limited to the contents described in the examples, but should be defined by the claims.

Claims (22)

In a rate matching method applied to a variable data rate, Performing channel coding on the input bit stream at a predetermined coding rate; Dividing the channel coded bit string into a first type code group and a second type code group according to an application ratio of a first repetition number and a second repetition number; Performing bit repetition by applying the first repetition number and the second repetition number differently to the first type code group and the second type code group. Rate matching method comprising a. The method of claim 1, The first repetition number of times,

Wherein the second repetition number is

Rate matching method, wherein N is the interleaver size, and L is the length of the channel coded bit string. The method of claim 2, The number of bits belonging to the first type code group is

And the number of bits belonging to the second type code group

A rate matching method, wherein I is the length of the input bit string. The method of claim 3, wherein The number of the second type code group is

The rate matching method characterized by the above-mentioned. The method of claim 4, wherein Within the code group of the first type, the number of bits for performing repetition by applying a second repetition number is

In the code group of the second type, the number of bits to perform the iteration by applying the second iteration number is

Rate matching method, wherein R ₁ is the number of bits belonging to the first type code group, and n is the inverse of the coding rate. The method of claim 5, The step of distinguishing the code group of the first type from the code group of the second type,

Is satisfied, the code group is classified into the second type, and if it is not satisfied, the rate matching method is characterized as being classified into the code group of the first type.

Is the number of second type code groups). The method of claim 6, Performing bit repetition on the second type code group may include: (a) initializing the j value to 0; (b) the channel coded bit stream

For the 1st bit,

Performing a bit repetition by applying the second repetition number, and performing a bit repetition by applying the first repetition number when not satisfied; And (c) repeating step (b) while increasing the value of j by 1, and repeating until the value of j becomes n-1. A rate matching method, wherein n is an inverse of a coding rate, P is a constant, and

Is an offset corresponding to the i th code group,

Is the number of bits within the code group of the second type to perform the iteration by applying a second iteration number. The method of claim 6, Performing bit repetition on the first type code group may include: (a) initializing the j value to 0; (b) the channel coded bit stream

For the 1st bit,

Performing a bit repetition by applying the second repetition number, and performing a bit repetition by applying the first repetition number when not satisfied; And (c) repeating step (b) while increasing the value of j by 1, and repeating until the value of j becomes n-1. A rate matching method, wherein n is an inverse of a coding rate, P is a constant, and

Is an offset corresponding to the i th code group,

Is the number of bits within the code group of the first type to perform the iteration by applying a second iteration number. The method according to claim 7 or 8, P is 7, the rate matching method. The method of claim 9, remind

Is

The rate matching method characterized by the above-mentioned. The method of claim 10, And the number of bits constituting the one code group is an inverse of a coding rate. In a rate matching method applied to a variable data rate, Performing channel coding on the input bit stream at a predetermined coding rate; And For the channel coded bit stream, bit repetition is performed according to a first type code group and a second type code group to which different repetition rules are applied. (a) initializing i to 0; (a)

And

Performing a repetition by applying a second repetition number to the ni-th bit satisfying n, and performing a bit repetition by applying a first repetition number to a bit not satisfied; (c) initializing j to 0; (d)

And

Or satisfy

And

If you satisfy

Performing bit repetition by applying the second repetition number to the first bit, and performing bit repetition by applying the first repetition number otherwise; (e) repeating step (d) but repeatedly performing j until n-1; And (f) repeating steps (a) to (e), but repeatedly performing i until I-1 Performing a bit iteration including Rate matching method comprising a

Is the number of the second type code group, the

Is the number of bits to perform the iteration by applying the second number of iterations within the first type of code group, wherein I is the length of the input bit stream, n is the inverse of the coding rate, and

Is the offset corresponding to the i th code group). The method of claim 12, remind

Is

The rate matching method characterized by the above-mentioned. The method of claim 12, remind

And

The ni-th bit satisfying the value is a systematic bit. In a rate matching method applied to a variable data rate, Performing channel coding on the input bit stream at a predetermined coding rate; And The channel coded bit string is composed of at least one first type code group and at least one second type code group applying different repetition rules, and, for bits belonging to the first type code group, a bit Repeats the first repetition number, b bits repeats the second repetition number, and for bits belonging to the second type code group, c bits repeat the first repetition number and d bits Repeating the second repetition number of times A rate matching method comprising a + b = c + d = n, where n is the inverse of the coding rate. The method of claim 15, The second type code group,

Satisfies the above, and the first type code group

Rate matching method (where i is the code group index, and

Is the number of second type code groups). The method of claim 16, The number of the second type code group is

A rate matching method, wherein N is the interleaver size and I is the length of the input bit stream. The method of claim 17, The first repetition number of times,

Wherein the second repetition number is

Rate matching method, wherein L is the length of the channel coded bit string. In a rate matching method applied to a variable data rate, Performing channel coding on the input bit stream; Performing bit repetition on two types of code groups applying the channel coded different repetition rules; And Performing interleaving on the bit repeated bit stream Rate matching method comprising a. The method of claim 19, The repetition rule is a rule regarding whether to perform bit repetition using either the first repetition number or the second repetition number for a specific bit. The method of claim 20, The two types of code groups, the rate matching method characterized in that the application rate of the first iteration number and the second iteration number is different. The method of claim 21, The first repetition number of times,

Wherein the second repetition number is

The rate matching method, wherein N is the size of the interleaver, and L is the length of the channel coded bit string.

Images