DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

[0056] A preferred embodiment 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.

[0057] The present invention provides an improved FDRT scheme capable of securing uniform puncturing or repetition, thereby solving a problem of the conventional FDRT scheme. To this end, a uniform puncturing pattern or a uniform repetition pattern is required. Therefore, the present invention provides a method for creating a new puncturing pattern for FDRT and then puncturing the coded symbols according to the created new puncturing pattern.

[0058] The determination of a proper puncturing distance D is important in performing the uniform puncturing or uniform repetition in the FDRT scheme. In other words, the non-uniform puncturing or repetition is caused by the parameter D for determining the puncturing pattern or the repetition pattern. That is, in the conventional IS-2000 FDRT algorithm, when LM/P is not an integer, └LM/P┘ indicating the maximum integer smaller than LM/P is defined as the parameter D. Therefore, in this case, only P×D bits are actually punctured and the puncturing is not performed in the remaining P×(LM/P−D)-bit period. For example, since LM/P=2.778, D=2 and LM/P−D=0.778. Therefore, the puncturing is performed in the P×D=864×2=1728-bit interval, while the puncturing is not performed in the P×(LM/P−D)=864×0.778=672-bit interval. In conclusion, the non-uniform puncturing occurs due to a difference of (LM/P−D) in the process of determining the value D. To solve this problem, the following basic conditions are introduced, and then an algorithm based on the conditions will be described.

[0059] FDRT Condition (1): P×D determined from L and N should satisfy P×D≧LM. That is, D should satisfy D≧LM/P. Here, P and D are integers.

[0060] FDRT Condition (2): (P−└LM/D┘) symbols determined from the parameter value D satisfying FDRT Condition (1) are punctured or repeated as uniformly (or at regular intervals) as possible over LM symbols. Here, the determined symbol position should not overlap with the position determined by the parameter D satisfying FDRT Condition (1).

[0061] FDRT Condition (3): The non-uniform repetition or puncturing due to a difference of (LM/P−D) in the process of determining the parameter D should be minimized.

[0062] Now, an operation of the FDRT scheme according to an embodiment of the present invention will be described, considering the above FDRT conditions. First, a description will be made of an embodiment to which the FDRT algorithm according to the present invention is applied. Subsequently, a generalized FDRT algorithm will be described.

[0063] New Flexible Data Rate Transmission Algorithm Type 1

[0064] A description will be made of an embodiment to which the FDRT algorithm according to the present invention is applied. The conditions used in this embodiment are shown in Table 4 below, and the algorithm is shown in Table 5 below.

[0065] Referring to Table 4, the embodiment of the present invention is applied to IS-2000 RC3. The maximum assigned data rate is 19.2 Kbps, the interleaver size is N=1536 bits, and an input data rate is 15 Kbps. Further, the number of coded symbols per frame is L=1200 bits. Therefore, the number of repetitions for the L=1200 coded symbols becomes M=2. The repetition number M is defined as the minimum integer larger than N/L (=(interleaver size)/(coded symbols per frame)). That is, the repetition number M is defined as M=┌N/L┐. The number P of coded symbols to be punctured is determined by subtracting the interleaver size N from the repeated coded symbols LM. The puncturing distance D is defined as D=┌LM/P┐. 4

[0066] 5

[0067] Referring to Table 5, in the algorithm according to an embodiment of the present invention, “k mod(?) 3” indicates a modulo-3 operation of calculating a remainder determined by dividing k by 3. FDRT Condition (1) is used in the process of calculating D, and FDRT Condition (2) is used in the process having a variable ‘36’.

[0068] FIG. 7 illustrates an exemplary method of puncturing the coded symbols according to a puncturing pattern proposed in the present invention. This method is based on the condition of Table 4 and the algorithm of Table 5.

[0069] Referring to FIG. 7, it is noted that the puncturing is actually uniformly performed over the overall interval of the coded symbol frame. In FIG. 7, the black blocks indicate the punctured symbols. Further, it is noted that the symbols transmitted after twice repetition and a selected one of the symbols transmitted after twice repetition are uniformly distributed. Therefore, the N=1536 frame has a symbol format coincident with FDRT Condition (3). Hence, such an FDRT scheme is free from performance degradation because of the uniform puncturing, and has a near-optimal performance.

