Method for multiplexing data and control information

Abstract

A method of transmitting uplink signal through a Physical Uplink Shared Channel (PUSCH) by a mobile device in a wireless communication system. The method includes generating multiplexed information by multiplexing a first type of control information and data information; and transmitting the multiplexed information and a second type of control information through the PUSCH. One or more Resource Blocks (RBs) for the PUSCH include N Single Carrier Frequency Division Multiple Access (SC-FDMA) symbols in a slot. The multiplexed information is mapped on a first set of SC-FDMA symbols, and the first set of SC-FDMA symbols includes SC-FDMA symbols other than an (N−3).sup.th SC-FDMA symbol for a reference signal in the slot. The second type of control information is mapped on (N−4).sup.th and (N−2).sup.th SC-FDMA symbols in the slot, and the second type of control information includes Acknowledgement/Negative Acknowledgement (ACK/NACK) information.

Claims

1. A method of transmitting uplink signal through a Physical Uplink Shared Channel (PUSCH) by a mobile device in a wireless communication system, the method comprising: generating multiplexed information by multiplexing a first type of control information and data information; and transmitting the multiplexed information and a second type of control information through the PUSCH, wherein one or more Resource Blocks (RBs) for the PUSCH include N Single Carrier Frequency Division Multiple Access (SC-FDMA) symbols in a slot, wherein the multiplexed information is mapped on a first set of SC-FDMA symbols, and the first set of SC-FDMA symbols includes SC-FDMA symbols other than an (N−3).sup.th SC-FDMA symbol for a reference signal in the slot, and wherein the second type of control information is mapped on (N−4).sup.th and (N−2).sup.th SC-FDMA symbols in the slot, and the second type of control information includes Acknowledgement/Negative Acknowledgement (ACK/NACK) information.

2. The method of claim 1, wherein the multiplexed information is mapped on the first set of SC-FDMA symbols in a time-first way.

3. The method of claim 1, wherein the first type of control information includes channel quality information.

4. The method of claim 1, wherein the first set of SC-FDMA symbols includes all SC-FDMA symbols other than the (N−3).sup.th SC-FDMA symbol for the reference signal in the slot.

5. The method of claim 1, wherein N is 7.

6. A mobile device for use in a wireless communication system, the mobile device comprising: a signal processing chain for generating multiplexed information by multiplexing a first type of control information and data information, and for transmitting the multiplexed information and a second type of control information through a Physical Uplink Shared Channel (PUSCH), wherein one or more Resource Blocks (RBs) for the PUSCH include N Single Carrier Frequency Division Multiple Access (SC-FDMA) symbols in a slot, wherein the multiplexed information is mapped on a first set of SC-FDMA symbols, and the first set of SC-FDMA symbols includes SC-FDMA symbols other than an (N−3).sup.th SC-FDMA symbol for a reference signal in the slot, and wherein the second type of control information is mapped on (N−4).sup.th and (N−2).sup.th SC-FDMA symbols in the slot, and the second type of control information includes Acknowledgement/Negative Acknowledgement (ACK/NACK) information.

7. The mobile device of claim 6, wherein the multiplexed information is mapped on the first set of SC-FDMA symbols in a time-first way.

8. The mobile device of claim 6, wherein the first type of control information includes channel quality information.

9. The mobile device of claim 6, wherein the first set of SC-FDMA symbols includes all SC-FDMA symbols other than the (N−3).sup.th SC-FDMA symbol for the reference signal in the slot.

10. The mobile device of claim 6, wherein N is 7.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) The accompanying drawings, which are included to provide a further understanding of the invention, illustrate embodiments of the invention and together with the description serve to explain the principle of the invention.

(2) In the drawings:

(3) FIG. 1 illustrates general processing for a transport channel and/or control information;

(4) FIG. 2 illustrates conventional transport channel processing;

(5) FIG. 3 is a view explaining a structure of a resource block used in FIGS. 4 to 11;

(6) FIG. 4 is a view illustrating a control information mapping method according to an exemplary embodiment of the present invention;

(7) FIG. 5 is a view illustrating a control information mapping method according to another exemplary embodiment of the present invention;

(8) FIG. 6 is a view illustrating a control information mapping method according to a further exemplary embodiment of the present invention;

(9) FIG. 7 is a view illustrating a control information mapping method according to another exemplary embodiment of the present invention;

(10) FIG. 8 is a view illustrating a control information mapping method according to another exemplary embodiment of the present invention;

(11) FIG. 9 is a view illustrating a control information mapping method according to another exemplary embodiment of the present invention;

(12) FIG. 10 is a view illustrating a control information mapping method according to another exemplary embodiment of the present invention; and

(13) FIG. 11 is a view illustrating a control information mapping method according to another exemplary embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

(14) Reference will now be made in detail to the exemplary embodiments of the present invention with reference to the accompanying drawings. The detailed description, which will be given below with reference to the accompanying drawings, is intended to explain exemplary embodiments of the present invention, rather than to show the only embodiments that can be implemented according to the invention. The following detailed description includes specific details in order to provide a thorough understanding of the present invention. However, it will be apparent to those skilled in the art that the present invention may be practiced without such specific details. For example, the following description will be given centering on specific terms, but the present invention is not limited thereto and any other terms may be used to represent the same meanings. The same reference numbers will be used throughout this specification to refer to the same or like parts.

(15) Suffixes ‘module’ and ‘part’ of constituent elements used in the following description are simply added in consideration of ease of description and do not have any special importance or role. Therefore, the terms ‘module’ and ‘part’ can be used interchangeably.

(16) In actual implementation, each element in a block diagram may be divided into two hardware chips, or two or more elements may be integrated into one hardware chip.

(17) Exemplary embodiments described hereinbelow may be used for processing of a transport channel of the 3GPP, especially a UL-SCH.

(18) Control information may be classified into various types according to an arbitrary method or ‘importance’ thereof. Here, ‘importance’ may be determined by evaluating a degree of influence on the capability of a wireless mobile communication system when transmission of any type of control information fails. When multiple types of control information are present, a new multiplexing scheme is required to improve the capability of a wireless mobile communication system. For example, control information of a more important type may be multiplexed so as not to be overwritten by control information of a less important type.

(19) In the present invention, control information 1 may be channel quality information (CQI)/precoding matrix index (PMI) which is a combination of CQI indicating channel quality and of a PMI indicating index information of a codebook used for pre-coding. The control information 1 may rate-match with data information for multiplexing. Control information 2 may be acknowledgement/negative acknowledgement (ACK/NACK) which is a hybrid automatic repeat request (HARQ) response. The control information 2 may puncture the data information or the control information 1 for multiplexing.

(20) Structures of exemplary embodiments proposed by the present invention may be modified and applied to a structure of up-down or right-left symmetry with respect to a frequency axis and a time axis in a set of resource elements comprised of resource elements. In the exemplary embodiments of the present invention, a symbol may be an SC-FDMA symbol.

(21) The term ‘puncturing’ refers to eliminating a specific bit (or symbol) from a sequence comprised of multiple bits (or symbols) and inserting a new bit (or symbol) into the sequence. That is, puncturing serves to replace a part of information with other information, and when data information or control information is multiplexed, a bit (or symbol) of punctured information is replaced with puncturing information. When a puncturing scheme is used, the length of whole bits (or symbols) is maintained even after new information is inserted. A code rate of punctured information is influenced by puncturing.

(22) The term ‘rate matching’ refers to adjusting a code rate of data information. When data information or control information is multiplexed, the location of such information may be changed but contents thereof are not influenced. Rate-matching control information 1 and data information means that the amount of rate-matched control information and rate-matched data information has a prescribed size. Therefore, if the amount of control information 1 to be transmitted is increased, the amount of data information rate-matching with the control information 1 is decreased by that much.

(23) When multiplexing data information and control information, the following should be considered. First, a multiplexing rule should not be changed by the amount and type of control information or presence/absence of control information. Second, when control information is multiplexed with data by rate matching or control information punctures data and/or other types of control information, the control information should not affect transmission of other data of a cyclic buffer. Third, a starting point of a cyclic buffer for a next redundancy version should not be influenced by presence/absence of control information. Fourth, in a HARQ transmission scheme, HARQ buffer corruption should be able to be avoided. In a method for mapping multiplexed information to a data channel, a specific type of control information should be mapped to resource elements adjacent to an RS which can positively influence system performance. Moreover, since a data code rate may be affected when control information punctures data, control information should be equally distributed over entire RBs and REs. Further, evenly distributing control information in one RB as much as possible limits an influence upon successive data.

(24) Exemplary embodiments of FIG. 3 to 11 which will be described hereinafter are based on a normal CP configuration and it is assumed that one RB is comprised of M (=R×C) resource elements. Here, ‘C’ denotes the number of symbol periods arranged in a time axis direction, and ‘R’ denotes the number of subcarriers arranged in a virtual frequency direction in one RB. The symbol period refers to a time period at which one symbol exits. Accordingly, the length of one symbol period is identical to the length of one symbol.

(25) Meanwhile, one RB may correspond to a matrix of columns of the number C of SC-FDMA symbols constituting the RB and rows of the number R of subcarriers constituting the RB. Therefore, when one RB is included on a two-dimensional plane, REs which are constituent elements of the RB may correspond to respective elements of the matrix. This matrix may be used to generate input information mapped to the RB.

(26) Generally, since an RS may be fixedly allocated two SC-FDMA symbols among SC-FDMA symbols of an RB, a matrix corresponding to the RB may be an R×(C−2) matrix rather than an R×C matrix.

