CA2341744C

CA2341744C - Rate matching device and method for a data communication system

Info

Publication number: CA2341744C
Application number: CA002341744A
Authority: CA
Inventors: Min-Goo Kim; Beong-Jo Kim; Se-Hyoung Kim; Soon-Jae Choi; Young-Hwan Lee
Original assignee: Samsung Electronics Co Ltd
Current assignee: Samsung Electronics Co Ltd
Priority date: 1999-07-06
Filing date: 2000-07-06
Publication date: 2007-04-10
Anticipated expiration: 2020-07-06
Also published as: ID29427A; BRPI0006890B1; RU2216111C2; EP1101321A4; CN1252962C; JP2011004434A; JP4105067B2; JP2003503952A; US6751772B1; IL141800A; WO2001003369A1; US20040243904A1; ES2280229T3; AU5854400A; US20080178064A1; DK1101321T3; IL173018A0; PT1101321E; EP1487117A2; US8332734B2

Abstract

A device and method for matching a rate of channel-encoded symbols in a data communication system. The rate matching device and method can be applied to a data communication system which uses one or both of a non-systematic code (such as a convolution code or a linear function code) and a systematic code (such as a turbo code). The rate matching device includes a plurality of rate matching functions, the number of the rate matching functions being equal to a reciprocal of a coding rate of a channel encoder. The rate matching device can rate match the symbols encoded with a non-systematic code or the symbols encoded with a systematic code, by changing initial parameters including the number of input symbols, the number of output symbols, and the puncturing/repetition parameters determining parameter.

Description

RATE MATCHING DEVICE AND METHOD FOR A DATA CON~UNICATION SYSTEM
BACKGROUND OF THE INVENTION
1. Field of the Invention The present invention relates generally to a channel encoding device and method for a data communication system, and in particular, to a device and method for rate matching of channel-encoded symbols.

2. Description of the Related Art Generally, in digital communication systems such as satellite systems, ISDN (Integrated Services Digital Network) systems, digital cellular systems, W-CDMA (Wideband Code Division Multiple Access) systems, UMTS (Universal Mobile Telecommunication Systems) and IMT-2000 (International Mobile Telecommunication-2000) systems, source user data is channel encoded with an error correction code before transmission in order to increase the reliability of the system. A convolution code and a linear function code are typically used for channel encoding, and, for the linear function code, a single decoder is used. Recently, in addition to such codes, a turbo code is also being widely used, which is useful for data transmission and reception.
In multiple access communication systems which support multiple users and mufti-channel communication systems with multiple channels, channel encoded symbols are matched to a given number of transmission channel symbols, in order to increase the efficiency of data transmission and to improve system performance. Such a process is called "rate matching"
Rate matching is also performed to match the output symbol rate with the transmission symbol rate. Typical rate matching methods include puncturing or repeating parts of channel-encoded symbols.
A conventional rate matching device is shown in FIG.
1. Referring to FIG. l, a channel encoder 100 encodes input information bits(k) at a coding rate R=k/n, and outputs encoded symbols(n). A multiplexer (MUX) 110 multiplexes the encoded symbols. A rate matching function 120 rate-matches the multiplexed encoded symbols by puncturing or repeating, and outputs the rate-matched symbols to a transmitter (not shown).
The channel encoder 100 operates at every period of a symbol clock having a speed of CLOCK, and the multiplexer 110 and the rate matching function 120 operate at every predetermined period of a clock having a speed of nxCLOCK.
It should be noted that the rate matching device of FIG. 1 is proposed to be applied to the case where a non-systematic code such as a convolution code or a linear function code is used for channel encoding. For symbols, channel-encoded with a non-systematic code such as a convolutional code or a linear function code, because there is no weight between symbols, i.e., since the error sensitivity of the encoded symbols output from the channel encoder 100 is similar for every symbol within one frame, it is possible that the symbols encoded by the channel encoder 100 are provided to the rate matching function 120 without distinction and undergo puncturing or repeating, as shown in FIG. 1.
However, when using systematic codes, such as a turbo code, there is weight between symbols, so it is not good for the channel encoded symbols that are provided to the rate matching function 120 to equally undergo puncturing or repeating. Because the weight is not equal between information symbols and parity symbols, it is recommended to the rate matching function 120 can puncture parity symbols out of the 7.5998-158 turbo-encoded symbols, but should not puncture the information symbols. As an alternative case, the rate matching function 120 can repeat the information symbols out of the turbo-encoded symbols to increase the energy of the symbols, but should not repeat the parity symbols, if possible. That is, it is difficult to use the rate matching device of FIG. 1 when a turbo code is being used. This is natural in the light of the facts that the structure of FIG. 1 is available for only non-systematic codes such as convolutional codes or linear function codes, and the turbo code has new properties different from those of the convolution codes and the linear function codes.
Recently, to solve such a problem, a method has been proposed for rate matching the symbols channel-encoded with the turbo code. However, such a method can be used only when rate matching the turbo-encoded symbols, and cannot be used when rate matching the symbols channel-encoded with the existing convolutional codes or linear function codes.
Therefore, there is a need for a single device and method for rate matching both symbols channel-encoded with existing non-systematic code and symbols channel-encoded with systematic code. For example, a data communication system designed to support both non-systematic code and systematic code requires two different structures in order to rate match both codes, causing an increase in complexity. However, if it is possible to rate match the different codes using a single structure, the complexity of implementation will be reduced.
SUMMARY OF THE INVENTION
It is, therefore, an object of embodiments of the present invention to provide a device and method for rate matching both symbols channel-encoded with a non-systematic code and symbols channel-encoded with a systematic code, using a single structure, in a data communication system.
It is another object of embodiments of the present invention to provide a device and method for selectively rate matching symbols channel-encoded with a non-systematic code or symbols channel-encoded with a systematic code in a data communication system supporting both non-systematic code and systematic code.
It is further another object of embodiments of the present invention to provide a device and method for rate matching channel-encoded symbols to increase the efficiency of data transmission and to improve system performance in a data communication system.
To achieve the above and other objects, a device and method for matching a rate of channel-encoded symbols in a data communication system is proposed. The rate matching device and method can be applied to a data communication system which uses one or both of a non-systematic code (convolutional code or linear function code) and a systematic code (turbo code). The rate matching device includes a plurality of rate matching functions, the number of the rate matching functions being equal to a reciprocal of the coding rate of the channel encoder. The rate matching device can rate match the symbols encoded with a non-systematic code or the symbols encoded with a systematic code, by changing initial parameters including the number of input symbols, the number of output symbols, and the puncturing/repetition pattern determining parameters.
According to another aspect of the invention, there is provided a data communication system for rate matching of turbo codes comprising: a turbo encoder for encoding input information bits with a predetermined coding rate and outputting a systematic bit stream, a first parity bit stream and a second parity bit stream for the input information bits to generate encoded bits of the input information bits; and a rate matching means for puncturing a number of bits from the encoded bits, wherein the rate matching means comprises: a first rate matching means for receiving the first parity bit stream and puncturing a predetermined number of first parity bits in the first parity bit stream; and a second rate matching means for puncturing a predetermined number of second parity bits in the second parity bit stream; wherein each of the rate matching means punctures a predetermined number of parity bits in a respective parity bit stream with a corresponding puncturing pattern, and the puncturing pattern of each of the rate matching means is controlled according to respective puncturing pattern determining parameters.
There is also provided a rate matching method for rate matching of turbo codes in a data communication system having a turbo encoder for encoding input information bits with a predetermined coding rate and outputting a systematic bit stream, a first parity bit stream and a second parity bit stream for the input information bits to generate encoded bits of the input information bits, and rate matching means for puncturing a number of bits from the encoded bits, the method comprising the steps of: separately receiving, in respective rate matching means, the parity bit streams; determining a number of encoded bits to be punctured compared to a number of input bits and a number of output symbols in each of the rate matching means; and puncturing, in a first rate matching means, the determined number of first parity bits in the first parity bit stream; puncturing, in a second rate matching means, the determined number of second parity bits in the second parity bit stream, wherein the puncturing in each of the rate matching means is performed for respective parity bits with a corresponding puncturing pattern, and the puncturing pattern of each of the rate matching means is controlled according to respective puncturing pattern determining parameters.
The invention also provides, in a further aspect, a data communication system for rate matching of turbo codes comprising: a turbo encoder for encoding input information bits with a predetermined coding rate and outputting a systematic bit stream, a first parity bit stream and second parity bit stream for the input information bits to generate encoded bits of the input information bits; and a rate matching means for rate matching a number of bits from the encoded bits, wherein the rate matching means comprises: a first rate matching means for receiving the systematic bit stream and repeating a predetermined number of systematic bits in the systematic bit stream, a second rate matching means for receiving the first parity bit stream and repeating a predetermined number of first parity bits in the first parity bit stream, and a third rate matching means for repeating a predetermined number of second parity bits in the second parity bit stream; wherein, at least one of the rate matching means is adapted to repeat respective systematic or parity bits in accordance with a corresponding repeating pattern, and the repeating pattern of each of the rate matching means is controlled according to respective repeating pattern determining parameters.
In accordance with another aspect of the invention, there is provided a rate matching method for rate matching of turbo codes in a data communication system having a turbo encoder for encoding input information bits with predetermined coding rate and outputting a systematic bit stream, a first parity bit stream and a second parity bit stream for the input 7.5998-158 information bits to generate encoded bits of the input information bits, and rate matching means for rate matching a number of bits from the encoded bits, the method comprising the steps of: separately receiving, in respective rate matching means, the systematic bit stream and the parity bit streams; determining a number of the encoded bits to be repeated compared to the number of input bits and the number of output bits from each of the rate matching means; and repeating in at least one of the rate matching means a determined number of the received systematic or parity bits in accordance with a corresponding repeating pattern, wherein the repeating pattern of each of the rate matching means is controlled according to respective repeating pattern determining parameters.
There is also provided a data communication system for rate matching of turbo codes comprising: a turbo encoder for encoding input information bits with a predetermined coding rate and outputting a systematic bit stream, a first parity bit stream and second parity bit stream for the input information bits to generate encoded bits of the input information bits; and a rate matching means for rate matching the encoded bits, wherein the rate matching means comprises:
a first rate matching means for receiving the systematic bit stream and outputting the systematic bit stream, a second rate matching means for receiving the first parity bit stream and puncturing a predetermined number of first parity bits in the first parity bit stream, and a third rate matching means for receiving the second parity bit stream and puncturing a predetermined number of second parity bits in the second parity bit stream; wherein each of the second and third rate matching means punctures a predetermined number of parity bits in a respective parity bit stream with a corresponding puncturing pattern, and the puncturing pattern of each of the ,75998-158 - 7a -second and third rate matching means is controlled according to respective puncturing pattern determining parameters.
BRIEF DESCRIPTION OF THE DRAWINGS
The above and other objects, features and advantages of the present invention will become more apparent from the following detailed description when taken in conjunction with the accompanying drawings in which:
FIG. 1 is a diagram illustrating a structure of a rate matching device according to the prior art;
FIGS. 2 and 3 are diagrams illustrating structures of rate matching devices according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating a structure of a rate matching device by puncturing according to an embodiment of the present invention;