[0070] FIGS. 8A and 8B illustrate distribution of symbol energy and the number of symbols per unit frame at the final stage of a receiver associated with a flexible data rate matching device according to an embodiment of the present invention.

[0071] Referring to FIGS. 8A and 8B, a channel receiver 200 receives the symbols transmitted in the inventive FDRT mode and provides the received symbols to an erasure insertion and symbol combining part 210. The symbol combining part 210 outputs 1200 symbols, as shown in FIG. 8A, and the output symbols have the relative symbol energy distribution shown in FIG. 8B. As illustrated, when the symbol energy Es of 864 unrepeated symbols is generalized to 1.0, the following 672 repeated symbols are subjected to symbol combining with M=2, making Es become 2.0. FIG. 8B shows that the symbols are uniformly distributed over the entire interval. The uniform symbol distribution contributes to performance improvement of a channel decoder 220, for which a Viterbi decoder is typically used.

[0072] Generalized Flexible Data Rate Transmission Algorithm GFDRTA-I

[0073] A generalized flexible data rate transmission algorithm according to the present invention will be described. The FDRT algorithm and the parameters used in the algorithm are defined in Table 6. 6

[0074] In table 6, L indicates the number of coded symbols per frame, out of streams of the coded symbols output from the encoder. Further, N indicates a predetermined channel interleaver size, and is defined as a value larger than or equal to the number L of the coded symbols per frame. In addition, M indicates the number of repetitions for the coded symbols, and is defined as ┌N/L┐. That is, the repetition number M is defined as the minimum integer larger than N/L. Therefore, the number P of the coded symbols to be punctured is defined as P=LM−N.

[0075] As a first embodiment, in the algorithm of Table 6, if P=0, then the puncturing is not performed. In the puncturing process, every D1^th symbol and every (D2+1)^th symbol (where D2 is an even number) out of the LM coded symbols are punctured, until P symbols are punctured per unit frame. That is, when the LM coded symbols are ordered from 1 to LM, the D1^th, 2D1^th, 3D1^th, . . . coded symbols and the (D2+1)^th, (2D2+1)^th, (3D2+1)^th, . . . coded symbols (where D2 is an even number) are punctured. Here, the (D2+1)^th, (2D2+1)^th, (3D2+1)^th, . . . coded symbols are punctured so as not to overlap with the mD1^th (where m=1,2,3 . . .) coded symbols in terms of puncturing positions. Therefore, if necessary, it is possible to consider another method for preventing the (D2+1)^th, (2D2+1)^th, (3D2+1)^th, . . . coded symbols from overlapping with the mD1^th (where m=1,2,3, . . .) coded symbols. For example, it is also possible to puncture (D2−1)^th, (2D2−1)^th, (3D2−1)^th, . . . coded symbols (where D2 is an odd number) instead of the (D2+1)^th, (2D2+1)^th, (3D2+1)^th, . . . coded symbols. Even in this case, the (D2−1)^th, (2D2−1)^th, (3D2−1)^th, . . . coded symbols are punctured so as not to overlap with the mD1^th (where m=1,2,3, . . .) coded symbols in terms of puncturing positions. That is, D1 and D2 indicate puncturing distance values for determining the distances among the P symbols to be punctured out of the LM repeated coded symbols. D1 and D2 used herein are defined by Equation (1) below.

[0076] As a second embodiment, in the algorithm of FIG. 6, if P=0, then the puncturing is not performed. In the puncturing process, every D1^th symbol and every ((a multiple of D2)−D2+└D1/2┘)^th symbol out of the LM coded symbols are punctured, until P symbols are punctured per unit frame. That is, when the LM coded symbols are ordered from 1 to LM, the D1^th, 2D1^th, 3D1^th, . . . coded symbols and the (D2+└D1/2┘)^th, (2D2+└D1/2┘)^th, (3D2+└D1/2┘)^th, . . . coded symbols are punctured. Here, the (D2+└D1/2┘)^th, (2D2+└D1/2┘)^th, (3D2+└D1/2┘)^th, . . . coded symbols are punctured so as not to overlap with the mD1^th (where m=1,2,3, . . .) coded symbols in terms of puncturing positions. D1 and D2 used herein are also defined by Equation (1) below.