(27) FIGS. 3a to 3c are views explaining a structure of an RB used in FIGS. 4 to 11.

(28) Referring to FIG. 3a, an RS is mapped to an ‘RS symbol period’ comprised of ‘RS symbol period(0)’ and ‘RS symbol period(1)’. The RS symbol period(0) and the RS symbol period(1) may not be adjacent to each other.

(29) An ‘RS symbol period area’ defined in the ‘RS symbol period’ will now be described. The RS symbol period area includes (2×R) resource elements located in the RS symbol period. The ‘RS symbol period area’ is divided into ‘RS symbol period area(0)’ and ‘RS symbol period area(1)’. Each of the RS symbol period area(0) and the RS symbol period area(1) has R resource elements in a frequency direction.

(30) Referring to FIG. 3b, a ‘first symbol period’ is defined as 4 symbol periods separated from the RS symbol period by a zero symbol period. A ‘first symbol period area’ includes (4×R) resource elements located in the first symbol period. Therefore, in FIGS. 3a to 6, the ‘first symbol period’ is further divided into ‘first symbol period area(0)’, ‘first symbol period area(1)’, ‘first symbol period area(2)’, and ‘first symbol period area(3)’.

(31) Referring to FIG. 3c, a ‘second symbol period’ is defined as 4 symbol periods separated from the RS symbol period by one symbol period. A ‘second symbol period area’ includes (4×R) resource elements located in the second symbol period. Therefore, in FIG. 3c, the ‘second symbol period area’ is further divided into ‘second symbol period area(0)’, ‘second symbol period area(1)’, ‘second symbol period area(2)’, and ‘second symbol period area(3)’.

(32) RS symbol periods shown in FIGS. 3a to 11 are not always located in the fourth and eleventh symbol periods.

(33) Although a set of resource elements shown in FIGS. 3a to 11 is based on the normal CP configuration, the same principle may be applied to an extended CP configuration comprised of 12 symbols.

Embodiment 1

(34) FIG. 4 illustrates a control information mapping method according to an exemplary embodiment of the present invention.

(35) In FIG. 4, control information is distributed in units of REs. The control information may be mapped to any one of the above-described first symbol period, second symbol period, and other available periods. To distribute the control information in units of REs, a rate value or a difference value is calculated between the amount of the control information for multiplexing and the amount of REs to which the control information can be mapped in an RB. The control information is rate-matched or is punctured based on the calculated rate value or difference value. That is, the mapping locations of the control information are determined according to the rate value or difference value. Hence, the control information is multiplexed with data in consideration of an interval to which the control information can be mapped in a transport, channel. If the multiplexed information is sequentially mapped in. the transport channel, the control information is evenly distributed over the entire RB in the transport channel, as illustrated in FIG. 4. The locations of REs, within each RB, mapped in units of RBs may vary according to RBs.

(36) In a mapping method, the multiplexed information is mapped in the direction of SC-FDMA symbols (namely, according to time flow) starting from the first SC-FDMA symbol of the first subcarrier of the first RB. If mapping of SC-FDMA symbols within one subcarrier is completed, mapping is sequentially performed for the next subcarriers. The mapping may be performed in a forward (namely, according to time flow), backward (namely, according to reverse time flow), or arbitrary order. Thus the data and the control information can be multiplexed. If the amount of the control information for multiplexing is greater than the amount of the control information which can be mapped in the transport channel, an area in which the control information can be mapped can be extended up to a symbol near to an RS. For example, even though the control information is permitted to be mapped only in the above-described first symbol period, if the amount of the control information is greater than the number of REs of the first symbol period, even an area except for the first symbol period can be mapped. Furthermore, the multiplexing/mapping method can be applied in consideration of an extended area and extended amount. In the above description, the data, control information, and RE have been described in units of symbols. The number of bits denoted by each symbol should consider a modulation order. The following Table 1 indicates one example of rate-matching the control information by the above method.

(37) TABLE-US-00001 TABLE 1 xi = no_re; e = xi; ep = xi; em = xi − no_ci; m = 1; do {  e = e − em;  if (e <= 0)  {   insert data;   e = e + ep;  }  else  {   insert control information;  }  m++; } while (m <= xi)

(38) In Table 1, ‘no_re’ denotes the amount of REs to which control information can be mapped, ‘no_ci’ denotes the amount of the control information. Parameters ‘e’, ‘ep’, ‘em’, and ‘m’ are used for rate-matching based on the amount of REs to which the control information can be mapped and the amount of the control information. The above algorithm is repeated for each of REs to which the control information can be mapped. A rate-matching operation is performed by this algorithm and the control information can be distributed between data. To multiplex different types of control information, ‘no_re’ of Table 1 is set to the amount of first control information, ‘no_ci’ is set to the amount of second control information, and ‘insert data’ and ‘insert control information’ can express different types of control information. Table 1 is based on a symbol unit and a relationship between the control information and REs can be established considering a modulation order.

Embodiment 2

(39) In FIG. 5, control information is distributed in units of groups of REs within a subcarrier that can be allocated for the control information. A group of REs within a subcarrier refers to a set of REs that can be allocated for the control information among a plurality of REs within one subcarrier of a transmission unit. If the number of REs to which the control information can be mapped within one subcarrier is N, then N REs are mapped as one unit. For example, if only the first symbol period is permitted for mapping, the control information can be mapped to 4 REs (N=4) per subcarrier (refer to FIG. 5). As another example, if both the first symbol period and the second symbol period are permitted for mapping, the control information can be mapped to 8 REs (N=8) per subcarrier (not shown). If a remainder obtained by dividing the amount of control information by N is not 0, that is, if a result value of a modulo-N operation is not 0, control information corresponding to the result value is mapped to SC-FDMA symbols of the last subcarrier.

(40) To distribute the control information in units of sets of REs within a subcarrier, the amount n1 of control information for multiplexing and the amount n2 of REs allocated for the control information in the entire RB may be divided by the amount of REs allocated for the control information among SC-FDMA symbols of a subcarrier. A rate value or a difference value between the two values n1 and n2 is calculated by rounding the divided result to the next greatest integer. The control information is rate-matched or is punctured using the rate value or the difference value. In other words, an interval in which the control information can be mapped is determined using the aforementioned rate value or difference value. Accordingly, the control information is multiplexed between specific locations of data in consideration of an interval in which the control information of a transport channel can be located. If the multiplexed information is sequentially mapped to the transport channel, the control information is distributively mapped in units of subcarriers over the entire RB. Locations of REs, within each RB, mapped in units of RBs may vary according to RBs.

(41) In the mapping method, the multiplexed information is mapped starting from the first SC-FDMA symbol of the first subcarrier of the first RB in the direction of SC-FDMA symbols (i.e., according to time flow). If mapping of SC-FDMA symbols within one subcarrier is completed, mapping is sequentially performed for the next subcarriers. The mapping may be performed in a forward (namely, according to time flow), backward (namely, according to reverse time flow), or arbitrary order. Thus the data and the control information can be multiplexed. If the amount of the control information for multiplexing is greater than the amount of the control information which can be mapped in the transport channel, a mapping area of the control information can be extended up to symbols near to an RS. For example, even though the control information is permitted to be mapped only in the above-described first symbol period, if the amount of the control information is greater than the number of REs of the first symbol period, the control information can be mapped even to an area except for the first symbol period. Furthermore, the multiplexing/mapping method can be applied in consideration of extended area and extended amount. In the above description, the data, control information, and RE have been described in units of symbols. The number of bits denoted by each symbol should consider a modulation order.

Embodiment 3

(42) FIG. 6 illustrates a control information mapping method according to a further exemplary embodiment of the present invention.

(43) In FIG. 6, if the sum of the amount of control information 1 and the amount of control information 2 is greater than the amount of transmissible REs, the amount of each control information mapped to one RB is reset such that a value obtained by dividing the amount of each control information by the number of SC-FDMA symbols can be 0. A result value obtained by dividing the amount of the control information 1 by the number of SC-FDMA symbols may be ceiled, floored, or rounded, so that {(amount of control information 1)=(number n1 of subcarriers)×(number of SC-FDMA symbols)}. Moreover, a result value obtained by dividing the amount of the control information 2 by the number of SC-FDMA symbols may be ceiled, floored, or rounded, so that {(amount of control information 2)=(number n2 of subcarriers)×(number of SC-FDMA symbols)}. In this case, (n1+n2) may be the same as the number of all subcarriers within one RB.

(44) According to importance of the control information, ceil, floor, or round may be selectively applied. For example, if the control information 1 is more important than the control information 2, ceil may be used for the control information 1 and floor may be used for the control information 2, The amount of the control information can be adjusted using a rate-matching method, a specific bit repeating method, or encoding method. If the sum of the amount of the control information 1 and the amount of the control information 2 is greater than the amount of transmissive REs, the amount of control information can be adjusted according to importance thereof such that {(amount of control information 1)=(amount of transmissive REs)−(amount of control information 2)} or {(amount of control information 2)=(amount of transmissive REs)−(amount of control information 1)}.

Embodiment 4

(45) FIG. 7 illustrates a control information mapping method according to another exemplary embodiment of the present invention.

(46) To describe the embodiment of FIG. 7, the number of control information 1 is denoted by N.sub.ci1, the number of control information 2 is denoted by N.sub.ci2, the number of SC-FDMA symbols is denoted by N.sub.SC.sub._.sub.sym, the number of subcarriers occupied by the control information 1 is denoted by N.sub.sc.sub._.sub.ci1, and the number of all subcarriers is denoted by N.sub.sc.