_ g _ FIG. 5 is a diagram illustrating a structure of a rate matching device by puncturing according to another embodiment of the present invention;
FIG. 6 is a detailed diagram illustrating a structure of the turbo encoder shown in FIG. 5;
FIG. 7 is a flow chart illustrating a rate matching procedure by puncturing according to an embodiment of the present invention;
FIG. 8 is a diagram illustrating a structure of a rate matching device by puncturing according to further another embodiment of the present invention;
FIG. 9 is a diagram illustrating a structure of a rate matching device by repeating according to an embodiment of the present invention;
FIG. 10 is a diagram illustrating a structure of a rate matching device by repeating according to another embodiment of the present invention; and FIG. 11 is a flow chart illustrating a rate matching procedure by repeating according to an embodiment of the present invention.
DETAINED DESCRIPTION OF THE PREFERRED EMBODIMENT
Preferred embodiments of the present invention will be described herein below with reference to the accompanying drawings. In the following description, well-known functions or constructions are not described in detail since they would obscure the invention in unnecessary detail.

Conditions Required When Designing a Rate Matching Device First, before describing the invention, reference will be made to conditions which should be considered when rate mating symbols channel-encoded with a non-systematic code such as a convolutional code or a linear function code (in the description below, the non-systematic code is assumed to be a convolutional code). Conditions 1A to 3A below are the conditions which should be considered when rate matching encoded symbols by puncturing, and Conditions 1C and 2C below are the conditions which should be considered when rate matching encoded symbols by repeating.
Condition 1A: An input symbol sequence, being encoded symbols, should be punctured using a puncturing pattern having a specific period.
Condition 2A: The number of punctured bits out of the input symbols should be minimized, if possible.
Condition 3A: A uniform puncturing pattern should be used such that the input symbol sequence, which is encoded symbols output from an encoder, should be uniformly punctured.
Condition 1C: An input symbol sequence, being encoded symbols, should be repeated using a repetition pattern having a specific period.
Condition 2C: A uniform repetition pattern should be used such that the input symbol sequence, which is encoded symbols output from an encoder, should be uniformly repeated.
These conditions are based on the assumption that the error sensitivity of the symbols output from the encoder using a convolutional code is almost the same for every symbol within one frame (or codeword). Actually, it is known that when the above conditions are used as main limitation factors in performing puncturing for rate matching, affirmative results are obtained as shown by the following references: [1] G. D.
Forney, "Convolutional codes I: Algebraic structure," IEEE
Trans. Inform. Theory, vol. IT-16, pp.720-738, Nov. 1970, [2]
J. B. Cain, G. C. Clark, and J. M. Geist, "Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding," IEEE Trans. Inform. Theory, vol. IT-25, pp.97-100, Jan. 1979.
Next, reference will be made to the conditions which should be considered when rate matching symbols channel-encoded with a systematic code (in the description below, the systematic code will be assumed to be a turbo code).
Conditions 1B to 5B below are the conditions which should be considered when rate matching the encoded symbols by puncturing, and Conditions 1D to 5D are the conditions which should be considered when rate matching the encoded symbols by repeating.
Condition 1B: Since a turbo code is a systematic code, the portion corresponding to information symbols out of the symbols encoded by the encoder should not be punctured.
Moreover, for the further reason that an iterative decoder is used as a decoder for the turbo code, the portion corresponding to the information symbols should not be punctured.
Condition 2B: Since a turbo encoder is comprised of two component encoders connected in parallel, it is preferable to maximize the minimum free distance of each of the two component encoders, for the minimum free distance of the whole code. Therefore, in order to obtain optimal performance, the output parity symbols of the two component encoders should be uniformly punctured.

Condition 3B: In most iterative decoders, since decoding is performed from the first internal decoder, the first output symbol of the first component decoder should not be Punctured. In other words, the first symbol of an encoder should not be punctured regardless of whether it is a systematic or parity bits, because the first symbol indicates the starting point of encoding.
Condition 4B: The output parity symbols of each component encoder should be punctured using a uniform puncturing pattern such that the encoded symbols output from the encoder, such as the existing convolutional code, should be uniformly punctured.
Condition 5B: Termination tail bits used for the turbo encoder should not be punctured because of the detrimental effect on the performance of the decoder. For example, a SOYA (Soft Output Viterbi Algorithm) decoder has low performance when the termination tail bits are punctured, as compared with the case where the termination tail bits are not punctured.
Condition 1D: Since a turbo code is a systematic code, a portion corresponding to information symbols out of the symbols encoded by the encoder should be repeated to increase the energy of the symbols. Moreover, since an iterative decoder is used as a decoder for the turbo code, the portion corresponding to the information symbols should be frequently repeated.
Condition 2D: Since a turbo encoder is comprised of two component encoders connected in parallel, it is preferable to maximize the minimum free distance of each of the two component encoders, for the minimum free distance of the whole code. Therefore, when the parity symbols are repeated, the output parity symbols of the two component encoders should be uniformly repeated in order to obtain optimal performance.
Condition 3D: In most iterative decoders, since decoding is performed from the first internal decoder, the first output symbol of the first component decoder should be preferentially repeated when the parity symbols are repeated.
Condition 4D: The output parity symbols of each component encoder should be repeated using a uniform repetition pattern such that the encoded symbols output from the encoder, such as the existing convolution code, should be uniformly repeated.
Condition 5D: Termination tail bits used for the turbo encoder should be repeated because of the effect on the performance of the decoder. For example, a SOYA (Soft Output Viterbi Algorithm) decoder has different performance according to whether the termination tail bits are repeated or not.
The present invention aims to implement a rate matching device which satisfies not only Conditions 1A-3A and 1C-2C but also Conditions 1B-5B and 1D-5D. That is, a rate matching device by puncturing according to the present invention serves as a rate matching device, which satisfies Conditions 1A to 3A, for convolutionally-encoded symbols, and also serves as a rate matching device, which satisfies Conditions 1B to 5B, for turbo-encoded symbols. The rate matching device by repeating according to the present invention serves as a rate matching device, which satisfies Conditions 1C
to 2C, for convolutionally-encoded symbols, and also serves as a rate matching device, which satisfies Conditions 1D to 5D, for turbo-encoded symbols.

Fundamental Structure o~ the Rate Matching Device Embodiments of rate matching device structures according to the present invention are shown in FIGS. 2 and 3.
More specifically, FIG. 2 shows an example of a rate matching device implemented in hardware according to an embodiment of the present invention, and FIG. 3 shows an example of a rate matching device implemented in software according to an embodiment of the present invention.
Referring to FIG. 2, a channel encoder 200 channel encodes input information bits at a coding rate R=k/n, and outputs encoded symbols. Here, n denotes the number of encoded symbols constituting one codeword, and k denotes the number of input information bits constituting one input information word.
There are n rate matching functions 231-239, each of which separately receive encoded symbols, output from the channel encoder 200, by a number of input symbols determined according to the coding rate, and puncture/repeat the received symbols.
The n rate matching functions 231-239 each separately receive the encoded symbols, output from the channel encoder 200, by the number determined by multiplying the number of the encoded symbols in a frame by the coding rate. For example, if the number of encoded symbols in one frame is 10 and the coding rate is R=1/5, the 5 rate matching functions each separately receive 2 symbols. The rate matching functions 231-239 each puncture the received symbols according to a predetermined puncturing pattern or repeat the received symbols according to a predetermined repetition pattern. A multiplexer 240 multiplexes the rate-matched symbols from the rate matching functions 231-239, and outputs the multiplexed symbols to a channel transmitter (not shown). Since the channel transmitter is beyond the scope of the present invention, a detailed description of the channel transmitter will be avoided herein.
The rate matching operation of the rate matching functions 231-239 will become mere apparent from the following detailed description of the embodiments of the present invention.
Referring to FIG. 3, a channel encoder 200 channel encodes input information bits at a coding rate R=k/n, and outputs the encoded symbols. A digital signal processor (DSP) 250 having a rate matching module, performs rate matching (or puncturing/repeating) on the symbols channel-encoded by the channel encoder 200, using the rate matching module. The symbols rate-matched by the DSP 250 are output to the channel transmitter. The rate matching DSP 250 separately receives the encoded symbols of one frame from n separate data streams, where the number of symbols received from each stream equals the number of the input symbols determined according to the coding rate, and punctures/repeats the received symbols, in the same manner as shown in FIG. 2. In other words, although the DSP 250 is a single element in hardware, it performs the same rate matching operation as the n rate matching functions of FIG. 2. The DSP 250 may also be implemented by a CPU (Central Processing Unit), and the rate matching operation may be implemented by a subroutine. When the term "rate matching functions" is used herein, it is intended to refer to the rate matching modules in DSP 250 as well.
As shown in FIGS. 2 and 3, a rate matching device according to the present invention may have a structure that includes as many rate matching functions as the number corresponding to the coding rate (i.e., a reciprocal of the coding rate when k=1, but if k~1 then the number of the rate matching functions may be equal to a reciprocal of the coding rate multiplied by k), and each rate matching function receives as many symbols as the number determined by multiplying the number of the encoded symbols in a frame by the coding rate, and punctures the received symbols according to a predetermined puncturing pattern or repeats the received symbols according to a predetermined repetition pattern. This structure has the feature that the channel encoded symbols are separately processed, while the conventional rate matching device of FIG.
1 processes the channel-encoded symbols in a frame unit. The rate matching device modified according to the present invention can be used for both convolutional codes and turbo codes. That is, a rate matching device according to the present invention has a single structure that can be applied to both convolutional codes and turbo codes, even though two different sets of conditions are required.
A rate matching device according to the present invention may also have a structure of FIG. 8. This rate matching device has a combined structure of the conventional rate matching device of FIG. 1 and the novel rate matching device of FIGS. 2 and 3. Including a single rate matching function, the rate matching device has a low complexity, even though implemented by hardware.
Referring to FIG. 8, a channel encoder 200 channel encodes input information bits at a coding rate R=k/n, and outputs the encoded symbols. The encoded symbols are multiplexed by a multiplexes 260, and the multiplexed encoded symbols are output to a rate matching function 230. The symbols rate-matched by the rate matching function 230 by puncturing/repeating are transmitted to a channel transmitter.
A RAM (Random Access Memory) 270 stores an initial value received during rate matching performed by the rate matching function 230, and provides the initial value to the rate matching function 230. The channel encoder 200 operates at every period of the symbol clock having a speed of CLOCK, and the multiplexes 260 and the rate matching function 230 operate at a predetermined period of a clock having a speed of nxCLOCK.

