US RE41753 E1 Abstract A method for matching a rate in a mobile communication system causes puncturing or repetition in a fixed pattern, in which puncturing or repetition is applied to each bitstream on transport channels supporting different services in a next generation mobile communication system of the W-CDMA (Wideband Code Division Multiple Access) system. The method comprises the steps of (1) subjecting a bitstream on a transport channel for use in supporting a particular service to channel coding, (2) determining an initial error offset value for use in avoiding all the puncturing only in a particular bitstream among one or more than one bitstreams produced by the channel coding, (3) periodically subtracting a decrement from the determined initial error offset value, for puncturing a bit at a relevant position when a result of the subtraction satisfies a puncturing condition, (4) adding an update error parameter determined as the maximum bit size among TF (Transport Format) transportable during one TTI (Transport Time Interval) of the transport channel after the puncturing to a result of the subtraction, for updating an initial error offset value, and (5) periodically subtracting a decrement from the updated initial error offset value, for determining a position of a relevant bit to be punctured at the next time.
Claims(40) 1. A method of performing rate matching in a communication system, comprising:
setting an initial offset value of a rate matching algorithm to 1; and
performing one of puncturing and repetition according to the rate matching algorithm using the initial offset value, wherein the initial offset value sets is used for determining an initial puncturing or repetition position for input bits.
2. The method of
updating the initial error offset value to form and updated offset value;
performing one of puncturing and repetition according to the rate matching algorithm using the updated offset value.
3. The method of
4. The method of
5. A method of performing rate matching in an uplink of a communication system, comprising:
setting an initial offset value of a rate matching algorithm for a radio frame to a prescribed value, the prescribed value being equal to a modulus of (a) a sum of 1 plus a product of a shifting amount multiplied by a number of bits to be punctured, modulo (b) a number of bits in the radio frame; and
performing one of puncturing and repetition according to the rate matching algorithm using the initial offset value.
6. The method of
7. The method of
8. The method of
9. A device to match a rate in a mobile communication system, comprising:
a channel encoder, configured to output at least one bitstream; and
at least one rate matching block coupled to receive the at least one bit stream and adjust a transport code rate by one of puncturing and repetition according to a rate matching algorithm using an initial offset value of 1, wherein the initial offset value sets is used for determining an initial puncturing or repetition position.
10. A method for matching a rate in a mobile communication system based on puncturing or repetition, the method comprising:
setting an initial offset value for input bits to be punctured or repeated;
updating the initial offset value by adding an update parameter, the update parameter being a maximum bit size among transport format transportable during one transport time interval in a transport format set; and
performing one of puncturing and repetition when the updated initial offset value is no greater than a prescribed value;
updating the offset value by using an update parameter, the update parameter being a maximum bit size of a transmission time interval among bit sizes of transmission time intervals for all transport formats in a transport format set. 11. The method of
12. The method of
13. The method of
14. A method of rate matching comprising:
(a) convolutional encoding of input bits;
(b) rate matching the coded bits, wherein the rate matching step comprises:
(i) setting an initial value of a first parameter (e) for a rate matching algorithm, wherein the initial value of the first parameter is used in the rate matching algorithm to decide a first bit position within the coded bits to be punctured or repeated and the initial value is a constant value equal to one;
(ii) performing puncturing or repetition of a coded bit based on the initial value.
15. The method of
16. The method of
17. The method of
18. The method of
19. The method of
20. The method of
21. The method of
[(a*S(k))*|ΔN|+1] mod a*N, where a=2, S(k) is a first prescribed value, ΔN is a number of bits to be punctured or repeated and N is a second prescribed value. 22. A method of rate matching comprising:
a) convolutional encoding of input bits;
b) rate matching by puncturing or repetition of a prescribed number of coded bits, wherein the rate matching step comprises:
i) setting a value of a parameter (e) to an initial value of one;
ii) updating a current value of the parameter (e) using a previous value of the parameter(e);
iii) performing puncturing or repetition of a coded bit at a corresponding bit index if the current value equals is equal to or less than a predetermined value and updating the current value of the parameter (e), or otherwise, not performing puncturing or repetition of the coded bit; and
iv) repeating steps ii) and iii).
23. The method of
24. The method of
25. The method of
26. The method of
27. The method of
28. The method of
29. The method of
30. The method of
31. A method of rate matching comprising:
outputting a plurality of coded bits by an encoder; setting an initial value of a first parameter for a rate matching algorithm; performing puncturing or repetition of a coded bit based on the first parameter using the rate matching algorithm; and updating the first parameter based on a second parameter, wherein a value of the second parameter is a same value for every transport format of a transport format set in a transmission time interval. 32. The method of
33. The method of
34. The method of
35. The method of
36. The method of
37. The method of
38. The method of
39. The method of
40. The method of
Description REFERENCE TO RELATED APPLICATIONS -35227, filed on Aug. 24, 1999, and Korean Application No. 1999 40809, filed on Sep. 21, 1999, the entirety of which are incorporated herein by reference.1. Field of the Invention The present invention relates to a mobile communication system, and more particularly, to a method for matching a rate, in which puncturing or repetition is applied to each bitstream on transport channels supporting different services in a next generation mobile communication system of the W-CDMA (Wideband Code Division Multiple Access) system. 2. Background of the Related Art Recently, the ARIB of Japan, the ETSI of the Europe, the TIA of the USA, the TTA of Korea, and the TTC of Japan have suggested next generation mobile communication systems based on the core network technology and the radio access technology in the existing GSM (Global System for Mobile communication) which serves for multimedia, such as audio, video and data. In order to provide a technical specification for the next generation mobile communication system, the organizations agreed on a common research, project called as 3GPP (Third Generation Partnership Project). The 3GPP has different technical specification groups, wherein the RAN (Radio Access Network) specification group suggests technical specifications on uplink rate matching and downlink rate matching. The rate matching is a method for adjusting a bitstream passed through a channel coding to a level of code rate which is most suitable for a radio interface by subjecting to puncturing process for removing a particular bit, or to repetition process for adding a particular bit. A puncturing algorithm and repetition algorithm is used in the rate matching, which is implemented differently to uplink and downlink, because a rate matched bitstream is interleaved in the downlink, and an interleaved bitstream is rate matched in the uplink. There are two types of downlink rate matchings, i.e., a fixed position rate matching for puncturing and repetition carried out at a fixed position transport channel, which is detected in decoding at a reception side when a reception bit rate is fixed by using a blind rate detection, and a flexible position rate matching with positions of the puncturing and the repetition are flexible, which is used in decoding at the reception side when a reception bit rate is detected by using TFCI (Transport Format Combination Indicator) field information among various field of reception frames. Respective downlink rate matching has a puncturing patterning (or repetition pattern) determining procedure using the puncturing algorithm and a signaling determining procedure to be used in the puncturing algorithm (or the repetition algorithm) to calculate the amount of rate matching. In the signaling determining procedure, a number of bits to be punctured (or repeated), and an initial error offset value e Current uniform rate matching pattern determination algorithm can be expressed as follows, where N denotes a size of channel coded input bitstream, and N
In order to obtain a uniform puncturing pattern (or a uniform repetition pattern) of the channel coded input bitstream by carrying out the foregoing rate matching algorithm, an initial error offset value e In the meantime, a constant or fixed parameter a=2 is used in determining a position of code bit to be punctured (or repeated) in the rate matching for current convolution code, and the initial error offset value e First, in the flexible position rate matching, the initial error offset value e On the other hand, in the fixed position rate matching, the initial error offset value e In equations (1) and (2), the subscript i denotes an index representing a transport channel number, the subscript l denotes an index representing TF (Transport Format) available in one TTI (Transport Time Interval) in a TFS (Transport Format Set). In other word, in the case of fixed position rate matching, a maximum bit size among bits in the TFS representing TFs transportable during each TTI which denotes a bit transport period in each transport channel is determined as the e Referring to With regard to puncturing of a first bit (when m=1) among total 20 bits, since y=4, e Next, with regard to puncturing of a third bit (when m=3), since the update error value calculated according to e=e−2*y from e=4 updated in the prior step is −4, that satisfies the condition of e≦0, a first puncturing occurs at the third bit. After the puncturing of the third bit, the error value is updated as e=36 according to e=e+2*N, and a loop is repeated for determining a next bit position to be punctured. A puncturing pattern (shaded bit positions) according to procedure is shown in FIG. The next example is when the TTI bit size is changed to 5. Although the input bitstream size N has changed to N=5 for the rate matching, the initial error offset value e With regard to puncturing of a first bit (when m=1) among total 5 bits, since y=4, e With regard to puncturing of a third bit (when m=3), since y=4, and the update error value calculated according to e=e−2*y from e=4 updated in the prior step is −4, which satisfies the condition of e≦0, a first puncturing occurs at the third bit. After the puncturing of the third bit, the error value is updated as e=6 according to e=e+2*N, and a loop is continued for determining a bit position to be punctured at the next bit. In this specific instance, the puncturing occurs at the fourth bit, and the puncturing occurs at the fifth bit, as shown in the shaded bit position of FIG. In the current rate matching algorithm based on parameters e Such a problem causes puncturing (or repetition) concentrated on a portion of bits, failing to satisfying a uniform puncturing (or a uniform repetition) for the entire channel coded bitstreams X, Y, Z resulting in a deterioration of an overall code performance. If the initial error offset value in the aforementioned current rate matching algorithm is used when the channel encoder carries out 1/3 rate convolutional coding separately, there can be a worst case when the puncturing is occurred only in a particular bitstream (especially, Z bitstream) among the three bitstreams branched off from the convolutional coded output bitstream, resulting in a code performance deterioration. As described above, even if an actual convolutional code is used, influences from respective output bitstreams to hamming weights for the bitstreams before coding are different. For example, if a length of input bitstream is fixed for a rate matching of 12, two bits are to be punctured in the input bitstream in the signaling determining procedure. With regard to puncturing of a first bit (when m=1) among total 12 bits, since y=2, e Upon carrying out the foregoing procedure repeatedly for the entire input bitstream, a puncturing pattern as shown in The above references are incorporated by reference herein where appropriate for appropriate teachings of additional or alternative details, features and/or technical background. An object of the invention is to solve at least the above problems and/or disadvantages and to provide at least the advantages described hereinafter. An object of the present invention is to provide a method for matching a rate in a mobile communication system, in which an initial error offset value used when a rate matching is carried out for a channel coded bitstream is fixed to a constant smaller than an input bitstream size, for elimination of the worst puncturing pattern for the 1/3 rate convolution code used in the W-CDMA system. Other object of the present invention is to provide a method for matching a rate in a mobile communication system, in which a separate parameter that represent an updated error value is employed further when the puncturing (or repetition) is carried out while keep subtracting a decrement from a preset initial error offset value e Additional features and advantages of the invention will be set forth in the description which follows, and in part will be apparent from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings. To achieve these and other advantages and in accordance with the purpose of the present invention, as embodied and broadly described, the method for matching a rate in a mobile communication system for causing puncturing or repetition in a fixed pattern includes the steps of (1) subjecting a bitstream on a transport channel for use in supporting a particular service to channel coding, (2) determining an initial error offset value for use in avoiding all the puncturing only in a particular bitstream among one or more than one bitstreams produced by the channel coding, (3) periodically subtracting a decrement from the determined initial error offset value, for puncturing a bit at a relevant position when a result of the subtraction satisfies a puncturing condition, (4) adding an update error parameter determined as the maximum bit size among TF (Transport Format) transportable during one TTI of the transport channel after the puncturing to a result of the subtraction, for updating an initial error offset value, and (5) periodically subtracting a decrement from the updated initial error offset value, for determining a position of a relevant bit to be punctured at the next time. The initial error offset value is determined to be any one of constants equal to, or below an integer time of the maximum bit size among TFs transportable during one TTI of the transport channel. Particularly, the initial error offset value is determined to be 1 fixedly or as the maximum bit size among the TFs transportable during the TTI of the transport channel. The present invention can also be achieved in whole or in parts by a method for matching a rate in a mobile communication system based on puncturing or repetition, the method comprising the steps of (1) determining an initial error offset value for a plurality of bitstreams of different bit sizes to be punctured or repeated, (2) periodically updating the initial error offset value and performing one of puncturing and repetition when the updated initial error offset value is no greater than a prescribed value, (3) after puncturing or repetition, updating the updated initial error value based on a maximum bit size of said plurality of bitstreams, and (4) if applicable, repeating steps (2) and (3) for remaining bits of the bitstreams. The present invention can also be achieved in whole or in parts by a method for matching a rate in a mobile communication system, for causing puncturing or repetition in a fixed pattern, the method comprising the steps of (1) determining a constant smaller than channel coded bitstream sizes as an initial error offset value, (2) updating the initial error offset value and performing one of puncturing and repetition when the offset value is equal to or below a prescribed value, and (3) if applicable, repeating step (2) such that the output bitstream produced by the channel coding has one of punctured and repeated bits at fixed intervals. The present invention can also be achieved in whole or in parts by a method for matching rates in a mobile communication system, the method comprising the steps of subjecting a bitstream on a transport channel for use in a particular service to a prescribed coding, periodically subtracting a decrement from an initial error offset value determined to be no greater than a maximum bit size transportable during one transport time interval (TTI) of the transport channel, subjecting a relevant bit in the bitstreams produced by the prescribed coding to one of puncturing and repetition when a result of the subtraction becomes zero or below zero, and adding an update error parameter determined as the maximum bit size among transport format (TF) transportable during one TTI of the transport channel after the puncturing to a result of the subtraction which is zero or below zero for updating the initial error offset value. The present invention can also be achieved in whole or in parts by a device for matching a rate in a mobile communication system comprising a channel encoder for subjecting a bitstream on a transport channel for use in supporting a particular service to channel coding, and at least one rate matching block for adjusting a transport code rate by using an initial error offset value and an update error parameter such that one of puncturing and repetition of only a particular bitstream from the channel encoder is avoided. Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objects and advantages of the invention may be realized and attained as particularly pointed out in the appended claims. The invention will be described in detail with reference to the following drawings in which like reference numerals refer to like elements wherein: The 1/3 rate convolutional code used in the 3GPP standard is obtained by using polynomials of 557 However, even if the channel encoder carries out a convolutional coding, influences from respective output bitstreams to hamming weights for the bitstreams before the coding are different. In conclusion, it is necessary to avoid the case when all the puncturing or repetition is imposed on a particular bitstream of a higher importance in the convolution coded output bitstreams, for enhancing the performance. Presently, it is preferable that the case when all the puncturing for the output bitstream Z obtained from the polynomial 711 As described above, there are situations when all the puncturing is occurred only in the output bitstream Z obtained from the polynomial 711 The present invention uses a fixed initial error offset value e Accordingly, by setting the initial error offset value e The present invention is applicable, not only to a downlink, but also to an uplink. Presently, an initial error offset value expressed as the following equation (3) is used in the uplink rate matching algorithm of the 3GPP standard.
However, if the above initial error offset value is applied to an existing rate matching algorithm, the worst situation may be occurred, as shown below as an example. First, a case when the initial error offset value is calculated to be 0 can be occurred, which is possible when N is an even number in equation (3). If e Second, similar to the downlink, if the initial error offset value calculated according to the equation (3) is used in the case of the uplink, the worst case is unavoidable, where all the puncturing occurs in the Z bitstream. In comparison to the above cases, the preferred embodiment of the present invention can avoid the worst puncturing patten where the puncturing occurs only in the Z bitstream, and avoids the additional operation of performing the zero test. If the initial error offset value of the present invention is applied to a uplink rate matching for the convolution code, the initial error offset value e Next, the initial error offset value in accordance with the preferred embodiment of the present invention is introduced to a downlink fixed position rate matching as follows. In a general rate matching, an initial error offset value e where the subscript i denotes an index representing a transport channel number, and the subscript 1 denotes an index representing a transport format one TTI may have in a TFS. The various parameters used in the rate matching of the present invention can be summarized as follows. N: an input bitstream size for a rate matching. P: Puncturing rate or repetition rate. ΔN: Total number of bits punctured (or repeated) at all RMB. (i.e., P*N). N e Nup: an update parameter representing an update error value. The foregoing parameters differ when the channel encoder carries out a convolutional coding from the case when the channel encoder carries out a turbo coding. The parameters used in the rate matching of the present invention is determined as follows when a convolutional coding is carried out.
The parameters used in the rate matching of the present invention when a turbo coding is carried out is as follows.
A value a is used in the equation (15), because different values of a can be used for the first and second parity sequences for turbo coding which is different from convolution coding. In this instance, in the rate matching following respective channel coding, a procedure for calculating ΔN First, a temporary parameter for intermediate calculation N In (16), F Next, the temporary parameter N Where, i=1, - - - , I and represents total number of bits that are available for the multiplexed transport channel in a radio frames with transport combination j. Finally, above ΔN A rate matching algorithm of the present invention using the parameters fixed as the above will be described. Current uniform rate matching may be described as below, where N denotes a channel coded input bitstream size, and N
In the rate matching of convolution code of the present invention, a parameter a=2 is used fixedly in determining positions of code bits to be punctured (or repeated) and in the rate matching of turbo code, different values of a may be used for the first parity sequence and the second parity sequence. The initial error offset value e An example of rate matching of the present invention will be described with reference to the attached drawings, where it is assumed that a TFS in a TTI has 5 bits, 10 bits, 15 bits, and 20 bits. With regard to puncturing of a first bit (when m=1) among total 20 bits, since y=4, e With regard to puncturing of the second bit (when m=2), since y=4, and the update error value calculated according to e=e−2*y from e=33 updated in the prior step is 25, which does not satisfy the condition of e≦0, no puncturing occurs for the second bit. With regard to puncturing of successive third, fourth, and fifth bits (when m=3, 4, 5), since y=4, a decrement (−8) is subtracted repeatedly from the updated e=25, and the update error value calculated according to e=e−2*y does not satisfy the condition of e≦0, no puncturing is occurred at the third, fourth and fifth bits. With regard to puncturing of a sixth bit (when m=6), since y=4, and the updated error value calculated according to e=e−2*y from the e=1 updated in the prior step is −7, which satisfies e≦0, a second puncturing occurs at the sixth bit. Again, in this instance, the e is updated to e=33 according to e=e+2*N With regard to puncturing of a first bit (when m=1) among total 5 bits, since y=4, e=1, and the update error value calculated according to e=e−2*y is −7, which satisfies the condition of e≦0, first puncturing occurs at the first bit. After the puncturing at the first bit, e is updated to e=33 according to e=e+2*N With regard to puncturing of the second bit (when m=2), since y=4, and the update error value calculated according to e=e−2*y from e=33 updated in the prior step is 25, which does not satisfy the condition of e≦0, no puncturing occurs at the second bit. With regard to puncturing of successive third, fourth, and fifth bits (when m=3, 4, 5), since y=4, a decrement (−8) is subtracted repeatedly from the updated e=25, and the update error value calculated according to e=e−2*y can not satisfy the condition of e≦0, no puncturing occurs at the third, fourth and fifth bits. As illustrated from the examples of Different examples of the fixed position rate matching are illustrated in With regard to puncturing of a first bit (when m=1) among total 20 bits, since y=4, e After the puncturing of the third bit, the error value is updated as e=36 according to e=e+2*N With regard to puncturing of successive fifth, sixth, and seventh bits (when m=5, 6, 7), since y=4, a decrement (−8) is subtracted repeatedly from the e=28 updated in the prior step, and the update error value calculated according to e=e−2*y can not satisfy the condition of e≦0, no puncturing occurs at the fifth, sixth, and seventh bits. With regard to puncturing of an eighth bit (when m=8), since y=4, and the update error value calculated according to e=e−2*y from e=4 updated in the prior step is −4, which satisfies the condition of e≦0, a second puncturing occurs at the eighth bit. Again, after the puncturing of the eighth bit, the error value is updated as e=36 according to e=e+2*N With regard to puncturing of a first bit (when m=1) among total of 5 bits, since y=4, e=20, and the update error value calculated according to e=e−2*y is 12, which does not satisfy the condition of e≦0, no puncturing occurs at the first bit. With regard to puncturing of the second bit (when m=2), since y=4, and the update error value calculated according to e=e−2*y from e=12 updated in the prior step is 4, which does not satisfy the condition of e≦0, no puncturing occurs at the second bit. With regard to puncturing of the third bit (when m=3), since y=4 and the update error value calculated according to e=e−2*y from e=4 updated in the prior step is −4, which satisfies the condition of e≦0, a first puncturing occurs at the third bit. After the puncturing of the third bit, the error offset value e is updated to e=36 according to e=e+2*N As illustrated from the examples of As has been described, by using a value suggested in the present invention as the initial error offset value e Further because the puncturing (or repetition) occurs at uniform and fixed positions for entire convolutional coded bitstream X, Y, Z regardless of a size change of bitstreams transportable during one TTI according to a TF change in a fixed position rate matching, the method for matching a rate, not only improves overall decoding performance, but also supports a blind rate detection in which a reception bit rate is effectively determined. The foregoing embodiments and advantages are merely exemplary and are not to be construed as limiting the present invention. The present teaching can be readily applied to other types of apparatuses. The description of the present invention is intended to be illustrative, and not to limit the scope of the claims. Many alternatives, modifications, and variations will be apparent to those skilled in the art. In the claims, means-plus-function clauses are intended to cover the structures described herein as performing the recited function and not only structural equivalents but also equivalent structures. Patent Citations
Non-Patent Citations
Classifications
Legal Events
Rotate |