(47) In FIG. 7, if a remainder obtained by dividing the number N.sub.ci1 of control information 1 by the number N.sub.SC.sub._.sub.sym of SC-FDMA symbols is n(≠0), (N.sub.SC.sub._.sub.sym−n) REs are filled with dummy information or data, thereby readjusting the number of control information 1. Therefore, the number N.sub.sc.sub._.sub.ci1 of subcarriers occupied by the control information 1 is a value obtained by rounding a result of dividing N.sub.ci1 by N.sub.SC.sub._.sub.sym to the next largest integer. Mapping is performed starting from the first RE of the first RB in the direction of SC-FDMA symbols. Hereinafter, the meaning of readjusting the number of control information may represent a method of increasing the length of the control information by adding dummy information or data or by copying a part of the control information, or decreasing the length of the control information by deleting a part of the control information.

(48) The control information 2 may be mapped by the following method. First, a value n is calculated by rounding, to the next largest integer, a result of dividing the number N.sub.ci1 of the control information 1 by the number N.sub.SC.sub._.sub.sym of the SC-FDMA symbols. Thereafter, the value n is subtracted from the number N.sub.sc of all subcarriers. Next, the number of the control information 2 that can be included per SC-FDMA symbol is calculated by dividing the number N.sub.ci2 of the control information 2 by the above subtracted result. Then the control information 2 may be sequentially or distributively mapped to SC-FDMA symbols near to an RS according to the calculated result. The amount of the control information 2 may be reset to a multiple of a value obtained by rounding, to the next largest integer, a result of dividing the number N.sub.ci2 of the control information 2 by the number of the control information that can be contained per SC-FDMA symbol. To this end, dummy information or other copied information may be added to the control information 2, or a part of the control information 2 may be eliminated. Alternatively, the number of the control information 2 may be set to the number of REs that have a remainder of 0 when divided by {(the number of subcarriers)×(the number of SC-FDMA symbols which can include the control information 2)}.

(49) First, a value n is calculated by rounding, to the next largest integer, a result of dividing the number N.sub.ci1 of the control information 1 by the number N.sub.SC.sub._.sub.sym of the SC-FDMA symbols. Thereafter, the number N.sub.SC−n of subcarriers to which the control information 2 can be mapped is calculated by subtracting the value n from the number N.sub.sc of all subcarriers. The value N.sub.SC−n is the number of control information 2 that can be included per SC-FDMA symbol. Then the control information 2 may be sequentially or distributively mapped to SC-FDMA symbols near to an RS. For instance, the control information 2 may be arranged in the first symbol period and/or the second symbol period. The amount of the control information 2 may be reset to a multiple of N.sub.SC−n. For example, in FIG. 7, N.sub.SC=12, n=7, N.sub.SC-n=5, and N.sub.ci2=(N.sub.SC−n)×8=40.

Embodiment 5

(50) FIG. 8 illustrates a control information mapping method according to another exemplary embodiment of the present invention.

(51) In the mapping method of FIG. 8, control information 1 is mapped starting from the first SC-FDMA symbol of the first subcarrier of the first RB in the direction of SC-FDMA symbols (i.e., according to time flow). If mapping of SC-FDMA symbols within one subcarrier is completed, mapping is sequentially performed for the next subcarriers. The mapping may be performed in a forward (i.e., according to time flow), backward (i.e., according to reverse time flow), or arbitrary order.

(52) According to the embodiment of FIG. 8, the amount of control information 2 is similarly determined to the method of FIG. 7. First, a value n is calculated by rounding, to the next largest integer, a result of dividing the number N.sub.ci1 of the control information 1 by the number N.sub.SC.sub._.sub.sym of the SC-FDMA symbols. Thereafter, the value n is subtracted from the number N.sub.sc of subcarriers. Next, the number of the control information 2 that can be included per SC-FDMA symbol is calculated by dividing the number N.sub.ci2 of the control information 2 by the above subtracted result. Then the control information 2 may be sequentially or distributively mapped to SC-FDMA symbols near to an RS according to the calculated result. The amount of the control information 2 may be reset to a multiple of a value obtained by rounding, to the next largest integer, a result of dividing the number N.sub.ci2 of the control information 2 by the number of the control information that can be contained per SC-FDMA symbol. To this end, dummy information or other copied information may be added to the control information 2, or a part of the control information 2 may be eliminated. Alternatively, the number of the control information 2 may be set to the number of REs that have a remainder of 0 when divided by {(the number of subcarriers)×(the number of SC-FDMA symbols which can include the control information 2)}.