The initial value provided to the RAM 270 includes input symbol number Nc, output symbol number Ni, error value 'e', and puncturing/repetition pattern determining parameters 'a° and 'b'. The number of symbols to be punctured for every frame of the encoded symbols is determined by the input symbol number Nc and the output symbol number Ni. The RAM 270 stores input symbol number Nc corresponding to each symbol clock in a predetermined period, output symbol number Ni, error value 'e', and puncturing/repetition pattern determining parameters 'a' and 'b'. When rate matching is performed by puncturing, the rate matching function 230 receives the corresponding input symbol number Nc, output symbol number Ni, error value 'e', and puncturing pattern determining parameters 'a' and 'b', stored in the RAM 270, at every symbol clock period, to determine whether the particular symbol being processed at every symbol clock period needs to be punctured, and performs puncturing according to the corresponding puncturing pattern. When rate matching is performed by repeating, the rate matching function 230 receives the corresponding input symbol number Nc, output symbol number Ni, error value 'e', and repetition pattern determining parameters 'a' and 'b', stored in the RAM 270, at every symbol clock period, to determine whether the particular symbol being processed at every symbol clock period needs to be punctured, and performs repeating according to the corresponding repetition pattern.
When a convolutional code or a linear function code is used in the channel encoder 200, the initial value is set to a specific puncturing/repeating parameter (Nc,Ni,e,b,a) in the RAM 270. That is, the rate matching function (RMB) 230 operates as shown in FIG. 1, without updating the RAM 270.
When a turbo code is used in the channel encoder 200, the rate matching function 230 should sequentially operate from RMB1 to RMBn (each RMBx [x = 1 to n] is associated with a set of values for Nc, Ni, e, b and a) at every symbol clock period designated as period 'n' (i.e., period n = the period of a clock having a speed of CLOCK). In other words, at every period of a clock having the speed of n x CLOCK, the rate matching function 230 is updated with the values for Nc, Ni, e, a and b from one of the RMBx[x = 1 to n]. Thus, for every period of n, the rate matching function 230 is updated with the values for Nc, Ni, e, b and a from each of the RMBx. For example, during one period of 1/(n x CLOCK), the rate matching function 230 may receive the values for Nc, Ni, e, a and b from RMB1 and then receive the values for Nc, Ni, e, a and b from RMB2 on the next period of 1/(n x CLOCK) and so on, until the values from RMBn is received by the rate matching function 230.
The same cycle is then again repeated in next period 'n'.
Therefore, state values of RMBx processed at a certain time point, i.e., the parameter values (Nc,Ni,e,b,a) for determining the symbols and the patterns for puncturing/repeating, are stored in the RAM 270 for the process at the next time point.
Therefore, if this value is used when the RMBx is processed again next time, it is possible to perform operation of n RMBs( RMB1-RMBn )using a single RMB. For a processing rate, since nxCLOCK is used as shown in FIGS. 1 and 2, the complexity will not be increased.
Meanwhile, in FIG. 2, the rate matching functions 231-239 each separately receive as many symbols encoded by the channel encoder 200 as the number determined by multiplying the number of encoded symbols in a frame by the coding rate.
However, it should be noted that each of the rate matching functions 231-239 can also separately receive a different number of the symbols encoded by the channel encoder 200. For example, one of the rate matching functions 231-239 could separately receive a number of encoded symbols which is smaller than the number determined by multiplying the number of the encoded symbols in a frame by the coding rate, and another rate matching function could separately receive a number of encoded symbols which is larger than the number determined by multiplying the number of the encoded symbols in a frame by the coding rate. However, for simplicity, we will describe a case where each of the rate matching functions 231-239 separately receive the same number of symbols encoded by the channel encoder 200.
EmbocTiments of the Rate Matching Device A description will now be made of the rate matching device according to an embodiment of the present invention.
Herein, for convenience, the description will be made on the assumption that the coding rate is R=1/3 and 3 rate matching functions are provided. However, it should be noted that the rate matching device according to the present invention applies to any case where there are n rate matching functions, i.e., the coding rate is R=k/n. Further, in the description below, Ncs indicates the total number of the encoded symbols included in one frame, output from the channel encoder. Nc indicates the number of symbols input into each rate matching function, and the number of the input symbols is determined as Nc=RxNcs.
In the following description, RxNcs=1/3xNcs=Ncs/3. Ni indicates the number of symbols output from each rate matching function, and the number of output symbols is determined as Ni=RxNis, which is Nis/3 in the description, where Nis indicates the total number of the symbols output after rate matching process. That is, Nis is the total number of the symbols output from the respective rate matching functions.
Therefore, the number of symbols (bits) to be punctured/repeated by each rate matching function is determined by y=Nc-Ni. The Nc value and Ni value can vary.