D1=┌LM/P┐ for P>0: Otherwise, puncturing is not required.

P1=└LM/D1┘

P2=P−P1

D2=sD1 for P2>0: Otherwise, puncturing is nor required. Equation (1)

[0077] In Equation (1), s indicates the maximum integer out of integers within a range satisfying Equation (2) below.

(sD1)≦└LM/P2┘,

s≦(└LM/P2┘)/D1=(└LM/D1┘)/P2)=└P1/P2┘ Equation (2)

[0078] Referring to Equations (1) and (2), the puncturing distance (or interval) D1 is defined as the minimum integer larger than LM/P for the number, P=LM−N, of the remaining symbols to be punctured. P1 indicates the symbol puncturing number and is defined as the maximum integer smaller than LM/D1. P2 indicates a symbol puncturing number determined by a difference between the total number P of the symbols to be punctured and the symbol puncturing number P1. The puncturing distance D2 is defined as sD1 for an integer ‘s’ out of integers smaller than or equal to the maximum integer smaller than P1/P2.

[0079] In Table 6 and Equations (1) and (2), in order to match a stream of L (<N) coded symbols to the interleaver size N, the stream of the L coded symbols is repeated M times thus generating a stream of LM coded symbols, and the stream of the LM repeated coded symbols is punctured at the first puncturing interval D1 and the second puncturing interval D2 according to a first puncturing pattern A and a second puncturing pattern B. Here, the first puncturing pattern A is defined as a multiple of the first puncturing distance D1, while the second puncturing pattern B is defined as a multiple of the second puncturing distance D2 plus an offset. In the first embodiment, the offset is +1 or −1 (offset=±1). In the second embodiment, the offset is either a value determined by subtracting D2 from the maximum integer smaller than D1/2(i.e., offset=−D2+└D1/2┘) or a negative value for a value determined by adding D2 to the maximum integer smaller than D‘/2 (i.e., offset=−D2−└D1/2┘). That is, for the stream of the LM repeated coded symbols, P1 symbols located at the first puncturing interval D1 from the initial symbol are first punctured, and then, P2 symbols located at the second puncturing interval D2 plus an offset (D2+offset) from the initial symbol are punctured. The first puncturing interval D1 and the second puncturing interval D2 are the values for determining the patterns used for puncturing the symbols uniformly distributed in one frame. Therefore, in the first puncturing process, relatively dense puncturing is performed on the stream of the repeated coded symbols constituting one frame, and in the second puncturing process, relatively loose puncturing is performed on the stream of repeated coded symbols.

[0080] In other words, for the stream of the LM repeated coded symbols, P1 symbols are punctured, and when the remaining number of the coded symbols after puncturing is larger than the interleaver size N, P2 symbols are punctured for the stream of the (LM−P1) repeated coded symbols. As described above, it is assumed that the embodiment of the present invention performs puncturing on the stream of the repeated coded symbols in two separate steps. This is because even though the number of the coded symbols is smaller than the interleaver size, it is possible to match the number of the coded symbols to the interleaver size by performing puncturing on the repeated coded symbols in two separate steps. Therefore, depending on the circumstances, it is also possible to generate the coded symbols, the number of which is matched to the interleaver size N, in only a single step.

[0081] FIG. 9 illustrates a procedure for performing flexible data rate matching and transmission operations, shown in Table 6, according to a first embodiment of the present invention.

