KR100404181B1 - Method and Apparatus of Rate Matching for Channelization Code On up-link - Google Patents

Abstract

TECHNICAL FIELD The present invention relates to a next generation communication system, and in particular, used to adjust channel symbol rate to an optimal level during coding and multiplexing procedures of a mobile communication system using a wideband code division multiple access (hereinafter, abbreviated as W-CDMA) scheme. A method and apparatus for channelization code rate matching in uplink.

The present invention provides an optimal rate matching method for turbo codes in the uplink and an apparatus for performing the rate matching using a puncturing algorithm for adjusting channel symbol rates to an optimal level during coding and multiplexing procedures of a mobile communication system. To provide.

Description

Method and apparatus for rate matching in uplink {Method and Apparatus of Rate Matching for Channelization Code On up-link}

The present invention relates to a rate matching method and apparatus applied to an uplink of a mobile communication, and more particularly, to a channelized code rate matching method and apparatus for an uplink used to adjust a channel symbol rate to an optimal level. will be.

Recently, ARIB in Japan, ETSI in Europe, T1 in the US, TTA in Korea, and TTC in Japan are the core networks of the existing global system for mobile communications (GSM) that provide multimedia services such as voice, video and data. The next generation of mobile communication system based on wireless access technology was envisioned.

In order to present technical specifications for the next generation evolved mobile communication system, they agreed to joint research, and the project for this was called Third Generation Partnership Project (hereinafter abbreviated as 3GPP).

3GPP includes three major technical research areas.

First, 3GPP systems and services. It is a division that studies the structure and service capabilities of systems based on the 3GPP specification.

Secondly, it is a research section for Universal Terrestrial Radio Access Network (UTRAN). The UTRAN is a radio access network (RAN) using W-CDMA according to Frequency Division Duplex (FDD) mode and TD-CDMA according to Time Division Duplex (TDD) mode. : Radio Access Network.

Third, it is a research section for the core network that has evolved from the second generation mobile communication globalization system (GSM) and has third generation networking capabilities such as mobility management and global roaming.

In the above-mentioned technical research divisions of 3GPP, the research section for the global radio access network (UTRAN) describes the definition and description of the transport channel and the physical channel, in particular, the S1 series. S1.12 describes definitions and descriptions of multiplexing, channel coding, and interleaving according to frequency division duplex (FDD) mode.

1 is a diagram illustrating a coding and multiplexing procedure in an uplink according to a 3GPP radio access network (RAN) standard, and illustrates a coding and multiplexing procedure for a transport channel.

The data streams on the transport channel arrive at the coding / multiplexing blocks (1, 2) in the form of transport block sets. At this time, each transport block arrives through its own transport channel at regular time intervals.