Further, the invention uses the parameters 'a' and 'b', which are integers determined according to a puncturing/repetition pattern within one frame, i.e., integers for determining the puncturing/repetition pattern. The parameter 'a' is an offset value for determining the position of the first symbol in the puncturing/repetition pattern. That is, the parameter 'a' determines which one of the encoded symbols included in one frame is to be taken as the first symbol of the puncturing/repetition pattern. If a value of the parameter 'a' increases, a symbol located at the front of the frame will be punctured/repeated. The parameter 'b' is a value for controlling the puncturing or repeating period in the frame. By varying this parameter value, it is possible to puncture/repeat all the encoded symbols included in the frame.
As described above, a rate matching device according to the present invention can perform rate matching not only by puncturing but also by repeating. The description of a rate matching device according to the present invention is divided into a device for performing rate matching by puncturing and a device for performing rate matching by repeating.
A. Embodiments of the Rate Matching Device by Puncturing 1. Embodiment of the Rate Matching Device by Puncturing (for a Convolutional Code) FIG. 4 shows the structure of a rate matching device by puncturing according to an embodiment of the present invention. This structure is used when the rate matching devices of FIG. 2 and 3 rate match convolutional-encoded symbols by puncturing.
Referring to FIG. 4, a convolutional encoder 210 encodes input information bits Ik at a coding rate R=1/3, and outputs encoded symbols Clk, C2k and C3k. The encoded symbols Clk, C2k, and C3k are separately provided to rate matching functions 231, 232 and 233, respectively. The first rate matching function 231 punctures the encoded symbol Clk. At this point, the puncturing process is performed based on the punctured symbol number y=Nc-Ni, which is determined by the input symbol number Nc and the output symbol number Ni, and the puncturing pattern determining parameters °a' and 'b'. For example, the first rate matching function 231 can output the symbols of '~~~11x10xOlx~~~' (where x indicates a punctured symbol). The second rate matching function 232 punctures the encoded symbol C2k. At this point, the puncturing process is performed based on the punctured symbol number y=Nc-Ni, which is determined by the input symbol number Nc and the output symbol number Ni, and the puncturing pattern determining parameters 'a' and 'b'. For example, the second rate matching function 232 can output the symbols of '~~~11x11x10x~~~' (where x indicates a punctured symbol). The third rate matching function 233 punctures the encoded symbol C3k. At this point, the puncturing process is performed based on the punctured symbol number y=Nc-Ni, which is determined by the input symbol number Nc and the output symbol number Ni, and the puncturing pattern determining parameters 'a' and 'b°. For example, the third rate matching function 233 can output the symbols of '~~~Olx11x11x~~~' (where x indicates a punctured symbol) . The encoded symbols rate-matched by the rate matching functions 231, 232 and 233 are multiplexed by a multiplexer 240 (not shown in FIG. 4) and provided to a channel transmitter.
In FIG. 4, the input symbol number Nc and the output symbol number Ni are equally determined as Nc=RxI~Tcs and Ni=RxNis, respectively, for every rate matching function. Each rate matching function separately punctures the same number of the channel-encoded symbols, on the assumption that the error sensitivity of encoded symbols is almost the same for every symbol in one frame. That is, an almost uniform puncturing pattern is provided within one frame regardless of the various punctured bit numbers determined according to the service type.
This is because it is possible that all of the symbols in one frame can be uniformly punctured for the convolution code.
Therefore, in accordance with an embodiment of the present invention, the symbols encoded by the convolution encoder 210 are separated and provided in the same number to the rate matching functions 231, 232 and 233. The rate matching functions 321, 232 and 233 each puncture the same number of the input symbols. At this point, the puncturing pattern parameters can be determined either equally or differently. That is, the puncturing patterns can be determined either equally or differently for the rate matching functions 231, 232 and 233.
2. Another Embodiment of the Rate Matching Device by Puncturing (for Turbo Code) FIG. 5 shows a structure of a rate matching device by puncturing according to another embodiment of the present invention. This structure is used when the rate matching devices of FIG. 2 and 3 rate match the turbo-encoded symbols by puncturing.
Referring to FIG. 5, a turbo encoder 220 encodes input information bits Ik at a coding rate R=1/3, and outputs encoded symbols Clk, C2k and C3k. Among the encoded symbols, the information symbol C1k is separately provided to a first rate matching function 231, and the parity symbols (or redundancy symbols) C2k and C3k are separately provided to second and third rate matching functions 232 and 233, respectively. The turbo encoder 220 is comprised of a first component encoder 222, a second component encoder 224 and an interleaver 226, as shown in FIG. 6. The structure of the turbo encoder 220 is well known by those skilled in the art.
Thus, a detailed description will be avoided. The input X(t) to the turbo encoder 220 corresponds to the input information bits Ik shown in FIG. 5. Outputs X(t), Y(t) and Y'(t) of the turbo encoder 220 correspond to the encoded symbols Clk, C2k and C3k shown in FIG. 5, respectively. For the first output of the turbo encoder 220, the input information bits Ik=X(t) are output at as they are, so that, in FIG. 5, the input information bits Ik are output as Clk.
The first rate matching function 231 punctures the encoded symbols C1k based on the following criteria. Since the coding rate is R=1/3, the input symbol number Nc is determined as Nc=RxNcs=Ncs/3, which is 1/3 the total number of encoded symbols. The output symbol number Ni is also determined as Ni=RxNcs, because puncturing is not performed on the portion corresponding to the information symbols according to Condition 1B. The puncturing pattern determining parameters 'a' and 'b' can be set to an integer but it is no meaning, since puncturing is not performed according to Condition 1B. For example, the first rate matching function 231 may output the symbols of '~~~111101011~~~' .
The second rate matching function 232 punctures the encoded symbols C2k based on the following criteria. Since the coding rate is R=1/3, the input symbol number Nc is determined as Nc=RxNcs=Ncs/3, which is 1/3 the total number of encoded symbols. Because the output parity symbols of the two component decoders should be uniformly punctured according to Condition 2B and Condition 4B, and the total output symbol number after puncturing is Nis for the total input symbols(Ncs) in one frame, the number Ni of symbols output from the second rate matching function 232 after puncturing is Ni=[Nis-(RxNcs)]/2. If Ni=[Nis-(RxNcs)]/2 is an odd number, the output symbol number becomes Ni=[Nis-(RxNcs)+1]/2 or [Nis-(RxNcs)-1]/2. One of the two values is selected according to the relationship between the second rate matching function 232 and the third rate matching function 233. That is, when the output symbol number of the second rate matching function 232 is determined as [Nis-(RxNcs)+1]/2, the output symbol number of the third rate matching function 233 is determined as [Nis-(RxNcs)-1]/2. On the contrary, when the output symbol number of the second rate matching function 232 is determined as [Nis (RxNcs)-1]/2, the output symbol number of the third rate matching function 233 is determined as [Nis-(RxNcs)+1]/2.
The puncturing pattern determining parameters 'a' and 'b' can be selected as integers according to a desired puncturing pattern. These integers are determined according to the puncturing pattern only, and the parameters can be set to b=1 and a=2. A detailed description of a method for determining the integers for the puncturing pattern determining parameters will be made with reference to the tables which are given below. For example, the second rate matching function 232 may output the symbols of '~~~11x11x10x~~~' (where x indicates a punctured symbol).
The third rate matching function 233 punctures the encoded symbols C3k based on the following criteria. Since the coding rate is R=1/3, the input symbol number Nc is determined as Nc=RxNcs=Ncs/3, which is 1/3 the total number of input symbols(encoded symbols). Because the total output parity symbols of the two component decoders should be uniformly punctured according to Condition 2B and Condition 4B, and the total output symbol number after puncturing is Nis for the total input symbols in one frame, the number Ni of the symbols output from the second rate matching function 232 after puncturing is Ni=[Nis-(RxNcs)]/2. If Ni=Nis-(RxNcs) is an odd number, the output symbol number becomes Ni=[Nis-(RxNcs)+1]/2 or [Nis-(RxNcs)-1]/2. One of the two values is selected according to the relationship between the second rate matching function 232 and the third rate matching function 233. That is, when the output symbol number of the second rate matching function 232 is determined as [Nis-(RxNcs)+1]/2, the number of output symbols of the third rate matching function 233 is determined as [Nis-(RxNcs)-1]/2. On the contrary, when the output symbol number of the second rate matching function 232 is determined as [Nis-(RxNcs)-1]/2, the output symbol number of the third rate matching function 233 is determined as [Nis-(RxNcs)+1]/2.
The puncturing pattern determining parameters 'a' and 'b' can be selected as integers according to a desired puncturing pattern. These integers are determined according to the puncturing pattern only, and the parameters can be set to b=1 and a=2. A detailed description of a method for determining the integers for the puncturing pattern determining parameters will be made with reference to the tables which are given below. For example, the third rate matching function 233 may output the symbols of '~~~01x11x11x~~~' (where x indicates a punctured symbol).
In FIG. 5, the symbols encoded by the turbo encoder 220 are separated and then provided in equal numbers to the rate matching functions 231, 232 and 233. The first rate matching function 231 outputs the input symbols, as they are.
The second and third rate matching functions 232 and 233 puncture the same number of input symbols. At this point, the puncturing patterns may be determined either equally or differently. That is, the puncturing patterns may be determined either equally or differently for the rate matching functions 232 and 233.
3. Determination of Parameters for Puncturing In the embodiments of the present invention discussed here, the rate matching functions puncture the same number of symbols (excepting the rate matching function 231 of FIG. 5).
However, the rate matching functions may puncture different numbers of symbols. If the number Ni of the symbols output from the respective rate matching functions is set differently, the number of symbols punctured by the respective rate matching functions will be determined differently. Further, the pattern of the symbols punctured by the respective rate matching functions can be determined either equally or differently, by changing the puncturing pattern determining parameters 'a' and 'b'. That is, even though it has a single structure, a rate matching device according to the present invention can determine parameters such as the input symbol number, the output symbol number, the number of symbols to be punctured and the puncturing pattern determining parameters differently.
Table 1 below shows various cases of the parameters, by way of example. Herein, the coding rate is assumed to be R=1/3.
Therefore, three rate matching functions are provided, and the respective rate matching functions separately receive the same number of symbols, i.e., Nc=Ncs/3 symbols. Herein, the rate matching functions separately receive the same number of the symbols, determined by multiplying the number of the encoded symbols by the coding rate. However, it should be noted that the present invention can also be applied to a case where the rate matching functions separately receive a different number of symbols, i.e., a number of symbols which is smaller than the number determined by multiplying the number of the encoded symbols in a frame by the coding rate, or a number of symbols which is larger than the number determined by multiplying the number of the encoded symbols in a frame by the coding rate.
In the description below, RMB1, RMB2 and RMB3 denote first to third rate matching functions, respectively.
[Table 1]
Case RMB1 RMB2 RMB3 Nc Ni a b Nc Ni a b Nc Ni a B

1 Ncs Nis p q Ncs/3 Nis/3 p q Ncs/Nis/3 p Q

2 Ncs Nis p q Ncs/3 Nis/3 r s Ncs/Nis/3 t W

3 Ncs Nis NA NA Ncs/3 (Nis- 2 1 Ncs/(Nis- 2 1 /3 /3 R*Ncs)/2 3 R*Ncs)/2 4 Ncs Nis NA NA Ncs/3 (Nis- 2 1 Ncs/(Nis- 5 1 /3 /3 R*Ncs)/2 3 R*Ncs)/2 5 Ncs Nis NA NA Ncs/3 (Nis- p 1 Ncs/(Nis- p 1 /3 /3 R*Ncs)/2 3 R*Ncs)/2 6 Ncs Nis NA NA Ncs/3 (Nis- p 1 Ncs/(Nis- q 1 /3 /3 R*Ncs)/2 3 R*Ncs)/2 7 Ncs Nis NA NA Ncs/3 (Nis- p q Ncs/(Nis- p Q

/3 /3 R*NCS)/2 3 R*Ncs)/2 8 Ncs Nis NA NA Ncs/3 (Nis- p q Ncs/(Nis- r S

/3 /3 R*Ncs)/2 3 R*Ncs)/2 9 Ncs Nis s 1 Ncs/3 Nis/q t 1 Ncs/Nis/r w 1 /3 /p 3 Ncs Nis s x Ncs/3 Nis/q t y Ncs/Nis/r w Z

/3 /p 3 In Table 1, RMB1, RMB2 and RMB3 indicates rate matching functions, and p, q, r, s, t, w, x, y and z are 1 1 1' integers. In Case 9 and Case 10, -+-+ = 1.0 . This is P q because NisC l + l + ~~ = Nis . NA (Not Available) indicates that the P q input symbols are output as they are, without puncturing, for which the parameters 'a' and 'b° can be set to any value. Here, the parameters °a' and 'b' are positive numbers. Further, the case where the input symbols are punctured to perform rate matching so that the number of the input symbols is larger than the number of the output symbols (i.e., Ncs > Nis) is shown.
Reference will be made to each Case.
Case 1, Case 2: In Case 1 and Case 2, the symbols in one frame are punctured in a uniform pattern. Specifically, in Case 1, the rate matching functions have the same puncturing pattern because the "a" and "b" parameters are the same, and in Case 2, the rate matching functions have different puncturing patterns because the '~a" and "b" parameters are different.
Case 3: In systematic puncturing, information symbols are not punctured, but the parity symbols are punctured. Here, since the puncturing pattern determining parameter values 'a' and 'b' are equal to each other, RMB2 and RMB3 perform uniform puncturing half-and-half using the same puncturing pattern.
Case 4: In systematic puncturing, information symbols are not punctured, and the parity symbols are punctured. Here, since the puncturing pattern determining parameters 'a' and 'b' are different from each other, RMB2 and RMB3 perform uniform puncturing half-and-half using different puncturing patterns.
Case 5: This is a general case for Case 3. In this case, the puncturing pattern determining parameter °a' is set to an integer 'p' so that it may be possible to set the various puncturing patterns. The parameter 'a' is set to the same value for both RMB2 and RMB3.