[0082] Referring to FIG. 9, in step 401, the initial parameters N, L, M and P necessary for FDRT are initialized. The number L of the coded symbols constituting the frame and the interleaver size N are determined according to a given data rate, while the repetition number M and the number P of the symbols to be punctured are determined by the formula in Table 6. In step 402, the first puncturing interval D1 and the first puncturing number P1 are calculated in accordance with the formula given in the algorithm. In step 403, the second puncturing interval D2 and the second puncturing number P2 are calculated in accordance with the formula given in the algorithm. After the parameters are all calculated in steps 402 and 403, steps 404 to 411 are performed while sequentially counting k from 1 to LM. At every counting, if it is determined in steps 405 and 406 that k is a multiple of D1 or D2 (where D2 is an even number), or if it is determined in steps 405 and 408 that k is a multiple of D1 or D2 (where D2 is an odd number), then the corresponding k^th coded symbols are punctured in step 407 or 409. In step 405, it is determined whether D2 is an even number or an odd number. If it is determined in step 405 that D2 is an even number, it is determined in step 406 whether k is a multiple of D1 or D2. If it is determined in step 406 that k is a multiple of D1, a k coded symbol is punctured in step 407; otherwise, if it is determined that k is a multiple of D2, a (k+1)^th coded symbol is punctured in step 407. However, if it is determined in step 406 that k is neither a multiple of D1 nor a multiple of D2, the procedure goes to step 410 to increase the value k by +1. If it is determined in step 405 that D2 is not an even number but an odd number, it is determined in step 408 whether k is a multiple of D1 or D2. If it is determined in step 408 that k is a multiple of D1, a k^th coded symbol is punctured in step 409; otherwise, if it is determined that k is a multiple of D2, a (k−1)^th coded symbol is punctured in step 409. However, if it is determined in step 408 that k is neither a multiple of D1 nor a multiple of D2, the procedure goes to step 410 to increase the value k by +1. After step 410, it is determined in step 411 whether k=LM+1. If so, the process ends. If not, the steps 405 to 411 are repeated until it is determined in step 411 that k=LM+1. In this method, a nearly uniform FDRT puncturing pattern is created and puncturing is performed on the stream of the repeated coded symbols according to the created puncturing pattern.

[0083] In the operation of steps 401-407, 410 and 411, if it is determined that k is a multiple of D1 or a multiple of D2 plus 1 (where D2 is an even number), then the corresponding k^th coded symbol is punctured. In the operation of steps 401-405 and 408-411, if k is a multiple of D1 or a multiple of D2 minus 1 (where D2 is an odd number), then corresponding k^th coded symbol is punctured. This is to perform the puncturing at the positions inconsistent with the coded symbols corresponding to a multiple of D1. That is, the coded symbols corresponding to a multiple of D2 plus 1 (where D2 is an even number) or a multiple of D2 minus 1 (where D2 is an odd number) are punctured at the different positions inconsistent with the coded symbols punctured at the positions corresponding to a multiple of D1.

[0084] FIGS. 10 and 11 illustrate structures of the flexible data rate matching and transmission devices according to the first embodiment of the present invention. Specifically, FIG. 10 illustrates a hardware structure of the FDRT algorithm, and FIG. 11 illustrates a software structure of the FDRT algorithm. That is, the FDRT device according to the first embodiment of the present invention can be realized with either a software module such as a digital signal processor (DSP), a central processing unit (CPU) and a micro-processing unit (MPU), as shown in FIG. 11, or a hardware module such as an application specific integrated circuit (ASIC), as shown in FIG. 10.

[0085] Referring to FIG. 10, the flexible data rate matching device according to an embodiment of the present invention includes a channel encoder 10, a repeater 110, a puncturer 350, a channel interleaver 100, a symbol index generator 310, modulo operators 320 and 330, and an OR gate (or logical sum operator) 340.

[0086] The channel encoder 10 generates a stream of L coded symbols. The repeater 110 repeats the stream of L coded symbols M times, and outputs LM repeated code symbols. Here, M indicates the number of times the stream of the L coded symbols is repeated, and is defined as the minimum integer larger than N/L. That is, M=┌N/L┐. The puncturer 350 performs a puncturing operation in response to a puncturing enable signal PUNC_EN from the OR gate 340. That is, the puncturing enable signal PUNC_EN is a puncturing pattern for determining the puncturing operation of the puncturer 350. The N-symbol stream output from the puncturer 350 is interleaved by the channel interleaver 100 having the interleaver size N.