(53) First, a value n is calculated by rounding, to the next largest integer, a result of dividing the number N.sub.ci1 of the control information 1 by the number N.sub.SC.sub._.sub.sym of the SC-FDMA symbols. Thereafter, the number N.sub.SC-n of subcarriers to which the control information 2 can be mapped is calculated by subtracting the value n from the number N.sub.sc of subcarriers. The value N.sub.SC-n is the number of control information 2 that can be included per SC-FDMA symbol. Then the control information 2 may be sequentially or distributively mapped to SC-FDMA symbols near to an RS. For instance, the control information 2 may be arranged in the first symbol period and/or the second symbol period. The amount of the control information 2 may be reset to a multiple of N.sub.SC−n. For example, in FIG. 8, N.sub.SC=12, n=7, N.sub.SC−5, and N.sub.ci2=(N.sub.SC−n×8=40.

Embodiment 6

(54) FIG. 9 illustrates a control information mapping method according to another exemplary embodiment of the present invention.

(55) In FIG. 9, the number of control information 1 may be reset to the number of REs having a remainder of 0 when divided by {(the number of subcarriers)×(the number of SC-FDMA symbols which can include the control information 1)}, using a value obtained by rounding up, to the next largest integer, a result of diving the number N.sub.ci1 of the control information 1 by the number N.sub.SC.sub._.sub.sym of SC-FDMA. symbols. To this end, dummy information or other copied information may be added to the control information 1, or a part of the control information 1 may be eliminated. The control information 1 may be sequentially mapped within SC-FDMA symbols which can include the control information 1.

(56) The number of control information 2 may be reset to a multiple of a value obtained by rounding up, to the next largest integer, a result of diving the number N.sub.ci2 of the control information 2 by the number of the control information 2 which can be included per SC-FDMA symbol, in consideration of the number of the control information 1 and the number N.sub.ci2 of the control information 2. To this end, dummy information or other copied information may be added to the control information 2, or a part of the control information 2 may be eliminated. The number of control information 2 may be reset to the number of REs having a remainder of 0 when divided by {(the number of subcarriers)×(the number of SC-FDMA symbols which can include the control information 2)}. The control information 2 may be sequentially or distributively arranged in the SC-FDMA symbols excluding the location of the control information 1.

(57) For example, the number of subcarriers mapped to the control information 1 is determined by a value n obtained by rounding, to the next largest integer, a result of dividing the number N.sub.ci1 of the control information 1 by the number N.sub.SC.sub._.sub.sym of the SC-FDMA symbols. The value n is the number of control information 1 that can be included per SC-FDMA symbol. Then the control information 1 may be sequentially or distributively mapped to SC-FDMA. symbols near to an RS. For example, the control information 1 may be arranged in the first symbol period and/or the second symbol period. In this case, the amount of the control information 1 may be reset to a multiple of n.

(58) A value is calculated by rounding, to the next largest integer, a result of dividing the number N.sub.ci1 of the control information 1 by the number N.sub.SC.sub._.sub.sym of the SC-FDMA symbols. The number N.sub.SC−n of subcarriers to which the control information 2 can be mapped is obtained by subtracting the value from the total number of subcarriers N.sub.SC. The value N.sub.SC−n is the number of control information 2 that can be included per SC-FDMA symbol. Then the control information 2 may be sequentially or distributively mapped to SC-FDMA symbols near to an RS. For instance, the control information 2 may be arranged in the first symbol period and/or the second symbol period. The amount of the control information 2 may be reset to a multiple of N.sub.SC−n. For example, in FIG. 9, N.sub.SC=12, n=7, N.sub.SC−n=5, N.sub.ci1=n×8=56, and N.sub.ci2=(N.sub.SC=n)×8=40.

Embodiment 7

(59) FIG. 10 illustrates a control information mapping method according to another exemplary embodiment of the present invention.

(60) In FIG. 10, control information 1 is sequentially mapped in the direction of a time axis (SC-FDMA symbols). The number and locations of SC-FDMA symbols to which control information 2 can be mapped among SC-FDMA symbols near to an RS are determined so that the control information 2 is distributively mapped to REs of locations corresponding to the determined SC-FDMA symbols. The locations in which the control information 2 can be mapped may be the above-described first symbol period and/or second symbol period.

(61) To determine the size and location of an area in which the control information 1 is mapped, a result value obtained by dividing the amount of the control information 1 considering a modulation order by the number of SC-FDMA symbols may ceiled, floored, rounded, or divided. The size of an area in which the control information 1 is mapped can be set to a number of the unit of REs or subcarriers based on the calculated value.

(62) To determine the size and location of an area in which the control information 2 is mapped, a result value obtained by dividing the number of symbols of the control information 1 and control information 2 considering a modulation order by the number of SC-FDMA symbols may ceiled, floored, rounded, or divided. The numbers of REs or subcarriers to which the control information 2 is mapped can be obtained based on the calculated value.

(63) The number of the control information 2 which can be included per SC-FDMA symbol should be determined in consideration of the number of the control information 1 included in a corresponding SC-FDMA symbol.

(64) According to the above-described method, the control information 1 is sequentially mapped in the direction of a time axis and the control information 2 can be mapped to REs near to the RS. Since the control information 2 is distributively mapped, a code rate of all code blocks can be uniformly maintained.

(65) If only the control information 1 and data are multiplexed, the above-described method may be used without considering the location of the control information 2. If only the control information 2 and data are multiplexed, the above-described method may be used to obtain an area and location in which the control information 2 is mapped in an entire transmission band without considering the location of the control information 1.

Embodiment 8

(66) FIG. 11 illustrates a control information mapping method according to another exemplary embodiment of the present invention.

(67) In FIG. 11, the number and locations of SC-FDMA symbols to which control information 1 can be mapped among SC-FDMA symbols near to an RS are determined. The control information 1 is sequentially mapped to REs of the determined locations. The number and locations of SC-FDMA symbols to which control information 2 can be mapped among SC-FDMA symbols near to an RS are determined. The control information 2 is distributively mapped to REs of locations corresponding to the determined SC-FDMA symbols.

(68) For example, the control information 1 is mapped to the first symbol period. If the mapping of the control information 1 is ended, the control information 2 is mapped to the remaining REs in the first symbol period. If the control information 2 is not all mapped to the first symbol period, the control information 2 which are not mapped may be mapped to an area except for the first symbol period, for example, to the second symbol period. The number of REs of the second symbol period is compared with the number of the remaining control information 2 to distributively map the remaining control information 2 to the second symbol period.

(69) To determine the size and location of an area in which the control information 1 is mapped, a result value obtained by dividing the number of the control information 1 considering a modulation order by the number of SC-FDMA symbols may ceiled, floored, rounded, or divided, thereby calculating the number of REs or subcarriers in which the control information 1 can be located. To determine the size and location of an area in which the control information 2 is mapped, a result value obtained by dividing the number of symbols of the control information 1 and control information 2 considering a modulation order by the number of SC-FDMA symbols may ceiled, floored, rounded, or divided, thereby calculating the number of REs or subcarriers in which the control information 2 can be located. Since a range of the control information 1 may differ in the SC-FDMA symbols (horizontal axis), the number of the control information 1 should be considered when determining the location of the control information 2. The number and/or location of the control information 2 which can be included per SC-FDMA symbol are determined considering the number and/or location of the control information 1 included in a corresponding SC-FDMA symbol. If only the control information 1 and data are multiplexed, the above-described method may be used without considering the location of the control information 2. If only the control information 2 and data are multiplexed, the above-described method may be used to obtain an area and location in which the control information 2 is mapped without considering the location of the control information 1. Therefore, the control information can be mapped to REs near to the RS and a code rate of all code blocks can be uniformly maintained by distributing the control information 2.

(70) The embodiments of the present invention described above have the following effects. The method for multiplexing the control information and data and mapping the multiplexed information to the transport channel may use the same multiplexing rule irrespective of the presence/absence, amount, and type of the control information and does not influence transmission of other data of a cyclic buffer. A start point of the cyclic buffer for the next redundancy version is not influenced by the method and HARQ buffer corruption can be avoided in a HARQ transmission scheme. The control information can be located in symbols near to the RS and can be distributed over the entire RB. Therefore, during multiplexing and mapping of the data and control information, the control information is gathered in a specific RB according to the amount of the control information, so a variation in a data code rate of the specific RB is distributed over the entire RB. As a result, an error rate in a code block can be equalized.

(71) Other exemplary embodiments of the present invention will now be described in detail.

(72) Table 2 illustrates the method of FIG. 2 and shows an example of applying a method for inserting control information to a 3GPP TS 36.212 V8.0.0.

(73) TABLE-US-00002 TABLE 2 set N.sub.symb.sup.UL-SCH = 2 .Math. (N.sub.symb.sup.UL −1) set i, j, k to 0 set e = no_re set ep = no_re set em = no_re − no_ci for k=0 to H-1  if k mod N.sub.symb.sup.UL-SCH = 2 or 3 or (N.sub.symb.sup.UL-SCH/2+2) or (N.sub.symb.sup.UL-SCH/2+3)  e = e − em  if (e <= 0)    g.sub.k = f.sub.i    e = e + ep    i++    k++  else    g.sub.k = q.sub.j    j++    k++   end if  else   g.sub.k = f.sub.i   i++   k++  end if end for

(74) Here, f.sub.1, f.sub.2, f.sub.3, . . . f.sub.G−1 denote inputs, G is the amount of data excluding the amount of control information, g.sub.0, g.sub.1, g.sub.2, . . . , g.sub.H−1 denote outputs, H denotes the sum of the amount of data and the amount of control information, q.sub.0, q.sub.1, q.sub.2, . . . , q.sub.Q−1 denote control information, and Q denotes the amount of control information.

(75) According to the method of Table 2, the number of SC-FDMA symbols located in one subcarrier in a transmission unit is given by N.sub.symb.sup.UL-SCH=2.Math.(N.sub.symb.sup.UL−1). Parameters for rate-matching are initialized using the amount of REs and the amount of the control information. In the multiplexing method of Table 2, a multiplexing operation is repeated H times using a parameter k. Input data is allocated in an area except for a control information mapping area. The data or control information is allocated to the control information mapping area through rate-matching. The control information mapping area is calculated by k mod N.sub.symb.sup.L-SCH=2 or 3 or (N.sub.symb.sup.UL-SCH/2+2) or (N.sub.symb.sup.UL-SCH/2+3) operation. Here, k may be 2, 3, 8, or 9 and k may be a specific

(76) number. In this embodiment, the multiplexing method is expressed in a symbol unit and may be applied considering bits and a modulation order.

(77) Table 3 illustrates the method of FIG. 2 and shows an example of applying a method for inserting different types of control information or a method for replacing data by control information to a 3GPP TS 36.212 V8.0.0.

(78) TABLE-US-00003 TABLE 3 set N.sub.symb.sup.UL-SCH = 2 .Math. (N.sub.symb.sup.UL −1) set i, j, k to 0 set e = no_re set ep = no_re set em = no_re − no_ci for k=0 to H-1  if k mod N.sub.symb.sup.UL-SCH = 2 or 3 or (N.sub.symb.sup.UL-SCH/2+2) or (N.sub.symb.sup.UL-SCH/2+3)   e = e − em   if (e <= 0)    g.sub.k = f.sub.i    e = e + ep    i++    k++   else    if (rate matching case)  g.sub.k = q.sub.j    j++    k++    else ; puncturing case    g.sub.k = q.sub.j    j++    k++    i++   end if  else   g.sub.k = f.sub.i   i++   k++   end if end for

(79) Control information q is formed by equally or unequally control information which is to puncture rate-matched control information and data. It is assumed that information about locations to be inserted or replaced can be known. Here, f.sub.1, f.sub.2, f.sub.3, . . . , f.sub.G−1 denote inputs, G is the amount of data excluding the amount of control information, g.sub.0, g.sub.1, g.sub.2, . . . , g.sub.H−1 denote outputs, H denotes the sum of the amount of data and the amount of control information, q.sub.0, q.sub.1, q.sub.2, . . . , q.sub.Q−1 denote control information, and Q denotes the amount of control information. According to the method of Table 3, the number of SC-FDMA symbols located in one subcarrier in a transmission unit is given by N.sub.symb.sup.UL-SCH=2.Math.(N.sub.symb.sup.UL−1). Parameters for rate-matching are initialized using the amount of REs and the amount of the control information. In the multiplexing method of Table 3, an operation for multiplexing is repeated H times using a parameter k. Input data is allocated in an area except for a control information mapping area. The data or control information is allocated to the control information mapping area through rate-matching. The control information mapping area is calculated by k mod N.sub.symb.sup.UL-SCH=2 or 3 or (N.sub.symb.sup.UL-SCH/2+2) or (N.sub.symb.sup.UL-SCH/2+3) operation. Here, k may be 2, 3, 8, or 9 and k may be a specific number. When control information is rate-matched, the control information is inserted between data. If the control information punctures the data, the control information can replace the data in a manner of increasing count of data by the size of control information to be inserted for replacement (in consideration of a modulation order). In this embodiment, the multiplexing method is expressed in a symbol unit and may be applied considering bits and a modulation order.

(80) Hereinafter, an embodiment of applying the method of FIG. 8 to 3GPP TS 36.212 V8.1.0 will be described.

(81) f.sub.0, f.sub.1, f.sub.2, . . . , f.sub.G−1 denotes input data, q.sub.0, q.sub.1, q.sub.2, . . . , q.sub.Q−1 denotes inserted (rate-matching scheme) input control information, s.sub.0, s.sub.1, s.sub.2, . . . , s.sub.S−1 denotes punctured input control information, g.sub.0, g.sub.1, g.sub.2, . . . , g.sub.H′−1 denotes a multiplexed output. Here, H′=G′+Q′. N.sub.symb.sup.PUSCH=(2.Math.(N.sub.symb.sup.UL−1)−N.sub.SRS) denotes the number of SC-FDMA symbols per subframe for PUSCH transmission. The number of modulation symbols per SC-FDMA symbol for PUSCH transmission is set to Rmux=H′/N.sub.symb.sup.PUSCH. The number of available symbols per SC-FDMA symbol for PUSCH transmission is set to R′mux=Rmux . . . ┌Q′/N.sub.symb.sup.PUSCH┐. The number of SC-FDMA symbols including punctured control information is given as follows.

(82) $N_{\mathrm{symb}}^{\mathrm{nec}}=\{\begin{array}{c}0\mathrm{if}{S}^{\prime }=0\\ 0\mathrm{if}0<.Math.S^{\prime }/R_{m\mathrm{ux}}^{\prime }.Math.\le 4\\ 4\mathrm{if}4<.Math.S^{\prime }/R_{m\mathrm{ux}}^{\prime }.Math.\le 8\\ 8\mathrm{if}.Math.S^{\prime }/R_{m\mathrm{ux}}^{\prime }.Math.>8\end{array}$

(83) Therefore, the number of SC-FDMA symbols including punctured control information is given as follows.

(84) N.sub.symb.sup.ULcontrol=N.sub.symb.sup.nec+N.sub.symb.sup.comp

(85) Table 4 illustrates parameters indicating puncturing locations of control information for puncturing.

(86) TABLE-US-00004 TABLE 4 es ei ep em Rmux − R′ R′ mux R′ mux ┌(S′ − N.sub.symb.sup.nec * R′ mux)/N.sub.symb.sup.comp┐ mux

(87) n1.sub.i denotes the number of control information modulation symbols (for puncturing) within an i-th SC-FDMA symbol transmitting a PUSCH within a subframe, and n2i denotes control information modulation locations (for puncturing) within an i-th SC-FDMA. symbol transmitting a PUSCH within a subframe.

(88) The number of control modulation symbols mapped to respective SC-FDMA symbols transmitting a PUSCH for a subframe having a normal CP is illustrated in Table 5 to Table 13.

(89) Table 5 illustrates n1.sub.i and n2.sub.i when N.sub.symb.sup.ULcontrol=4 in a normal CP subframe without an SRS.

(90) Table 6 illustrates n1.sub.i and n2i when N.sub.symb.sup.ULcontrol=4 in a normal CP subframe with an SRS in the last symbol.

(91) Table 7 illustrates n1.sub.i and n2i when N.sub.symb.sup.ULcontrol=4 in a normal CP subframe with an SRS in the first symbol.

(92) Table 8 illustrates n1.sub.i and n2.sub.i when N.sub.symb.sup.ULcontrol=8 in a normal CP subframe without an SRS.

(93) Table 9 illustrates n1.sub.i and n2.sub.i when N.sub.symb.sup.ULcontrol=8 in a normal CP subframe with an SRS in the last symbol.

(94) Table 10 illustrates n1.sub.i and n2.sub.i when N.sub.symb.sup.ULcontrol=8 in a normal CP subframe with an SRS in the first symbol.

(95) Table 11 illustrates n1.sub.i and n2.sub.i when N.sub.symb.sup.ULcontrol=N.sub.symb.sup.PUSCH in a normal CP subframe without an SRS.

(96) Table 12 illustrates n1.sub.i and n2.sub.i when N.sub.symb.sup.ULcontrol=N.sub.symb.sup.PUSCH in a normal CP subframe with an SRS in the last symbol.

(97) Table 13 illustrates n1.sub.i and n2.sub.i when N.sub.symb.sup.ULcontrol=N.sub.symb.sup.PUSCH in a normal CP subframe with an SRS in the first symbol.

(98) TABLE-US-00005 TABLE 5 i 0 1 2 3 4 5 6 7 8 9 10 11 n1 0 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ 0 0 n2 0 0 0 0 0 0 0 0 0 0 0 0

(99) TABLE-US-00006 TABLE 6 i 0 1 2 3 4 5 6 7 8 9 10 n1 0 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ 0 n2 0 0 0 0 0 0 0 0 0 0 0

(100) TABLE-US-00007 TABLE 7 i 0 1 2 3 4 5 6 7 8 9 10 n1 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ 0 0 n2 0 0 0 0 0 0 0 0 0 0 0

(101) TABLE-US-00008 TABLE 8 I 0 1 2 3 4 5 N1 0 └┌(S′-4*R′mux)/ R′mux R′mux ┌┌(S′-4*R′mux)/ 0 2┐/2┘ 2┐/2┐ N2 0 0 1 1 0 0 I 6 7 8 9 10 11 N1 0 ┌└(S′-4*R′mux)/ R′mux R′mux └└(S′-4*R′mux)/ 0 2┘/2┐ 2┘/2┘ N2 0 0 1 1 0 0

(102) TABLE-US-00009 TABLE 9 i 0 1 2 3 4 5 N1 0 └┌(S′-4*R′mux)/ R′mux R′mux ┌┌(S′-4*R′mux)/ 0 2┐/2┘ 2┐/2┐ N2 0 0 1 1 0 0 i 6 7 8 9 10 N1 0 ┌└(S′-4*R′mux)/ R′mux R′mux └└(S′-4*R′mux)/ 2┘/2┐ 2┘/2┘ N2 0 0 1 1 0

(103) TABLE-US-00010 TABLE 10 I 0 1 2 3 4 N1 └┌(S′-4*R′mux)/ R′mux R′mux ┌┌(S′-4*R′mux)/ 0 2┐/2┘ 2┐/2┐ N2 0 1 1 0 0 I 5 6 7 8 9 10 N1 0 ┌└(S′-4*R′mux)/ R′mux R′mux └└(S′-4*R′mux)/ 0 2┘/2┐ 2┘/2┘ N2 0 0 0 1 0 0

(104) TABLE-US-00011 TABLE 11 i 0 1 2 3 4 5 n1 └┌(S′ − 8 * R′mux)/2┐/2┘ R′mux R′mux R′mux R′mux ┌┌(S′ − 8 * R′mux)/2┐/2┐ n2 0 1 1 1 1 0 i 6 7 8 9 10 11 n1 ┌└(S′ − 8 * R′mux)/2┘/2┐ R′mux R′mux R′mux R′mux └└(S′ − 8 * R′mux)/2┘/2┘ n2 0 1 1 1 1 0

(105) TABLE-US-00012 TABLE 12 I 0 1 2 3 4 5 n1 └(S′ − 8 * R′mux)/3┘ R′mux R′mux R′mux R′mux ┌(S′ − 8 * R′mux)/3┐ n2 0 1 1 1 1 0 I 6 7 8 9 10 n1 └(S′ − 8 * R′mux)/3 + 0.5┘ R′mux R′mux R′mux R′mux n2 0 1 1 1 1

(106) TABLE-US-00013 TABLE 13 I 0 1 2 3 4 n1 R′mux R′mux R′mux R′mux ┌(S′ − 8 * R′mux)/3┐ n2 1 1 1 1 0 i 5 6 7 8 9 10 ni └(S′ − 8 * R′mux)/3 + 0.5┘ R′mux R′mux R′mux R′mux └(S′ − 8 * R′mux)/3┘ n2 0 1 1 1 1 0

(107) The number of control modulation symbols mapped to respective SC-FDMA symbols transmitting a PUSCH for a subframe having an extended CP is illustrated in Table 14 to Table 22.

(108) Table 14 illustrates n1.sub.i and n2.sub.i when N.sub.symb.sup.ULcontrol=4 in an extended CP subframe without an SRS.

(109) Table 15 illustrates n1.sub.i and n2.sub.i when N.sub.symb.sup.ULcontrol=4 in an extended CP subframe with an SRS in the last symbol.

(110) Table 16 illustrates n1.sub.i and n2i when N.sub.symb.sup.ULcontrol=4 in an extended CP subframe with an SRS in the first symbol.

(111) Table 17 illustrates n1.sub.i and n2.sub.i when N.sub.symb.sup.ULcontrol=8 in an extended CP subframe without an SRS.

(112) Table 18 illustrates n1.sub.i and n2.sub.i when N.sub.symb.sup.ULcontrol=8 in an extended CP subframe with an SRS in the last symbol.

(113) Table 19 illustrates n1.sub.i and n2i when N.sub.symb.sup.ULcontrol=8 in an extended CP subframe with an SRS in the first symbol.

(114) Table 20 illustrates 1.sub.i and n2i when N.sub.symb.sup.ULcontrol=N.sub.symb.sup.PUSCH in an extended CP subframe without an SRS,

(115) Table 21 illustrates 1.sub.i and n2i when N.sub.symb.sup.ULcontrol=N.sub.symb.sup.PUSCH in an extended CP subframe with an SRS in the last symbol.

(116) Table 22 illustrates 1.sub.i and n2i when N.sub.symb.sup.ULcontrol=N.sub.symb.sup.PUSCH in an extended CP subframe with an SRS in the first symbol.

(117) TABLE-US-00014 TABLE 14 i 0 1 2 3 4 5 6 7 8 9 n1 0 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ 0 n2 0 0 0 0 0 0 0 0 0 0

(118) TABLE-US-00015 TABLE 15 i 0 1 2 3 4 5 6 7 8 n1 0 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ n2 0 0 0 0 0 0 0 0 0

(119) TABLE-US-00016 TABLE 16 i 0 1 2 3 4 5 6 7 8 n1 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ 0 n2 0 0 0 0 0 0 0 0 0

(120) TABLE-US-00017 TABLE 17 i 0 1 2 3 4 n1 0 └┌(S′ − 4 * R′ mux)/ R′ mux R′ mux ┌┌(S′ − 4 * R′ mux)/ 2┐/2┘ 2┐/2┐ n2 0 0 1 1 0 i 5 6 7 8 9 n1 0 ┌└(S′ − 4 * R′ mux)/ R′ mux R′ mux ┌┌(S′ − 4 * R′ mux)/ 2┐/2┘ 2┐/2┐ n2 0 0 1 1 0

(121) TABLE-US-00018 TABLE 18 i 0 1 2 3 4 n1 0 └┌(S′ − 4 * R′ mux)/2┐/ R′ mux R′ mux ┌┌S′ − 4 * R′ mux)/ 2┘ 2┐/2┐ n2 0 0 1 1 0 i 5 6 7 8 n1 └└(S′ − 4 * R′ mux)/2┘/ ┌└(S′ − 4 * R′ mux)/2┘/2┐ R′ mux R′ mux 2┘ n2 0 0 1 1

(122) TABLE-US-00019 TABLE 19 i 0 1 2 3 n1 └┌(S′ − 4 * R′ mux)/2┐/ R′ mux R′ mux ┌┌(S′ − 4 * R′ mux/2┐/2┐ 2┘ n2 0 1 1 0 i 4 5 6 7 8 n1 0 ┌└(S′ − 4 * R′ mux)/2┘/ R′ mux R′ mux └└(S′ − 4 * R′ mux)/ 2┐ 2┘/2┘ n2 0 0 1 1 0

(123) TABLE-US-00020 TABLE 20 i 0 1 2 3 4 n1 └(S′ − 8 * R′ mux)/2┘ R′ mux R′ mux R′ mux R′ mux n2 0 1 1 1 1 i 5 6 7 8 9 n1 ┌(S′ − 8 * R′ mux)/2┐ R′ mux R′ mux R′ mux R′ mux n2 0 1 1 1 1

(124) TABLE-US-00021 TABLE 21 i 0 1 2 3 4 5 6 7 8 n1 S′ − 8 * R′mux R′mux R′mux R′mux R′mux R′mux R′max R′mux R′mux n2 0 I 1 1 1 1 1 1 1

(125) TABLE-US-00022 TABLE 22 i 0 1 2 3 4 5 6 7 8 n1 R′mux R′mux R′mux R′mux S′ − 8 * R′mux R′mux R′mux R′mux R′mux n2 1 1 1 1 0 1 1 1 1

(126) The control information and data may be multiplexed as follows.

(127) TABLE-US-00023 Set i to 0 Set temp to S' Set e to ei for (m = 0; m < Rmux ; m++)  if (m < es)   for (i = 0; i < N.sub.symb.sup.PUSCH ; i++)    if (temp > 0)     insert control information (insert)     increase control information (insert) index     temp--    else     insert data     increase data index    end if    increase output index   end for  else   e = e − em   if (e <= 0)    for (i = 0; i < N.sub.symb.sup.PUSCH ; i++)     if (n1[i] > 0)      puncture data      increase control information (puncturing) index      increase data index      n1[i]--     else      insert data      increase data index     end if     increase output index    end for    e = e + ep   else    for (i = 0; i < N.sub.symb.sup.PUSCH ; i++)     if (n2[i] == 1)      puncture data      increase control information (puncturing) index      increase data index      n1[i]--     else      insert data      increase data index     end if     increase output index    end for   end if  end if end for

(128) Hereinafter, an embodiment of applying the method of FIG. 9 to 3GPP TS 36.212 V8.1.0 will be described.

(129) f.sub.0, f.sub.1, f.sub.2, . . . , f.sub.G−1 denotes input data, q.sub.0, q.sub.1, q.sub.2, . . . , q.sub.Q−1 denotes inserted (rate-matching scheme) input control information, s.sub.0, s.sub.1, s.sub.2, . . . , s.sub.S−1 denotes punctured input control information, g.sub.0, g.sub.1l, g.sub.2, . . . , g.sub.H−1 denotes a multiplexed output. Here, H′=G′+Q′. N.sub.symb.sup.PUSCH=(2∩(N.sub.symb.sup.UL−1)−N.sub.SRS) denotes the number of SC-FDMA symbols per subframe for PUSCH transmission. The number of modulation symbols per SC-FDMA symbol for PUSCH transmission is set to R.sub.mux=H′/N.sub.symb.sup.PUSCH.

(130) The number of SC-FDMA symbols including inserted control information is given as follows.

(131) $N_{\mathrm{symb}}^{\mathrm{UL}\mathrm{control}1}=\{\begin{array}{c}0\mathrm{if}{Q}^{\prime }=0\\ 4\mathrm{if}0<.Math.Q^{\prime }/R_{m\mathrm{ux}}.Math.\le 4\\ 8\mathrm{if}4<.Math.Q^{\prime }/R_{\mathrm{mux}}.Math.\le 8\\ N_{\mathrm{symb}}^{\mathrm{PUSCH}}\mathrm{if}.Math.Q^{\prime }/R_{m\mathrm{ux}}.Math.>8\end{array}$

(132) The number of SC-FDMA symbols including inserted and punctured control information is given as follows.

(133) $N_{\mathrm{symb}}^{\mathrm{UL}\mathrm{control}2}=\{\begin{array}{c}0\mathrm{if}\left(Q^{\prime }+S^{\prime }\right)=0\\ 4\mathrm{if}0<.Math.\left(Q^{\prime }+S^{\prime }\right)/R_{m\mathrm{ux}}.Math.\le 4\\ 8\mathrm{if}4<.Math.\left(Q^{\prime }+S^{\prime }\right)/R_{m\mathrm{ux}}.Math.\le 8\\ N_{\mathrm{symb}}^{\mathrm{PUSCH}}\mathrm{if}.Math.\left(Q^{\prime }+S^{\prime }\right)Q^{\prime }/R_{m\mathrm{ux}}.Math.>8\end{array}$

(134) The number of SC-FDMA. symbols including punctured control information is given as follows.

(135) $N_{\mathrm{symb}}^{\mathrm{nec}}=\{\begin{array}{c}0\mathrm{if}\left(Q^{\prime }+S^{\prime }\right)=0\\ 0\mathrm{if}0<.Math.\left(Q^{\prime }+S^{\prime }\right)/R_{m\mathrm{ux}}.Math.\le 4\\ 4\mathrm{if}4<.Math.\left(Q^{\prime }+S^{\prime }\right)/R_{\mathrm{mux}}.Math.\le 8\\ 8\mathrm{if}.Math.\left(Q^{\prime }+S^{\prime }\right)/R_{\mathrm{mux}}.Math.>8\end{array}$

(136) The number of SC-FDMA symbols including punctured control information may additionally be given as follows.

(137) $N_{\mathrm{symb}}^{\mathrm{comp}}=\{\begin{array}{c}0\mathrm{if}\left(Q^{\prime }+S^{\prime }\right)=0\\ 4\mathrm{if}0<.Math.\left(Q^{\prime }+S^{\prime }\right)/R_{m\mathrm{ux}}.Math.\le 4\\ 4\mathrm{if}4<.Math.\left(Q^{\prime }+S^{\prime }\right)/R_{\mathrm{mux}}.Math.\le 8\\ N_{\mathrm{symb}}^{\mathrm{PUSCH}}-N_{\mathrm{symb}}^{\mathrm{nec}}\mathrm{if}.Math.\left(Q^{\prime }+S^{\prime }\right)/R_{m\mathrm{ux}}.Math.>8\end{array}$

(138) Table 23 illustrates parameters indicating puncturing locations of control information for puncturing.

(139) TABLE-US-00024 TABLE 23 es ei ep └(Q′ − N.sub.symb.sup.nec * R.sub.mux)/N.sub.symb.sup.comp┘ R.sub.mux − es R.sub.mux − es

(140) n1.sub.i denotes the number of control information modulation symbols (for insertion) within an i-th SC-FDMA symbol transmitting a PUSCH within a subframe.

(141) The number of control modulation symbols mapped to respective SC-FDMA symbols transmitting a PUSCH for a subframe having a normal CP is illustrated in Table 24 to Table 32.

(142) Table 24 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=4 in a normal CP subframe without an SRS.

(143) Table 25 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=4 in a normal CP subframe with an SRS in the last symbol.

(144) Table 26 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=4 in a normal CP subframe with an SRS in the first symbol.

(145) Table 27 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=8 in a normal CP subframe without an SRS.

(146) Table 28 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=8 in a normal CP subframe with an SRS in the last symbol.

(147) Table 29 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=8 in a normal CP subframe with an SRS in the first symbol.

(148) Table 30 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol=N.sub.symb.sup.PUSCH in a normal CP subframe without an SRS.

(149) Table 31 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol=N.sub.symb.sup.PUSCH in a normal CP subframe with an SRS in the last symbol.

(150) Table 32 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol=N.sub.symb.sup.PUSCH in a normal CP subframe with an SRS in the first symbol.

(151) TABLE-US-00025 TABLE 24 i 0 1 2 3 4 5 6 7 8 9 10 11 n1 0 0 ┌└Q′/2┘/2┐ └└Q′/2┘/2┘ 0 0 0 0 └┌Q′/2┐/2┘ ┌┌Q′/2┐/2┐ 0 0

(152) TABLE-US-00026 TABLE 25 i 0 1 2 3 4 5 6 7 8 9 10 n1 0 0 ┌└Q′/2┘/2┐ └└Q′/2┘/2┘ 0 0 0 0 └┌Q′/2┐/2┘ ┌┌Q′/2┐/2┐ 0

(153) TABLE-US-00027 TABLE 26 i 0 1 2 3 4 5 6 7 8 9 10 n1 0 ┌└Q′/2┘/2┐ └└Q′/2┘/2┘ 0 0 0 0 └┌Q′/2┐/2┘ ┌┌Q′/2┐/2┐ 0 0

(154) TABLE-US-00028 TABLE 27 i 0 1 2 3 4 5 n1 0 ┌└(Q′ − 4 * Rmux)/2┘/2┐ Rmux Rmux └└(Q′ − 4 * Rmux)/2┘/2┘ 0 i 6 7 8 9 10 11 n1 0 └┌(Q′ − 4 * Rmux)/2┐/2┘ Rmux Rmux ┌┌(Q′ − 4 * Rmux)/2┐/2┐ 0

(155) TABLE-US-00029 TABLE 28 i 0 1 2 3 4 5 n1 0 ┌└(Q′ − 4 * Rmux)/ Rmux Rmux └└(Q′ − 4 * Rmux)/ 0 2┘/2┐ 2┘/2┘ i 6 7 8 9 10 n1 0 └┌(Q′ − 4 * Rmux)/ Rmux Rmux ┌┌(Q′ − 4 * Rmux)/ 2┐/2┘ 2┐/2┐

(156) TABLE-US-00030 TABLE 29 i 0 1 2 3 4 n1 ┌└(Q′ − 4 * Rmux Rmux └└(Q′ − 4 * 0 Rmux)/2┘/2┐ Rmux)/2┘/2┘ i 5 6 7 8 9 10 n1 0 └┌(Q′ − 4 * Rmux Rmux ┌┌(Q′ − 4 * 0 Rmux)/2┐/2┘ Rmux)/2┐/2┐

(157) TABLE-US-00031 TABLE 30 i 0 1 2 3 4 5 n1 ┌└(Q′ − 8 * Rmux Rmux Rmux Rmux └└(Q′ − 8 * Rmux)/2┘/2┘ Rmux)/2┘/2┐ i 6 7 8 9 10 11 n1 └┌(Q′ − 8 * Rmux Rmux Rmux Rmux ┌┌(Q′ − 8 * Rmux)/2┐/2┐ Rmux)/2┐/2┘

(158) TABLE-US-00032 TABLE 31 i 0 1 2 3 4 5 n1 ┌(Q′ − 8 * Rmux Rmux Rmux Rmux └(Q′ − 8 * Rmux)/3┘ Rmux)/3┐ i 6 7 8 9 10 n1 └(Q′ − 8 * Rmux Rmux Rmux Rmux Rmux)/3 + 0.5┘

(159) TABLE-US-00033 TABLE 32 i 0 1 2 3 4 n1 Rmux Rmux Rmux Rmux └(Q′ − 8 * Rmux)/3┘ i 5 6 7 8 9 10 n1 └(Q′ − 8 * Rmux Rmux Rmux Rmux ┌(Q′ − 8 * Rmux)/3┐ Rmux)/3 + 0.5┘

(160) The number of control modulation symbols mapped to respective SC-FDMA symbols transmitting a PUSCH for a subframe having an extended CP is illustrated in Table 33 to Table 41.

(161) Table 33 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=4 in an extended CP subframe without an SRS.

(162) Table 34 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=4 in an extended CP subframe with an SRS in the last symbol.

(163) Table 35 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=4 in an extended CP subframe with an SRS in the first symbol.

(164) Table 36 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=8 in an extended CP subframe without an SRS.

(165) Table 37 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=8 in an extended CP subframe with an SRS in the last symbol.

(166) Table 38 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=8 in an extended CP subframe with an SRS in the first symbol.

(167) Table 39 illustrates n1.sub.i when N.sub.symb.sup.ULcontrol1=N.sub.symb.sup.PUSCH in an extended CP subframe without an SRS.

(168) Table 40 illustrates 1.sub.i when N.sub.symb.sup.ULcontrol1=N.sub.symb.sup.PUSCH in an extended CP subframe with an SRS in the last symbol.

(169) Table 41 illustrates 1.sub.i when N.sub.symb.sup.ULcontrol1=N.sub.symb.sup.PUSCH in an extended CP subframe with an SRS in the first symbol.

(170) TABLE-US-00034 TABLE 33 i 0 1 2 3 4 5 6 7 8 9 n1 0 0 ┌└Q′/2┘/2┐ └└Q′/2┘/2┘ 0 0 0 └┌Q′/2┐/2┘ ┌┌Q′/2┐/2┐ 0

(171) TABLE-US-00035 TABLE 34 i 0 1 2 3 4 5 6 7 8 n1 0 0 ┌└Q′/2┘/2┐ └└Q′/2┘/2┘ 0 0 0 └┌Q′/2┐/2┘ ┌┌Q′/2┐/2┐

(172) TABLE-US-00036 TABLE 35 i 0 1 2 3 4 5 6 7 8 n1 0 ┌└Q′/2┘/2┐ └└Q′/2┘/2┘ 0 0 0 └┌Q′/2┐/2┘ ┌┌Q′/2┐/2┐ 0

(173) TABLE-US-00037 TABLE 36 i 0 1 2 3 4 n1 0 ┌└(Q′ − 4 * Rmux)/2┘/ Rmux Rmux └└Q′ − 4 * Rmux)/ 2┐ 2┘/2┘ i 5 6 7 8 9 n1 0 └┌(Q′ − 4 * Rmux)/2┐/ Rmux Rmux ┌┌(Q′ − 4 * Rmux)/ 2┘ 2┐/2┐

(174) TABLE-US-00038 TABLE 37 i 0 1 2 3 4 n1 0 ┌└(Q′ − 4 * Rmux)/2┘/ Rmux Rmux └└(Q′ − 4 * Rmux)/ 2┐ 2┘/┘2 i 5 6 7 8 n1 ┌┌(Q′ − 4 * Rmux)/2┐/ └┌(Q′ − 4 * Rmux)/2┐/2┘ Rmux Rmux 2┐

(175) TABLE-US-00039 TABLE 38 i 0 1 2 3 n1 ┌└(Q′ − 4 * Rmux)/2┘/ Rmux Rmux └└(Q′ − 4 * Rmux)/2┘/2┘ 2┐ i 4 5 6 7 8 n1 0 └┌(Q′ − 4 * Rmux)/2┐/ Rmux Rmux ┌┌(Q′ − 4 * Rmux)/ 2┘ 2┐/2┐

(176) TABLE-US-00040 TABLE 39 i 0 1 2 3 4 n1 ┌(Q′ − 8 * Rmux)/2┐ Rmux Rmux Rmux Rmux i 5 6 7 8 9 n1 └(Q′ − 8 * Rmux)/2┘ Rmux Rmux Rmux Rmux

(177) TABLE-US-00041 TABLE 40 i 0 1 2 3 4 5 6 7 8 n1 Q′ − 8 * Rmux Rmux Rmux Rmux Rmux Rmux Rmux Rmux Rmux

(178) TABLE-US-00042 TABLE 41 i 0 1 2 3 4 5 6 7 8 n1 Rmux Rmux Rmux Rmux Q′ − 8 * Rmux Rmux Rmux Rmux Rmux

(179) n2.sub.i denotes the number of control information modulation symbols (for puncturing) within an i-th SC-FDMA. symbol transmitting a PUSCH within a subframe.

(180) n3.sub.i denotes control information location (for puncturing) within an i-th SC-FDMA symbol transmitting a PUSCH within a subframe.

(181) The number of control modulation symbols mapped to respective SC-FDMA symbols transmitting a PUSCH for a subframe having a normal CP is illustrated in Table 42 to Table 50.

(182) Table 42 illustrates 2.sub.i, n3.sub.i, and em when N.sub.symb.sup.ULcontrol2=4 in a normal CP subframe without an SRS.

(183) Table 43 illustrates n2.sub.i, n3.sub.i, and em when N.sub.symb.sup.ULcontrol2=4 in a normal CP subframe with an SRS in the last symbol.

(184) Table 44 illustrates 2.sub.i, n3.sub.i, and em when N.sub.symb.sup.ULcontrol2=4 in a normal CP subframe with an SRS in the first symbol.

(185) Table 45 illustrates 2.sub.i, n3.sub.i, and em when N.sub.symb.sup.ULcontrol2=8 in a normal CP subframe without an SRS.

(186) Table 46 illustrates 2.sub.i, n3.sub.i, and em when N.sub.symb.sup.ULcontrol2=8 in a normal CP subframe with an SRS in the last symbol.

(187) Table 47 illustrates 2.sub.i, n3.sub.i, and em when N.sub.symb.sup.ULcontrol2=8 in a normal CP subframe with an SRS in the first symbol.

(188) Table 48 illustrates n2.sub.in3.sub.i, and em when N.sub.symb.sup.ULcontrol2=N.sub.symb.sup.PUSCH in a normal CP subframe without an SRS.

(189) Table 49 illustrates 2.sub.in3.sub.i, and em when N.sub.symb.sup.ULcontrol2=N.sub.symb.sup.PUSCH in a normal CP subframe with an SRS in the last symbol.

(190) Table 50 illustrates 2.sub.in3.sub.i, and em when N.sub.symb.sup.ULcontrol2=N.sub.symb.sup.PUSCH in a normal CP subframe with an SRS in the first symbol.

(191) TABLE-US-00043 TABLE 42 i 0 1 2 3 4 5 6 7 8 9 10 11 n2 0 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ 0 0 n3 0 0 0 0 0 0 0 0 0 0 0 0 em ┌S′/4┐

(192) TABLE-US-00044 TABLE 43 i 0 1 2 3 4 5 6 7 8 9 10 n2 0 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ 0 n3 0 0 0 0 0 0 0 0 0 0 0 em ┌S′/4┐

(193) TABLE-US-00045 TABLE 44 i 0 1 2 3 4 5 6 7 8 9 10 n2 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ 0 0 n3 0 0 0 0 0 0 0 0 0 0 0 em ┌S′/4┐

(194) TABLE-US-00046 TABLE 45 i 0 1 2 3 4 5 n2 0 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ 0 n3 0 0 1 1 0 0 i 6 7 8 9 10 11 n2 0 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ 0 n3 0 0 1 1 0 0 em 0$.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/4.Math.$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=2,3,8,9$

(195) TABLE-US-00047 TABLE 46 i 0 1 2 3 4 5 n2 0 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ 0 n3 0 0 1 1 0 0 i 6 7 8 9 10 n2 0 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ n3 0 0 1 1 0 em $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/4.Math.$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=2,3,8,9$

(196) TABLE-US-00048 TABLE 47 i 0 1 2 3 4 n2 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ 0 n3 0 1 1 0 0 i 5 6 7 8 9 10 n2 0 0$.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ 0 n3 0 0 1 1 0 0 em $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/4.Math.$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=1,2,7,8$

(197) TABLE-US-00049 TABLE 48 i 0 1 2 3 4 5 n2 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ n3 0 1 1 1 1 0 i 6 7 8 9 10 11 n2 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ n3 0 1 1 1 1 0 em $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/4.Math.$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=1,2,3,4,7,8,9,10$

(198) TABLE-US-00050 TABLE 49 i 0 1 2 3 4 5 n2 0$.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/3.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/3.Math.$ n3 0 1 1 1 1 0 i 6 7 8 9 10 n2 $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/3+0.5.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] n3 0 1 1 1 1 em $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/3.Math.$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=1,2,3,4,7,8,9,10$

(199) TABLE-US-00051 TABLE 50 i 0 1 2 3 4 n7 R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/3.Math.$ n3 1 1 1 1 0 i 5 6 7 8 9 10 n2 $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/3+0.5.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/3.Math.$ n3 0 1 1 1 1 0 em $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/3.Math.$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=0,1,2,3,6,7,8,9$

(200) The number of control modulation symbols mapped to respective SC-FDMA symbols transmitting a PUSCH for a subframe having an extended CP is illustrated in Table 51 to Table 59.

(201) Table 51 illustrates n2.sub.i n3i, and em when N.sub.symb.sup.ULcontrol2=4 in an extended CP subframe without an SRS.

(202) Table 52 illustrates n2.sub.i n3i, and em when N.sub.symb.sup.ULcontrol2=4 in an extended CP subframe with an SRS in the last symbol.

(203) Table 53 illustrates n2.sub.i n3i, and em when N.sub.symb.sup.ULcontrol2=4 in an extended CP subframe with an SRS in the first symbol.

(204) Table 54 illustrates n2.sub.i n3i, and em when N.sub.symb.sup.ULcontrol2=8 in an extended CP subframe without an SRS.

(205) Table 55 illustrates n2.sub.i n3i, and em when N.sub.symb.sup.ULcontrol2=8 in an extended CP subframe with an SRS in the last symbol.

(206) Table 56 illustrates n2.sub.i n3i, and em when N.sub.symb.sup.ULcontrol2=4 in an extended CP subframe with an SRS in the first symbol.

(207) Table 57 illustrates n2.sub.i n3i, and em when N.sub.symb.sup.ULcontrol2=N.sub.symb.sup.PUSCH in an extended CP subframe without an SRS.

(208) Table 58 illustrates 2.sub.i n3i, and em when N.sub.symb.sup.ULcontrol2=N.sub.symb.sup.PUSCH in an extended CP subframe with an SRS in. the last symbol.

(209) Table 59 illustrates 2.sub.i n3i, and em when N.sub.symb.sup.ULcontrol2=N.sub.symb.sup.PUSCH in an extended CP subframe with an SRS in the first symbol.

(210) TABLE-US-00052 TABLE 51 i 0 1 2 3 4 5 6 7 8 9 n2 0 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ 0 n3 0 0 0 0 0 0 0 0 0 0 em ┌S′/4┐

(211) TABLE-US-00053 TABLE 52 i 0 1 2 3 4 5 6 7 8 n2 0 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ n3 0 0 0 0 0 0 0 0 0 em ┌S′/4┐

(212) TABLE-US-00054 TABLE 53 i 0 1 2 3 4 5 6 7 8 n2 0 └┌S′/2┐/2┘ ┌┌S′/2┐/2┐ 0 0 0 ┌└S′/2┘/2┐ └└S′/2┘/2┘ 0 n3 0 0 0 0 0 0 0 0 0 em ┌S′/4┐

(213) TABLE-US-00055 TABLE 54 i 0 1 2 3 4 n2 0 0$.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ n3 0 0 1 1 0 i 5 6 7 8 9 n2 0 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ n3 0 0 1 1 0 em $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/4.Math.$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=2,3,8,9$

(214) TABLE-US-00056 TABLE 55 i 0 1 2 3 4 n2 0 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ n3 0 0 1 1 0 i 5 6 7 8 n2 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] n3 0 0 1 1 em 0$.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/4.Math.$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=2,3,7,8$

(215) TABLE-US-00057 TABLE 56 i 0 1 2 3 n2 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ n3 0 1 1 0 i 4 5 6 7 8 n2 0 $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] $.Math..Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math./2.Math.$ n3 0 0 1 1 0 em $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/4.Math.$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=1,2,6,7$

(216) TABLE-US-00058 TABLE 57 i 0 1 2 3 4 n2 $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] n3 0 1 1 1 1 i 5 6 7 8 9 n2 $.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math.$ R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] n3 0 1 1 1 1 em 0$.Math.\left(S^{\prime }-\underset{j}{.Math.}n2\left[j\right]\right)/2.Math.$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=1,2,3,4,6,7,8,9$