Case 6: This is a general case for Case 4. In this case, the puncturing pattern determining parameter 'a' is set to integers 'p' and 'q' so that it may be possible to set the various puncturing patterns. The parameter 'a' is set to 'p' for RMB2 and 'q' for RMB3.
Case 7: This is a further general case for Case 5.
In this case, the puncturing pattern determining parameter 'a' is set to an integer 'p' and the puncturing pattern determining parameter 'b' is set to an integer 'q' so that it may be possible to set the various puncturing patterns. The parameters 'a' and 'b' are set to the same value for both RMB2 and RMB3.
Case 8: This is a further general case for Case 6.
In this case, the puncturing pattern determining parameter 'a' is set to integers 'p' and 'r' for RMB2 and RMB3, respectively, and the puncturing pattern determining parameter 'b' is set to integers 'q' and 's' for RMB2 and RMB3, respectively, so that it may be possible to set various puncturing patterns. The parameters 'a' and 'b' are set to 'p' and 'q' for RMB2 and to 'r' and 's' for RMB3.
Case 9, Case 10: In these cases, all the possible parameters are changed. That is, the output symbol number can be set to any integer and the puncturing pattern determining parameters 'a' and 'b' can also be set to any given integers.
In Table 1, Case 1 and Case 2 can be applied when rate matching is performed on the convolutionally-encoded symbols, and Case 3 to Case 8 can be applied when rate matching is performed on the turbo-encoded symbols.
The puncturing pattern may be varied according to a change in the puncturing pattern determining parameter 'a'.
Table 2 below shows a variation of the puncturing patterns according to a change in the parameter 'a'. It is assumed in Table 2 that Nc=10, Ni=8, y=Nc-Ni=10-8=2, and b=1. The symbols punctured according to the puncturing pattern are represented by 'x' .
[Table 2]
Case a Input Output Case 1 1 1 2 4 5 6 7 8 9 10 1 2 4 6 7 8 9 x 3 3 x Case 2 2 1 2 4 5 6 7 8 9 10 1 2 x 6 7 x 9 10 Case 3 5 1 2 4 5 6 7 8 9 10 x 2 4 x 7 8 9 10 Case 4 10 1 2 4 5 6 7 8 9 10 x 2 4 6 x 8 9 10 Case 5 100 1 2 4 5 6 7 8 9 10 x 2 4 6 x 8 9 10 It is noted from Table 2 that it is possible to obtain the different puncturing patterns by fixing 'b' to '1°
and setting 'a' to different values. It can be understood that the first symbol of the puncturing pattern is located in front, as the 'a' value is increased. Of course, it is possible to obtain more various puncturing patterns by changing the parameter 'b' as well. In addition, it is possible to prevent the first symbol from being punctured by setting the parameter 'b' to 1 and using a value satisfying Equation 1 below for the parameter 'a'. Therefore, to satisfy Condition 3B, the parameter 'a' should be set to a value within a range of Equation 1.
1 <_ a < LNc/y~ . . . . (1) where LNc/y~ is the largest integer less than or equal to Nc/y.

In Equation 1, for Nc=10 and y=2, Nc/y=10/2=5.
Therefore, if 'a' has a value of 1, 2, 3 and 4, the first symbols will not be punctured.
In order to satisfy Condition 5B, the tail bits should not be punctured. To this end, Nc should be set to a value determined by subtracting the number of the tail bits therefrom. That is, if the input symbol number Nc is set to Nc-NT where NT denotes the number of tail bits, the tail bits will not be punctured, thus satisfying Condition 5B. In other words, the tail bits do not enter the rate matching function.
Thus, the rate matching pattern only considers a frame size of Nc-NT. After puncturing or repeating by the rate matching function, the tail bits are concatenated sequentially to the output symbols of the rate matching function. The tail bits are not processed and are only attached at the end of the output symbols.
4. Rate Matching Algorithm by Puncturing FIG. 7 shows a rate matching procedure by puncturing according to an embodiment of the present invention. This procedure is performed based on a rate matching algorithm shown in Table 3 below. In Table 3, ~~So={dl,d2,~~~,dNc}" denotes the symbols input for one rate matching function, i.e., the symbols input in a frame unit for one rate matching function, and is comprised of Nc symbols in total. A shift parameter S(k) is an initial value used in the algorithm, and is constantly set to '0' when a rate matching device according to the present invention is used in a downlink of a digital communication system (i.e., when rate matching is performed on the encoded symbols to be transmitted from the base station to the mobile station). 'm' indicates the order of the symbols input for rate matching, and has the order of l, 2, 3, ~~~, Nc. It is noted from Table 3 that the parameters including the input symbol number Nc, the output symbol number Ni and the puncturing pattern determining parameters 'a' and 'b' can be changed. For example, the parameters can be changed as shown in Table 1. The input symbol number Nc can be determined as a value other than Ncs/3, according to the coding rate R. FIG. 7 corresponds to the case where the algorithm of Table 3 is applied to a downlink of the digital communication system, i.e., S(k)=0.
[Table 3]
Let's denote:
So = ~ d1, d2, ~~~, dNc } - set of Nc data bits The rate matching rule is as follows:
if puncturing is to be performed y = Nc-Ni a = (2*S (k) *y + bNc) mod aNc initial error between current and desired puncturing ratio (downlink: S=0) if a = 0 then a = aNc m = 1 --~ index of current bit do while m <= Nc a = a - a*y --~ update error if a <= 0 then ~ check if bit number m should be punctured puncture bit m from set So a = a + a*Nc ~ update error end if m = m + 1 --~ next bit end do When the algorithm of Table 3 is used, the following advantages are provided.
First, it is possible to variably puncture the encoded symbols of frame unit.
Second, it is possible to generate various puncturing patterns by adjusting the parameters Nc, Ni, a and b.
Third, it is possible to reduce the complexity and calculating time of each rate matching function by 1/R. This is because if a plurality of rate matching functions are used, the number of the symbols to be punctured by each rate matching function will be reduced, as compared with the case where one rate matching function is used.
Referring to FIG. 7, in step 701, all sorts of parameters including the input symbol number Nc, the output symbol number Ni and the puncturing pattern determining parameters 'a° and 'b' are initialized for the rate matching process. When Nc and Ni are determined by parameter initialization, the number of symbols to be punctured is determined by y=Nc-Ni, in step 702. In step 703, an initial error value 'e' between current and desired puncturing ratios is calculated. The initial error value is determined by a =
b*Nc mod a*Nc.
Next, in step 704, 'm' indicating the order of the input symbols is set to '1' (m=1). Thereafter, in steps 705 to 709, the symbols are examined from the initial symbol as to whether they should be punctured or not. If it is determined in step 707 that the calculated error value 'e' is smaller than or equal to '0', the corresponding symbol is punctured and then the error value is updated by e=a+a*Nc, in step 708.
Otherwise, if it is determined in step 707 that the calculated error value 'e' is larger than '0', puncturing is not performed. The operation of receiving the encoded symbols in order, determining whether to perform puncturing on the received symbols, and performing puncturing accordingly, is repeatedly performed until it is determined in step 705 that all the symbols in one frame are completely received.
As shown by the algorithm above, the position of the first symbol to be punctured or repeated is controlled by the (a,b) parameters (let Initial Offset m = the position of the first symbol to be punctured). In the above algorithm, Initial Offset m = 'm' when 'e' <_ 0 for the first time. The table below shows an example of determining Initial Offset m.
In the example below, bNc is assumed to be smaller than aNc.
m=1 m=2 m=3 m=4=k .... ..m=Nc initially,bNC- bNc-2ay>_0bNc-Say>_0bNc-4ay<0 ay>_0 a =bNc ....

puncturingNone None None Puncturing or or Repetition "
"

repetition ..

'Initial Offset m =k =4"
In the equations below, Ppnc signifies the period of puncturing or repeating in the above algorithm.
Initial Offset m =rbNc / ay~= r (b/a) * (Nc/y) ~= r (b/a) *Ppnc1 Ppnc = ~Nc/y~ if Nc/y is an integer - rNc/y1 ~ 1 if Nc/y is not an integer As shown by the above equations, by controlling the (a,b) parameters, the position of the first symbol to be punctured or repeated can be controlled.
For example, the value of Initial Offset m decreases as 'a' increases if 'b' stays constant. Thus, by increasing 'a', the position of the first symbol to be punctured/repeated will be pushed closer to the first position. If 'a' is chosen to be bigger than by/Nc, then Initial Offset m = 1, which means that the first symbol will be punctured or repeated. As a result, the position of the first symbol to be punctured/repeated can be manipulated by choosing a value for 'a' between 1 and Ppnc. For example, if 'b' - 1 and 'a' - 2, the position of the first symbol to be punctured/repeated will be always equal to Ppnc/2.
As for the 'b' parameter, it controls the Initial Offset m along with 'a', and, as shown below, once the value of 'a' has been decided, the value of 'b° can be expressed as 1<_'b'<-'a'. If 'a' stays constant, Initial Offset m will increase if 'b' increases and will decrease if 'b' decreases. Thus, the puncturing/repeating positions can be controlled by manipulating the values of (a, b) parameters. Although the value of 'b' can be anything, it is not meaningful to choose a value of 'b' greater than 'a', as shown below, because the initial value of 'e' becomes cyclical once the value of 'b' becomes larger than 'a' (i.e., the value of 'e' repeats itself).
Let 'a' - 3;
the initial value of a = (2*S(k)*y + bNc) mod aNc;
a = bNc mod aNc since S(k)=0 in downlink;
if b=1 then e=Nc;