[0087] The symbol index generator 310 sequentially generates indexes indicating the symbols constituting the stream of LM repeated symbols. The symbol index generator 310 can be realized with a counter. The modulo operator 320 receives the index k generated from the symbol index generator 310 and D1, and generates the puncturing enable signal PUNC_EN of ‘1’, when the k^th coded symbol corresponds to a coded symbol at a puncturing position. For example, in the modulo operator 320, “when the k^th coded symbol corresponds to a coded symbol at a puncturing position” refers to when the k^th coded symbol corresponds to a multiple of D1. The modulo operator 330 receives the index k generated from the symbol index generator 310 and D2, and generates the puncturing enable signal PUNC_EN of ‘1’, when the k^th coded symbol corresponds to a coded symbol at a puncturing position. For example, in the modulo operator 330, “when the k^th coded symbol corresponds to a coded symbol at a puncturing position” refers to when the k^th coded symbol corresponds to a multiple of (D2+1) (where D2 is an even number) or a multiple of (D2−1) (where D2 is an odd number). The OR gate 340 generates the puncturing enable signal PUNC_EN by ORing the outputs of the modulo operators 320 and 330, and provides the generated puncturing enable signal PUNC_EN to the puncturer 350.

[0088] D1 and D2, as described with reference to Table 6, Equations (1) and (2), and FIG. 9, are the puncturing interval values for determining the interval between the symbols to be punctured in the stream of the coded symbols within one frame. The first puncturing interval D1 is defined as the minimum integer larger than LM/P for the number, P=LM−N, of the symbols to be punctured. The second puncturing interval D2 is defined as sD1 for a selected one integer ‘s’ out of integers smaller than or equal to the maximum integer smaller than P1/P2. Here, P1 indicates the first symbol puncturing number and is defined as the maximum integer smaller than LM/D1. P2 indicates the second symbol puncturing number determined by a difference between the total number P of the symbols to be punctured and the first symbol puncturing number P1. That is, D1=┌LM/P┐, P1=└LM/D1┘, P2=P−P1, D2=sD1, and s≦└P1/P2┘. The puncturing intervals D1 and D2 and the symbol puncturing numbers P1 and P2 are provided from a puncturing pattern determiner (not shown). The puncturing pattern determiner, the modulo operators 320 and 330, and the OR gate 340 serve as a puncturing pattern generator for generating a puncturing enable signal for determining a puncturing operation of the puncturer 350.

[0089] Referring to FIG. 11, as in the flexible data rate matching device shown in FIG. 10, the flexible data rate matching device according to an embodiment of the present invention includes the channel encoder 10, the repeater 110, the puncturer 350, the channel interleaver 100, and the symbol index generator 310. The flexible data rate matching device shown in FIG. 11 is featured by including a puncturing pattern generator 360 in place of the modulo operators 320 and 330 and the OR gate 340 of FIG. 10. By doing so, the flexible data rate matching device is realized by software. The puncturing pattern generator 360 stores an address generator module program, and generates the puncturing enable signal ‘1’ when k satisfies a specific condition according to the program. The puncturing pattern generator 360 determines the k^th coded symbols corresponding to the case where k is a multiple of D1 or a multiple of D2 plus 1 (where D2 is an even number), to puncture the determined coded symbols. The puncturing pattern generator 360 may also determine the k^th coded symbols corresponding to the case where k is a multiple of D1, a multiple of D2 plus 1 (where D2 is an even number), or a multiple of D2 minus 1 (where D2 is an odd number), to puncture the determined coded symbols. Then, the flexible data rate matching device actually outputs N symbols out of LM symbols, as in the flexible data rate matching device of FIG. 10.

[0090] FIG. 12 illustrates a procedure for performing flexible data rate matching and transmission operations, shown in Table 6, according to a second embodiment of the present invention.

[0091] Referring to FIG. 12, in step 601, the initial parameters N, L, M and P necessary for FDRT are initialized. The number L of the coded symbols constituting the frame and the interleaver size N are determined according to a given data rate, while the repetition number M and the number P of the symbols to be punctured are determined by the formula in Table 6. In step 602, the first puncturing interval D1 and the first puncturing number P1 are calculated in accordance with the formula given in the algorithm. In step 603, the second puncturing interval D2 and the second puncturing number P2 are calculated in accordance with the formula given in the algorithm. After the parameters are all calculated in steps 602 and 603, steps 604 to 608 are performed while sequentially counting k from 1 to LM. At every counting, if it is determined in step 605 that k is (a multiple of D1) or ((a multiple of D2)−D2+└D1/2┘), then the corresponding k^th coded symbols are punctured in step 606. If it is determine in step 605 that k is neither (a multiple of D1) nor ((a multiple of D2)−D2+└D1/2┘), the procedure goes to step 607 to increase the value k by +1. After step 607, it is determined in step 608 whether k=LM+1. If so, the process ends. If not, the steps 605 to 608 are repeated until it is determined in step 608 that k=LM+1. In this method, an almost uniform FDRT puncturing pattern is created.