(217) TABLE-US-00059 TABLE 58 i 0 1 2 3 4 5 6 7 8 n2 $S^{\prime }-\underset{j}{.Math.}n2\left[j\right]$ R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] n3 0 1 1 1 1 1 1 1 1 em $S^{\prime }-\underset{j}{.Math.}n2\left[j\right]$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=1,2,3,4,5,6,7,8$

(218) TABLE-US-00060 TABLE 59 i 0 1 2 3 4 5 6 7 8 n2 R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] $S^{\prime }-\underset{j}{.Math.}n2\left[j\right]$ R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] R.sub.max − n1[i] n3 1 1 1 1 0 1 1 1 1 em $S^{\prime }-\underset{j}{.Math.}n2\left[j\right]$ $\underset{j}{.Math.}n2\left[j\right],\mathrm{where}j=0,1,2,3,5,6,7,8$

(219) The control information and data may be multiplexed as follows.

(220) TABLE-US-00061  Set i to 0  Set e to ei  for (m = 0; m < Rmux ; m++)   if (m < es)    for (i = 0; i < N.sub.symb.sup.PUSCH ; i++)      if (n1[i] > 0)      insert control information (insert)      increase control information (insert) index      n1[i]--     else      insert data      increase data index     end if     increase output index    end for   else    e = e − em    if (e <= 0)     for (i = 0; i < N.sub.symb.sup.PUSCH ; i++)      if (n1[i] > 0)       insert control information (insert)       increase control information (insert) index       n1[i]--      els if (n3[i] > 0)       puncture data       increase control information (puncturing) index       increase data index       n3[i]--;      else       insert data       increase data index      end if      increase output index     end for     e = e + ep    else     for (i = 0; i < N.sub.symb.sup.PUSCH ; i++)      if (n1[i] > 0)       insert control information (insert)       increase control information (insert) index       n1[i]--      els if (n4[i] == 1)       puncture data       increase control information (puncturing) index       increase data index       n3[i]--      else       insert data       increase data index      end if      increase output index     end for    end if   end if end for