if b=2 then e=2Nc;
if b=3 then e=3Nc;
if b=4 then e=Nc;
if b=5 then e=2Nc;
if b=6 then e=3Nc;
As shown by the above example, the initial value of 'e' changes as the value of 'b' changes. However, once the value of 'b' becomes larger than 'a', the initial value of 'e' repeats itself cyclically. Thus, it is not meaningful to assign a value bigger than 'a' to 'b'. In conclusion, the puncturing or repetition pattern can be controlled by manipulating the (a, b) parameters.
B. Embodiments of the Rate Matching Device by Repeating 1. Embodiment of the Rate Matching Device by Repeating (for a Convolutional Code) FIG. 9 shows a structure of a rate matching device by repeating according to an embodiment of the present invention.
This structure is used when the rate matching devices of FIG. 2 and 3 rate match convolutionally-encoded symbols by repeating.
Referring to FIG. 9, a convolutional encoder 210 encodes input information bits Ik at a coding rate R=1/3, and outputs encoded symbols Clk, C2k and C3k. The encoded symbols Clk, C2k, and C3k are separately provided to rate matching functions 231, 232 and 233, respectively. The first rate matching function 231 selectively repeats the encoded symbol Clk. At this point, the repeating process is performed based on the repetition symbol number y=Ni-Nc determined by the input symbol number Nc and the output symbol number Ni, and the repetition pattern determining parameters 'a' and 'b'. For example, the first rate matching function 231 can output the symbols of '~~~11 ( 11 ) 101 ( 00 ) 010~~~' (where ( 11 ) and ( 00 ) indicate repeated symbols).
The second rate matching function 232 selectively repeats the encoded symbol C2k. At this point, the repeating process is performed based on the repetition symbol number y=Ni-Nc determined by the input symbol number Nc and the output symbol number Ni, and the repetition pattern determining parameters 'a' and 'b'. For example, the second rate matching function 232 can output the symbols of '~~~ (11) 01 (00) 1100~~~' (where (11) and (00) indicate repeated symbols).
The third rate matching function 233 repeats the encoded symbol C3k. At this point, the repeating process is performed based on the repetition symbol number y=Ni-Nc determined by the input symbol number Nc and the output symbol number Ni, and the repetition pattern determining parameters 'a' and 'b'. For example, the third rate matching function 233 can output the symbols of °~~~0 (11) 1101 (11) ~~~' (where (11) indicates repeated symbols). The encoded symbols rate-matched by the rate matching functions 231, 232 and 233 are multiplexed by a multiplexer 240 and provided to a channel transmitter.
In FIG. 9, the input symbol number Nc and the output symbol number Ni are equally determined as Nc=RxNcs and Ni=RxNis, respectively, for every rate matching function. It is determined that each rate matching function separately repeats the same number of the channel-encoded symbols, on the assumption that the error sensitivity of encoded symbols is almost the same for every symbol in one frame. That is, an almost uniform repetition pattern is provided within one frame regardless of the various repetition bit numbers (y=Ni-Nc) determined according to the service type. This is because it is possible that the whole symbols in one frame can be uniformly repeated for the convolutional code.
Therefore, in accordance with the embodiment of the present invention, the symbols encoded by the convolutional encoder 210 are separated by the same number and provided to the rate matching functions 231, 232 and 233. The rate matching functions 321, 232 and 233 each repeat the same number of input symbols. At this point, the repetition pattern parameters can be determined either equally or differently.
That is, the repetition patterns can be determined either equally or differently for the rate matching functions 231, 232 and 233.
2. Another Embodiment of a Rate Matching Device by Repeating (for a Turbo Code) FIG. 10 shows the structure of a rate matching device by repeating according to another embodiment of the present invention. This structure is used when the rate matching devices of FIG. 2 and 3 rate match turbo-encoded symbols by repeating.
Referring to FIG. 10, a turbo encoder 220 encodes input information bits Ik at a coding rate R=1/3, and outputs encoded symbols Clk, C2k and C3k. Among the encoded symbols, the information symbol Clk is separately provided to a first rate matching function 231, and the parity symbols (or redundancy symbols) C2k and C3k are separately provided to second and third rate matching functions 232 and 233, respectively. The turbo encoder 220 is comprised of a first component encoder 222, a second component encoder 224 and an interleaver 226, as shown in FIG. 6. The component encoders 222 and 223 may use recursive systematic codes (RSC). The structure of the turbo encoder 220 is well known by those skilled in the art. Thus, a detailed description will be avoided. The input X(t) to the turbo encoder 220 corresponds to the input information bits Ik shown in FIG. 10. Outputs X(t), Y(t) and Y'(t) of the turbo encoder 220 correspond to the encoded symbols Clk, C2k and C3k shown in FIG. 10, respectively. For the first output of the turbo encoder 220, the input information bits Ik are output at as they are, so that the input information bits Ik are output as Clk in FIG.

10.
The first rate matching function 231 repeats the encoded symbols C1k based on the following criteria. Since the coding rate is R=1/3, the input symbol number Nc is determined as Nc=RxNcs=Ncs/3, which is 1/3 the total number of input symbols(encoded symbol). The output symbol number Ni is determined as Ni=Nis-(2RxNcs), since repeating should be performed according to Condition 1D. The repetition pattern determining parameters 'a' and 'b' can be set to given integers according to a desired repetition pattern. The integers are determined depending on the repetition pattern only, and the parameters can be typically set to b=1 and a=2. A detailed description of a method for determining the integers for the repetition pattern determining parameters will be made with reference to the tables below. For example, the first rate matching function 231 may output the symbols of '~~~1 ( 11 ) 101 ( 00 ) 11~~~' (where ( 11 ) and ( 00 ) indicate repeated symbols).
The second rate matching function 232 outputs the encoded symbols C2k without repetition. However, the second rate matching function 232 may repeat the encoded symbols C2k in certain conditions such as severe repetition. Since the coding rate is R=1/3, the input symbol number Nc is determined as Nc=RxNcs=Ncs/3, which is 1/3 the total number of input symbols. The output symbol number Ni is determined as Ni=RxNcs which is equal to the input symbol number, since the two kinds of parity symbols should not be repeated according to Condition 2D and Condition 4D. For example, the second rate matching function 232 may output the symbols of '~~~110111101~~~' where there is no repetition.
The third rate matching function 233 outputs the encoded symbols C3k without repetition. However, the third rate matching function 233 may also repeat the encoded symbols C3k under severe repetition. Since the coding rate is R=1/3, the input symbol number Nc is determined as Nc=RxNcs=Ncs/3, which is 1/3 the total number of input symbols. The output symbol number Ni is determined as Ni=RxNcs which is equal to the input symbol number, since the two kinds of parity symbols should not be repeated according to Condition 2D and Condition 4D. The repetition pattern determining parameters 'a' and 'b' can be set to given integers according to a desired repetition pattern. However, if functions 232 or 233 do not use repetition, then (a, b) parameters are meaningless for the rate matching functions 232 or 233. The integers are determined depending on the repetition pattern only, and the parameters can be typically set to b=1 and a=2. A detailed description of a method for determining the integers for the repetition pattern determining parameters will be made with reference to the tables below. For example, the third rate matching function 233 may output the symbols of '~~~01011010~~~' which have not experienced repetition.
In FIG. 10, the symbols encoded by the turbo encoder 220 are separated in the same number and then provided to the rate matching functions 231, 232 and 233. The first rate matching function 231 receives the information symbols out of the encoded symbols and repeats the received symbols according to a predetermined repetition pattern. The second and third rate matching functions 232 and 233 receive the parity symbols out of the encoded symbols, and output the received symbols as they are, without repetition.
3. Determination of Parameters for Repeating As described above, the repetition patterns used for the respective rate matching functions may be either identical or different. That is, the symbol repetition pattern used in the respective rate matching functions and the number of repeated symbols can be variably determined. If the number Ni of the symbols output from the respective rate matching functions is differently set, the number of symbols repeated by the respective rate matching functions will be determined differently. Further, the pattern of the symbols repeated by the respective rate matching functions can be determined either equally or differently, by changing the repetition pattern determining parameters 'a' and 'b'. That is, even though having a single structure, a rate matching device according to the present invention can differently determine parameters such as the input symbol number, the output symbol number, the number of symbols to be repeated and the repetition pattern determining parameters.
Table 4 below shows various cases of parameters, by way of example. Herein, the coding rate is assumed to be R=1/3. Therefore, there are provided three rate matching functions, and the respective rate matching functions separately receive the same number of symbols, i.e., Nc=Ncs/3 symbols. Herein, the rate matching functions separately receive the same number of the symbols, determined by multiplying the number of the encoded symbols by the coding rate. However, it should be noted that the present invention can also be applied to a case where the rate matching functions separately receive a different number of symbols, i.e., a number of symbols smaller than the number determined by multiplying the number of the encoded symbols in a frame by the coding rate, or a number of symbols which is larger than the number determined by multiplying the number of the encoded symbols in a frame by the coding rate. In the description below, RMB1, RMB2 and RMB3 denote first to third rate matching functions, respectively.
[Table 4]
CaseRMB1 RMB2 RMB3 Nc Ni a b Nc Ni a b Nc Ni a b 1 Ncs/ Nis- 2 1 Ncs/3 Nis/3NA NA Ncs/3 Nis/3 NA NA

3 2Ncs/

2 NCS/ Nis- p q Ncs/3 Nis/3NA NA Ncs/3 Nis/3 NA NA

3 2Ncs/

3 Ncs/ Nis/p s t Ncs/3 Nis/qs t Ncs/3 Nis/r s t 4 Ncs/ Nis/p s t Ncs/3 Nis/3a v Ncs/3 Nis/3 w x In Table 4, RMB1, RMB2 and RMB3 indicates rate matching functions, and p, q, r, s, t, w and x are given integers. NA (Not Available) indicates that the input symbols are output as they are, without repetition, for which the parameters 'a' and 'b' can be set to any value. Here, the parameters 'a' and 'b' are positive numbers. Further, the case where the input symbols are repeated to perform rate matching so that the number of the input symbols is smaller than or equal to the number of the output symbols (i.e., Ncs c= Nis) is shown. Reference will be made to each Case.
Case 1: In systematic repetition, information symbols are repeated, but the parity symbols are not repeated. The repetition pattern determining parameters are set to a=2 and b=1.
Case 2: In systematic repetition, information symbols are repeated, but the parity symbols are not repeated. The repetition pattern determining parameters are set to a=p and b=q.
Case 1 and Case 2 can be applied when only the turbo-encoded information symbols are repeated as shown in FIG. 10.
Case 3: Both the information symbols and the parity symbols are repeated, and the repetition patterns are equally determined for all of RMB1, RMB2 and RMB3. The number of repeated symbols is equal for k~MBl, RMB2 and RMB3.
Case 4: Both the information symbols and the parity symbols are repeated, and the repetition patterns are differently determined for all or some of RMB1, RMB2 and RMB3.
The number of repeated symbols is equal for RMB2 and RMB3.
Table 5 below shows the variation in repetition patterns according to a change in the parameter 'a'. It is assumed in Table 5 that Nc=8, Ni=10, y=Ni-Nc=10-8=2, and b=1.
The symbols repeated according to the repetition pattern are represented by '( )'.