[0092] In FIG. 12, if it is determined that k is (a multiple of D1) or ((a multiple of D2)−D2+└D1/2┘), then the corresponding k^th coded symbol is punctured. Alternatively, if k is (a multiple of D1) or ((a multiple of D2)−D2└D1/2┘), then the corresponding k^th coded symbol is punctured. This is to perform the puncturing at the positions inconsistent with the coded symbols corresponding to a multiple of D1, and also, to prevent the puncturing range from surpassing the range of LM. In addition, this is to keep the puncturing position of D1 away from the puncturing position of D2 as wide as possible, as the D1 value increases more and more. That is, the coded symbols corresponding to ((a multiple of D2)−D2+└D1/2┘) are punctured at the different positions inconsistent with the coded symbols punctured at the positions corresponding to a multiple of D1.

[0093] FIGS. 13 and 14 illustrate structures of the flexible data rate matching and transmission devices according to the second embodiment of the present invention. Specifically, FIG. 13 illustrates a hardware structure of the FDRT algorithm, and FIG. 14 illustrates a software structure of the FDRT algorithm. That is, the FDRT device according to the second embodiment of the present invention can be realized with either a software module such as a DSP and a CPU, as shown in FIG. 14, or a hardware module such as an ASIC, as shown in FIG. 13.

[0094] Referring to FIG. 13, the flexible data rate matching device according to an embodiment of the present invention includes a channel encoder 10, a repeater 110, a puncturer 550, a channel interleaver 100, a symbol index generator 510, modulo operators 520 and 530, and an OR gate (or logical sum operator) 540.

[0095] The channel encoder 10 generates a stream of L coded symbols. The repeater 110 repeats the stream of L coded symbols M times, and outputs LM repeated code symbols. Here, M indicates the number of times the stream of the L coded symbols is repeated, and is defined as the minimum integer larger than N/L. That is, M=┌N/L┐. The puncturer 550 performs puncturing on the stream of the LM repeated symbol and outputs a stream of N symbols. Specifically, the puncturer 550 perform a puncturing operation in response to a puncturing enable signal PUNC_EN from the OR gate 540. That is, the puncturing enable signal PUNC_EN is a puncturing pattern for determining the puncturing operation of the puncturer 550. The N-symbol stream output from the puncturer 550 is interleaved by the channel interleaver 100 having the interleaver size N.

[0096] The symbol index generator 510 sequentially generates indexes indicating the symbols constituting the stream of LM repeated symbols. The symbol index generator 510 can be realized with a counter. The modulo operator 520 receives the index k generated from the symbol index generator 510 and D 1, and generates the puncturing enable signal PUNC_EN of ‘1’, when the k^th coded symbol corresponds to a coded symbol at a puncturing position. For example, in the modulo operator 520, “when the k^th coded symbol corresponds to a coded symbol at a puncturing position” refers to when the k^th coded symbol corresponds to a multiple of D1. The modulo operator 530 receives the index k generated from the symbol index generator 510 and D2, and generates the puncturing enable signal PUNC_EN of ‘1’, when the k^th coded symbol corresponds to a coded symbol at a puncturing position. For example, in the modulo operator 530, “when the k^th coded symbol corresponds to a coded symbol at a puncturing position” refers to when the k^th coded symbol corresponds to ((a multiple of D2)−D2+└D1/2┘). The OR gate 540 generates the puncturing enable signal PUNC_EN by ORing the outputs of the modulo operators 520 and 530, and provides the generated puncturing enable signal PUNC_EN to the puncturer 550.