(221) Although the above-described exemplary embodiments of the present invention may be used to a UL-SCH of 3GPP, it should be noted that the present invention is not limited thereto.

(222) The exemplary embodiments described hereinabove are combinations of elements and features of the present invention. The elements or features may be considered selective unless otherwise mentioned. Each element or feature may be practiced without being combined with other elements or features. Further, the embodiments of the present invention may be constructed by combining parts of the elements and/or features. Operation orders described in the embodiments of the present invention may be rearranged. Some constructions of any one embodiment may be included in another embodiment and may be replaced with corresponding constructions of another embodiment. It is apparent that the present invention may be embodied by a combination of claims which do not have an explicit cited relation in the appended claims or may include new claims by amendment after application,

(223) The embodiments of the present invention may be achieved by various means, for example, hardware, firmware, software, or a combination thereof. In a hardware configuration, the embodiments of the present invention may be achieved by one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, microcontrollers, microprocessors, etc.

(224) In a firmware or software configuration, the embodiments of the present invention may be achieved by a module, a procedure, a function, etc. performing the above-described functions or operations. A software code may be stored in a memory unit and driven by a processor. The memory unit is located at the interior or exterior of the processor and may transmit data to and receive data from the processor via various known means.

(225) It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention cover the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents.

(226) The present invention may be applied to a user equipment, a base station, and other devices of a wireless mobile communication system.