[Table 5]
Case A Input Symbols Output Symbols Case 1 1 2 3 4 5 6 7 8 (11) 3 (44) 5 7 8 2 1 2 3 4 5 6 7 8 1 (22) 3 4 5 (66) 7 8 5 1 2 3 4 5 6 7 8 (11) 3 4 (55) 7 8 Case 2 6 10 1 2 3 4 5 6 7 8 (11) 3 4 (55) 7 8 100 1 2 3 4 5 6 7 8 (11) 3 4 (55) 7 8 It is noted from Table 5 that it is possible to obtain the various repetition patterns by fixing 'b' to '1' and setting 'a' to different values. Of course, it is possible to obtain more various repetition patterns by changing the parameter 'b' as well. In addition, it is possible to always repeat the first symbol by setting the parameter 'b' to 1 and using a value satisfying Equation 2 below for the parameter 'a'. Therefore, to satisfy Condition 3D, the parameter 'a' should be set to a value within a range of Equation 2.
a > LN~/yJ . . . . (2) where ~.Nc/y~ is the largest integer less than or equal to Nc/y.
In Equation 2, for Nc=8 and y=2, Nc/y=8/2=4.
Therefore, if 'a' has a value larger than 4, the first symbols will be repeated.
In order to satisfy Condition 5D, the tail bits should be repeated. To this end, Nc should be set to a value determined by adding the number of the tail bits thereto. That is, if the input symbol number Nc is set to Nc+NT where NT
denotes the number of tail bits, the tail bits for the information symbols will always be repeated, thus satisfying Condition 5D. In other words, for repetition, even the tail bits are entered into the rate matching function and considered for repetition.
4. Rate Matching Algorithm by Repeating FIG. 11 shows a rate matching procedure by repeating according to an embodiment of the present invention. This procedure is performed based on a rate matching algorithm shown in Table 6 below. In Table 6, "So={dl,d2,~~~,dNc}" denotes the symbols input for rate matching, i.e., the symbols input in a frame unit for rate matching, and is comprised of Nc symbols in total. A shift parameter S(k) is an initial value used in the algorithm, and is constantly set to '0' when a rate matching device according to the present invention is used in a downlink of a digital communication system (i.e., when rate matching is performed on the encoded symbols to be transmitted from the base station to the mobile station). 'm' indicates the order of the symbols input for rate matching, and has the order of l, 2, 3, ~~~, Nc. It is noted from Table 6 that the parameters including the input symbol number Nc, the output symbol number Ni and the repetition pattern determining parameters 'a' and 'b' can be changed. For example, the parameters can be changed as shown in Table 4. The input symbol number Nc can be determined as a value other than Ncs/3, according to the coding rate R. FIG. 11 corresponds to the case where the algorithm of Table 6 is applied to a downlink of the digital communication system, i . a . , S (k) =0 .

[Table 6) Let°s denote:
So = {d1, d2, ~~~, dNc} - set of Nc data bits The rate matching rule is as follows:
if repetition is to be performed y = Ni-Nc a = (2*S (k) *y + bNc) mod aNc initial error between current and desired repetition ratio (downlink: S=0) i f a = 0 then a = aNc m = 1 -~ index of current bit do while m <= Nc a = a - a*y -~ update error do while a <= 0 then ~ check if bit number m should be repeated repeat bit m from set So a = a + a*Nc -~ update error end do m = m + 1 ~ next bit end do end if When the algorithm of Table 6 is used, the following advantages are provided.
First, it is possible to variably repeat the encoded symbols (or codeword symbols) of frame unit.
Second, it is possible to generate various repetition patterns by adjusting the parameters Nc, Ni, a and b.

Third, it is possible to reduce the complexity and calculating time of each rate matching function by 1/R. This is because if a plurality of rate matching functions are used, the number of the symbols to be repeated by each rate matching function will be reduced, as compared with the case where one rate matching function is used. For example, the number of symbols which can be repeated by each rate matching function can be reduced by the coding rate R, as compared with the case where one rate matching function is used.
Referring to FIG. 11, in step 1101, all sorts of parameters including the input symbol number Nc, the output symbol number Ni and the repetition pattern determining parameters 'a° and 'b' are initialized for the rate matching process. When Nc and Ni are determined by parameter initialization, the number of symbols to be repeated is determined by y=Ni-Nc, in step 1102. In step 1103, an initial error value 'e' between current and desired repetition ratios is calculated. The initial error value is determined by a =
b*Nc mod a*Nc.
Next, in step 1104, 'm' indicating the order of the input symbols is set to '1' (m=1). Thereafter, in steps 1105 to 1109, the symbols are examined from the initial symbol as to whether they should be repeated or not. If it is determined in step 1107 that the calculated error value °e° is smaller than or equal to '0', the corresponding symbol is repeated and then the error value is updated by e=a+a*Nc, in step 1108.
Otherwise, if it is determined in step 1107 that the calculated error value 'e' is larger than '0', repetition is not performed. The operation of receiving the encoded symbols in order, determining whether to perform repetition on the received symbols, and performing repetition accordingly, is repeatedly performed until it is determined in step 1105 that all the symbols in one frame are completely received. During the repetition process, the error value is updated by e=e-a*y in step 1106.
As described above, the data communication system according to the present invention can perform rate matching on both symbols channel-encoded with a non-systematic code and symbols channel-encoded with a systematic code, using a single structure. Therefore, the data communication system supporting both non-systematic codes and systematic codes can selectively rate match symbols channel-encoded with a non-systematic code or symbols channel-encoded with a systematic code, thereby increasing efficiency of data transmission and improving system performance.
The present invention has the following advantages.
First, it is possible to freely set the puncturing/repetition patterns by adjusting the parameters of the rate matching functions, and all the conditions which should be considered when rate matching the turbo-encoded symbols can be satisfied by simply adjusting the parameters.
Second, it is possible to implement all of the rate matching functions according to the coding rate R by using the same algorithm, and the rate matching functions are simple in structure.
Third, a system using both convolutional codes and turbo codes can support both convolutional codes and turbo codes, using a single rate matching device rather than using different rate matching devices, by simply setting different initial parameters.
Fourth, it is not necessary to implement the rate matching functions differently according to a convolutional code or a turbo code.

Fifth, by setting the number of input symbols to a value determined by adding the number of the tail bits therefrom so that the tail bits are repeated, the novel rate matching device is useful when a SOVA decoder is used or when performance would be degraded due to the no repeating of the tail bits. By setting the number of input symbols to a value determined by adding the number of the tail bits to the number of non-tail bits so that the tail bits are repeated, the novel rate matching device is useful when a SOVA decoder is used or when performance would be degraded due to the no repeating of the tail bits.
By setting the number of input symbols to a value determined by adding the number of the tail bits therefrom so that the tail bits are repeated, the novel rate matching device is useful when a SOYA decoder is used or when performance would be degraded due to the no repeating of the tail bits.
Sixth, by setting the puncturing pattern determining parameter 'b' to '1' and setting the parameter 'a' to a value within a specific range, it is possible to prevent the first symbol in one frame from being punctured. Further, it is possible to repeat the first symbol in one frame by setting the repetition pattern determining parameter 'b' to '1' and setting the parameter 'a' to a value within a specific range.
While the invention has been shown and described with reference to a certain preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.

Claims

CLAIMS:

1. A data communication system for rate matching of turbo codes comprising:
a turbo encoder for encoding input information bits with a predetermined coding rate and outputting a systematic bit stream, a first parity bit stream and a second parity bit stream for the input information bits to generate encoded bits of the input information bits; and a rate matching means for puncturing a number of bits from the encoded bits, wherein the rate matching means comprises:
a first rate matching means for receiving the first parity bit stream and puncturing a predetermined number of first parity bits in the first parity bit stream; and a second rate matching means for puncturing a predetermined number of second parity bits in the second parity bit stream;
wherein each of the rate matching means punctures a predetermined number of parity bits in a respective parity bit stream with a corresponding puncturing pattern, and the puncturing pattern of each of the rate matching means is controlled according to respective puncturing pattern determining parameters.

2. The data communication system as claimed in claim 1, wherein the system further includes a multiplexer for collecting the systematic bit stream and the rate matched parity bit streams.

3. The data communication system as claimed in claim 1, wherein the puncturing pattern determining parameters are a first parameter (a) for determining a position of a bit to be first punctured in one frame and a second parameter (b) for determining a period of the bits to be punctured in one frame.

4. The data communication system as claimed in claim 3, wherein each of the rate matching means punctures a predetermined number of parity bits in a respective parity bit stream according to the corresponding puncturing pattern and the numbers of bits output from the rate matching means.

5. The data communication system as claimed in claim 3, wherein the numbers of bits output from the rate matching means are equal to one another.

6. The data communication system as claimed in claim 3, wherein the numbers of bits output from the rate matching means are different from one another.

7. The data communication system as claimed in claim 3, wherein the number of bits output from at least one rate matching means is different from the number of bits output from at least one other rate matching means.

8. The data communication system as claimed in claim 3, wherein each of the rate matching means has the same corresponding puncturing pattern determining parameters.

9. The data communication system as claimed in claim 3, wherein each of the rate matching means has corresponding puncturing pattern determining parameters and the first parameters of each of the corresponding puncturing pattern determining parameters are equal to one another.

10. The data communication system as claimed in claim 3, wherein each of the rate matching means has corresponding puncturing pattern determining parameters, and the first parameters of each of the corresponding puncturing pattern determining parameters are different from one another.