[0097] D1 and D2, as described with reference to Table 6, Equations (1) and (2), and FIG. 9, are the puncturing interval values for determining the interval between the symbols to be punctured in the stream of the coded symbols within one frame. The first puncturing interval D1 is defined as the minimum integer larger than LM/P for the number, P=LM−N, of the symbols to be punctured. The second puncturing interval D2 is defined as sD1 for a selected one integer ‘s’ out of integers smaller than or equal to the maximum integer smaller than P1/P2. Here, P1 indicates the first symbol puncturing number and is defined as the maximum integer smaller than LM/D1. P2 indicates the second symbol puncturing number determined by a difference between the total number P of the symbols to be punctured and the first symbol puncturing number P1. That is, D1=┌LM/P┐, P132 └LM/D1┘, P2=P−P1, D2=sD1, and s≦└P1/P2┘. The puncturing intervals D1 and D2 and the symbol puncturing numbers P1 and P2 are provided from a puncturing pattern determiner (not shown). The puncturing pattern determiner, the modulo operators 520 and 530, and the OR gate 540 serve as a puncturing pattern generator for generating a puncturing enable signal for determining a puncturing operation of the puncturer 550.

[0098] Referring to FIG. 14, as in the flexible data rate matching device shown in FIG. 13, the flexible data rate matching device according to an embodiment of the present invention includes the channel encoder 10, the repeater 110, the puncturer 550, the channel interleaver 100, and the symbol index generator 510. The flexible data rate matching device shown in FIG. 14 is featured by including a puncturing pattern generator 560 in place of the modulo operators 520 and 530 and the OR gates 540 of FIG. 10. By doing so, the flexible data rate matching device is realized by software. The puncturing pattern generator 560 stores an address generator module program, and generates the puncturing enable signal PUNC_EN of ‘1’ when k satisfies a specific condition according to the program. The puncturing pattern generator 560 determines the k^th coded symbols corresponding to the case where k is (a multiple of D1) or ((a multiple of D2)−D2+└D1/2┘), to puncture the determined coded symbols. The puncturing pattern generator 560 may also determine the k^th coded symbols corresponding to the case where k is (a multiple of D1) or ((a multiple of D2)−D2−└D1/2┘), to puncture the determined coded symbols. Then, the flexible data rate matching device actually outputs N symbols out of LM symbols, as in the flexible data rate matching device of FIG. 13.

[0099] Performance Analysis

[0100] In the following description, a change in performance according to puncturing of the coded symbols encoded with the convolutional code is analyzed, and an average performance change of a convolutional code with a code rate R according to a puncturing rate and a repetition rate is described. From this, it is possible to predict a performance difference between the conventional IS-2000 FDRT algorithm and the novel FDRT algorithm proposed in the invention, and an average performance value.

[0101] First, the reference letters used herein will be defined as follows:

[0102] R: a code rate of the convolutional code, R=k/n;

[0103] Rst: (data rate of coded symbols actually transmitted over the channel)×R, Rst=NR(bits/sec); and

[0104] Rfdrt: (data rate of coded symbol output from the channel encoder in the FDRT mode)×R, Rfdrt=LR(bits/sec).

[0105] When the uniform puncturing or repetition pattern is used, a performance change caused by the puncturing or repetition is given by Equation (3) below. Here, when Rfdrt<Rst, the FDRT scheme performs symbol repetition, so that the performance, i.e., coding gain, is improved. However, in contrast, when Rfdrt>Rst, the FDRT scheme performs symbol puncturing, so that the performance, i.e., coding gain, is degraded. As mentioned before, however, since N>L, the FDRT scheme generally performs symbol repetition, thus increasing the performance, i.e., coding gain. The point at issue is how the coding gain can be increased according to the pattern.

Average Coding Gain=10 log₁₀ (Rst/Rfdrt) dB Equation (3)

[0106] For example, when Rst=19.2 Kbps, the coding gains according to Rfdrt are shown in Table 7. Therefore, if the puncturing pattern or the repetition pattern is properly determined and the FDRT algorithm is used, the coding gains shown in Table 7 should be guaranteed. 7

[0107] FIGS. 15 and 16 illustrate a comparison between the simulation results of the novel FDRT algorithm and the simulation results of the conventional FDRT algorithm.

