Method for multiplexing data and control information
09775136 · 2017-09-26
Assignee
Inventors
Cpc classification
H04L5/0007
ELECTRICITY
H04L5/0053
ELECTRICITY
H04L5/0044
ELECTRICITY
H04W72/20
ELECTRICITY
International classification
Abstract
A method for multiplexing a data information stream, including a systematic symbol and a non-systematic symbol, and a control information stream of at least three types in a wireless mobile communication system is disclosed. The method includes mapping the data information stream to a resource area so that the systematic symbol is not mapped to a specific resource area to which the control information stream is mapped, and mapping the control information stream to the specific resource area.
Claims
1. A method of transmitting an uplink signal in a wireless communication system, the method comprising: multiplexing data and rank information (RI); and transmitting the uplink signal through a plurality of Single Carrier Frequency Division Multiple Access (SC-FDMA) symbols, the uplink signal including the multiplexed data and the RI, wherein the plurality of SC-FDMA symbols includes an SC-FDMA symbol for reference signal, and a first set of two SC-FDMA symbols for the RI, and wherein each SC-FDMA symbol of the first set of two SC-FDMA symbols for the RI is separated from the SC-FDMA symbol for the reference signal by a respective single SC-FDMA symbol.
2. The method of claim 1, wherein each of the respective single SC-FDMA symbols are contiguous with the SC-FDMA symbol for the reference signal and comprise a second set of two SC-FDMA symbols reserved for first control information different from the RI.
3. The method of claim 2, wherein, if the uplink signal further includes the first control information, the data on the second set of two SC-FDMA symbols is punctured by the first control information.
4. The method of claim 1, wherein the SC-FDMA symbol for the reference signal includes 4.sup.th SC-FDMA symbol in the subframe.
5. The method of claim 4, wherein the first set of two SC-FDMA symbols for the RI includes 2.sup.nd and 6.sup.th SC-FDMA symbols in the subframe.
6. The method of claim 1, wherein the uplink signal is transmitted through a Physical Uplink Shared Channel (PUSCH).
7. An apparatus for use in a wireless communication system, the apparatus comprising: a device configured to multiplex data and rank information (RI); and a device configured to transmit an uplink signal including the multiplexed data and RI via a plurality of Single Carrier Frequency Division Multiple Access (SC-FDMA) symbols in a subframe, wherein the plurality of SC-FDMA symbols includes an SC-FDMA symbol for reference signal, and a first set of two SC-FDMA symbols for the RI, and wherein each SC-FDMA symbol of the first set of two SC-FDMA symbols for the RI is separated from the SC-FDMA symbol for the reference signal by a respective single SC-FDMA symbol.
8. The apparatus of claim 7, wherein each of the respective single SC-FDMA symbols are contiguous with the SC-FDMA symbol for the reference signal and comprise a second set of two SC-FDMA symbols reserved for first control information different from the RI.
9. The apparatus of claim 8, wherein, if the uplink signal further includes the first control information, the data on the second set of two SC-FDMA symbols is punctured by the first control information.
10. The apparatus of claim 7, wherein the SC-FDMA symbol for the reference signal includes 4.sup.th SC-FDMA symbol in the subframe.
11. The apparatus of claim 10, wherein the first set of two SC-FDMA symbols for the RI includes 2.sup.nd and 6.sup.th SC-FDMA symbols in the subframe.
12. The apparatus of claim 7, wherein the uplink signal is transmitted through a Physical Uplink Shared Channel (PUSCH).
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)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)
DETAILED DESCRIPTION OF THE INVENTION
(17) 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.
(18) 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.
(19) Exemplary embodiments described hereinbelow may be used for processing of a transport channel, especially a UL-SCH, of the 3GPP.
(20) 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 any type of control information fails in transmission. 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 s as not to be overwritten by control information of a less important type.
(21) 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 HARQ response. The control information 2 may puncture the data information or the control information 1 for multiplexing. Control information 3 may be a rank indication or rank information (RI) indicating the number of transport streams. The control information 3 may puncture the data information or the control information 1 or may rate-match with the data information and/or the control information 1, for multiplexing.
(22) 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.
(23) 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.
(24) The term ‘rate matching’ refers to adjusting a code rate of data information. When data information or control information is multiplexed, the location of each information may be changed but contents of information are not influenced. ‘Rate matching’ of control information 1 and data information represents that the amount of adding 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.
(25) If a transport block is segmented into multiple code blocks for transmission, a receiving side can sequentially decode the code blocks from a code block No. 0. At this time, if the code blocks are punctured using control information from the last code block of data information, an error may occur only in the last code block due to transmission environments and a code rate. Then error detection is delayed and considerable power is consumed in decoding the code blocks. If control information which punctures data is present, since puncturing is performed beginning from the front code block, an early stop is possible in a decoding process.
(26) Multiple code blocks generated from the code block segmentation block of
(27) In the exemplary embodiments of
(28)
(29) A set of resource elements shown in
(30) For the following description, a subcarrier located in the first row from the top in the whole area of a set of resource elements is defined as ‘subcarrier 0’, and a subcarrier located in the last row is defined as ‘subcarrier R-1’. That is, the first subcarrier in a transmission band is defined as ‘subcarrier 0’, and the next subcarriers are sequentially defined as ‘subcarrier 1’, ‘subcarrier 2’, and the like. The last subcarrier is defined as ‘subcarrier R-1’.
(31)
(32) Referring to
(33) 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.
(34) Referring to
(35) Referring to
(36) RS symbol periods shown in
(37) The RS symbol period area, the first symbol period area, and the second symbol period area may be regarded as the area A.
(38) The term ‘forward mapping order’ is used in relation to the area A. Being mapped in the forward mapping order from a specific resource element in the area A refers to a 2-dimensional mapping method in which, within the area A, mapping is performed from a subcarrier to which a specific resource element belongs in a downward direction, and, within each subcarrier, mapping is performed according to time flow, that is, from a left column to a right column. For example, mapping in the forward mapping order from the first resource element of the whole area depicted in
(39) Although a set of resource elements shown in
Embodiment 1
(40)
(41) Referring to
(42) The control information 1 is mapped to one or more successive resource elements including the last resource element except for resource elements allocated for RS mapping within the whole area shown in
(43) The control information 2 is mapped to resource elements located just before or just after resource elements to which the RS is mapped. For example, if the RS is mapped to a j-th resource element, the control information 2 may be mapped to a (j−1)-th resource element and a (j+1)-th resource element. The control information 2 is mapped in a forward, backward, or specific mapping order in the first symbol period area.
(44) The above method may be modified to up-down or right-left symmetry in a set of resource elements of
(45) In
Embodiment 2
(46)
(47) In
(48) In
(49) If the sum of the number of symbols of the control information 2 and the number of symbols of the control information 3 is greater than the number of resource elements of the first symbol period area, control information having a higher priority of the control information 2 and control information 3 may replace control information having a lower priority for mapping. In other words, all the control information of a high priority is first mapped to the first symbol period area and N information out of the control information of a low priority is mapped to the first symbol period area. Here, N is a value obtained by subtracting the number of resource elements to which the control information of a higher priority is mapped from the number of resource elements of the first symbol period area. For example, if a priority of the control information 2 is higher than a priority of the control information 3, all the control information 2 is first mapped to the first symbol period area and the control information 3 is mapped to the remaining resource elements in the first symbol period area. Therefore, a part of the control information 3 may not be mapped to the first symbol period area.
(50) The method of
Embodiment 3
(51)
(52) In
(53) In
(54) If the sum of the number of symbols of the control information 2 and the number of symbols of the control information 3 is greater than the number of resource elements of the first symbol period area, control information of a higher priority of the control information 2 and the control information 3 may replace control information of a lower priority for mapping. This is the same as described in
(55) The method of
Embodiment 4
(56)
(57) In
(58) Alternatively, the control information 2 may first be mapped to the first, third, and fifth subcarriers of the whole area shown in
(59) In
(60) If the sum of the number of the symbols of the control information 2 and the number of the symbols of the control information 3 is greater than the number of resource elements belonging to the first symbol period area, control information having a higher priority of the control information 2 and the control information 3 may replace control information having a lower priority. This is the same as described in
(61) The method of
(62)
Embodiment 5
(63)
(64) In
(65) If the control information 3 is multiplexed by a puncturing scheme, puncturing of the control information 1 can be reduced by mapping the control information 3 to the second symbol period area, that is, to resource elements next to resource elements to which the control information 2 is mapped.
(66) In
(67) If the number of symbols of the control information 2 is greater than the number of resource elements of the first symbol period area, the control information 2 may puncture the control information 1 outside the first symbol period area. If the number of symbols of the control information 3 is greater than the number of resource elements of the second symbol period area, the control information 3 may puncture the control information 1 outside the second symbol period area.
(68) The method of
Embodiment 6
(69)
(70) In
(71) If the control information 3 is multiplexed in a manner of puncturing other information, puncturing of the control information 1 can be reduced by mapping the control information 3 to the second symbol period area, that is, to resource elements next to resource elements to which the control information 2 is mapped.
(72) In
(73) Alternatively, the control information 2 and/or the control information 3 may be transmitted through resource elements ensured through rate matching for the data information. For example, the control information 2 may puncture the data information and the control information 1, and the control information 3 may rate-match with the data information and/or the control information 1 so that the control information 3 are inserted between the data information and/or the control information 1.
(74) If the number of symbols of the control information 2 is greater than the number of resource elements of the first symbol period area, the control information 2 may puncture the control information 1 outside the first symbol period area. If the number of symbols of the control information 3 is greater than the number of resource elements of the second symbol period area, the control information 3 may puncture the control information 1 outside the second symbol period area.
(75) In the embodiment of
(76) Since the structure of
(77) Before a description of Table 1 to Table 9 is given, the above-described embodiments of
(78) In the embodiments of
(79) In the method of
(80)
(81) A symbol period to which data information and control information are mapped may be changed by the configuration of a CP or the configuration of an SRS. When a normal CP is used, one subframe is comprised of 14 symbol periods as shown in
(82) In Table 1 to Table 9, numbers within ‘{ }’ of ‘Column Set’ indicate symbol periods to which the control information 3 can be mapped. These numbers are allocated except for symbol periods allocated for RS mapping in
(83) Table 1 to Table 9 include configurations in which an SRS is mapped to the first symbol period and to the last symbol period. In Table 1 to Table 9, ‘First SC-FDMA symbol’ means that the SRS is mapped to the first symbol period, ‘Last SC-FDMA symbol’ means that the SRS is mapped to the last symbol period, and ‘No SRS’ means that no SRS is mapped.
(84) TABLE-US-00001 TABLE 1 CP Configuration SRS Configuration Column Set Normal No SRS {1, 4, 7, 10} First SC-FDMA symbol {0, 3, 6, 9} Last SC-FDMA symbol {1, 4, 7, 10} Extended No SRS {1, 4, 6, 9} First SC-FDMA symbol {0, 3, 5, 8} Last SC-FDMA symbol {1, 4, 6} or {1, 4, 5, 6} or {0, 1, 4, 6} or {0, 1, 4, 5}
(85) In Table 1, in the last SC-FDMA symbol of the extended CP, one of multiple column sets may be used.
(86) TABLE-US-00002 TABLE 2 CP Configuration SRS Configuration Column Set Normal No SRS {1, 4, 7, 10} First SC-FDMA symbol {0, 3, 6, 9} Last SC-FDMA symbol {1, 4, 7, 10} Extended No SRS {1, 4, 6, 9} First SC-FDMA symbol {0, 3, 5, 8} Last SC-FDMA symbol {1, 4, 6, 9}
(87) In the extended CP, an SRS may not be permitted to be mapped to the last symbol period, or even if the SRS is permitted, the SRS may be dropped. Then as illustrated in Table 2, the ‘Last SC-FDMA symbol’ may have the same column set as the ‘No SRS’.
(88) TABLE-US-00003 TABLE 3 CP Configuration SRS Configuration Column Set Normal No SRS {1, 4, 7, 10} First SC-FDMA {0, 3, 6, 9} symbol Last SC-FDMA symbol {1, 4, 7, 10} Extended No SRS {1, 4, 6, 9} First SC-FDMA {0, 3, 5, 8} symbol Last SC-FDMA symbol {1, 4, 5, 6}
(89) The ‘Last SC-FDMA symbol’ of the extended CP of Table 3 represents that the location of symbol periods to which the control information 3 is mapped may be modified due to the SRS.
(90) TABLE-US-00004 TABLE 4 CP Configuration SRS Configuration Column Set Normal No SRS {1, 4, 7, 10} First SC-FDMA symbol {0, 3, 6, 9} Last SC-FDMA symbol {1, 4, 7, 10} Extended No SRS {1, 4, 6, 9} First SC-FDMA symbol {0, 3, 5, 8} Last SC-FDMA symbol {1, 4, 6, 9}
(91) In the extended CP, the SRS may not be permitted to be mapped to the last symbol period, or even if the SRS is permitted, the SRS may be dropped. The extended CP of Table 4 can be used when the ‘Last SC-FDMA symbol’ SRS is not permitted, or the ‘Last SC-FDMA symbol’ SRS can be dropped even though the ‘Last SC-FDMA symbol’ SRS is permitted. If the first SC-FDMA symbol SRS is not used, the extended CP of Table 4 may be constructed without the first SC-FDMA symbol part (including ‘Column set’ thereof).
(92) TABLE-US-00005 TABLE 5 CP Configuration SRS Configuration Column Set Normal No SRS {1, 4, 7, 10} Last SC-FDMA {1, 4, 7, 10} symbol Extended No SRS {1, 4, 6, 9} Last SC-FDMA {1, 4, 6, 9} symbol
(93) Referring to
(94) TABLE-US-00006 TABLE 6 CP Configuration SRS Configuration Column Set Normal No SRS {1, 4, 7, 10} Last SC-FDMA {1, 4, 7, 10} symbol Extended No SRS {1, 4, 6, 9} Last SC-FDMA {1, 4, 6, 5} symbol
(95) Referring to
(96) TABLE-US-00007 TABLE 7 CP Configuration SRS Configuration Column Set Normal No SRS {1, 4, 7, 10} Last SC-FDMA {1, 4, 7, 10} symbol Extended No SRS {1, 4, 6, 5} Last SC-FDMA {1, 4, 6, 5} symbol
(97) Referring to
(98)
(99) TABLE-US-00008 TABLE 8 CP Configuration SRS Configuration Column Set Normal No SRS {1, 4, 7, 10} Last SC-FDMA {1, 4, 7, 10} symbol Extended No SRS {0, 3, 5, 8} Last SC-FDMA {0, 3, 5, 8} symbol
(100) Table 8 illustrates a configuration when a symbol period allocated for RS mapping in an extended CP is changed. Especially, it is assumed in Table 8 that the RS is located in the third (‘{circle around (3)}’) and the ninth (‘{circle around (9)}’) symbol periods (refer to
(101) TABLE-US-00009 TABLE 9 CP Configuration SRS Configuration Column Set Normal No SRS {1, 4, 7, 10} Last SC-FDMA {1, 4, 7, 10} symbol Extended No SRS {1, 4, 5, 8} Last SC-FDMA {1, 4, 5, 8} symbol
(102) Table 9 illustrates a configuration when a symbol period allocated for RS mapping in the extended CP is changed. Especially, it is assumed in Table 9 that the RS is located in the fourth (‘{circle around (4)}’) and the ninth (‘{circle around (9)}’) symbol periods (refer to
(103)
(104)
Embodiment 7
(105)
(106) Each of the control information 2 and the control information 3 can be mapped to a maximum of 4 resource elements per subcarrier.
(107) Hereinafter,
(108) In
(109) In
(110) In
(111) In
(112) In
(113)
(114) While
(115)
(116) In
(117) The data information and control information mapped to the set of physical resource elements in
(118) In the method of
(119) Hereinafter, 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 input rank information (RI), and g.sub.0, g.sub.1, g.sub.2, . . . , g.sub.H′−1 denotes a multiplexed output. Here, H′=G′±Q′.
(120) Multiplexing can be performed through the following steps.
(121) 1. Determine the number of symbols per subframe using the following equation:
N.sub.symb.sup.PUSCH=(2.Math.(N.sub.symb.sup.UL−1)−N.sub.SRS)
(122) Here, N.sub.symb.sup.PUSCH denotes the number of SC-FDMA symbols which transmit a PUSCH in one subframe, N.sub.symb.sup.UL denotes the number of symbols within one uplink slot, N.sub.SRS denotes the number of symbols used to transmit an SRS within one subframe.
(123) 2. Determine the number G′ of modulation symbols of data information using the following equation:
G′=G/Qm1
(where Qm1 is a modulation order of data)
(124) 3. Determine the number Q′ of modulation symbols of rank information using the following equation:
Q′=Q/Qm2
(where Qm2 is a modulation order of rank information)
(125) 4. Determine the number K of subcarriers occupied by modulation symbols of rank information using the following equation:
K=ceil(Q′/maximum number of resources for rank information)
(126) 5. Determine the number of modulation symbols of rank information per symbol.
(127) The number of modulation symbols of rank information per symbol is determined by a combination of ‘floor’ and ‘ceil’ in a symbol position occupied by each rank information based on Q′ or by a method determined according to a remainder obtained by dividing the number of modulation symbols of rank information by the number of symbols. In this case, the modulation symbols may be equally divided to a maximum of two slots, and may be allocated from a front slot to a back slot or vice versa.
(128) 6. Multiplex the modulation symbols of the data information and the rank information.
(129) Since the rank information should have a form stacked from the bottom of a subcarrier, the data information should be mapped by a time-priority scheme and the rank information should be mapped in a corresponding symbol. At this time, since the data information is mapped from the top subcarrier, the location of a subcarrier in which rank information can be located is determined by subtracting a result of the above step 2 from the entire number of subcarriers. Then the rank information is mapped in consideration of the number of symbols determined in the above step 3. This can be represented as a pseudo code as follows.
(130) TABLE-US-00010 For (from 0-th subcarrier to last subcarrier) { If (current subcarrier number is less than value obtained by subtracting K from entire number of subcarriers) { for (from SC-FDMA symbol 0 to number of SC-FDMA symbols per subframe) { map data as output one symbol by one symbol increase SC-FDMA symbol count increase data symbol count } else { for (from SC-FDMA symbol 0 to the number of SC-FDMA symbols per subframe) { if (number of modulation symbols of rank information in corresponding SC-FDMA symbol calculated in the above step 4 is 0) { map data as output one symbol by one symbol increase SC-FDMA symbol count increase data symbol count } else { map rank information as output by one symbol by one symbol increase SC-FDMA symbol count increase rank information count delete number of modulation symbols of rank information in corresponding SC-FDMA symbol calculated in the above step 4 by one } } } increase subcarrier count }
(131) A detailed method for locating rank information between data due to rate matching rather than puncturing may be modified entirely or partially.
(132) Hereinafter, in the method of
(133) It is assumed that the amount of RI does not intrude upon resources occupied by CQI/PMI (the number of subcarriers including symbols occupied by RI and the number of subcarriers occupied by CQI/PMI do not exceed the entire number of subcarriers per subframe for PUSCH transmission). Therefore, each of the RI, CQI/PMI, and data information should be considered to have a size which does not intrude upon each other. If the RI, CQI/PMI, and data information intrude upon one another, the RI may use a modified form of the following method by puncturing the CQI/PMI.
(134) Here, q.sub.0, q.sub.1, q.sub.2, q.sub.3, . . . , q.sub.Q−1 denotes a CQI/PMI input, f.sub.0, f.sub.1, f.sub.2, f.sub.3, . . . , f.sub.G−1 denotes a data information input, q.sub.0.sup.RANK, q.sub.1.sup.RANK, q.sub.2.sup.RANK, . . . , q.sub.Q.sub.
(135) N.sub.symb.sup.PUSCH=(2.Math.(N.sub.symb.sup.UL−1)−N.sub.SRS) denotes the number of symbols per subframe for PUSCH transmission, and N.sub.sc.sup.PUSCH=H′/N.sub.symb.sup.PUSCH denotes the number of subcarriers carrying a PUSCH within one subframe.
(136) The number of subcarriers used for rank information within one subcarrier can be expressed by two equations. Namely, if the RI is a coded bit, then N.sub.sc.sup.RANK=┌(Q.sub.RANK/Q.sub.m)/4┐. Here, 4 is the maximum number of resources for the RI. A symbol such as ceil or floor need not be used when a result of division has no remainder. If the RI is a vector sequence, then N.sub.sc.sup.RANK=┌(Q′.sub.RANK/Q.sub.m)/4┐. Here, 4 is the maximum number of resources for the RI. A symbol such as ceil or floor need not be used when a result of division has no remainder.
(137) The number of rank information encoded as a bit/vector sequence within the i-th symbol carrying a PUSCH within one subframe is expressed by ni.
(138) The number of bit/vector sequences for the RI mapped to respective symbols carrying a PUSCH with respect to a subframe having a normal CP may refer to Table 10 to Table 12. Table 10 shows an ni value in a subframe having a normal CP. Table 11 shows an ni value in a subframe having an extended CP without an SRS. Table 12 shows an ni value in a subframe having an extended CP with an SRS in the last symbol.
(139) TABLE-US-00011 TABLE 10 i 0 1 2 3 4 5 6 7 8 9 10 11 0 └┌Q.sub.RANK/2┐/2┘ 0 0 ┌┌Q.sub.RANK/2┐/2┐ 0 0 ┌└Q.sub.RANK/2┘/2┐ 0 0 └└Q.sub.RANK/2┘/2┘ 0 or or or or └┌Q′.sub.RANK/2┐/2┘ ┌┌Q′.sub.RANK/2┐/2┐ ┌└Q′.sub.RANK/2┘/2┐ └└Q′.sub.RANK/2┘/2┘
(140) Table 10 serves to evenly use symbols in which two slots and RI are located using ceil/floor down/modulo or a position priority of symbols in which the RI is located. That is, the number of sequences may be different by about 1 by various combinations of i of 1>4>7>10, 1>7>4>10, or 4>7>1>10 and Table 10 may be changed accordingly. Although two cases of Q.sub.RANK and Q′.sub.RANK have been described, an equation using Q.sub.RANK may be used if the Ri is a coded bit and an equation using Q′.sub.RANK may be used if the Ri is a vector sequence.
(141) TABLE-US-00012 TABLE 11 i 0 1 2 3 4 5 6 7 8 9 0 └┌Q.sub.RANK/ 0 0 ┌┌Q.sub.RANK/ 0 ┌└Q.sub.RANK/ 0 0 └└Q.sub.RANK/ 2┐/2┘ 2┐/2┐ 2┘/2┐ 2┘/2┘ or or or or └┌Q′.sub.RANK/ ┌┌Q′.sub.RANK/ ┌└Q′.sub.RANK/ └└Q′.sub.RANK/ 2┐/2┘ 2┐/2┐ 2┘/2┐ 2┘/2┘
(142) Table 11 serves to evenly use symbols in which two slots and RI are located using ceil/floor/modulo or a position priority of symbols in which the RI is located. That is, the number of sequences may be different by about 1 by various combinations of i of 1>4>6>9, 1>6>4>9, or 4>6>1>9 and Table 11 may be changed accordingly. Although two cases of Q.sub.RANK and Q′.sub.RANK have been described, an equation using Q.sub.RANK may be used if the Ri is a coded bit and an equation using Q′.sub.RANK may be used if the Ri is a vector sequence.
(143) TABLE-US-00013 TABLE 12 i 0 1 2 3 4 5 6 7 8 0 └┌Q.sub.RANK/ 0 0 ┌┌Q.sub.RANK/ └└Q.sub.RANK/ ┌└Q.sub.RANK/ 0 0 2┐/2┘ 2┐/2┐ 2┘/2┘ 2┘/2┐ or or or or └┌Q′.sub.RANK/ ┌┌Q′.sub.RANK/ └└Q′.sub.RANK/ ┌└Q′.sub.RANK/ 2┐/2┘ 2┐/2┐ 2┘/2┘ 2┘/2┐
(144) Table 12 serves to use symbols in which two slots and RI are located using ceil/floor/modulo or a position priority of symbols in which the RI is located. That is, the number of sequences may be different by about 1 by various combinations of i of 1>4>6>5, 1>6>5>4, or 4>6>1>5 and Table 12 may be changed accordingly. Although two cases of Q.sub.RANK and Q′.sub.RANK have been described, an equation using Q.sub.RANK may be used if the Ri is a coded bit and an equation using Q′.sub.RANK may be used if the Ri is a vector sequence.
(145) Control information, rank information, and data information may be multiplexed as follows.
(146) TABLE-US-00014 set i, j, k, l, m to 0 while l < H’- .sup.N.sub.SC.sup.
(147) If RI is a coded bit, g.sub.k=[q.sub.m.sup.RANK . . . q.sub.m+Q.sub.
(148) In the method of
(149)
(150) Hereinafter, the process for attaching CRC to a transport block is described. Error detection is provided on UL-SCH transport blocks through a Cyclic Redundancy Check (CRC).
(151) The entire transport block is used to calculate the CRC parity bits. Denote the bits in a transport block delivered to layer 1 by a.sub.0, a.sub.1, a.sub.2, a.sub.3, . . . , a.sub.A−1 and the parity bits by p.sub.0, p.sub.1, p.sub.2, p.sub.3, . . . , p.sub.L−1. A is the size of the transport block and L is the number of parity bits.
(152) The parity bits are computed and attached to the UL-SCH transport block according to subclause 5.1.1 setting L to 24 bits and using the generator polynomial g.sub.CRC24A(D).
(153) The process for segmenting a code block and attaching CRC to the segmented code block will now be described. The bits input to the code block segmentation are denoted by b.sub.0, b.sub.1, b.sub.2, b.sub.3, . . . , b.sub.B−1 where B is the number of bits in the transport block (including CRC).
(154) Code block segmentation and code block CRC attachment are performed according to subclause 5.1.2.
(155) The bits after code block segmentation are denoted by c.sub.r0, c.sub.r1, c.sub.r2, c.sub.r3, . . . , c.sub.r(K.sub.
(156) Channel coding for a UL-SCH will now be described. Code blocks are delivered to the channel coding block. The bits in a code block are denoted by c.sub.r0, c.sub.r1, c.sub.r2, c.sub.r3, . . . , c.sub.r(K.sub.
(157) After encoding the bits are denoted by d.sub.r0.sup.(i), d.sub.r1.sup.(i), d.sub.r2.sup.(i), d.sub.r3.sup.(i), . . . , d.sub.r(D.sub.
(158) Hereinafter, rate matching is described. Turbo coded blocks are delivered to the rate matching block. They are denoted by d.sub.r0.sup.(i), d.sub.r1.sup.(i), d.sub.r2.sup.(i), d.sub.r3.sup.(i), . . . , d.sub.r(D.sub.
(159) After rate matching, the bits are denoted by e.sub.r0, e.sub.r1, e.sub.r2, e.sub.r3, . . . , e.sub.r(E.sub.
(160) Hereinafter, code block concatenation is described. The bits input to the code block concatenation block are denoted by e.sub.r0, e.sub.r1, e.sub.r2, e.sub.r3, . . . , e.sub.r(E.sub.
(161) Code block concatenation is performed according to subclause 5.1.5.
(162) The bits after code block concatenation are denoted by f.sub.0, f.sub.1, f.sub.2, . . . , f.sub.G−1, where G is the total number of coded bits for transmission excluding the bits used for control transmission, when control information is multiplexed with the UL-SCH transmission.
(163) Hereinafter, channel coding for control information is described. Control data arrives at the coding unit in the form of channel quality information (CQI and/or PMI), HARQ-ACK and rank indication. Different coding rates for the control information are achieved by allocating different number of coded symbols for its transmission. When control data are transmitted in the PUSCH, the channel coding for HARQ-ACK, rank indication and channel quality information o.sub.0, o.sub.1, o.sub.2, . . . , o.sub.O−1 is done independently. If HARQ-ACK consists of 1-bit of information, i.e., [o.sub.0.sup.ACK], it is first encoded according to Table 5.2.2-1. If HARQ-ACK consists of 2-bits of information, i.e., [o.sub.1.sup.ACK o.sub.0.sup.ACK], it is first encoded according to Table 5.2.2-2.
(164) TABLE-US-00015 TABLE 13 Q.sub.m Encoded HARQ-ACK 2 [o.sub.0.sup.ACK X] 4 [o.sub.0.sup.ACK x x x] 6 [o.sub.0.sup.ACK x x x x x]
(165) TABLE-US-00016 TABLE 14 Q.sub.m Encoded HARQ-ACK 2 [o.sub.1.sup.ACK o.sub.0.sup.ACK] 4 [o.sub.1.sup.ACK o.sub.0.sup.ACK x x] 6 [o.sub.1.sup.ACK o.sub.0.sup.ACK x x x x]
[Note from the editor: the ‘x’ above is a placeholder for 211 to treat bits with this value differently when performing scrambling of coded bits. This will enable limiting the constellation size used for ACK transmission in PUSCH to QPSK.
(166) The bit sequence q.sub.0.sup.ACK, q.sub.1.sup.ACK, q.sub.2.sup.ACK, . . . , q.sub.Q.sub.
(167) TABLE-US-00017 Set i ,k to 0 while i < Q.sub.ACK q.sub.k.sup.ACK =[q.sub.i.sup.ACK ...q.sub.i+Q.sub.
For rank indication (RI) If RI consists of 1-bit of information, i.e., [o.sub.0.sup.RI], it is first encoded according to Table 5.2.2-3. If RI consists of 2-bits of information, i.e., [o.sub.0.sup.RI o.sub.1.sup.RI], it is first encoded according to Table 5.2.2-4 where o.sub.2.sup.RI=(o.sub.0.sup.RI+o.sub.1.sup.RI) mod 2.
(168) TABLE-US-00018 TABLE 15 Q.sub.m Encoded RI 2 [o.sub.0.sup.RI X] 4 [o.sub.0.sup.RI x x x] 6 [o.sub.0.sup.RI x x x x x]
(169) TABLE-US-00019 TABLE 16 Q.sub.m Encoded RI 2 [o.sub.0.sup.RI o.sub.1.sup.RI o.sub.2.sup.RI o.sub.0.sup.RI o.sub.1.sup.RI o.sub.2.sup.RI] 4 [o.sub.0.sup.RI o.sub.1.sup.RI x x o.sub.2.sup.RI o.sub.0.sup.RI x x o.sub.1.sup.RI o.sub.2.sup.RI x x] 6 [o.sub.0.sup.RI o.sub.1.sup.RI x x x x o.sub.2.sup.RI o.sub.0.sup.RI x x x x o.sub.1.sup.RI o.sub.2.sup.RI x x x x]
(170) The “x” in Table 15 and 16 are placeholders for 3GPP TS 36.211 to scramble the RI bits in a way that maximizes the Euclidean distance of the modulation symbols carrying rank information.
(171) The bit sequence q.sub.0.sup.RI, q.sub.1.sup.RI, q.sub.2.sup.RI, . . . , q.sub.Q.sub.
(172) TABLE-US-00020 Set i ,k to 0 while i < Q.sub.RI q.sub.k.sup.RI = [q.sub.i.sup.RI ...q.sub.i+Q.sub.
(173) For channel quality control information (CQI and/or PMI) If the payload size is less than or equal to 11 bits, the channel coding of the channel quality information is performed according to subclause 5.2.3.3 of 3GPP TS 36.212 with input sequence o.sub.0, o.sub.1, o.sub.2, . . . , o.sub.O−1. For payload sizes greater than 11 bits, the channel coding and rate matching of the channel quality information is performed according to subclause 5.1.3.1 and 5.1.4.2 of 3GPP TS 36.212 with input sequence o.sub.0, o.sub.1, o.sub.2, . . . , o.sub.O−1.
(174) The output sequence for the channel coding of channel quality information is denoted by q.sub.0, q.sub.1, q.sub.2, q.sub.3, . . . , q.sub.Q−1.
(175) The control and data multiplexing is performed such that HARQ-ACK information is present on both slots and is mapped to resources around the demodulation reference signals. In addition, the multiplexing ensures that control and data information are mapped to different modulation symbols.
(176) The inputs to the data and control multiplexing are the coded bits of the control information denoted by q.sub.0, q.sub.1, q.sub.2, q.sub.3, . . . , q.sub.Q−1 and the coded bits of the UL-SCH denoted by f.sub.0, f.sub.1, f.sub.2, f.sub.3, . . . , f.sub.G−1. The output of the data and control multiplexing operation is denoted by g.sub.0, g.sub.1, g.sub.2, g.sub.3, . . . , g.sub.H′−1, where H=(G+Q) and H′=H/Q.sub.m, and where g.sub.i, i=0, . . . , H′−1 are column vectors of length Q.sub.m. H is the total number of coded bits allocated for UL-SCH data and CQI/PMI data.
(177) Denote the number of SC-FDMA symbols per subframe for PUSCH transmission by N.sub.symb.sup.PUSCH=(2.Math.(N.sub.symb.sup.UL−1)−N.sub.SRS).
(178) The control information and the data shall be multiplexed as follows:
(179) TABLE-US-00021 Set i,j, k to 0 while j < Q -- first place the control information g.sub.k =[q.sub.j ...q.sub.j+Q.sub.
(180) Hereinafter, channel interleaver is described.
(181) The channel interleaver described in this subclause in conjunction with the resource element mapping for PUSCH in 3GPP TS 36.211 implements a time-first mapping of modulation symbols onto the transmit waveform while ensuring that the HARQ-ACK information is present on both slots in the subframe and is mapped to resources around the uplink demodulation reference signals.
(182) The input to the channel interleaver are denoted by g.sub.0, g.sub.1, g.sub.2, . . . , g.sub.H′−1, q.sub.0.sup.RI, q.sub.1.sup.RI, q.sub.2.sup.RI, . . . , q.sub.Q′.sub.
(183) (1) Assign C.sub.mux=N.sub.symb.sup.PUSCH to be the number of columns of the matrix. The columns of the matrix are numbered 0, 1, 2, . . . , C.sub.mux−1 from left to right.
(184) (2) The number of rows of the matrix is R.sub.mux=(H″.Math.Q.sub.m/C.sub.mux and we define R′.sub.mux=R.sub.mux/Q.sub.m.
(185) The rows of the rectangular matrix are numbered 0, 1, 2, . . . , R.sub.mux−1 from top to bottom.
(186) (3) If rank information is transmitted in this subframe, the vector sequence q.sub.0.sup.RI, q.sub.1.sup.RI, q.sub.2.sup.RI, . . . , q.sub.Q.sub.
(187) TABLE-US-00022 Set i,j to 0. Set r to R′.sub.mux −1 while i < Q′.sub.RI c.sub.RI = Column Set(j) y.sub.r×C.sub.
(188) (4) Write the input vector sequence, i.e., y.sub.k=g.sub.k for k=0, 1, . . . , H′−1, into the (R.sub.mux×C.sub.mux) matrix by sets of Q.sub.m rows starting with the −1) vector y.sub.0, in column 0 and rows 0 to (Q.sub.m−1) and skipping the matrix entries that are already occupied:
(189)
(190) (5) If HARQ-ACK information is transmitted in this subframe, the vector sequence q.sub.0.sup.ACK, q.sub.1.sup.ACK, q.sub.2.sup.ACK, . . . , q.sub.Q′.sub.
(191) (6) The output of the block interleaver is the bit sequence read out column by column from the (R.sub.mux×C.sub.mux) matrix. The bits after channel interleaving are denoted by h.sub.0, h.sub.1, h.sub.2, . . . , h.sub.H+Q.sub.
(192) TABLE-US-00023 TABLE 17 CP configuration Column Set Normal {1, 4, 7, 10} Extended {0, 3, 5, 8}
(193) TABLE-US-00024 TABLE 18 CP configuration Column Set Normal {2, 3, 8, 9} Extended {1, 2, 6, 7}
(194) 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.
(195) 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.
(196) 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.
(197) 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.
(198) 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.
(199) The present invention may be applied to a user equipment, a base station, and other devices of a wireless mobile communication system.