11. The data communication system as claimed in claim 3, wherein each of the rate matching means has corresponding puncturing pattern determining parameters, and the second parameters of each of the corresponding puncturing pattern determining parameters are equal to one another.

12. The data communication system as claimed in claim 3, wherein each of the rate matching means has corresponding puncturing pattern determining parameters, and the second parameters of each of the corresponding puncturing pattern determining parameters are different from one another.

13. The data communication system as claimed in claim 1, wherein the puncturing patterns of the rate matching means are equal to one another.

14. The data communication system as claimed in claim 1, wherein the puncturing patterns of the rate matching means are different from one another.

15. A rate matching method for rate matching of turbo codes in a data communication system having a turbo encoder for encoding input information bits with a predetermined coding rate and outputting a systematic bit stream, a first parity bit stream and a second parity bit stream for the input information bits to generate encoded bits of the input information bits, and rate matching means for puncturing a number of bits from the encoded bits, the method comprising the steps of:
separately receiving, in respective rate matching means, the parity bit streams;

determining a number of encoded bits to be punctured compared to a number of input bits and a number of output symbols in each of the rate matching means; and puncturing, in a first rate matching means, the determined number of first parity bits in the first parity bit stream;
puncturing, in a second rate matching means, the determined number of second parity bits in the second parity bit stream, wherein the puncturing in each of the rate matching means is performed for respective parity bits with a corresponding puncturing pattern, and the puncturing pattern of each of the rate matching means is controlled according to respective puncturing pattern determining parameters.

16. The method as claimed in claim 15, further wherein the systematic bit stream and the punctured parity bit streams are separately input into the respective rate matching means.

17. The method as claimed in claim 15, further wherein the systematic bit stream and the punctured parity bit streams are multiplexed and the multiplexed bit stream is output into a transmission channel.

18. The method for determining bits to be punctured in claim 15, comprising the steps of:
(a) determining a number 'y' of symbols to be punctured by receiving a number Nc of input symbols and a number Ni of output symbols;
(b) calculating an initial error value 'e' indicating a difference value between a current puncturing ratio and a desired puncturing ratio;
(c) updating the error value for each of the input bits;

(d) puncturing a corresponding input bit when the error value is less than or equal to '0'; and (e) repeatedly performing the steps (c) and (d) until a number of counted bits is larger than 'Nc'

19. The method as claimed in claim 18, wherein the initial error value 'e' indicating a difference value between a current puncturing ratio and a desired puncturing ratio is calculated by a formula [{(2 × S (k) × y) + (b × Nc)} mod {a × Nc}], each of the rate matching means receiving a set of the encoded bits.

20. The method claimed in claim 19, wherein the S(k) denotes a shift parameter set to "0" in downlink, 'a' denotes a parameter for determining a position of a bit to be first punctured in one frame, 'b' denotes a parameter for determining a period of the bits to be punctured in one bit stream.

21. The method as claimed in claim 15, wherein the puncturing pattern determining parameters are determined for each rate matching means according to a first parameter for determining a position of a bit to be first punctured in one frame and a second parameter for determining a period of the bits to be punctured in one frame.

22. The method as claimed in claim 15, wherein the number of punctured bits in each rate matching means is equal to one another.

23. The method as claimed in claim 15, wherein the number of punctured bits in each rate matching means is different from one another.

24. The method as claimed in claim 15, wherein each of the rate matching means has corresponding puncturing pattern determining parameters which are equal to one another.

25. The method as claimed in claim 21, wherein each of the rate matching means has corresponding puncturing pattern determining parameters, the first parameters of which are equal to one another.

26. The method as claimed in claim 21, wherein each of the puncturing determining means has corresponding puncturing pattern determining parameters, the first parameters of which are different from one another.

27. The method as claimed in claim 21, wherein each of the rate matching means has corresponding puncturing pattern determining parameters, the second parameters of which are equal to one another.

28. The method as claimed in claim 21, wherein each of the rate matching means has corresponding puncturing pattern determining parameters, the second parameters of which are different from one another.

29. The method as claimed in claim 15, wherein the puncturing in each of the rate matching means is performed for respective parity bits according to the corresponding puncturing pattern and the numbers of bits output from the rate matching means.

30. The method as claimed in claim 15, wherein the numbers of bits output from the rate matching means are equal to one another.

31. The method as claimed in claim 15, wherein the numbers of bits output from the rate matching means are different from one another.

32. A data communication system for rate matching of turbo codes comprising:
a turbo encoder for encoding input information bits with a predetermined coding rate and outputting a systematic bit stream, a first parity bit stream and second parity bit stream for the input information bits to generate encoded bits of the input information bits; and a rate matching means for rate matching a number of bits from the encoded bits, wherein the rate matching means comprises:
a first rate matching means for receiving the systematic bit stream and repeating a predetermined number of systematic bits in the systematic bit stream, a second rate matching means for receiving the first parity bit stream and repeating a predetermined number of first parity bits in the first parity bit stream, and a third rate matching means for repeating a predetermined number of second parity bits in the second parity bit stream;
wherein, at least one of the rate matching means is adapted to repeat respective systematic or parity bits in accordance with a corresponding repeating pattern, and the repeating pattern of each of the rate matching means is controlled according to respective repeating pattern determining parameters.

33. A rate matching method for rate matching of turbo codes in a data communication system having a turbo encoder for encoding input information bits with predetermined coding rate and outputting a systematic bit stream, a first parity bit stream and a second parity bit stream for the input information bits to generate encoded bits of the input information bits, and rate matching means for rate matching a number of bits from the encoded bits, the method comprising the steps of:
separately receiving, in respective rate matching means, the systematic bit stream and the parity bit streams;
determining a number of the encoded bits to be repeated compared to the number of input bits and the number of output bits from each of the rate matching means; and repeating in at least one of the rate matching means a determined number of the received systematic or parity bits in accordance with a corresponding repeating pattern, wherein the repeating pattern of each of the rate matching means is controlled according to respective repeating pattern determining parameters.

34. A method for determining bits to be repeated in claim 33, comprising the steps of:
(a) determining a number 'y' of the bits to be repeated by receiving a number Nc of input bits and a number Ni of output bits;
(b) calculating an initial error value 'e' indicating a difference value between a current repetition ratio and a desired repetition ratio;
(c) updating the error value for each of the input bits;
(d) repeating a corresponding input symbol when the error value is less than or equal to '0'; and (e) repeatedly performing the steps (c) and (d) until a number of counted symbols 'm' is larger than 'Nc'.

35. The method as claimed in claim 34, wherein the initial error value 'e' indicating a difference value between a current repetition ratio and a desired repetition ratio is calculated by a formula [{(2 × S (k) × y) + (b × Nc)} mod {a × Nc}], each of the rate matching means receiving a set of the encoded bits.

36. The method claimed in claim 35, wherein the S(k) denotes a shift parameter set to "0" in downlink, 'a' denotes a parameter for determining a position of a bit to be first repeated in one frame, 'b' denotes a parameter for determining a period of the bits to be repeated in one bit stream.

37. A data communication system for rate matching of turbo codes comprising:
a turbo encoder for encoding input information bits with a predetermined coding rate and outputting a systematic bit stream, a first parity bit stream and second parity bit stream for the input information bits to generate encoded bits of the input information bits; and a rate matching means for rate matching the encoded bits, wherein the rate matching means comprises:
a first rate matching means for receiving the systematic bit stream and outputting the systematic bit stream, a second rate matching means for receiving the first parity bit stream and puncturing a predetermined number of first parity bits in the first parity bit stream, and a third rate matching means for receiving the second parity bit stream and puncturing a predetermined number of second parity bits in the second parity bit stream;
wherein each of the second and third rate matching means punctures a predetermined number of parity bits in a respective parity bit stream with a corresponding puncturing pattern, and the puncturing pattern of each of the second and third rate matching means is controlled according to respective puncturing pattern determining parameters.

38. The data communication system as claimed in claim 37, wherein the first rate matching means punctures a predetermined number of systematic bits in the systematic bit stream with a corresponding puncturing pattern, and the puncturing pattern of the first rate matching means is controlled according to puncturing pattern determining parameters.

39. The data communication system as claimed in claim 38, wherein the system further includes a multiplexer for collecting the rate matched bit streams.

40. The data communication system as claimed in claim 38, wherein the puncturing pattern determining parameters are a first parameter (a) for determining a position of a bit to be first punctured in one frame and a second parameter (b) for determining a period of the bits to be punctured in one frame.

41. The data communication system as claimed in claim 40, wherein each of the rate matching means punctures a predetermined number of bits in a respective bit stream according to the corresponding puncturing pattern and the numbers of bits output from the rate matching means.

42. The data communication system as claimed in claim 40, wherein the numbers of bits output from the rate matching means are equal to one another.

43. The data communication system as claimed in claim 40, wherein the numbers of bits output from the rate matching means are different from one another.

44. The data communication system as claimed in claim 40, wherein the number of bits output from at least one rate matching means is different from the number of bits output from at least one other rate matching means.

45. The data communication system as claimed in claim 40, wherein each of the rate matching means has the same corresponding puncturing pattern determining parameters.

46. The data communication system as claimed in claim 40, wherein each of the rate matching means has corresponding puncturing pattern determining parameters and the first parameters of each of the corresponding puncturing pattern determining parameters are equal to one another.

47. The data communication system as claimed in claim 40, wherein each of the rate matching means has corresponding puncturing pattern determining parameters, and the first parameters of each of the corresponding puncturing pattern determining parameters are different from one another.

48. The data communication system as claimed in claim 40, wherein each of the rate matching means has corresponding puncturing pattern determining parameters, and the second parameters of each of the corresponding puncturing pattern determining parameters are equal to one another.

49. The data communication system as claimed in claim 40, wherein each of the rate matching means has corresponding puncturing pattern determining parameters, and the second parameters of each of the corresponding puncturing pattern determining parameters are different from one another.

50. The data communication system as claimed in claim 38, wherein the puncturing patterns of the rate matching means are equal to one another.

51. The data communication system as claimed in claim 38, wherein the puncturing patterns of the rate matching means are different from one another.