[0108] FIG. 15 is a graph illustrating the simulation results for the case where the present invention is applied to the IS-2000 RC3 (Code Rate R=¼). This graph is obtained under the following simulation environment. Case (1), Case (2) and Case (3) are given the simulation environments shown in Tables 8, 9 and 10, respectively. In Case (1), a data rate is 15 Kbps, the number of coded symbols per frame is L=1200, and the interleaver size is N=1536. Here, 15k_BER_IS2000 and 15k_FER_IS200 indicate the simulation results according to the prior art, while 15k_BER_SEC and 15k_FER_SEC indicate the simulation results according to the present invention. In Case (2), a data rate is 10 Kbps, the number of coded symbols per frame is L=800, and the interleaver size is N=1536. In this case, only the simulation results according to the prior art are shown. In Case (3), a data rate is 19.2 Kbps. In this case, there occurs no symbol puncturing/repetition. 8

[0109] 9

[0110] 10

[0111] Referring to FIG. 15, as shown in the RC3 simulation results, the FDRT scheme (15k_BER_SEC, and 15k_FER_SEC) according to the present invention provides a gain Eb/No of about 0.9 dB to 1.0 dB, as compared with the conventional IS-2000 FDRT scheme (15k_BER_IS2000, and 15k_FER _IS2000). This almost approaches the average coding gain 1.07 dB, compared with 19.2 Kbps, as set forth in Table 7. Such results are obtained by generating the uniform puncturing and repetition pattern, and the performance also shows an almost optimal performance. Therefore, FDRT Condition (1) and FDRT Condition (2) of the FDRT algorithm proposed in the invention play an important role in the performance, and the new FDRT Algorithm Type 1 reflecting the conditions can also provide high performance. However, it is noted that the simulation results for the conventional IS-2000 FDRT algorithm unexpectedly provide a coding gain of about 0.1 dB. Such a problem is caused by the asymmetric pattern concentrated at the end of the frame, as described before. In conclusion, in the same channel condition, there occurs a performance difference of about 0.9 to 1.0 dB according to the FDRT pattern.

[0112] FIG. 16 is a graph illustrating the simulation results for the case where the invention is applied to the RC4 SCH (Code Rate R=½). This graph is obtained under the following simulation environment. Case (1), Case (2) and Case (3) are given the simulation environments shown in Tables 11, 12 and 13, respectively. In Case (1), a data rate is 15 Kbps, the number of coded symbols per frame is L=600, and the interleaver size is N=768. Here, 15k_BER_IS2000 and 15k_FER_IS200 indicate the simulation results according to the prior art, while 15k_BER_SEC and 15k_FER_SEC indicate the simulation results according to the present invention. In Case (2), a data rate is 17.5 Kbps, the number of coded symbols per frame is L=700, and the interleaver size is N=768. In this case, only the simulation results according to the prior art are shown. In Case (3), a data rate is 10 Kbps, the number of coded symbols per frame is L=400, and the interleaver size is N=768. In this case, only the simulation results according to the prior art are shown. In Case (4), the data rate is 19.2 Kbps. In this case, there occurs no symbol puncturing/repetition. 11

[0113] 12

[0114] 13

[0115] Referring to FIG. 16, the RC4 simulation results are also equal to the simulation results shown in FIG. 15. As illustrated in FIG. 16, the FDRT scheme (15k_BER_SEC, and 15k_FER_SEC) according to the present invention provides a gain Eb/No of about 0.8 dB to 0.9 dB, as compared with the conventional IS-2000 FDRT scheme (15k_BER_IS2000, and 15k_FER_IS2000).

[0116] What is important next is the 10 Kbps performance. In this case, the conventional FDRT algorithm almost approaches the average coding gain 2.83 dB shown in Table 7. Such results are obtained because the puncturing distance D for the case of 10 Kbps is set to an integer, so that the non-uniform puncturing due to the difference of LM/P−D does not occur in the process of determining the puncturing distance D. Therefore, this is a good example showing that the performance is linked directly with the prior condition that the difference of LM/P−D should be fully considered in the process of determining the puncturing distance D. Table 14 below shows the simulation environment for this performance. 14

[0117] As described above, the novel FDRT scheme according to the present invention matches a frame having coded symbols flexibly determined according to variation of a data rate to the interleaver size in the data communication system. The FDRT scheme uniformly distributes the puncturing pattern or repetition pattern within the frame by adjusting initial setting values, thereby making it possible to flexibly transmit data according to a data rate without performance degradation.

[0118] While the invention has been shown and described with reference to a certain preferred embodiment 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.