In this case, a CRC bit for a cyclic redundancy check (hereinafter, referred to as CRC) is added to each transport block arriving at each coding / multiplexing block (1, 2) (S1), and then the same quality of service ( Transmission channels of Quality of Service (hereinafter referred to as QoS) are multiplexed (S2).

CRC is applied to error detection of a transport block, and a CRC bit is added to each transport block of all transport channels.

The multiplexed transmission channels of the same QoS are subjected to channel coding (S3), interleaving (S4), and rate matching (S5).

It is common to use either convolutional coding or turbo coding for channel coding, but in some cases specific coding may be used.

In each coding / multiplexing block (1, 2), the transmission channels of different QoS adjusted to the optimal level of channel symbol rate by rate matching (S5) are multiplexed again, and then the data streams are respectively interleaved through the divided physical channels Is sent.

2 is a diagram illustrating a coding and multiplexing procedure in a downlink according to the 3GPP radio access network (RAN) standard. Although the coding and multiplexing procedure for a transport channel in the downlink is similar to the uplink, rate matching (S13). It is different that inserting discontinuous transmission indication bits S14 and interleaving S15 are performed after the.

Even in the downlink, the data stream on the transport channel arrives at the coding / multiplexing blocks 10 and 20 in the form of transport block sets. At this time, each transport block arrives through its own transport channel at regular time intervals.

At this time, CRC bits for CRC are added to each transport block arriving at each coding / multiplexing block (10, 20) (S10), and then the transport channels of the same QoS are multiplexed (S11).

CRC is applied to error detection of a transport block, and a CRC bit is added to each transport block of all transport channels.

The multiplexed transmission channels of the same QoS are subjected to channel coding (S12), rate matching (S13), discontinuous transmission indication bit insertion (S14), and interleaving (S15).

Channel coding generally uses either convolutional coding or turbo coding, and in some cases, specific coding may be used.

In each coding / multiplexing block (10,20), after adjusting to the optimal level of channel symbol rate by rate matching (S13), the transmission channels of different QoS which have undergone interleaving (S15) are multiplexed again, and then the data stream is divided Interleaved and transmitted through the physical channel.

Of note in the coding and multiplexing procedure in the uplink or downlink according to the 3GPP radio access network (RAN) standard is rate matching.

This rate matching is a process of adjusting the optimal channel symbol rate by applying repetition and puncturing for different transmission channels.

Currently, in the 3GPP radio access network (RAN) standard using the W-CDMA scheme, puncturing schemes for convolutional codes are considered in uplink and downlink, and puncturing schemes for turbo codes are It is being considered in the downlink.

Here, the purpose of the puncturing technique for the convolutional code is to distribute the positions of the punctured code bits as evenly as possible. In the downlink, a puncturing algorithm can be easily implemented to satisfy this purpose. However, as described above, puncturing is performed on the interleaved bit strings in the uplink, so that other conditions must be added in addition to the puncturing conditions in the downlink to satisfy uniform puncturing in the code bit unit. .

Currently, a puncturing method for a convolution code has been proposed in the uplink.

For example, the puncturing method for convolutional code in the downlink is very simple. This is because only the condition of puncturing the code bits uniformly needs to be satisfied.

In other words, if the puncturing distance (N) is obtained for the entire bit string in the code bit unit, and the algorithm is punctured for every Nth bit, the above condition is satisfied.

In this case, if the puncturing distance is '5', the (5xn) th bits are punctured for the entire bit string for the convolutional code (where n = 1, 2, 3, ...).

However, if the puncturing distance is '5.5' rather than an integer, the puncturing procedure is performed when the puncturing distance is '5' for half of the entire bit strings, and the puncturing distance is '6' for the other half. Just execute the puncturing procedure at.

Currently, puncturing techniques for turbo code are only considered in the downlink.

Unlike the convolutional code, the turbo code has different importance of each code bit. That is, in a turbo code having a specific code rate, systematic bit components are relatively important in the decoding process, except for the parity bits. Ingredients are less important.

Therefore, when puncturing the turbo code, puncturing should be excluded for the systematic bit components, and an algorithm for performing puncturing evenly on the remaining parity bit components is essential.

The puncturing algorithm for the turbo code in the downlink under consideration is basically performed in units of code symbols rather than code bits.

For example, to determine the puncturing position of a code symbol so that puncturing occurs uniformly in units of code symbols, there is an algorithm that alternately punctures parity bit components. Meanwhile, there is an algorithm that doubles the distance in which puncturing can occur in code symbol units and then punctures parity bit components simultaneously for each code symbol in which puncturing will occur.

The puncturing algorithm for the turbo code described so far is considered in the downlink, and the puncturing procedure in the downlink may be performed independently of the interleaving procedure since the puncturing procedure occurs in the interleaving front end.

However, since the rate matching procedure is performed after the interleaving in the uplink, there are additional considerations in performing the puncturing procedure for the turbo code.

In order to solve these additional matters, an optimal puncturing algorithm for the turbo code in the uplink has to be proposed. However, a puncturing method for the turbo code has not been proposed yet.

An object of the present invention is proposed to solve the above problems, using an puncturing algorithm for adjusting the channel symbol rate to an optimal level during the coding and multiplexing procedure of a mobile communication system using the W-CDMA scheme It is an object of the present invention to provide an optimal rate matching method and apparatus for a turbo code in a link.

1 is a diagram illustrating a coding and multiplexing procedure in the uplink according to the 3GPP Radio Access Network (RAN) standard.

2 is a diagram illustrating a coding and multiplexing procedure in downlink according to the 3GPP Radio Access Network (RAN) standard.

3 is a diagram showing an interleaving pattern used in the present invention.

4 illustrates a virtual interleaving pattern for applying a puncturing algorithm for a turbo code according to the present invention.

5 is a diagram illustrating a puncturing position in each virtual interleaving pattern generated by a rate matching procedure according to the present invention.

Figure 6 illustrates the overall puncturing position in the actual interleaving pattern generated by the rate matching procedure in accordance with the present invention.

7 is another application example showing the overall puncturing position in the actual interleaving pattern generated by the rate matching procedure according to the present invention.

A method of the present invention for achieving the above object, in the rate matching method applied to the uplink of the mobile communication, interleaving the turbo-coded bits including the first bit stream, the second bit stream and the third bit stream Calculating a value of a first shifting parameter for the second bit string for each column of the interleaver performing interleaving, and calculating a value of the second shifting parameter for the third bit string for each column for interleaving. Calculating and using the shifting parameters to determine respective rate matching patterns for the second parity bit stream and the third parity bit stream. The method of the present invention also provides a method for achieving the above object. A rate matching method applied to an uplink of mobile communication, the systematic bits, the first parity bits and the second parity Interleaving the turbocoded bits comprising bits, providing, for the first parity bits, a first shifting parameter corresponding to a radio frame having an index of (3k + 1) mod K, and the second Providing a second shifting parameter for a parity bits corresponding to a radio frame with an index of (3k + 2) mod K and using the shifting parameters for the first parity bits and the second parity bits And determining each rate matching pattern. In addition, the present invention provides a rate matching method applied to an uplink of a mobile communication, in which systematic bits, first parity bits are used. Interleaving the turbocoded bits comprising the first and second parity bits, and a first virtual interleaving pattern with the first parity bits. Configuring, configuring a second virtual interleaving pattern with the second parity bits, corresponding to the at least one first shifting parameter value corresponding to the first virtual interleaving pattern, and the second virtual interleaving pattern. Computing a value of at least one second shifting parameter and performing a rate matching algorithm on the interleaved output bits using the shifting parameter values. The apparatus is a rate matching apparatus applied to an uplink of a mobile communication, comprising: means for interleaving turbocoded bits comprising a first bitstream, a second bitstream, and a third bitstream; Calculate at least one shifting parameter for each of the third bit streams, And a means for determining a rate matching pattern for each bit string using the data streams. Further, an apparatus of the present invention for achieving the above object includes a systematic bit in a rate matching device applied to an uplink of a mobile communication. Means for interleaving turbocoded bits comprising a column, a first parity bitstream, and a second parity bitstream, and for the first parity bitstream, a first shifting corresponding to a column having a radio frame number of (3k + 1) mod K Provide a parameter, provide a second shifting parameter for the second parity bit string corresponding to a string in which the radio frame number of the interleaver is (3k + 2) mod K, and determine a rate matching pattern using the shifting parameters. Means. Where k is an integer of 0 ≦ k <K, and K is the number of rows of means for interleaving. The above objects, features, and advantages will become more apparent from the following detailed description taken in conjunction with the accompanying drawings. . Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

Generally, two turbo decoders are used in a system using a turbo code, and a MAP decoder or a Viterbi decoder for soft decision decoding output is used.

These two turbo decoders are located at both ends of the interleaver, and the code bits input to the first turbo decoder and the second turbo decoder are parity bit components.

Therefore, it is very important that a uniform puncturing of the parity bit components occurs on the transmitting side. It is also important that uniform puncturing occurs for all channel coded bit strings.

Accordingly, in the present invention, the puncturing algorithm for the turbo code in the uplink is implemented to satisfy the following conditions.

First, puncturing for systematic bit components is excluded.

Second, puncturing occurs evenly on all parity bit components with respect to the parity bit components.

Third, puncturing occurs uniformly over the entire bit string.

In addition to these three conditions, the present invention should consider one of the following conditions. This is because rate matching is performed on the interleaved bit strings in the uplink.

Fourth, the same puncturing should occur for all radio frames that have undergone interleaving. That is, an equal code bit should be punctured for each of the serial bit strings that are the interleaved bit strings.

The present invention proposes a puncturing algorithm for the turbo code in the uplink that satisfies all the puncturing conditions for the turbo code, which is the channelization code.

Hereinafter, a puncturing procedure for turbo code rate matching in uplink according to the present invention will be described in detail. Although the present invention can be applied to the case where the number of columns K of the interleaver is 1, 2, and 4, the following description will be given only in the case where the number K of the interleavers is '8'. Do it.

3 is a diagram illustrating an interleaving pattern used in the present invention.

3 is a case where the number of columns K of the interleaver is 8, where x is a systematic bit component, y is a first parity bit component, and z is a second parity bit component.

These bit components are output as a result of channel coding for the transport channel, so that the parity bit components are the outputs of each RSC coder (Recursive systematic convolutional coder).

In the present invention, in the above-described interleaving pattern, the first parity bit component y and the second parity bit component z are independently configured in different virtual interleavers, thereby making the same puncturing algorithm for each parity bit component individually. Apply to.

4 illustrates a virtual interleaving pattern for applying a puncturing algorithm for a turbo code according to the present invention.

4A illustrates a virtual interleaving pattern for puncturing a y bit component as a first parity bit component, and FIG. 4B illustrates a virtual interleaving pattern for puncturing a z bit component as a second parity bit component.

The numerals in the upper shaded portion in FIG. 4 represent column numbers in the interleaving pattern of FIG. 3.

At this time, the first parity bit component and the second parity bit component among the interleaved bit components as shown in FIG. 3 are separately separated as in the virtual interleaving pattern of FIG. 4, and then each uniform puncturing condition in units of code symbols is satisfied. The shifting parameter S is calculated for the virtual interleaving pattern and applied to the actual puncturing algorithm.

In the present invention, each column of the interleaving pattern of FIG. Of code bits An algorithm that punctures two code bits, so that each column For y-bit components with four code bits Punctures two code bits. On the other hand, every column For z-bit components with four code bits Punctures two code bits.

At this time, the same algorithm is applied when puncturing the code bits of each column for each y-bit component and when puncturing the code bits of each column for each z-bit component. That is, puncturing is applied in parallel to the y bit component and the z bit component.

Hereinafter, a first algorithm and a second algorithm for calculating the shifting parameter S to be used in the puncturing algorithm for the y bit component and the z bit component will be described.

Initial error value for each column of interleaver Should be obtained. The initial error value In order to obtain, the shifting parameter S to be applied to each column of the interleaver for each bit string should be calculated by the following first and second algorithms, respectively.

In the first algorithm for calculating the shifting parameter S1 for the y bit component, as shown in FIG. Consists of four code bits, each column Assume that puncturing occurs individually. At this point Is not actually a code symbol, but is considered a code symbol.

Also, before starting the first algorithm for calculating the shifting parameter S1 for the y bit component, the following basic premise is required.

First, code symbol ; here Is Maximum integer value not exceeding. Means rounding off.

Second, the number of code symbols after puncturing

Third, ; At this time Denotes an average puncturing distance in code symbol units.

From the basic premise mentioned above Is calculated, and The first algorithm for obtaining the shifting parameter S1 to be applied to each column from the values is as follows.

"

"

In the first algorithm described above, "Is to prevent puncturing in the same row," " Wow Represents the greatest common divisor of.

Also " "I" Are the interleaving patterns of the interleaver.

Last expression " "Is a formula for calculating the shifting parameter (S1) for each column of the interleaver. Is Greater minimum integer value.

Even in the second algorithm for calculating the shifting parameter S2 for the z bit component, each column of the interleaving pattern of FIG. Consists of four code bits, each column Assume that puncturing occurs individually. At this point Is not actually a code symbol, but is considered a code symbol.

The following basic premise is also required before starting the second algorithm for calculating the shifting parameter S2 for the z bit component.

First, code symbol ; here Is Maximum integer value not exceeding. Means rounding off.

Second, the number of code symbols after puncturing

Third, ; At this time Denotes an average puncturing distance in code symbol units.

From the basic premise mentioned above Is calculated, and A second algorithm for obtaining the shifting parameter S2 to be applied to each column from the values is as follows.

"

"

In the second algorithm described above, "Is to prevent puncturing in the same row," " Wow Represents the greatest common divisor of.

Also " "I" Are the interleaving patterns of the interleaver.

Last expression " Is a formula for calculating the shifting parameter S2 for each column of the interleaver. Is Greater minimum integer value.

As described above, after calculating the shifting parameters S1 and S2 for each column of the interleaver by the first algorithm and the second algorithm, the initial error values obtained therefrom. In order to perform puncturing using, a third algorithm is performed as follows.

In the third algorithm, a procedure for calculating an initial error value for the first parity bit component and a procedure for calculating an initial error value for the second parity bit component are independently applied.

In order to perform the following third algorithm, the following assumptions are required. The puncturing distance q in code symbol units is calculated based on the following assumptions.

first, = Set of bits

second, Is the number of punctures in each column

Third,

Fourth, the number of code symbols after puncturing

fifth, ; Column number of first interleaver; (here, Is the number of columns in the first interleaver)

finally to be.

Symbols Used in the Home Means round off the decimal point.

"

; Initial error between the current puncturing ratio and the desired puncturing ratio

; The index of the current code symbol

; Error (e) update

; index Checking for puncturing on encoded symbols

; Error (e) update

; Index for next code symbol

; The index of the current code symbol

; Error (e) update

; index For iteration over encoded symbols

; Error (e) update

; Index for next code symbol

"

Hereinafter, an embodiment to which the above algorithms are applied will be described.

FIG. 5 is a diagram illustrating a puncturing position in each virtual interleaving pattern generated by a rate matching procedure according to the present invention. FIG. 5A illustrates a puncturing position in a virtual interleaving pattern for y-bit components. FIG. 5B. Shows the puncturing position in the virtual interleaving pattern for the z bit component.

6 is a diagram showing the overall puncturing position in the actual interleaving pattern generated by the rate matching procedure according to the present invention.

In FIG. 6, the total number of interleaved code bits is 288, and a puncturing occurs in 32 code bits among the total code bits.

Therefore, according to the third algorithm, four code bits are punctured in each column. That is, four code bits among the 32 (288/8) code bits existing in each column are punctured.

As can be seen from the first algorithm and the second algorithm, in the virtual interleaving pattern of FIG. 5, the y bit component is composed of 12 code bits for each column, and the z bit component is composed of 12 code bits. Also, based on each virtual interleaver, it can be seen that two code bits are punctured in a row of each virtual interleaver.

The following describes another embodiment applying the puncturing algorithm for the y bit component and the z bit component and the first and second algorithms for calculating the shifting parameter S to be used in the puncturing algorithm.

7 is another embodiment of the overall puncturing position in the actual interleaving pattern generated by the rate matching procedure according to the present invention.

In the above embodiment, four code bits are punctured for each column. However, if the code bits totally punctured as in the present embodiment are 24, only three code bits should be punctured in each column.

At this time, according to the first algorithm and the second algorithm described above, a result of puncturing 1.5 code bits for each of the y bit component and the z bit component is required. However, since it is impossible to puncture 1.5 code bits, the present invention provides a method to compensate for this.

If it is necessary to puncture a non-integer number of code bits for each bit component as described above, for each column of the interleaving pattern, = 2 punctures and z-bit components A method of puncturing = 1 can be used. On the other hand, for the y-bit component of each column of the interleaving pattern, Puncture = 1, for z-bit components You can also use the puncture method of = 2.

However, this method can produce a difference of up to 8 code bits in the number of bits punctured for each bit component. Thus, by the first, second, and third algorithm After puncturing as many times as possible, a method of excluding puncturing for some code bits of a y bit component or a z bit component for each column may be used.

For example, a method of excluding puncturing for the last y-bit component in the even column and a puncturing for the last z component in the odd column may be used. Of course, on the contrary, a method of excluding puncturing of the last y-bit component in the odd columns and the puncturing of the last z-bit component in the even columns may be used.

In addition, an algorithm may be used to exclude puncturing for the last y-bit component for the four preceding columns of the interleaver and to exclude puncturing for the last z-bit component for the subsequent four columns. On the contrary, a method of excluding the puncturing of the last z bit component for the four preceding columns of the interleaver and the puncturing of the last y bit component of the last four columns may be used.

As described above, the present invention satisfies the uniform puncturing condition even when the number of code bits to be punctured for each column in the interleaving pattern is odd. The method of the present invention as described above is implemented as a program and can be read by a computer. It can be stored in a recording medium (CD-ROM, RAM, floppy disk, hard disk, magneto-optical disk, etc.) in the form. Since the process can be easily carried out by those skilled in the art, the present invention will not be described in detail. The present invention described above has ordinary knowledge in the technical field to which the present invention pertains. It is not limited to the above embodiments and the accompanying drawings as various substitutions, modifications and changes are possible within the scope without departing from the spirit of the present invention.

The present invention performs puncturing having a uniform code symbol distance for each parity bit component of RSC coders among the puncturing conditions for the turbo code in the uplink, thereby realizing uniform puncturing even in the uplink to achieve total decoding performance. There is an effect that can be significantly improved.

Claims (30)

Interleaving the turbocoded bits comprising a first bit string, a second bit string, and a third bit string; Calculating a value of a first shifting parameter for the second bit string for each column of the interleaver performing the interleaving; Calculating a value of a second shifting parameter for the third bit string for each column of the interleaver performing the interleaving; And Determining respective rate matching patterns for the second parity bit stream and the third parity bit stream using the shifting parameters. Rate matching method applied to the uplink of the mobile communication comprising a. The method of claim 1, The first bit string is, Is a systematic bit string, The second bit string and the third bit string, Rate matching method applied to the uplink of the mobile communication characterized in that the parity bit string. The method according to claim 1 or 2, If you are doing puncturing, Calculating the value of the shifting parameter, Determining the number of bits to puncture; And Steps to Determine Punching Distance Rate matching method applied to the uplink of the mobile communication comprising a. The method of claim 3, wherein If the puncturing distance is 2 or less, Rate matching method applied to the uplink of the mobile communication, characterized in that for calculating using. Where k is an integer of 0 ≦ k <K, and K is the number of interleaver columns S [n] is the shifting parameter corresponding to column number n, B denotes 2 for the second bit string and 3 for the third bit string.) The method of claim 3, wherein The method for calculating the value of the shifting parameter is If the puncturing distance is greater than 2, Determining a temporary variable according to the puncturing distance; Using Determining; And Step to calculate Rate matching method applied to the uplink of the mobile communication comprising a. (However, Is 0 ≤ An integer of K, where K is the number of interleaver columns, q 'is the temporary variable, S [n] is the shifting parameter corresponding to column number n, B denotes 2 for the second bit string and 3 for the third bit string.) The method of claim 3, wherein Determining the number of bits to puncture, For the second bit string Decided to, For the third bit string Rate matching method applied to the uplink of the mobile communication, characterized in that determined by. Where P is the number of bits to puncture for each interleaver string The method of claim 3, wherein Determining the number of bits to puncture, For the second bit string Decided to, For the third bit string Rate matching method applied to the uplink of the mobile communication, characterized in that determined by. Where P is the number of bits to puncture for each interleaver string The method of claim 3, wherein Determining the number of bits to puncture, Depending on whether the column number of the interleaver is odd For the second bit string For the third bit string Decided to, Rate matching method applied to the uplink of the mobile communication, characterized in that the determination is opposed to this. Where P is the number of bits to puncture for each interleaver string The method of claim 3, wherein Determining the number of bits to puncture, Depending on whether the column number of the interleaver is smaller than K / 2 For the second bit string For the third bit string Decided to, Rate matching method applied to the uplink of the mobile communication, characterized in that the determination is opposed to this. Where P is the number of bits to be punctured for each interleaver column and K is the number of interleaver columns. The method of claim 1, Determining the rate matching pattern, Obtaining an initial error value using the value of the shifting parameter Rate matching method applied to the uplink of the mobile communication comprising a. The method of claim 1, The column of the interleaver, Rate matching method applied to the uplink of the mobile communication, characterized in that the radio frame. The method of claim 1, The turbo coding, Rate coding method applied to the uplink of the mobile communication, characterized in that the channel coding for the transport channel (transport channel). Interleaving the turbocoded bits comprising systematic bits, first parity bits and second parity bits; Providing a first shifting parameter for the first parity bits corresponding to a radio frame having an index of (3k + 1) mod K; Providing a second shifting parameter for the second parity bits corresponding to a radio frame having an index of (3k + 2) mod K; And Determining respective rate matching patterns for the first parity bits and the second parity bits of the interleaving output using the shifting parameters. Rate matching method applied to the uplink of the mobile communication comprising a. (Wherein k is an integer of 0 ≤ k <K, and K is the number of interleaver columns) The method of claim 13, Providing the shifting parameter when puncturing, In determining the number of bits to puncture, For the first parity bits Decided to, For the second parity bits Rate matching method applied to the uplink of the mobile communication, characterized in that determined by. Where P is the number of bits to puncture for each radio frame The method of claim 13, In case of puncturing, the shifting parameter is If the puncturing distance is 2 or less, And the shifting parameter value corresponding to the radio frame designated by the index is k mod 2. (Wherein k is an integer of 0 ≦ k <K, and K is the number of interleaver columns) The method of claim 13, Providing the shifting parameter when puncturing, If the puncturing distance is greater than 2, Determining a temporary variable according to the puncturing distance; Using Determining; And The shifting parameter value of the radio frame designated by the index Step to calculate Rate matching method applied to the uplink of the mobile communication comprising a. (However, Is 0 ≤ <K, where K is the number of interleaver columns, q 'is the temporary variable) The method of claim 13, Computing the rate matching pattern, Obtaining an initial error value using the shifting parameter Rate matching method applied to the uplink of the mobile communication comprising a. The method of claim 13, The radio frame is, The rate matching method applied to the uplink of the mobile communication, characterized in that the column of the interleaver performing the interleaving. The method of claim 13, The turbo coding, Rate coding method applied to the uplink of the mobile communication, characterized in that the channel coding for the transport channel (transport channel). Interleaving the turbocoded bits comprising systematic bits, first parity bits and second parity bits; Constructing a first virtual interleaving pattern with the first parity bits; Constructing a second virtual interleaving pattern with the second parity bits; Calculating at least one first shifting parameter value corresponding to the first virtual interleaving pattern and at least one second shifting parameter value corresponding to the second virtual interleaving pattern; And Performing a rate matching algorithm on the interleaved output bits using the shifting parameter values Rate matching method applied to the uplink of the mobile communication comprising a. The method of claim 20, For the first virtual interleaving pattern, n = (3k + 1) mod K, N = (3k + 2) mod K for the second virtual interleaving pattern Rate matching method applied to the uplink of the mobile communication. Where n is a column index of the virtual interleaving pattern, k is a column index of the interleaving pattern, and K is the number of interleaver columns. The method of claim 20, Computing the shifting parameter value, Determining the number of bits to puncture; Determining a puncturing distance; And Calculating the shifting parameter Rate matching method applied to the uplink of the mobile communication comprising a. The method of claim 22, Computing the shifting parameter, And calculating the shifting parameter according to the puncturing distance. The method of claim 22, Determining the number of bits to puncture, For the second bit string Decided to, For the third bit string Rate matching method applied to the uplink of the mobile communication, characterized in that determined by. Where P is the number of bits to puncture for each interleaver string The method of claim 20, Performing the rate matching algorithm, Obtaining an initial error value using the shifting parameter Rate matching method applied to the uplink of the mobile communication comprising a. The method of claim 20, A column of the interleaver performing the interleaving is Rate matching method applied to the uplink of the mobile communication, characterized in that the radio frame. The method of claim 20, The turbo coding, Rate coding method applied to the uplink of the mobile communication, characterized in that the channel coding for the transport channel (transport channel). Means for interleaving turbocoded bits comprising a first bit string, a second bit string, and a third bit string; And Means for calculating at least one shifting parameter for each of the interleaved second bit stream and the third bit stream, and using the shifting parameters to determine a rate matching pattern for each bit stream Rate matching device applied to the uplink of the mobile communication having a. Means for interleaving turbocoded bits comprising a systematic bitstream, a first parity bitstream, and a second parity bitstream; And The first parity bit string provides a first shifting parameter corresponding to a string in which the radio frame number of the interleaver is (3k + 1) mod K. The second parity bit string provides a second shifting parameter corresponding to a string in which the radio frame number of the interleaver is (3k + 2) mod K. Means for determining a rate matching pattern of the interleaving output using the shifting parameters Rate matching device applied to the uplink of the mobile communication having a. Where k is an integer of 0 ≦ k <K, where K is the number of columns of the interleaving means The method of claim 28 or 29, And the number of columns of the interleaving means is any one of 1, 2, 4, and 8. The rate matching device applied to the uplink of the mobile communication.