Abstract:
A base station includes a transmit path circuitry to transmit an uplink grant to a subscriber station. The uplink grant indicating a first MCS value for a first codeword transmission and a second MCS value for a second codeword transmission. The base station also includes a receive path circuitry configured to receive a MIMO uplink subframe from the subscriber station, the MIMO uplink subframe having a first subset of layers used for the first codeword transmission and a second subset of layers used for the second codeword transmission. ACK/NACK information and RI information are repeated on both the first and second subsets of layers, and CQI is spatially multiplexed on either the first subset or the second subset of layers. If the first MCS value is different from the second MCS value, the CQI is spatially multiplexed onto the subset of layers having a higher MCS value.

Description:
CROSS-REFERENCE TO RELATED APPLICATION(S) AND CLAIM OF PRIORITY 
       [0001]    The present application is related to U.S. Provisional Patent Application No. 61/334,085, filed May 12, 2010, entitled “MULTIPLEXING OF CONTROL AND DATA IN AN UPLINK MIMO SYSTEM”. Provisional Patent Application No. 61/334,085 is assigned to the assignee of the present application and is hereby incorporated by reference into the present application as if fully set forth herein. The present application hereby claims priority under 35 U.S.C. §119(e) to U.S. Provisional Patent Application No. 61/334,085. 
         [0002]    The present application also claims priority under 35 U.S.C. §119(a) to a Korean Patent Application entitled “UPLINK TRANSMISSION APPARATUS AND METHOD FOR MOBILE COMMUNICATION SYSTEM SUPPORTING UPLINK MIMO” filed in the Korean Intellectual Property Office on May 13, 2010 and assigned Serial No. 10-2010-0045141, the contents of which are incorporated herein by reference. 
     
    
     TECHNICAL FIELD OF THE INVENTION 
       [0003]    This disclosure relates to uplink transmission apparatus and method for mobile communication system supporting uplink MIMO. 
       BACKGROUND OF THE INVENTION 
       [0004]    In the uplink of Long Term Evolution (LTE) as a next generation mobile communication standard, just one codeword is transmitted through an antenna. The physical uplink shared channel (PUSCH) is used for the uplink data transmission in such a system, and the Uplink Control Information (UCI) including channel quality indicator (CQI), rank indicator (RI), and hybrid automatic repeat request—acknowledgement (HARQ-ACK) is carried in the same PUSCH transmitted for the uplink data. 
         [0005]      FIG. 1  is a diagram illustrating a procedure for processing data and UCI in the uplink of a legacy LTE system on the transport channel and physical channel levels. In  FIG. 1 , reference numbers  101  to  110  denote the steps of processing on the transport channel, and reference numbers  111  to  115  denote the steps of processing on the physical channel. 
         [0006]    In the uplink of the legacy LTE system, a User Equipment (UE) uses a single codeword and a single antenna such that, when the PUSCH and UCI are transmitted together, the UCI is mapped to a single codeword and then transmitted on a single layer. 
         [0007]    Referring to  FIG. 1 , the UE determines a number of coded symbols for the transmission of ACK or RI, i.e., the number of symbols for RI (channel coding RI) at step  107  and the number of symbols for ACK (channel coding ACK/NACK) at step  108 . The UE also determines the number of coded symbols for transmitting CQI in the PUSCH, i.e., the number of symbols for CQI (channel coding CQI) at step  106 . 
         [0008]    The UE attaches a Cyclic Redundancy Check (CRC) to the Transport Block (TB) at step  101  and segments the TB into code blocks and attaches the CRC to each code block again at step  102 . Next, the UE performs channel coding at step  103 , rate matching at step  104 , and then concatenates the code blocks (channel block concatenation) at step  105 . Next, the UE multiplexes data (UL-SCH data) and CQI information (data and control multiplexing) at step  109 . 
         [0009]    Next, the UE performs interleaving (channel interleaving) on the data uplink shared channel (UL-SCH) data, CQI, RI, and ACK/NACK information (that are processed at steps  109 ,  107 , and  108 ) at step  110 . 
         [0010]      FIG. 2  is a diagram illustrating uplink (UL) channel interleaver-layer mapping relationship in the legacy LTE system. In  FIG. 2 , reference number  201  denotes an exemplary symbol configuration of the UL channel interleaver, and reference number  202  denotes an exemplary symbol configuration of layer# 1 . Referring to  FIG. 2 , the output bit sequence of the channel interleaver as denoted by reference number  201  is mapped one by one onto the layer# 1  as denoted by reference number  202 . 
         [0011]    The channel interleaved information is scrambled at step  111 , modulated (modulation mapper) at step  112 , transformed by discrete Fourier transform (DFT) (transform precoder, DFT) at step  113 , mapped to resource (resource element mapper) at step  114 , and then transformed by inverse fast Fourier transform (IFFF) for transmission at step  115 . 
         [0012]    In the LTE system, the UE uses a single codeword and a single antenna for uplink transmission as described above such that, when the data and UCI are transmitted together in the PUSCH, the UCI is transmitted on the signal layer as mapped to the single codeword. 
         [0013]    Unlike the legacy LTE system, the UE can use two codewords and up to four transmit antennas in LTE-Advanced (LTE-A) system. Accordingly, when the data and UCI are transmitted together through UL-SCH, the UCI can be mapped to one or two codewords. This means that the UE can transmit the UCI on multiple layers in the uplink of the LTE-A system. 
         [0014]    However, in the case in which the transmitted UCI is unequally distributed on the two layers, if the channel status is good for one layer but bad for the other, the UCI reception performance is likely degraded especially when such control information is concentrated onto the layer having bad channel status. 
       SUMMARY OF THE INVENTION 
       [0015]    In order to solve the problems of prior arts, this disclosure provides a method for transmitting the information of CQI, RI, HARQ-ACK constituting the UCI as equally distributed on multiple layers especially when a single codeword is mapped to two transmission layers. 
         [0016]    Also, this disclosure provides a method for transmitting the UCI carried with a single codeword mapped to two layers and two codewords mapped to multiple layers in an uplink channel of a LTE-A system supporting multi-antenna transmission. 
         [0017]    This disclosure provides a method for transmitting the UCI carried with a single codeword as equally distributed on two layers. For this purpose, first an uplink interleaving operation taking into consideration the number of layers to which the codeword is mapped is disclosed. Unlike the conventional uplink channel interleaver designed to consider the time and frequency, the uplink channel interleaver of this disclosure is designed to operate by taking into consideration the number of layers as well as the time and frequency. This disclosure also discloses some modification necessary for data and UCI processing procedure on the transport layer and physical layer according to the disclosed uplink channel interleaver. Second, a method for transmitting the UCI with interleavers for respective layers, when a single codeword is transmitted on two layers, is disclosed. Also, this disclosure discloses some modifications necessary for processing the data and UCI on the transport layer and the physical layer in case each layer has a dedicated uplink channel interleaver. 
         [0018]    This disclosure discloses a method for transmitting the UCI on multiple layers especially when two codewords are mapped to multiple layers. 
         [0019]    In accordance with an aspect of this disclosure, an uplink data multiplexing method for a mobile communication system includes receiving multiplexed data of data and CQI, RI, and ACK; channel-interleaving the multiplexed data, RI, and ACK; modulating the channel interleaved data into a codeword composed of a plurality of symbols; and mapping a sequence of odd number-th symbols to a first layer and a sequence of even number-th symbols to a second layer. 
         [0020]    In accordance with another aspect of this disclosure, an uplink data multiplexing method for a mobile communication system includes receiving data obtained by multiplexing data and CQI, RI, and ACK; channel-interleaving the multiplexed data, RI, and ACK to be equally distributed on individual layers by taking into consideration a number of layers; modulating the channel-interleaved data into codewords composed of a plurality of symbols; and mapping a sequence of odd number-th symbols to a first layer and a sequence of even number-th symbols to a second layer. 
         [0021]    In accordance with another aspect of this disclosure, an uplink data multiplexing method of a mobile communication system includes receiving data obtained by multiplexing data and CQI, RI, and ACK; channel-interleaving the multiplexed data, RI, and ACK to be equally distributed on individual layers in consideration of a number of layers for a first codeword; channel-interleaving the multiplexed data, RI, and ACK to be equally distributed on individual layers in consideration of a number of layers for a second codeword; modulating the interleaved data into codewords composed of a plurality of symbols; mapping a sequence of odd number-th symbols of the modulated first codeword to a first layer; mapping a sequence of even number-th symbols of the modulated first codeword to a second layer; mapping a sequence of odd number-th symbols of the modulated second codeword to a third layer; and mapping a sequence of even number-th symbols of the modulated second codeword to a fourth layer. 
         [0022]    In accordance with another aspect of this disclosure, an uplink data multiplexing method of a mobile communication system includes time division-multiplexing, when two codewords are being transmitted, ACK and RI symbols with data to be repeated on all layers and transmitted in a time-aligned manner; channel-interleaving for CQI to be transmitted on layers mapped to a codeword; modulating the channel-interleaved data into codewords composed of a plurality of symbols; and mapping the modulated codewords to corresponding layers. 
         [0023]    In accordance with still another aspect of this disclosure, an uplink data multiplexing apparatus of a mobile communication system includes a multiplexer for multiplexing channel-coded data and CQI, a RI channel coder for channel-coding RI data, an ACK channel coder for channel-coding ACK, a channel interleaver for channel interleaving the multiplexed data, RI, and ACK, a modulator for modulating the channel-interleaved data into codewords composed of a plurality of symbols, and a layer mapper for mapping a sequence of odd number-th symbols of the modulated codewords to a first layer and mapping a sequence of even number-th symbols of the modulated codewords to a second layer. 
         [0024]    A base station is provided. The base station comprising a transmit path circuitry configured to transmit an uplink grant to a subscriber station. The uplink grant indicating a first modulation and coding scheme (MCS) value for a first codeword transmission and a second MCS value for a second codeword transmission. The base station also includes a receive path circuitry configured to receive a multiple-input multiple-output (MIMO) uplink subframe from the subscriber station, the MIMO uplink subframe having a first subset of layers used for the first codeword transmission and a second subset of layers used for the second codeword transmission. Acknowledgement/negative acknowledgement (ACK/NACK) information and rank indication (RI) information are repeated on both the first subset of layers and the second subset of layers. Channel quality information (CQI) is spatially multiplexed on either the first subset of layers or the second subset of layers. If the first MCS value is different from the second MCS value, the CQI is spatially multiplexed onto the subset of layers having a higher MCS value. If the first MCS value is the same as the second MCS value, the CQI is spatially multiplexed onto the first subset of layers. 
         [0025]    A method of operating a base station is provided. The method includes transmitting an uplink grant to a subscriber station, the uplink grant indicating a first modulation and coding scheme (MCS) value for a first codeword transmission and a second MCS value for a second codeword transmission. The method also includes receiving a multiple-input multiple-output (MIMO) uplink subframe from the subscriber station, the MIMO uplink subframe having a first subset of layers used for the first codeword transmission and a second subset of layers used for the second codeword transmission. Acknowledgement/negative acknowledgement (ACK/NACK) information and rank indication (RI) information are repeated on both the first subset of layers and the second subset of layers. Channel quality information (CQI) is spatially multiplexed on either the first subset of layers or the second subset of layers. If the first MCS value is different from the second MCS value, the CQI is spatially multiplexed onto the subset of layers having a higher MCS value. If the first MCS value is the same as the second MCS value, the CQI is spatially multiplexed onto the first subset of layers. 
         [0026]    A subscriber station is provided. The subscriber station includes a receive path circuitry configured to receive an uplink grant from a base station, the uplink grant indicating a first modulation and coding scheme (MCS) value for a first codeword transmission and a second MCS value for a second codeword transmission. The subscriber station also includes a transmit path circuitry configured to transmit a multiple-input multiple-output (MIMO) uplink subframe from the subscriber station, the MIMO uplink subframe having a first subset of layers used for the first codeword transmission and a second subset of layers used for the second codeword transmission. Acknowledgement/negative acknowledgement (ACK/NACK) information and rank indication (RI) information are repeated on both the first subset of layers and the second subset of layers. Channel quality information (CQI) is spatially multiplexed on either the first subset of layers or the second subset of layers. If the first MCS value is different from the second MCS value, the CQI is spatially multiplexed onto the subset of layers having a higher MCS value. If the first MCS value is the same as the second MCS value, the CQI is spatially multiplexed onto the first subset of layers. 
         [0027]    A method of operating a subscriber station is provided. The method includes receiving an uplink grant from a base station, the uplink grant indicating a first modulation and coding scheme (MCS) value for a first codeword transmission and a second MCS value for a second codeword transmission. The method also includes transmitting a multiple-input multiple-output (MIMO) uplink subframe from the subscriber station, the MIMO uplink subframe having a first subset of layers used for the first codeword transmission and a second subset of layers used for the second codeword transmission. Acknowledgement/negative acknowledgement (ACK/NACK) information and rank indication (RI) information are repeated on both the first subset of layers and the second subset of layers. Channel quality information (CQI) is spatially multiplexed on either the first subset of layers or the second subset of layers. If the first MCS value is different from the second MCS value, the CQI is spatially multiplexed onto the subset of layers having a higher MCS value. If the first MCS value is the same as the second MCS value, the CQI is spatially multiplexed onto the first subset of layers. 
         [0028]    A base station is provided. The base station includes a receive path circuitry configured to receive a multiple-input multiple-output (MIMO) uplink subframe from a subscriber station, the MIMO uplink subframe having a first subset of layers having a total number of layers L 1  used for a first codeword transmission carrying acknowledgement/negative acknowledgement (ACK/NACK) information and rank indication (RI) information, and a second subset of layers having a total number of layers L 2  used for a second codeword transmission carrying ACK/NACK information, RI information, and channel quality information (CQI). A total number of coded symbols N ACK  used for carrying ACK/NACK information is generated by repeating N ACK /(L 1 +L 2 ) coded symbols across each of the L 1  and L 2  layers. A total number of coded symbols N RI  used for carrying RI information is generated by repeating N RI /(L 1 +L 2 ) coded symbols across each of the L 1  and L 2  layers, and a total number of coded symbols N CQI  is used for carrying CQI and N CQI /L 2  coded symbols are mapped across each of the L 2  layers. 
         [0029]    A method of operating a base station is provided. The method includes receiving a multiple-input multiple-output (MIMO) uplink subframe from a subscriber station, the MIMO uplink subframe having a first subset of layers having a total number of layers L 1  used for a first codeword transmission carrying acknowledgement/negative acknowledgement (ACK/NACK) information and rank indication (RI) information, and a second subset of layers having a total number of layers L 2  used for a second codeword transmission carrying ACK/NACK information, RI information, and channel quality information (CQI). A total number of coded symbols N ACK  used for carrying ACK/NACK information is generated by repeating N ACK /(L 1 +L 2 ) coded symbols across each of the L 1  and L 2  layers. A total number of coded symbols N RI  used for carrying RI information is generated by repeating Aim N RI /(L 1 +L 2 ) coded symbols across each of the L 1  and L 2  layers, and a total number of coded symbols N CQI  is used for carrying CQI and N CQI /L 2  coded symbols are mapped across each of the L 2  layers. 
         [0030]    A subscriber station is provided. The subscriber station includes a transmit path circuitry configured to transmit a multiple-input multiple-output (MIMO) uplink subframe from a subscriber station, the MIMO uplink subframe having a first subset of layers having a total number of layers L 1  used for a first codeword transmission carrying acknowledgement/negative acknowledgement (ACK/NACK) information and rank indication (RI) information, and a second subset of layers having a total number of layers L 2  used for a second codeword transmission carrying ACK/NACK information, RI information, and channel quality information (CQI). A total number of coded symbols N ACK  used for carrying ACK/NACK information is generated by repeating N ACK /(L 1 +L 2 ) coded symbols across each of the L 1  and L 2  layers. A total number of coded symbols N RI  used for carrying RI information is generated by repeating N RI /(L 1 +L 2 ) coded symbols across each of the L 1  and L 2  layers, and a total number of coded symbols N CQI  is used for carrying CQI and N CQI /L 2  coded symbols are mapped across each of the L 2  layers. 
         [0031]    A method of operating a subscriber station is provided. The method includes transmitting a multiple-input multiple-output (MIMO) uplink subframe from a subscriber station, the MIMO uplink subframe having a first subset of layers having a total number of layers L 1  used for a first codeword transmission carrying acknowledgement/negative acknowledgement (ACK/NACK) information and rank indication (RI) information, and a second subset of layers having a total number of layers L 2  used for a second codeword transmission carrying ACK/NACK information, RI information, and channel quality information (CQI). A total number of coded symbols N ACK  used for carrying ACK/NACK information is generated by repeating N ACK /(L 1 +L 2 ) coded symbols across each of the L 1  and L 2  layers. A total number of coded symbols N RI  used for carrying RI information is generated by repeating N RI /(L 1 +L 2 ) coded symbols across each of the L 1  and L 2  layers, and a total number of coded symbols N CQI  is used for carrying CQI and N CQI /L 2  coded symbols are mapped across each of the L 2  layers. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0032]      FIG. 1  is a diagram illustrating a procedure for processing data and UCI in uplink of a legacy LTE system on the transport channel and physical channel levels; 
           [0033]      FIG. 2  is a diagram illustrating an uplink (UL) channel interleaver-layer mapping relationship in the legacy LTE system; 
           [0034]      FIG. 3  is a diagram illustrating a mapping relationship between a single uplink channel interleaver and a single layer according to a first embodiment of this disclosure; 
           [0035]      FIG. 4  is a diagram illustrating a procedure of a transmitter processing data and UCI on the transport and physical channels according to a second embodiment of this disclosure; 
           [0036]      FIG. 5  is a diagram illustrating a mapping relationship between a single uplink channel interleaver and two layers according to the second embodiment of this disclosure; 
           [0037]      FIG. 6  is a diagram illustrating a procedure of a transmitter for processing data and UCI on the transport and physical channels according to a third embodiment of this disclosure; 
           [0038]      FIG. 7  is a block diagram illustrating a configuration of a receiver for use in the second and third embodiments of this disclosure; 
           [0039]      FIG. 8  is a diagram illustrating per-layer uplink channel interleaving according to a fourth embodiment of this disclosure; 
           [0040]      FIG. 9  is a diagram illustrating a procedure of a transmitter processing data and UCI on the transport and physical channels according to the fourth embodiment of this disclosure; 
           [0041]      FIG. 10  is a block diagram illustrating a configuration of a receiver for use in the fourth embodiment of this disclosure; 
           [0042]      FIG. 11  is a diagram illustrating a configuration of a channel interleaver when the ACK and RI symbols are repeated on all of the layers according to an embodiment of this disclosure; and 
           [0043]      FIG. 12  is a diagram illustrating a CQI and data multiplexing according to an embodiment of this disclosure. 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0044]    Embodiments of this disclosure are described with reference to accompanying formulas and drawings. 
         [0045]    Although the description is directed to the 3GPP Evolved Universal Terrestrial Radio Access (EUTRA, also referred to as LTE) or Advanced E-UTRA (also referred to as LTE-A) standards in the following, this disclosure is not limited thereto but can be applied to other communication systems based on the similar technical background and channel formats with minor modifications without departing from the scope of this disclosure as understood by those skilled in the art. 
         [0046]    This disclosure discloses a method for transmitting the UCI carried in a codeword as mapped to two layers and UCI carried in two codewords as mapped to multiple layers in the uplink of the LTE-Advanced system supporting multiple transmit antenna. 
         [0047]    First, a method for transmitting the UCI carried in a codeword as equally distributed on two layers is disclosed. For this purpose, an uplink channel-interleaving operation that takes into consideration a number of layers to which the codeword is mapped is disclosed. According to an embodiment of this disclosure, the uplink channel interleaver is designed to operate by taking in consideration time, frequency and the number of transmission layers. Also, some modifications are disclosed in the procedure for processing the data and UCI information of the transport layer and physical layer according to the disclosed uplink channel interleaver. 
         [0048]    Second, a method for transmitting a single codeword on two layers with uplink channel interleavers responsible for respective transmission layers is disclosed. For the case in which each layer is provided with a dedicated uplink channel interleaver, some modifications are disclosed in the procedure for processing the data and UCI information. 
         [0049]    This disclosure also discloses a method for transmitting UCI on multiple layers when two codewords are mapped to multiple layers. 
         [0050]    In LTE, one codeword and one antenna are used in the uplink such that only one layer is used for transmitting the PUSCH carrying Uplink Control Information (UCI). That is, only rank-1 transmission is supported. Meanwhile, LTE-A supports up to two codewords and 4 transmit antennas such that up to 4 layers can be used for transmission. That is, rank-4 transmission is possible in the LTE-A system. In the LTE-A system supporting up to two codewords and up to four antennas, the following scenario is possible. 
         [0051]    Rank-1 transmission 
         [0052]    CW 0  is mapped to layer 1   
         [0053]    Rank-2 transmission 
         [0054]    CW 0  is mapped to layer 1   
         [0055]    CW 1  is mapped to layer 2   
         [0056]    Rank-3 transmission 
         [0057]    CW 0  is mapped to layer 1   
         [0058]    CW 1  is mapped to layer 2  and layer 3   
         [0059]    Rank-4 transmission 
         [0060]    CW 0  is mapped to layer 1  and layer 2   
         [0061]    CW 1  is mapped to layer 3  and layer 4   
         [0062]    In the case in which one codeword is mapped to one layer, CW 0  is mapped to layer 1  for rank-1 transmission, CW 0  to layer 1  or CW 1  to layer 2  for rank-2 transmission, and CW 0  to layer 1  for rank-3 transmission, such that the channel interleaver operation in LTE can be applied without modification. 
         [0063]    In the case in which one codeword is mapped to two layers, CW 1  is mapped to layer 2  and layer 3  for rank-3 transmission. CW 0  is mapped to layer 1  and layer 2  and CW 1  is mapped to layer 3  and layer 4  for rank-4 transmission. When one codeword is mapped to two layers, the uplink channel interleaver operates as follows. 
         [0064]      FIG. 3  is a diagram illustrating a mapping relationship between a single uplink channel interleaver and a single layer according to a first embodiment of this disclosure. 
         [0065]    Assuming that QPSK modulation is used in  FIG. 3 , Q m =2, and the coded symbol of RI  307  is 2-bit long. 
         [0066]    In  FIG. 3 , r 1 , r 2 , r 3 , r 4 , r 5 , r 6 , r 7 , r 8 , r 9 , r 10 , r 11 , r 12 , r 13 , r 14 , r 15 , and r 16  are indices of coded symbols of RI and arranged in the uplink channel interleaver  301 . 
         [0067]    The numbers  1  to  32  are the indices of coded symbols of CQI and arranged in the uplink channel interleaver  301  as shown in  FIG. 3 . Assuming QPSK modulation, the coded symbols of CQI  304  consists of two bits. In the interleaver  301  of  FIG. 3 , the first and second index bits constitute the first coded symbol of CQI, the third and fourth index bits constitute the second coded symbol of CQI, and so on until the 31st and 32nd index bits constitute the 16th coded symbol. 
         [0068]    In  FIG. 3 , numbers  33  to  96  are index bits constituting a coded codeblock 0  and arranged as shown in the uplink channel interleaver  301 , and numbers  97  to  176  are index bits constituting a coded codeblock 1 . Since QPSK is assumed in  FIG. 3 , the coded symbol  305  of codeblock 0  consists of two bits. Also, the coded symbol  306  of codeblock 1  consists of two bits. 
         [0069]    In  FIG. 3 , the index bits of  147 ,  148 ,  149 ,  150 ,  155 ,  156 ,  157 ,  158 ,  163 ,  164 ,  165 ,  166 ,  171 ,  172 ,  173 , and  174  constituting the code block are overlaid by coded ACK bits. Since QPSK modulation is assumed in  FIG. 3 , the coded symbol  308  of ACK consist of two bits. The positions of the index bits that are sequentially mapped to the coded ACK bits are indicated by  163 ,  164 ,  173 ,  174 ,  171 ,  172 ,  165 ,  166 ,  147 ,  148 ,  157 ,  158 ,  155 ,  156 ,  1   49 , and  150 . 
         [0070]    In the case in which the channel interleaver  301  of  FIG. 3  is used without modification, one codeword can be mapped to two layers as follows. The uplink channel interleaver  301  of  FIG. 3  reads out data downward from the first column in unit of symbol. After all of the symbols of the first column are read out completely, the symbols of the second column are read. In the first embodiment, Q m =2 and the symbols in the uplink channel interleaver  301  have to be mapped to the two layers (Layer# 1  and Layer# 2 ) as denoted by reference numbers  302  and  303  such that, if mapping starts from the first column, the CQI symbol composed of the bits located at the positions indicated by 1 and 2 in the uplink channel interleaver  301  is scrambled first, modulated to a modulation symbol by the modulation mapper, and then mapped to the layer# 1  at first. The CQI symbol composed of bits located at the positions indicated by 25 and 26 in the uplink channel interleaver  301  is scrambled first, modulated to a modulation symbol by the modulation mapper, and then mapped to the layer# 2   303  at first. In  FIG. 3 , the symbols on layer# 1  and layer# 2  should be expressed as modulation symbols. For example, when Q m =2, the QPSK modulation mapping is expressed by 
         [0000]    
       
         
           
             
               1 
               
                 2 
               
             
             + 
             
               
                 1 
                 
                   2 
                 
               
                
               j 
             
           
         
       
     
         [0000]    for 00 (bits of the symbol), 
         [0000]    
       
         
           
             
               1 
               
                 2 
               
             
             - 
             
               
                 1 
                 
                   2 
                 
               
                
               j 
             
           
         
       
     
         [0000]    for 01, 
         [0000]    
       
         
           
             
               - 
               
                 1 
                 
                   2 
                 
               
             
             + 
             
               
                 1 
                 
                   2 
                 
               
                
               j 
             
           
         
       
     
         [0000]    for 10, and 
         [0000]    
       
         
           
             
               - 
               
                 1 
                 
                   2 
                 
               
             
             - 
             
               
                 1 
                 
                   2 
                 
               
                
               j 
             
           
         
       
     
         [0000]    for 11. 
         [0071]    In this embodiment, however, the bit indices generated by the uplink channel interleaver  301  are used in place of the modulation symbols in order to explain how the indices are mapped to the layers. 
         [0072]    The symbol of the codeblock 0  which is composed of the bits located at the index positions  49  and  50  of the uplink channel interleaver  301  is mapped to layer# 1   302 , and the symbol of the codeblock 0  which is composed of the bits located at the index positions  73  and  74  is mapped to Layer# 2   303 . The symbol of the codeblock 1  which is composed of the bits located at the index positions  97  and  98  is mapped to the layer# 1   302 , and the symbol of the codeblock 1  which is composed of the bits located at the index positions  121  and  122  is mapped to the layer# 2   303 . The symbol of the codeblock 1  which is composed of the bits located at the index positions  145  and  146  is mapped to the layer# 1   302 , and the symbol of the codeblock 1  which is composed of the bits located at the index positions  161  and  162  is mapped to the layer# 2   303 . After mapping the symbols of the first column of the uplink channel interleaver  301  to the layer# 1   302  and the layer# 2   303 , the data of the second column of the uplink channel interleaver  301  are mapped to the layer# 1   302  and the layer# 2   303  as follows. The CQI symbol composed of the bits located at the index positions  3  and  4  is mapped to layer# 1   302 , and the CQI symbol composed of the bits located at the index positions  27  and  28  is mapped to layer# 2   303 . Next, the symbol of codeblock 0  which is composed of the bits located at the index positions  51  and  52  is mapped to Layer# 1   302 , and the symbol of codeblock 0  which is composed of the bits located at the index positions  75  and  76  is mapped to layer# 2   303 . The symbol of codeblock 1  which is composed of the bits located at the index positions  99  and  100  is mapped to Layer# 1   302 , and the symbol of codeblock 1  which is composed of the bits located at the index positions  123  and  124  is mapped to layer# 2   303 . The RI symbol composed of the bits located at the positions r 9  and r 10  is mapped to layer# 1   302 , and the RI symbol composed of the bits located at the positions r 1  and r 2  is mapped to layer# 2   303 . If the symbols of the interleaver  301  are mapped to the layer# 1   302  and layer# 2   303  as described above, the CQI bits are unequally distributed on layer# 1   302  and layer# 2   303 . As shown in  FIG. 3 , the CQI symbols are mapped to the bit positions  1  to  24  on layer# 1  and the bit positions  25  to  32  on layer# 2 . 
         [0073]    In order to solve the unequal distribution problem of the first embodiment in which the coded CQI symbols are distributed to layer# 1  and layer# 2  unequally, a second embodiment of this disclosure discloses a method of writing data to the uplink channel interleaver that takes into consideration the number of transmission layers. 
         [0074]      FIG. 4  is a diagram illustrating a procedure of a transmitter processing data and UCI on the transport and physical channels according to the second embodiment of this disclosure. 
         [0075]    A description can be made with equations as follows. At steps  407  and  408  of  FIG. 4 , the UE determines a number of coded symbols Q /  with Equation 1 for RI or ACK transmission. In Equation 1, ◯ is a number of bits of the ACK or RI, and the parameters are defined as shown in Table 1. 
         [0000]    
       
         
           
             
               
                 
                   
                     Q 
                     / 
                   
                   = 
                   
                     
                       min 
                       ( 
                       
                         
                           ⌈ 
                           
                             
                               O 
                               · 
                               
                                 M 
                                 SC 
                                 
                                   PUSCH 
                                   - 
                                   initial 
                                 
                               
                               · 
                               
                                 N 
                                 SYMB 
                                 
                                   PUSCH 
                                   - 
                                   initial 
                                 
                               
                               · 
                               
                                 β 
                                 OFFSET 
                                 PUSCH 
                               
                             
                             
                               
                                 ∑ 
                                 
                                   τ 
                                   = 
                                   0 
                                 
                                 
                                   C 
                                   - 
                                   1 
                                 
                               
                                
                               
                                 K 
                                 τ 
                               
                             
                           
                           ⌉ 
                         
                         , 
                         
                           4 
                            
                           
                               
                           
                            
                           
                             M 
                             SC 
                             PUSCH 
                           
                         
                       
                       ) 
                     
                     . 
                   
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     1 
                   
                   ] 
                 
               
             
           
         
       
     
         [0000]    
       
         
               
             
               
               
             
           
               
                 TABLE 1 
               
               
                   
               
               
                 definitions of parameters used in Equation 1 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                   
                 The number of ACK/NACK, or RI, 
               
               
                 M SC   PUSCH-initial   
                 Initially scheduled bandwidth for the same TB, 
               
               
                   
                 expressed as number of subcarriers 
               
               
                 M SC   PUSCH   
                 scheduled bandwidth for the current PUSCH in 
               
               
                   
                 the unit of subcarrier 
               
               
                 C 
                 number of codeblocks for the TB 
               
               
                 K r   
                 number of bits for code block number r 
               
               
                 β OFFSET   PUSCH   
                 offsets configured by higher layers 
               
               
                 N SYMB   PUSCH-initial   
                 number of SC-FDMA symbols in the subframe for 
               
               
                   
                 initial PUSCH transmission 
               
               
                 N SYMB   
                 number of SC-FDMA symbols in the current PUSCH 
               
               
                   
                 transmission subframes 
               
               
                   
               
             
          
         
       
     
         [0076]    A number of total coded HARQ-ACK bits is calculated by Equation 2 where Q ACK  denotes the number of total bits of the coded ACK, Q m  denotes a number of bits per symbol (2 for QPSK, 4 for 16QAM, and 6 for 64QAM). N denotes a number of layers to which one codeword is mapped. 
         [0000]        Q   ACK   =Q   m   ·Q   /   ACK   ·N.    [Eqn. 2]
 
         [0077]    For example, when Q /   ACK =4, Q m =2, and N=2; Q ACK  is 16. Since Q ACK  is 16, q 0   ACK , q 1   ACK , . . . , q Q     ACK−1    is generated by concatenating the coded values of Table 3 and can be expressed by Equation 3. 
         [0000]        q   0   ACK   , q   1   ACK   , . . . , q   Q     ACK−1     ACK   =[o   0   ACK    o   1   ACK    o   2   ACK    o   0   ACK    o   1   ACK    o   2   ACk    o   0   ACK    o   1   ACK    o   2   ACK    o   0   ACK    o   1   ACK    o   2   ACK    o   0   ACK    o   1   ACK    o   2   ACK    o   0   ACK ].   [Eqn 3]
 
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 2 
               
             
             
               
                   
               
               
                 encoding of 1-bit HARQ-ACK 
               
             
          
           
               
                   
                 Q m   
                 Encoded HARQ-ACK 
               
               
                   
                   
               
               
                   
                 2 
                 [o 0   ACK  y] 
               
               
                   
                 4 
                 [o 0   ACK  y x x] 
               
               
                   
                 6 
                 [o 0   ACK  y x x x x] 
               
               
                   
                   
               
             
          
         
       
     
         [0000]    
       
         
               
             
               
               
             
           
               
                 TABLE 3 
               
             
             
               
                   
               
               
                 encoding of 2-bit HARQ-ACK 
               
             
          
           
               
                 Q m   
                 Encoded HARQ-ACK 
               
               
                   
               
               
                 2 
                 [o 0   ACK  o 1   ACK  o 2   ACK  o 0   ACK  o 1   ACK  o 2   ACK ] 
               
               
                 4 
                 [o 0   ACK  o 1   ACK  x x o 2   ACK  o 0   ACK  x x o 1   ACK  o 2   ACK  x x] 
               
               
                 6 
                 [o 0   ACK  o 1   ACK  x x x x o 2   ACK  o 0   ACK  x x x x o 1   ACK  o 2   ACK  x x x x] 
               
               
                   
               
             
          
         
       
     
         [0078]    The vector sequence output of the channel coding of ACK information value can be expressed by Equation 4. Here, Q /   ACK =Q ACK /Q m /N, and it is processed according to Equation 5a. 
         [0000]    
       
         
               
               
               
             
           
               
                   
                   
               
             
             
               
                   
                   q 0   ACK   ,  q 1   ACK   , . . . ,  q Q /   ACK−1     ACK   . 
                 [Eqn. 4] 
               
               
                   
                 Set i, k to 0 
                 [Eqn. 5a] 
               
               
                   
                 while i &lt; Q ACK   
                   
               
               
                   
                   q k   ACK    = [q i   ACK  . . . q i+Q     m     ·N−1   ACK ] T   
                   
               
               
                   
                 i = i + Q m  · N 
                   
               
               
                   
                 k = k + 1 
                   
               
               
                   
                 end while 
               
               
                   
                   
               
             
          
         
       
     
         [0079]    In some embodiments, it is processed according to Equation 5b as follows: 
         [0000]    
       
         
               
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 set i, k to 0 
                 [Eqn. 5b] 
               
               
                   
                 while i &lt; Q ACK   
                   
               
               
                   
                 if N = 1, 
                   
               
               
                   
                    q   k   ACK  = [q i   ACK  . . . q i+Q     m     −1   ACK ] T   
                   
               
               
                   
                 elseif N = 2, 
                   
               
               
                   
                    q   k   ACK  = [q i   ACK  . . . q i+Q     m     −1   ACK q i   ACK  . . . q i+Q     m     -1   ACK ] T   
                   
               
               
                   
                 end if 
                   
               
               
                   
                 i = i + Q m  · N 
                   
               
               
                   
                 k = k + 1 
                   
               
               
                   
                 end while. 
               
               
                   
                   
               
             
          
         
       
     
         [0080]    In order to indicate the number of total RI bits, Equation 6 is used at step  407  of  FIG. 4 , where Q RI  denotes a number of total coded RI bits, and Q m  denotes a number of bits per modulation symbol (2 for QPSK, 4 for 16QAM, and 6 for 64QAM). denotes a number of layers to which one codeword is mapped. 
         [0000]        Q   RI   =Q   m   ·Q/   RI   ·N    [Eqn. 6]
 
         [0081]    For example, when , and Q/ RI =4, Q m =2; and N=2, Q RI  is 16. Since Q ACK  is 16, q 0   RI , q 1   RI , . . . , q Q     RI−1     RI  is generated by concatenating the coded values of table 5 and can be expressed by Equation 7. In case that the maximum rank of RI is 2, the encoded values of table 4 are used. 
         [0000]        q   0   RI   , q   1   RI   , . . . , q   Q     RI−1     RI   =[o   0   RI    o   1   RI    o   2   RI    o   0   RI    o   1   RI    o   2   RI    o   0   RI    o   1   RI    o   2   RI    o   0   RI    o   1   RI    o   2   RI    o   0   RI    o   1   RI  o 2   RI  o 0   RI ][Eqn. 7] 
         [0000]    
       
         
               
               
               
             
           
               
                   
                 TABLE 4 
               
               
                   
                   
               
               
                   
                 Q m   
                 Encoded RI 
               
               
                   
                   
               
             
             
               
                   
                 2 
                 [o 0   RI  y] 
               
               
                   
                 4 
                 [o 0   RI  y x x] 
               
               
                   
                 6 
                 [o 0   RI  y x x x x] 
               
               
                   
                   
               
             
          
         
       
     
         [0000]    
       
         
               
               
               
             
           
               
                   
                 TABLE 5 
               
               
                   
                   
               
               
                   
                 Q m   
                 Encoded RI 
               
               
                   
                   
               
             
             
               
                   
                 2 
                 [o 0   RI  o 1   RI  o 2   RI  o 0   RI  o 1   RI  o 2   RI ] 
               
               
                   
                 4 
                 [o 0   RI  o 1   RI  x x o 2   RI  o 0   RI  x x o 1   RI  o 2   RI  x x] 
               
               
                   
                 6 
                 [o 0   RI  o 1   RI  x x x x o 2   RI  o 0   RI  x x x x o 1   RI  o 2   RI  x x x x] 
               
               
                   
                   
               
             
          
         
       
     
         [0082]    The vector sequence output of the channel coding of RI information value can be expressed by Equation 8. Here, Q /   RI =Q RF /Q m /N and is processed according to Equation 9a. Equation 9a, a number of layers is taken into account. 
         [0000]    
       
         
               
               
               
             
           
               
                   
                   
               
             
             
               
                   
                   q 0   RI   ,  q 1   RI   , . . . ,  q Q /   RI−1     RI   . 
                 [Eqn. 8] 
               
               
                   
                 Set i, k to 0 
                 [Eqn. 9a] 
               
               
                   
                 while i &lt; Q RI   
                   
               
               
                   
                   q k   RI    = [q i   RI  . . . q i+Q     m     ·N−1   RI ] T   
                   
               
               
                   
                 i = i + Q m  · N 
                   
               
               
                   
                 k = k + 1 
                   
               
               
                   
                 end while 
               
               
                   
                   
               
             
          
         
       
     
         [0083]    In some embodiments, Q /   RI =Q RI /Q m /N and is processed according to Equation 9b as follows: 
         [0000]    
       
         
               
               
             
           
               
                   
               
             
             
               
                 set i, k to 0 
                 [Eqn. 9b] 
               
               
                 while i &lt; Q RI   
                   
               
               
                   if N = 1, 
                   
               
               
                      q   k   RI  = [q i   RI  . . . q i+Q     m     -1   RI ] T   
                   
               
               
                 elseif N = 2, 
                   
               
               
                      q   k   RI  = [q i   RI  . . . q i+Q     m     −1   RI q i   RI  . . . q i+Q     m     -1   RI ] T   
                   
               
               
                 end if 
                   
               
               
                 i = i + Q m  · N 
                   
               
               
                 k = k + 1 
                   
               
               
                 end while. 
               
               
                   
               
             
          
         
       
     
         [0084]    At step  406  of  FIG. 4 , the UE determines the number of coded symbols Q /  using Equation 10 for CQI transmission. Here, denotes a number of bits of CQI, denotes the bandwidth scheduled for PUSCH transmission in the current subframe and expressed as number of subcarriers. N SYMB   PUSCH-initial  is a number of SC-FDMA symbols per subframe used in initial transmission. The parameters are defined as shown in Table 6. 
         [0000]    
       
         
           
             
               
                 
                   
                     Q 
                     / 
                   
                   = 
                   
                     
                       min 
                       ( 
                       
                         
                           ⌈ 
                           
                             
                               
                                 ( 
                                 
                                   O 
                                   + 
                                   L 
                                 
                                 ) 
                               
                               · 
                               
                                 M 
                                 SC 
                                 
                                   PUSCH 
                                   - 
                                   initial 
                                 
                               
                               · 
                               
                                 N 
                                 SYMB 
                                 
                                   PUSCH 
                                   - 
                                   initial 
                                 
                               
                               · 
                               
                                 β 
                                 OFFSET 
                                 PUSCH 
                               
                             
                             
                               
                                 ∑ 
                                 
                                   τ 
                                   = 
                                   0 
                                 
                                 
                                   C 
                                   - 
                                   1 
                                 
                               
                                
                               
                                 K 
                                 τ 
                               
                             
                           
                           ⌉ 
                         
                         , 
                         
                             
                         
                          
                         
                           
                             
                               M 
                               SC 
                               PUSCH 
                             
                             · 
                             
                               N 
                               SYMB 
                               PUSCH 
                             
                           
                           - 
                           
                             
                               Q 
                               RI 
                             
                             
                               
                                 Q 
                                 m 
                               
                               · 
                               N 
                             
                           
                         
                       
                       ) 
                     
                     . 
                   
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     10 
                   
                   ] 
                 
               
             
           
         
       
     
         [0000]    
       
         
               
               
               
             
           
               
                   
                 TABLE 6 
               
               
                   
                   
               
             
             
               
                   
                 O 
                 number of CQI bits 
               
               
                   
                 M SC   PUSCH-initial   
                 Initially scheduled bandwidth for the 
               
               
                   
                   
                 same TB, expressed as # of subcarriers 
               
               
                   
                 M SC   PUSCH   
                 scheduled bandwidth for the current  
               
               
                   
                   
                 PUSCH in the unit of subcarrier 
               
               
                   
                 C 
                 number of codeblocks for the TB 
               
               
                   
                 K τ   
                 number of bits for code block number r 
               
               
                   
                 β OFFSET   PUSCH   
                 offsets configured by higher layers 
               
               
                   
                 N SYMB   PUSCH-initial   
                 number of SC-FDMA symbols in the  
               
               
                   
                   
                 subframe for initial PUSCH transmission 
               
               
                   
                 N SYMB   
                 number of SC-FDMA symbols in the  
               
               
                   
                   
                 current PUSCH transmission subframes 
               
               
                   
                 L 
                 the number of CRC bits where 
               
               
                   
                   
                 
                   
                     
                       
                         L 
                         = 
                         
                           { 
                           
                             
                               
                                 
                                   0 
                                 
                                 
                                   
                                     O 
                                     ≤ 
                                     11 
                                   
                                 
                               
                               
                                 
                                   8 
                                 
                                 
                                   otherwise 
                                 
                               
                             
                             , 
                           
                         
                       
                     
                   
                 
               
               
                   
                   
               
             
          
         
       
     
         [0085]    In order to calculate the total CQI bits, Equation 11 is used. In Equation 11, Q CQI  denotes the total number of bits of coded CQI, Q m  denotes the number of bits per symbol (2 for QPSK, 4 for 16QAM, and 6 for 64QAM). Q /   CQI  denotes the number of symbols coded by Equation 10. N denotes the number of layers to which one codeword is mapped. 
         [0000]        Q   CQI   =Q   m   ·Q   /   CQI   ·N    [Eqn. 11]
 
         [0086]    The coded CQI/PMI bits are expressed by Equation 12. 
         [0000]        b   0   , b   1   , b   2   , . . . , b   B−1  where B=32   [Eqn. 12]
 
         [0087]    Equation 12 is derived from Equation 13 and Table 7. 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       b 
                       i 
                     
                     = 
                     
                       
                         ∑ 
                         
                           n 
                           = 
                           0 
                         
                         
                           O 
                           - 
                           1 
                         
                       
                        
                       
                         
                           ( 
                           
                             
                               o 
                               n 
                             
                             · 
                             
                               M 
                               
                                 i 
                                 - 
                                 n 
                               
                             
                           
                           ) 
                         
                          
                         mod 
                          
                         
                             
                         
                          
                         2 
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     
                       
                         where 
                          
                         
                             
                         
                          
                         i 
                       
                       = 
                       0 
                     
                     , 
                     1 
                     , 
                     
                       
                         2 
                          
                         
                             
                         
                          
                         … 
                          
                         
                             
                         
                          
                         B 
                       
                       - 
                       1. 
                     
                   
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     13 
                   
                   ] 
                 
               
             
           
         
       
     
         [0000]    
       
         
               
             
               
               
               
               
               
               
               
               
               
               
               
               
             
           
               
                 TABLE 7 
               
             
             
               
                   
               
               
                 Basis sequences for (32, 0) code 
               
             
          
           
               
                 i 
                 M i,0   
                 M i,1   
                 M i,2   
                 M i,3   
                 M i,4   
                 M i,5   
                 M i,6   
                 M i,7   
                 M i,8   
                 M i,9   
                 M i,10   
               
               
                   
               
               
                  0 
                 1 
                 1 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 1 
               
               
                  1 
                 1 
                 1 
                 1 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 1 
                 1 
               
               
                  2 
                 1 
                 0 
                 0 
                 1 
                 0 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
               
               
                  3 
                 1 
                 0 
                 1 
                 1 
                 0 
                 0 
                 0 
                 0 
                 1 
                 0 
                 1 
               
               
                  4 
                 1 
                 1 
                 1 
                 1 
                 0 
                 0 
                 0 
                 1 
                 0 
                 0 
                 1 
               
               
                  5 
                 1 
                 1 
                 0 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
                 0 
                 1 
               
               
                  6 
                 1 
                 0 
                 1 
                 0 
                 1 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
               
               
                  7 
                 1 
                 0 
                 0 
                 1 
                 1 
                 0 
                 0 
                 1 
                 1 
                 0 
                 1 
               
               
                  8 
                 1 
                 1 
                 0 
                 1 
                 1 
                 0 
                 0 
                 1 
                 0 
                 1 
                 1 
               
               
                  9 
                 1 
                 0 
                 1 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
                 1 
                 1 
               
               
                 10 
                 1 
                 0 
                 1 
                 0 
                 0 
                 1 
                 1 
                 1 
                 0 
                 1 
                 1 
               
               
                 11 
                 1 
                 1 
                 1 
                 0 
                 0 
                 1 
                 1 
                 0 
                 1 
                 0 
                 1 
               
               
                 12 
                 1 
                 0 
                 0 
                 1 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
                 1 
               
               
                 13 
                 1 
                 1 
                 0 
                 1 
                 0 
                 1 
                 0 
                 1 
                 0 
                 1 
                 1 
               
               
                 14 
                 1 
                 0 
                 0 
                 0 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
                 1 
               
               
                 15 
                 1 
                 1 
                 0 
                 0 
                 1 
                 1 
                 1 
                 1 
                 0 
                 1 
                 1 
               
               
                 16 
                 1 
                 1 
                 1 
                 0 
                 1 
                 1 
                 1 
                 0 
                 0 
                 1 
                 0 
               
               
                 17 
                 1 
                 0 
                 0 
                 1 
                 1 
                 1 
                 0 
                 0 
                 1 
                 0 
                 0 
               
               
                 18 
                 1 
                 1 
                 0 
                 1 
                 1 
                 1 
                 1 
                 1 
                 0 
                 0 
                 0 
               
               
                 19 
                 1 
                 0 
                 0 
                 0 
                 0 
                 1 
                 1 
                 0 
                 0 
                 0 
                 0 
               
               
                 20 
                 1 
                 0 
                 1 
                 0 
                 0 
                 0 
                 1 
                 0 
                 0 
                 0 
                 1 
               
               
                 21 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
                 0 
                 0 
                 0 
                 1 
                 1 
               
               
                 22 
                 1 
                 0 
                 0 
                 0 
                 1 
                 0 
                 0 
                 1 
                 1 
                 0 
                 1 
               
               
                 23 
                 1 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
                 0 
                 1 
                 1 
                 1 
               
               
                 24 
                 1 
                 1 
                 1 
                 1 
                 1 
                 0 
                 1 
                 1 
                 1 
                 1 
                 0 
               
               
                 25 
                 1 
                 1 
                 0 
                 0 
                 0 
                 1 
                 1 
                 1 
                 0 
                 0 
                 1 
               
               
                 26 
                 1 
                 0 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
                 1 
                 1 
                 0 
               
               
                 27 
                 1 
                 1 
                 1 
                 1 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
                 0 
               
               
                 28 
                 1 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
               
               
                 29 
                 1 
                 0 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 0 
                 0 
               
               
                 30 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
               
               
                 31 
                 1 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
               
               
                   
               
             
          
         
       
     
         [0088]    The output sequence q 0 , q 1 , q 2 , . . . , q Q     CQI-1    is obtained by cyclic repetition of the CQI/PMI bits encoded using Equation 14. 
         [0000]        q   i   =b ( i  mod  B ) where  i= 0, 1, 2, . . . ,  Q   CQI −1.   Eqn. 14]
 
         [0089]    In  FIG. 4 , a CRC is attached to each Transport Block (TB) at step  401 . The CRC-attached TB is segmented into code blocks and the CRC is attached to individual code blocks again at step  402 . Next, channel coding is performed on the CRC-attached code blocks at step  403 , rate matching is performed on the channel-coded code blocks at step  404 , and then the channel-coded code blocks are concatenated at step  405 . The UL-SCH data of which total number of coded bits is G are expressed by Equation 15. 
         [0000]        f   0   , f   1   , . . . , f   G−1 .   [Eqn. 15]
 
         [0090]    The CQI data of which total number of coded bits is C CQI  can be expressed by Equation 16. 
         [0000]        q   0   , q   1   , . . . , q   Q     CQI     −1 .   [Eqn. 16]
 
         [0091]    At step  409  of  FIG. 4 , the code blocks concatenated at step  405  and the CQI channel-coded symbols at step  406  are multiplexed (data and control multiplexing) at step  409 , and the vector sequence output of the multiplexed signal is expressed by Equation 17. In Equation 17, H=(G+Q CQI ) and H / =H/Q m /N. Equation 18 shows the vector sequence output process under the assumption of N transmission layers. 
         [0000]    
       
         
               
               
             
               
               
             
               
               
             
               
               
               
             
               
               
             
               
               
               
             
           
               
                   
               
             
             
               
                 g 0 , g 1 ,...,g H   |  − 1. 
                 [Eqn. 17] 
               
               
                 set i, j, k to 0 
               
             
          
           
               
                 while j &lt; Q CQI   
                 (placement of control information) 
               
             
          
           
               
                   
                   g   k  = [q j ...q j+Q     m     ·N−1 ] T   
               
               
                   
                 j = j + Q m  · N 
               
               
                   
                 k = k + 1 
               
               
                   
                 end while, 
               
             
          
           
               
                   
                 while i &lt; G 
                 (placement of data) 
               
             
          
           
               
                   
                   g   k  = [f i ...f i+Q     m     ·N−1 ] T   
               
               
                   
                 i = i + Q m  · N 
               
               
                   
                 k = k + 1 
               
             
          
           
               
                   
                 end while. 
                 [Eqn. 18] 
               
               
                   
                   
               
             
          
         
       
     
         [0092]    The input to the channel interleaver at step  410  of  FIG. 4  is expressed as shown in Equation 19. 
         [0000]          g   0   ,    g   1   , . . . ,    g   H     /     −1   ,    q   0     RI ,    q   1     RI , . . . ,    q   Q     /       RI−1       RI ,    q   0     ACK ,    q   1     ACK , . . . ,    q   Q     /       ACK−1       ACK .   [Eqn. 19]
 
         [0093]    The output bit sequence of the channel interleaver  410  is obtained as follows. 
         [0094]    Step (1): C mux =N symb   PUSCH  is allocated for a number of columns of the channel interleaver matrix. number of rows of the channel interleaver matrix by taking into consideration the number of bits per symbol and the number of layers. Here, H // =H / +H /   RI . R /   mux =R mux /Q m /N takes in consideration the number of layers. 
         [0095]    Step (3): The RI values are written in the R mux ×C mux  channel interleaver according to Equation 20. The column set to be used is defined as shown in Table 8. 
         [0000]    
       
         
               
               
             
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 Set i,j to 0 
               
               
                   
                 Set r to R mux   |  − 1 
               
               
                   
                 while i &lt; Q RI   |   
               
               
                   
                 c RI  = ColumnSet(j) 
               
               
                   
                 y r  × C mux  + c RI  = q i   RI   
               
               
                   
                 i = i + 1 
               
               
                   
                 r = R mux   |  − 1 − └i/4┘ 
               
               
                   
                 j = (j + 3)mod4 
               
               
                   
                 end while 
               
             
          
           
               
                   
                 [Eqn. 20] 
               
               
                   
                   
               
             
          
         
       
     
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 8 
               
             
             
               
                   
               
               
                 Column Set for insertion of rank information 
               
             
          
           
               
                   
                 CP configuration 
                 Column Set 
               
               
                   
                   
               
               
                   
                 Normal 
                 {1, 4, 7, 10} 
               
               
                   
                 Extended 
                 {0, 3, 5, 8} 
               
               
                   
                   
               
             
          
         
       
     
         [0096]    Step (4): Generate a matrix of Equation 21 for  y k   = g k    in k=0, 1, . . . , H /− 1. At this time, skip the part occupied by the RI at step (3). 
         [0000]    
       
         
           
             
               
                 
                   
                     [ 
                     
                         
                     
                      
                     
                       
                         
                           
                             
                               y 
                               0 
                             
                             _ 
                           
                         
                         
                           
                             
                               y 
                               1 
                             
                             _ 
                           
                         
                         
                           … 
                         
                         
                           
                             
                               y 
                               
                                 
                                   C 
                                   max 
                                 
                                 - 
                                 1 
                               
                             
                             _ 
                           
                         
                         
                           
                               
                           
                         
                       
                       
                         
                           
                             
                               y 
                               
                                 C 
                                 max 
                               
                             
                             _ 
                           
                         
                         
                           
                             
                               y 
                               
                                 
                                   C 
                                   max 
                                 
                                 + 
                                 1 
                               
                             
                             _ 
                           
                         
                         
                           … 
                         
                         
                           
                             
                               y 
                               
                                 
                                   2 
                                    
                                   
                                     C 
                                     max 
                                   
                                 
                                 - 
                                 1 
                               
                             
                             _ 
                           
                         
                         
                           
                               
                           
                         
                       
                       
                         
                           ⋮ 
                         
                         
                           ⋮ 
                         
                         
                           ⋮ 
                         
                         
                           ⋱ 
                         
                         
                           ⋮ 
                         
                       
                       
                         
                           
                             
                               y 
                               
                                 
                                   ( 
                                   
                                     
                                       R 
                                       max 
                                       / 
                                     
                                     - 
                                     1 
                                   
                                   ) 
                                 
                                 × 
                                 
                                   C 
                                   max 
                                 
                               
                             
                             _ 
                           
                         
                         
                           
                             
                               y 
                               
                                 
                                   
                                     ( 
                                     
                                       
                                         R 
                                         max 
                                         / 
                                       
                                       - 
                                       1 
                                     
                                     ) 
                                   
                                   × 
                                   
                                     C 
                                     max 
                                   
                                 
                                 + 
                                 1 
                               
                             
                             _ 
                           
                         
                         
                           … 
                         
                         
                           
                             
                               y 
                               
                                 ( 
                                 
                                   
                                     
                                       R 
                                       max 
                                       / 
                                     
                                     × 
                                     
                                       C 
                                       max 
                                     
                                   
                                   - 
                                   1 
                                 
                                 ) 
                               
                             
                             _ 
                           
                         
                         
                           
                               
                           
                         
                       
                     
                      
                     
                         
                     
                     ] 
                   
                   . 
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     21 
                   
                   ] 
                 
               
             
           
         
       
     
         [0097]    Step (5): Overwrite the matrix generated at step (4) with HARQ-ACK values as Equation 22. The column set to be used is defined as shown in Table 9. 
         [0000]    
       
         
               
               
             
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 Set i,j to 0 
               
               
                   
                 Set r to R mux   | − 1 
               
               
                   
                 while i &lt; Q ACK   |   
               
               
                   
                 c ACK  = ColumnSet(j) 
               
               
                   
                 y r  × C mux  + c ACK  = q i   ACK   
               
               
                   
                 i = i + 1 
               
               
                   
                 r = R mux   | − 1 − └i/4┘ 
               
               
                   
                 j = (j + 3)mod4 
               
               
                   
                 end while 
               
             
          
           
               
                   
                 [Eqn. 22] 
               
               
                   
                   
               
             
          
         
       
     
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 9 
               
             
             
               
                   
               
               
                 Column Set for insertion of HARQ-ACK information 
               
             
          
           
               
                   
                 CP configuration 
                 Column Set 
               
               
                   
                   
               
               
                   
                 Normal 
                 {2, 3, 8, 9} 
               
               
                   
                 Extended 
                 {1, 2, 6, 7} 
               
               
                   
                   
               
             
          
         
       
     
         [0098]    Step (6): The bit sequence is read from the top of the first column of the R mux ×C mux  channel interleaver matrix download and then the next column after the previous column is read completely until the last column is read completely. 
         [0099]    If Q m =2 the the two bits positioned ahead of other bits among the four bits constituting the symbol  y r    in the channel interleaver are mapped to layer# 1 , and the two bits following the other bits among the four bits constituting the symbol  y r    in the channel interleaver are mapped to layer# 2 . 
         [0100]    If Q m =4, the four bits positioned ahead of other bits among the eight bits constituting the symbol  y r    in the channel interleaver are mapped to layer# 1 , and the four bits following the other bits among the eight bits constituting the symbol  y r    in the channel interleaver are mapped to layer# 2 . 
         [0101]    If Q m =6, the six bits positioned ahead of other bits among the twelve bits constituting the symbol  y r    in the channel interleaver are mapped to layer# 1 , and the six bits following the other bits among the twelve bits constituting the symbol  y r    in the channel interleaver are mapped to layer# 2 . 
         [0102]      FIG. 5  is a diagram illustrating a mapping relationship between a single uplink channel interleaver and two layers according to the second embodiment of this disclosure. 
         [0103]    Assuming two layers  502  and  503 , normal CP, and Q m =2, the RI symbols  507  encoded into the second, fifth, eighth, and eleventh columns of the uplink channel interleaver  501  are written at the index positions of r 1 , r 2 , r 3 , r 4 , r 5 , r 6 , r 7 , r 8 , r 9 , r 10 , r 11 , r 12 , r 13 , r 14 , r 15 , and r 16  as shown in  FIG. 5 . What is different from the first embodiment is that one encoded RI symbol consists of four bits in the second embodiment when Q m =2. This is because the channel interleaver  501  according to the second embodiment generates the symbol taking into consideration the number of layers N. 
         [0104]    When the first symbol of the first column of the uplink channel interleaver  501  is generated, the CQI bits  504  are written at the index positions  1 ,  2 ,  3 , and  4 . When the first symbols of the second column is generated, the CQI bits are written at the index positions  5 ,  6 ,  7 , and  8 . In this manner, the CQI bits are written at the index positions  1  to  32 . The uplink channel interleaver  501  writes the four bits constituting the first symbol  505  of codeblock 0  to the index positions  33 ,  34 ,  35 , and  36  and the four bits of the next symbol of codeblock 0  sequentially to the index positions  93 ,  94 ,  95 , and  96 . Next, the uplink channel interleaver  501  writes the four bits constituting the first symbol  506  of codebookl. As shown in  FIG. 5 , the bits of the symbols of codebookl are written sequentially at the index positions from  97  to  176 . At this time, the index positions r 1 , r 2 , r 3 , r 4 , r 5 , r 6 , r 7 , r 8 , r 9 , r 10 , r 11 , r 12 , r 13 , r 14 , r 15 , and r 16  occupied by the encoded RI bits are skipped. Finally, the coded ACK bits at symbols  508  are overwritten at the index position sets of  149 ,  150 ,  151 ,  152 ,  153 ,  154 ,  155 ,  156 ,  165 ,  166 ,  167 ,  168 ,  169 ,  170 ,  171 , and  172 . At this time, the ACK bits are sequentially written at the index positions  149 ,  150 ,  151 ,  152 ,  169 ,  170 ,  171 ,  172 ,  165 ,  166 ,  167 ,  168 ,  153 ,  154 ,  155 , and  156 . 
         [0105]    In the uplink channel interleaver  501 , the symbols are read downward from the first column in unit of symbol. After all of the symbols of the first column are read, the symbols of the next column are read. Since the symbols are written in the channel interleaver under the assumption of two layers and Q m =2 in the second embodiment of this disclosure, if the symbols are read from the first column to be mapped to the two layers, the bits located at the index positions  1  and  2  occupied by the first CQI symbol in the uplink channel interleaver  501  are scrambled (see step  411  of  FIG. 4 ), modulated into a modulation symbol (see step  412  of  FIG. 4 ), and then mapped to layer# 1   502  (see step  413  of  FIG. 4 ). The bits located at the index positions  3  and  4  occupied by the first CQI symbol in the uplink channel interleaver  501  are scrambled (see step  411  of  FIG. 4 ), modulated into a modulation symbol (see step  412  of  FIG. 4 ), and then mapped to layer# 2   503  (see step  413  of  FIG. 4 ). In  FIG. 5 , the symbols in layer# 1   502  and layer# 2   503  should actually be expressed as modulation symbols. For example, when Q m =2, the QPSK modulation mapping is expressed by 
         [0000]    
       
         
           
             
               1 
               
                 2 
               
             
             + 
             
               
                 1 
                 
                   2 
                 
               
                
               j 
             
           
         
       
     
         [0000]    for 00 (bits of the symbol), 
         [0000]    
       
         
           
             
               1 
               
                 2 
               
             
             - 
             
               
                 1 
                 
                   2 
                 
               
                
               j 
             
           
         
       
     
         [0000]    for 01, 
         [0000]    
       
         
           
             
               - 
               
                 1 
                 
                   2 
                 
               
             
             + 
             
               
                 1 
                 
                   2 
                 
               
                
               j 
             
           
         
       
     
         [0000]    for 10, and 
         [0000]    
       
         
           
             
               - 
               
                 1 
                 
                   2 
                 
               
             
             - 
             
               
                 1 
                 
                   2 
                 
               
                
               j 
             
           
         
       
     
         [0000]    for 11. In this embodiment, however, the bit indices generated by the uplink channel interleaver  501  are used in place of the modulation symbols in order to explain how the indices are mapped to the layers. 
         [0106]    The bits located at the index positions  49  and  50  occupied by the data symbol of codeblock 0  in the uplink interleaver  501  of  FIG. 5  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 1   502  at step  413  of  FIG. 4 . The bits located at the index positions  51  and  52  occupied by the data symbol of codeblock 0  in the uplink interleaver  501  of  FIG. 5  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 2   503  at step  413  of  FIG. 4 . The bits located at the index positions  97  and  98  occupied by the data symbol of codeblock 1  in the uplink interleaver  501  of  FIG. 5  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 1   502  at step  413  of  FIG. 4 . The bits located at the index positions  99  and  100  occupied by the data symbol of codeblock 1  in the uplink interleaver  501  of  FIG. 5  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 2   503  at step  413  of  FIG. 4 . The bits located at the index positions  145  and  146  occupied by the data symbol of codeblock 1  in the uplink interleaver  501  of  FIG. 5  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 1   502  at step  413  of  FIG. 4 . The bits located at the index positions  147  and  148  occupied by the data symbol of codeblock 1  in the uplink interleaver  501  of  FIG. 5  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 2   503  at step  413  of  FIG. 4 . 
         [0107]    After all of the symbols of the first column of the uplink channel interleaver  501  are read and mapped to the first column of layer# 1   502  and layer# 2   503 , the data of the second column of the uplink channel interleaver  501  are mapped to layer# 1   502  and layer# 2   503  as follows. The CQI bits at symbols  504  located at the index positions  5  and  6  occupied by the second CQI symbol in the uplink channel interleaver  501  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 1   502  at step  413  of  FIG. 4 . The CQI bits located at the index positions  7  and  8  occupied by the second CQI symbol in the uplink channel interleaver  501  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 2   503  at step  413  of  FIG. 4 . Next, the bits located at the index positions  53  and  54  occupied by a symbol of codeblock 0  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 1   502  at step  413  of  FIG. 4 . The bits located at the index positions  55  and  56  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 2   503  at step  413  of  FIG. 4 . The bits located at the index positions  101  and  102  occupied by a symbol of codeblock 1  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 1   502  at step  413  of  FIG. 4 . The bits located at the index positions  103  and  104  occupied by the symbols of codeblock 1  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 2   503  at step  413  of  FIG. 4 . The bits located at the index positions R 1  and R 2  occupied by an RI symbol in the uplink channel interleaver  501  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 1   502  at step  413  of  FIG. 4 . The bits located at the index positions R 3  and R 4  occupied by the RI symbol in the uplink channel interleaver  501  are scrambled at step  411  of  FIG. 4 , modulated into a modulation symbol at step  412  of  FIG. 4 , and mapped to layer# 2   503  at step  413  of  FIG. 4 . In the same manner, all the symbols from first to last column are mapped to layer# 1   502  and layer# 2   503 . 
         [0108]    After being mapped to the transmission layers at step  413  of  FIG. 4 , the codewords mapped to layer# 1  are processed in the procedure of steps  414 ,  415 ,  416 , and  417 , and the codewords mapped to layer# 2  are processed in the procedure of steps  418 ,  415 ,  420 , and  421 . That is, after step  413 , layer# 1   502  and layer# 2   503  are transformed by DFT at steps  414  and  418 , precoded by multiplying precoding matrix at step  415 , mapped to corresponding resources at steps  416  and  420 , and then transmitted through respective antenna ports in the form of SC-FDMA signals at steps  417  and  421 . 
         [0109]    In the second embodiment of this disclosure, the channel interleaver calculates a number of symbols according to the number of layers, each symbol consisting of a number bits equal to the value obtained by multiplying the number of bits of a modulation symbol with the number of transmission layers, and generating a symbol to be mapped to layer  1  by scrambling and modulating half of the bits of a modulation symbol and another symbol to be mapped to layer  2  by scrambling and modulating the other half of the bits of the modulation symbol, whereby the CQI bits are transmitted as equally distributed on two layers. 
         [0110]    If a single codeword is to be transmitted mapped to one layer, this is the case where CW# 0  is mapped to layer# 1  in rank-1 transmission, CW 0  is mapped to layer# 1  in rank-2 transmission, CW# 1  is mapped to layer# 2 , or CW# 0  is mapped to layer# 1 , especially the case where CW# 1  is mapped to layer# 2  and layer# 3  in rank-3 transmission and CW# 0  is mapped to layer# 1  and layer# 2  or CW# 1  is mapped to layer# 3  and layer# 4  in rank-4 transmission when a single codeword is mapped to two layers. With the method disclosed in the second embodiment of this disclosure, the interleaving and layer mapping operations are performed by taking into consideration the number of transmission layers such that it is possible to transmit the control information as equally distributed on the transmission layers regardless of the number of transmission layers to which the codeword is mapped. 
         [0111]    In a third embodiment of this disclosure, the UCI is carried with two codewords. In the case in which two codewords are transmitted, all of the transmission layers are used to transmit the UCI. Like the second embodiment, the third embodiment defines the operations of the channel interleaver as taking into consideration the number of layers per codeword and maps the codewords to the layers. 
         [0112]      FIG. 6  is a diagram illustrating a procedure of a transmitter processing data and UCI on the transport and physical channels according to the third embodiment of this disclosure.  FIG. 6  shows how the UCI carried in two codewords are mapped to all of the transmission layers. 
         [0113]    Referring to  FIG. 6 , the number of RI, ACK, and CQI symbols per codeword and the number of RI, ACK, and CQI bits are derived by Equations 1, 2, 10, and 11, and the channel interleaving and layer mapping operations are identical to those of the second embodiment. In  FIG. 6 , CW# 0  and C# 1  are different from each other in the number of RI, ACK, and CQI symbols and RI, ACK, and CQI bits according to the modulation and coding scheme (MCS) of individual codewords. In the case in which a certain codeword is mapped to two transmission layers, the RI, ACK, and CQI are equally distributed on the layers to be transmitted. For example, when CW# 0  is mapped to layer# 1  and layer# 2  and CW# 1  is mapped to layer# 3  and layer# 4  in rank-4 transmission, although the numbers of the RI, ACK, and CQI allocated to CW# 0  and CW# 1  are different from each other, the RI, ACK, an CQI symbols mapped to layer# 1  and layer# 2  are equally distributed on layer# 1  and layer# 2 , and the RI, ACK, and CQI symbols mapped to layer# 3  and layer# 4  are equally distributed on layer# 3  and layer# 4 . 
         [0114]    In  FIG. 6 , a CRC is attached to each Transport Block (TB) of CW# 0  at step  601 , and the CRC-attached TB is segmented into code blocks and then the CRC is attached to individual code blocks again at step  602 . The code blocks are channel-coded at step  603 , rate-matched at step  604 , and concatenated at step  605 . The number of RI, ACK, and CQI symbols and the RI, ACK, and CQI bits at steps  606 ,  607 ,  608 , and  609  take into consideration the number of layers. The data symbols and UCI symbols are written in the uplink channel interleaver take into consideration the number of layers at step  610 . Scrambling is performed on CW# 0  at step  611 , and the initialization value is obtained by Equation 23. For CW# 0 , q is 0. 
         [0000]    
       
         
           
             
               
                 
                   
                     C 
                     init 
                   
                   = 
                   
                     
                       
                         n 
                         RNTI 
                       
                       · 
                       
                         2 
                         14 
                       
                     
                     + 
                     
                       q 
                       · 
                       
                         2 
                         13 
                       
                     
                     + 
                     
                       
                         ⌊ 
                         
                           
                             n 
                             s 
                           
                           2 
                         
                         ⌋ 
                       
                       · 
                       
                         2 
                         9 
                       
                     
                     + 
                     
                       
                         N 
                         ID 
                         cell 
                       
                       . 
                     
                   
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     23 
                   
                   ] 
                 
               
             
           
         
       
     
         [0115]    In the case in which the CW# 0  is mapped to two layers, one symbol of the channel interleaver consists of a number of bits equal to the value obtained by multiplying the number of layers and the number of bits of a symbol such that the modulation symbol is generated taking into consideration only the number of bits of a symbol at step  612 . At the codeword-to-layer mapping step  613 , the symbols modulated by the channel interleaver are mapped to two layers sequentially. Afterward, DFT is performed on the respective layer# 1  and layer# 2  at steps  614  and  618 . 
         [0116]    Meanwhile, a CRC is attached to each Transport Block (TB) of CW# 1  at step  622 , and the CRC-attached TB is segmented into code blocks and then the CRC is attached to individual code blocks again at step  623 . The code blocks are channel coded at step  624 , rate matched at step  625 , and concatenated at step  626 . The numbers of RI, ACK, and CQI symbols and the RI, ACK, and CQI bits at steps  627 ,  628 ,  629 , and  630  take into consideration the number of layers. The data symbols and UCI symbols are written in the uplink channel interleaver by taking into consideration the number of layers at step  632 . Scrambling is performed on CW# 1  at step  634 , and the initialization value C init  is obtained by Equation 23. For CW# 1 , q is 1. That is, the scrambling initialization value is set to different values for CW# 0  and CW# 1 . In the case in which the CW# 1  is mapped to two layers, one symbol of the channel interleaver consists of a number of bits equal to the value obtained by multiplying the number of layers and the number of bits of a symbol such that the modulation symbol is generated by taking into consideration only the number of bits of a symbol at step  635 . At the codeword-to-layer mapping step  636 , the symbols modulated by the channel interleaver are mapped to two layers sequentially. Afterward, DFT is performed on the respective layer# 3  and layer# 4  at steps  637  and  638 . 
         [0117]    After being mapped to the corresponding layers and transformed by DFT at steps  614 ,  618 ,  637 , and  638 , the CW# 0  and CW# 1  are precoded at step  615 . 
         [0118]    After being precoded at step  615  of  FIG. 6 , the codes words are mapped to corresponding resources at steps  616 ,  620 ,  640  and  641 , and then transmitted through respective antenna ports in the form of SC-FDMA signals at steps  617 ,  621 ,  642  and  643 . 
         [0119]      FIG. 7  is a block diagram illustrating a configuration of a receiver for use in the second and third embodiments of this disclosure. 
         [0120]    Referring to  FIG. 7 , the FFT  701  performs FFT on the signal received by means of multiple antennas, and the resource element demapper  702  demaps the resources. The deprecoder  703  performs deprecoding on the signals received by the antenna ports, and the inverse discrete Fourier transform (IDFT)  704  performs IDFT per layer. The layer to codeword mapper  705  performs demapping on the signal transformed by IDFT  704  to obtain symbols per codeword. The demodulation demapper  706  performs demodulation on the symbols per layer, the descrambler  707  performs descrambling on the demodulated signals, and the deinterleaver  708  performs deinterleaving on the descrambled signals taking into consideration of the number of layers per codeword. The decoder  709  performs decoding on the data and RI, ACK, and CQI information. 
         [0121]    In the third embodiment of this disclosure, the codeword-to-layer mapping step  613  follows the modulation mapping step  612 . Meanwhile, a fourth embodiment of this disclosure replaces the codeword-to-layer mapping step with per-layer channel interleaving step. 
         [0122]      FIG. 8  is a diagram illustrating per-layer uplink channel interleaving according to the fourth embodiment of this disclosure.  FIG. 8  shows two uplink channel interleavers  811  and  812  for layer# 1  and layer# 2 , respectively, to which one codeword is mapped. 
         [0123]      FIG. 9  is a diagram illustrating a procedure of a transmitter processing data and UCI on the transport and physical channels according to the fourth embodiment of this disclosure. 
         [0124]    In  FIG. 9 , a CRC is attached to one Transport Block (TB) at step  901 , and the CRC-attached TB is segmented into code blocks such that the CRC is attached to each code block again at step  902 . Next, the code blocks are channel-coded at step  903 , rate-matched at step  904 , and concatenated at step  905 . At step  906 , the UE determines a number of coded symbols for CQI transmission. The coded bits constituting the code blocks are arranged in unit of symbol according to the number of coded bits Q m  as denoted by reference numbers  803 ,  804 ,  805 , and  806 . If Q m =2 in  FIG. 8 , the coded bits indexed by  33  to  176  constituting the code blocks are mapped to the symbols by 2 bits. That is, the first symbol  813  of the code block  803  is composed of two bits located at the index positions  33  and  34 , and the first symbols  813  of the code block  804  is composed of two bits located at the index positions  35  and  36 , the second symbol of the code block  803  is composed of two bits located at the index positions  37  and  38 , and the second symbol of the code block  804  is composed of two bits located at the index positions  39  and  40 . In this manner, the symbols  814  of the code blocks  805  and  806  are composed of the bits that are allocated to the symbols by 2 bits alternately. The code blocks  803  and  805  are used at the data and control multiplexing for layer# 1  at step  907  of  FIG. 9 , and the code blocks  804  and  806  are used at the data and control multiplexing for layer# 2  at step  920  of  FIG. 9 . At steps  917 ,  918  and  919  of  FIG. 9 , the UE determines a number of coded symbols for CQI, ACK and RI transmissions, respectively. 
         [0125]    In  FIG. 9 , the number of RI and ACK symbols to be transmitted on each layer is calculated by Equation 24. The process can be explained with formulas as follows. The UE determines the number of coded symbols Q /  for ACK and RI transmission using Equation 24 at step  908  and  909  of  FIG. 9 , respectively. In Equation 24, ◯ denotes a number of ACK or RI bits, and the parameters are defined as shown in Table 10. 
         [0000]    
       
         
           
             
               
                 
                   
                     Q 
                     / 
                   
                   = 
                   
                     min 
                      
                     
                       ( 
                       
                         
                           ⌈ 
                           
                             
                               O 
                               · 
                               
                                 M 
                                 SC 
                                 
                                   PUSCH 
                                   - 
                                   initial 
                                 
                               
                               · 
                               
                                 N 
                                 SYMB 
                                 
                                   PUSCH 
                                   - 
                                   initial 
                                 
                               
                               · 
                               
                                 β 
                                 OFFSET 
                                 PUSCH 
                               
                             
                             
                               
                                 ∑ 
                                 
                                   r 
                                   = 
                                   0 
                                 
                                 
                                   C 
                                   - 
                                   1 
                                 
                               
                                
                               
                                 K 
                                 r 
                               
                             
                           
                           ⌉ 
                         
                         , 
                         
                           4 
                            
                           
                             M 
                             SC 
                             PUSCH 
                           
                         
                       
                       ) 
                     
                   
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     24 
                   
                   ] 
                 
               
             
           
         
       
     
         [0000]    
       
         
               
             
               
               
             
           
               
                 TABLE 10 
               
               
                   
               
               
                 Definitions of parameters used in Equation 24 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                 O 
                 The number of ACK/NACK, or RI, 
               
               
                 M SC   PUSCH-initial   
                 Initially scheduled bandwidth for the same TB, 
               
               
                   
                 expressed as number of subcarriers 
               
               
                 M SC   PUSCH   
                 scheduled bandwidth for the current PUSCH in the 
               
               
                   
                 unit of subcarrier 
               
               
                 C 
                 number of codeblocks for the TB 
               
               
                 K r   
                 number of bits for code block number r 
               
               
                 β OFFSET   PUSCH   
                 offsets configured by higher layers 
               
               
                 N SYMB   PUSCH-initial   
                 number of SC-FDMA symbols in the subframe for 
               
               
                   
                 initial PUSCH transmission 
               
               
                 N SYMB   
                 number of SC-FDMA symbols in the current PUSCH 
               
               
                   
                 transmission subframes 
               
               
                   
               
             
          
         
       
     
         [0126]    In order to calculated the total number of coded HARQ-ACK bits to be transmitted on layer# 1  and layer# 2 , Equation 25 is used. In Equation 25, Q ACK  denotes a number of bits per symbol (2 for QPSK, 4 for 16QAM, and 6 for 64QAM). N denotes a number of layers to which one codeword is mapped. 
         [0000]        Q   ACK   =Q   m   ·Q   /   ACK   ·N.    [Eqn. 25]
 
         [0127]    In an exemplary case where Q /   ACK =4, Q m =2, and N=2, Q ACK  is 16. Since Q ACK  is 16, q 0   ACK , q 1   ACK , . . . , q Q     ACK−1     ACK  is generated by concatenating the coded values of Table 12 and can be expressed by Equation 26. In case that 1 bit is necessary for HARQ-ACK is necessary, the encoded value of Table 11 is used. 
         [0000]        q   0   ACK   , q   1   ACK   , . . . , q   Q     ACK−1     ACK   =[o   0   ACK    o   1   ACK    o   2   ACK    o   0   ACK    o   1   ACK    o   2   ACK    o   0   ACK    o   1   ACK    o   2   ACK    o   0   ACK    o   1   ACK    o   2   ACK    o   0   ACK    o   1   ACK    o   2   ACK    o   0   ACK ].   [Eqn. 26]
 
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 11 
               
             
             
               
                   
               
               
                 Encoding of 1-bit HARQ-ACK 
               
             
          
           
               
                   
                 Q m   
                 Encoded HARQ-ACK 
               
               
                   
                   
               
               
                   
                 2 
                 [o 0   ACK  y] 
               
               
                   
                 4 
                 [o 0   ACK  y x x] 
               
               
                   
                 6 
                 [o 0   ACK  y x x x x] 
               
               
                   
                   
               
             
          
         
       
     
         [0000]    
       
         
               
             
               
               
             
           
               
                 TABLE 12 
               
             
             
               
                   
               
               
                 Encoding of 2-bit HARQ-ACK 
               
             
          
           
               
                 Q m   
                 Encoded HARQ-ACK 
               
               
                   
               
               
                 2 
                 [o 0   ACK  o 1   ACK  o 2   ACK  o 0   ACK  o 1   ACK  o 2   ACK ] 
               
               
                 4 
                 [o 0   ACK  o 1   ACK  x x o 2   ACK  o 0   ACK  x x o 1   ACK  o 2   ACK  x x] 
               
               
                 6 
                 [o 0   ACK  o 1   ACK  x x x x o 2   ACK  o 0   ACK  x x x x o 1   ACK  o 2   ACK  x x x 
               
               
                   
               
             
          
         
       
     
         [0128]    Although the total number of bits Q ACK  for for layer# 1  and layer# 2  is 16, the number of bits to be transmitted on each transmission layer is 8. 
         [0129]    In  FIG. 8 , reference number  809  denotes 8 bits at ACK symbols  816  to be transmitted on layer# 1 , and reference number  810  denotes 8 bits to be transmitted on layer# 2 . Assuming Q m =2, the first two bits q 0   ACK  and q 1   ACK  among the 16 bits in Equation 26 are mapped to the first symbol of code block  809  of  FIG. 8 , and the next two bits q 2   ACK  and q 3   ACK  are mapped to the first symbol of code block  810 . Accordingly, 8-bit ACK information is transmitted on both layer# 1  and layer# 2  and, as a consequence, a total of 16 bits of ACK information is transmitted. 
         [0130]    In order to express the total number of RI bits to be transmitted on layer# 1  and layer# 2 , Equation 27 is used. In Equation 27, Q RI  denotes the total number of coded RI bits, and Q m  denotes a number of bits per symbol (2 for QPSK, 4 for 16QAM, and 6 for 64QAM). N denotes a number of layers to which one codeword is mapped. 
         [0000]        Q   RI   =Q   m   ·Q   /   RI   ·N    [Eqn. 27]
 
         [0131]    In an exemplary case where Q /   RI =4, Q m =2, and N=2, Q RI  is 16. Since Q RI  is 16, q 0   RI , q 1   RI , . . . , q Q     RI−1     RI  is generated by concatenating the coded values of Table 14 and can be expressed by Equation 28. In the case in which the maximum rank of RI is 2, the encoded value of Table 13 is used. 
         [0000]        q   0   RI   , q   1   RI   , . . . , q   Q     RI−1     RI   =[o   0   RI    o   1   RI    o   2   RI    o   0   RI    o   1   RI    o   2   RI    o   0   RI    o   1   RI    o   2   RI    o   0   RI    o   1   RI    o   2   RI    o   0   RI    o   1   RI    o   2   RI    o   0   RI ].   [Eqn. 28]
 
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 13 
               
             
             
               
                   
               
               
                 Encoding of 1-bit RI 
               
             
          
           
               
                   
                 Q m   
                 Encoded RI 
               
               
                   
                   
               
               
                   
                 2 
                 [o 0   RI  y] 
               
               
                   
                 4 
                 [o 0   RI  y x x] 
               
               
                   
                 6 
                 [o 0   RI  y x x x x] 
               
               
                   
                   
               
             
          
         
       
     
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 14 
               
             
             
               
                   
               
               
                 Encoding of 20-bit RI 
               
             
          
           
               
                   
                 Q m   
                 Encoded RI 
               
               
                   
                   
               
               
                   
                 2 
                 [o 0   RI  o 1   RI  o 2   RI  o 0   RI  o 1   RI  o 2   RI ] 
               
               
                   
                 4 
                 [o 0   RI  o 1   RI  x x o 2   RI  o 0   RI  x x o 1   RI  o 2   RI  x x] 
               
               
                   
                 6 
                 [o 0   RI  o 1   RI  x x x x o 2   RI  o 0   RI  x x x x o 1   RI  o 2   RI  x x x x] 
               
               
                   
                   
               
             
          
         
       
     
         [0132]    Although the total number of bits Q ACK  for layer# 1  and layer# 2  is 16, the number of bits to be transmitted on each transmission layer is 8. 
         [0133]    In  FIG. 8 , reference number  807  denotes 8 RI bits at symbols  817  to be transmitted on layer# 1 , and reference number  808  denotes 8 RI bits to be transmitted on layer# 2 . Assuming Q m =2 the first two bits q 0   RI  and q 1   RI  among the 16 bits of Equation 28 are mapped to the first symbol of code block  807  of  FIG. 8  (referred to as r 1  and r 2 ), and the next two bits q 2   RI  and q 3   RI  are mapped to the first symbol of code block  808  (referred to as r 3  and r 4 ). 
         [0134]    Accordingly, 8-bit RI information is transmitted on both layer# 1  and layer# 2  and, as a consequence, a total of 16 bits of RI information is transmitted. 
         [0135]    In  FIG. 9 , the UE determines the number of encoded symbols Q /  using equation (29) for CQI transmission on one layer. In Equation 29, ◯ denotes a number CQI bits, and M SC   PUSCH  denotes the bandwidth scheduled for PUSCH transmission in the current subframe and expressed as the number of subcarriers. N SYMB   PUSCH-initial  denotes a number of SC-FDMA symbols per subframe which is used in the initial transmission. The parameters used in Equation 29 are defined in Table 15. 
         [0000]    
       
         
           
             
               
                 
                   
                     Q 
                     / 
                   
                   = 
                   
                     
                       min 
                        
                       
                         ( 
                         
                           
                             ⌈ 
                             
                               
                                 
                                   ( 
                                   
                                     O 
                                     + 
                                     L 
                                   
                                   ) 
                                 
                                 · 
                                 
                                   M 
                                   SC 
                                   
                                     PUSCH 
                                     - 
                                     initial 
                                   
                                 
                                 · 
                                 
                                   N 
                                   SYMB 
                                   
                                     PUSCH 
                                     - 
                                     initial 
                                   
                                 
                                 · 
                                 
                                   β 
                                   OFFSET 
                                   PUSCH 
                                 
                               
                               
                                 
                                   ∑ 
                                   
                                     r 
                                     = 
                                     0 
                                   
                                   
                                     C 
                                     - 
                                     1 
                                   
                                 
                                  
                                 
                                   K 
                                   r 
                                 
                               
                             
                             ⌉ 
                           
                           , 
                           
                             
                               
                                 M 
                                 SC 
                                 PUSCH 
                               
                               · 
                               
                                 N 
                                 SYMB 
                                 PUSCH 
                               
                             
                             - 
                             
                               
                                 Q 
                                 RI 
                               
                               
                                 
                                   Q 
                                   m 
                                 
                                 · 
                                 N 
                               
                             
                           
                         
                         ) 
                       
                     
                     . 
                   
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     29 
                   
                   ] 
                 
               
             
           
         
       
     
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 15 
               
               
                   
               
               
                 Definitions of parameter used in Equation 29 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                   
                 O 
                 number of CQI bits 
               
               
                   
                 M SC   PUSCH-initial   
                 Initially scheduled bandwidth for the  
               
               
                   
                   
                 same TB, expressed as # of subcarriers 
               
               
                   
                 M SC   PUSCH   
                 scheduled bandwidth for the current  
               
               
                   
                   
                 PUSCH in the unit of subcarrier 
               
               
                   
                 C 
                 number of codeblocks for the TB 
               
               
                   
                 K τ   
                 number of bits for code block number r 
               
               
                   
                 β OFFSET   PUSCH   
                 offsets configured by higher layers 
               
               
                   
                 N SYMB   PUSCH-initial   
                 number of SC-FDMA symbols in the  
               
               
                   
                   
                 subframe for initial PUSCH transmission 
               
               
                   
                 N SYMB   
                 number of SC-FDMA symbols in the  
               
               
                   
                   
                 current PUSCH transmission subframes 
               
               
                   
                 L 
                 the number of CRC bits where 
               
               
                   
                   
                 
                   
                     
                       
                         L 
                         = 
                         
                           { 
                           
                             
                               
                                 
                                   0 
                                 
                                 
                                   
                                     O 
                                     ≤ 
                                     11 
                                   
                                 
                               
                               
                                 
                                   8 
                                 
                                 
                                   otherwise 
                                 
                               
                             
                             , 
                           
                         
                       
                     
                   
                 
               
               
                   
                   
               
             
          
         
       
     
         [0136]    In order to calculate the total number of CQI bits to be transmitted on layer# 1  and layer# 2 , Equation 30 is used. In Equation 30, Q CQI  denotes the total number of encoded CQI bits, and Q m  denotes a number of bits per symbol (2 for QPSK, 4 for 16QAM, and 6 for 64QAM). qv denotes the number of coded symbols. N denotes a number of layers to which one codeword is mapped. 
         [0000]        Q   CQI   =Q   m   ·Q   /   CQI   ·N    [Eqn. 30]
 
         [0137]    The coded CQI/PMI bits can be expressed as Equation 31. 
         [0000]        b   0   , b   1   , b   2   , . . . , b   B−1  where B=32   [Eqn. 31]
 
         [0138]    Equation 31 is derived from Equation 32 and Table 16. 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       b 
                       i 
                     
                     = 
                     
                       
                         
                           ∑ 
                           
                             n 
                             = 
                             0 
                           
                           
                             O 
                             - 
                             1 
                           
                         
                          
                         
                           
                             ( 
                             
                               
                                 o 
                                 n 
                               
                               · 
                               
                                 M 
                                 
                                   i 
                                   , 
                                   n 
                                 
                               
                             
                             ) 
                           
                            
                           mod2 
                            
                           
                               
                           
                            
                           where 
                            
                           
                               
                           
                            
                           i 
                         
                       
                       = 
                       0 
                     
                   
                   , 
                   1 
                   , 
                   
                     
                       2 
                        
                       
                           
                       
                        
                       … 
                        
                       
                           
                       
                        
                       B 
                     
                     - 
                     1 
                   
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     32 
                   
                   ] 
                 
               
             
           
         
       
     
         [0000]    
       
         
               
             
               
               
               
               
               
               
               
               
               
               
               
               
             
           
               
                 TABLE 16 
               
             
             
               
                   
               
               
                 Basis sequences for (32, 0) code 
               
             
          
           
               
                 i 
                 M i,0   
                 M i,1   
                 M i,2   
                 M i,3   
                 M i,4   
                 M i,5   
                 M i,6   
                 M i,7   
                 M i,8   
                 M i,9   
                 M i,10   
               
               
                   
               
               
                  0 
                 1 
                 1 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 1 
               
               
                  1 
                 1 
                 1 
                 1 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 1 
                 1 
               
               
                  2 
                 1 
                 0 
                 0 
                 1 
                 0 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
               
               
                  3 
                 1 
                 0 
                 1 
                 1 
                 0 
                 0 
                 0 
                 0 
                 1 
                 0 
                 1 
               
               
                  4 
                 1 
                 1 
                 1 
                 1 
                 0 
                 0 
                 0 
                 1 
                 0 
                 0 
                 1 
               
               
                  5 
                 1 
                 1 
                 0 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
                 0 
                 1 
               
               
                  6 
                 1 
                 0 
                 1 
                 0 
                 1 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
               
               
                  7 
                 1 
                 0 
                 0 
                 1 
                 1 
                 0 
                 0 
                 1 
                 1 
                 0 
                 1 
               
               
                  8 
                 1 
                 1 
                 0 
                 1 
                 1 
                 0 
                 0 
                 1 
                 0 
                 1 
                 1 
               
               
                  9 
                 1 
                 0 
                 1 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
                 1 
                 1 
               
               
                 10 
                 1 
                 0 
                 1 
                 0 
                 0 
                 1 
                 1 
                 1 
                 0 
                 1 
                 1 
               
               
                 11 
                 1 
                 1 
                 1 
                 0 
                 0 
                 1 
                 1 
                 0 
                 1 
                 0 
                 1 
               
               
                 12 
                 1 
                 0 
                 0 
                 1 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
                 1 
               
               
                 13 
                 1 
                 1 
                 0 
                 1 
                 0 
                 1 
                 0 
                 1 
                 0 
                 1 
                 1 
               
               
                 14 
                 1 
                 0 
                 0 
                 0 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
                 1 
               
               
                 15 
                 1 
                 1 
                 0 
                 0 
                 1 
                 1 
                 1 
                 1 
                 0 
                 1 
                 1 
               
               
                 16 
                 1 
                 1 
                 1 
                 0 
                 1 
                 1 
                 1 
                 0 
                 0 
                 1 
                 0 
               
               
                 17 
                 1 
                 0 
                 0 
                 1 
                 1 
                 1 
                 0 
                 0 
                 1 
                 0 
                 0 
               
               
                 18 
                 1 
                 1 
                 0 
                 1 
                 1 
                 1 
                 1 
                 1 
                 0 
                 0 
                 0 
               
               
                 19 
                 1 
                 0 
                 0 
                 0 
                 0 
                 1 
                 1 
                 0 
                 0 
                 0 
                 0 
               
               
                 20 
                 1 
                 0 
                 1 
                 0 
                 0 
                 0 
                 1 
                 0 
                 0 
                 0 
                 1 
               
               
                 21 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
                 0 
                 0 
                 0 
                 1 
                 1 
               
               
                 22 
                 1 
                 0 
                 0 
                 0 
                 1 
                 0 
                 0 
                 1 
                 1 
                 0 
                 1 
               
               
                 23 
                 1 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
                 0 
                 1 
                 1 
                 1 
               
               
                 24 
                 1 
                 1 
                 1 
                 1 
                 1 
                 0 
                 1 
                 1 
                 1 
                 1 
                 0 
               
               
                 25 
                 1 
                 1 
                 0 
                 0 
                 0 
                 1 
                 1 
                 1 
                 0 
                 0 
                 1 
               
               
                 26 
                 1 
                 0 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
                 1 
                 1 
                 0 
               
               
                 27 
                 1 
                 1 
                 1 
                 1 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
                 0 
               
               
                 28 
                 1 
                 0 
                 1 
                 0 
                 1 
                 1 
                 1 
                 0 
                 1 
                 0 
                 0 
               
               
                 29 
                 1 
                 0 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 0 
                 0 
               
               
                 30 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
                 1 
               
               
                 31 
                 1 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
                 0 
               
               
                   
               
             
          
         
       
     
         [0139]    The output sequence q 0 , q 1 , q 2 , . . . , q Q     CQI     −1  is obtained by cyclic repetition of coded CQI/PMI bits using Equation 33. 
         [0000]        q   1   =b ( i  mod  B ) where  i= 0, 1, 2, . . . ,  Q   CQI −1   [Eqn. 33]
 
         [0140]    In an exemplary case where Q /   CQI =8, Q m =2, and N=2, Q CQI  is 32. Although the total number of bits Q CQI  for layer# 1  and layer# 2  is 32, the number of bits to be transmitted on each transmission layer is 16. 
         [0141]    In  FIG. 8 , reference number  801  denotes the 16 CQI bits at symbols  815  to be transmitted on layer# 1 , and reference number  802  denotes the 16 CQI bits to be transmitted on layer# 2 . Assuming Q m =2, the first two bits q 0  and q 1  among the 32 bits in Equation 33 are mapped to the first symbol of code block  801  of  FIG. 8  (referred to as indices 1 and 2), and the next two bits q 2  and q 3  are mapped to the first symbol of code block  802  (referred to as indices 3 and 4). In this manner, the information bits are mapped to two different layers alternately. Accordingly, 16-bit CQI information is transmitted on both layer# 1  and layer# 2 , and as a consequence, a total of 32 bits of CQI information is transmitted. The channel interleaver matrix for layer# 1  is composed of the CQI information bits  801 , data information bits  803  and  805 , ACK information bits  809 , and RI information bits  807 . The channel interleaver matrix for layer# 2  is composed of the CQI information bits  802 , data information bits  804  and  806 , ACK information bits  810 , and RI information bits  808 . The channel interleaver matrix is generated as defined in Rel-8 standard. 
         [0142]    After channel interleaving for layer# 1  is performed at step  910 , each bit is scrambled at step  911 , and the initial value C init  used is shown in Equation 34. 
         [0000]    
       
         
           
             
               
                 
                   
                     C 
                     init 
                   
                   = 
                   
                     
                       
                         n 
                         RNTI 
                       
                       · 
                       
                         2 
                         14 
                       
                     
                     + 
                     
                       q 
                       · 
                       
                         2 
                         13 
                       
                     
                     + 
                     
                       
                         ⌊ 
                         
                           
                             n 
                             s 
                           
                           2 
                         
                         ⌋ 
                       
                       · 
                       
                         2 
                         9 
                       
                     
                     + 
                     
                       
                         N 
                         ID 
                         cell 
                       
                       . 
                     
                   
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     34 
                   
                   ] 
                 
               
             
           
         
       
     
         [0143]    After scrambling is performed, the scrambled signal is modulated into a modulation symbol by a modulation mapper at step  912  and then transformed by DFT at step  913 . 
         [0144]    After channel interleaving for layer# 2  is performed at step  921 , each bit is scrambled at step  922 , and the initial value is used as shown in Equation 35. Using Equation 35, q is set to 0 or 1 for layer# 1  of CW# 1 . q is set to 0 for the same CW to use the same scrambling initialization value, and q is set to 1 for the same CW to use different scrambling initialization values for respective layers. 
         [0145]    If the UCI is transmitted on all of the layers to which two codewords are mapped, q is set to 0 for scrambling layer# 1  and layer# 2  and 1 for scrambling layer# 3  and layer# 4 . In another method, q can be set to 0 for scrambling layer# 1 ,  1  for scrambling layer# 2 ,  2  for scrambling layer# 3 , and  3  for scrambling layer# 4 . That is, different scrambling can be applied to the individual layers. 
         [0000]    
       
         
           
             
               
                 
                   
                     C 
                     init 
                   
                   = 
                   
                     
                       
                         n 
                         RNTI 
                       
                       · 
                       
                         2 
                         14 
                       
                     
                     + 
                     
                       q 
                       · 
                       
                         2 
                         13 
                       
                     
                     + 
                     
                       
                         ⌊ 
                         
                           
                             n 
                             s 
                           
                           2 
                         
                         ⌋ 
                       
                       · 
                       
                         2 
                         9 
                       
                     
                     + 
                     
                       
                         N 
                         ID 
                         cell 
                       
                       . 
                     
                   
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     35 
                   
                   ] 
                 
               
             
           
         
       
     
         [0146]    After scrambling is performed, the scrambled signal is modulated into a modulation symbol at step  923 , and transformed by DFT at step  924 . Next, the signals DFT-transformed at step  913  and  924  are precoded at step  914 , mapped to the resource at step  915  and  925 , transformed by IFFT at steps  916  and  926 , and then transmitted. 
         [0147]      FIG. 10  is a block diagram illustrating a configuration of a receiver for use in the fourth embodiment of this disclosure. 
         [0148]    Referring to  FIG. 10 , the FFT  1001  performs FFT on the signal received by means of multiple antennas, and the resource element demapper  1002  demaps the resources. The deprecoder  1003  performs deprecoding on the signals received by the antenna ports, and the IDFT  1004  performs IDFT per layer. The demodulation demapper  1005  performs demodulation on the symbols per layer, the descrambler  1006  performs descrambling on the demodulated signals, and the deinterleaver  1007  performs deinterleaving per layer. The decoder  1008  performs decoding on the data and RI, ACK, and CQI information carried in uplink deinterleaver channel per codeword. 
         [0149]    In a fifth embodiment of this disclosure, the ACK and RI symbols are replicated on all of the layers on which two codewords are transmitted and time division multiplexed with data as arranged in all of the layers simultaneously. The CQI are transmitted on only the layers to which one codeword is mapped. The ACK and RI symbols are replicated on all of the layers multiplexed in time domain to be distributed on all of the layers through the transport and physical channels processing procedure with the uplink channel interleaver. 
         [0150]      FIG. 11  is a diagram illustrating a configuration of a channel interleaver when the ACK symbols  1105  and RI symbols  1104  are repeated on all of the layers according to an embodiment of this disclosure. 
         [0151]    As shown in  FIG. 11 , the ACK symbols  1105  and RI symbols  1104  are multiplexed with data in time domain (TDM) on the sections for layer  2   n    1108  and layer  2   n +1  1107 . The numbers of ACK and RI symbols are determined in the same way described with the third embodiment in which the ACK and RI are distributed on all of the layers to which two codewords are mapped. The numbers of ACK and RI symbols also can be determined using Equation 36 with which the UE calculates the number of coded symbols Q / . That is, the number of coded symbols mapped to individual layers Q /  is calculated by taking into consideration the two codewords mapped to all of the layers. In Equation 36, ◯ denotes the number of ACK or RI bits, and the parameters used in Equation 36 are defined in Table 17. Also shown in  FIG. 11  are coded symbols  1101  of CQI, coded symbols  1102  of codeblock  0 , and coded symbols  1101  of codeblock  1 . 
         [0000]    
       
         
           
             
               
                 
                   
                     Q 
                     / 
                   
                   = 
                   
                       
                     
                       min 
                       ( 
                       
                           
                       
                        
                       
                           
                         
                           
                               
                             
                               
                                 ⌈ 
                                 
                                   
                                     O 
                                     · 
                                     
                                       M 
                                       SC 
                                       
                                         PUSCH 
                                         - 
                                         initial 
                                       
                                     
                                     · 
                                     
                                       N 
                                       SYMB 
                                       
                                         PUSCH 
                                         - 
                                         initial 
                                       
                                     
                                     · 
                                     
                                       β 
                                       OFFSET 
                                       PUSCH 
                                     
                                   
                                   
                                     
                                       
                                         ∑ 
                                         
                                           r 
                                           = 
                                           0 
                                         
                                         
                                           
                                             C 
                                              
                                             
                                               ( 
                                               0 
                                               ) 
                                             
                                           
                                           - 
                                           1 
                                         
                                       
                                        
                                       
                                         K 
                                         r 
                                         0 
                                       
                                     
                                     + 
                                     
                                       
                                         ∑ 
                                         
                                           r 
                                           = 
                                           0 
                                         
                                         
                                           
                                             C 
                                              
                                             
                                               ( 
                                               1 
                                               ) 
                                             
                                           
                                           - 
                                           1 
                                         
                                       
                                        
                                       
                                         K 
                                         r 
                                         1 
                                       
                                     
                                   
                                 
                                 ⌉ 
                               
                               , 
                               
                                 4 
                                  
                                 
                                   M 
                                   SC 
                                   PUSCH 
                                 
                               
                             
                             ) 
                           
                           . 
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     36 
                   
                   ] 
                 
               
             
           
         
       
     
         [0000]    
       
         
               
               
             
           
               
                 TABLE 17 
               
               
                   
               
             
             
               
                 O 
                 The number of ACK/NACK, or RI, 
               
               
                 M SC   PUSCH-initial   
                 Initially scheduled bandwidth for the same TB, 
               
               
                   
                 expressed as number of subcarriers 
               
               
                 M SC   PUSCH   
                 scheduled bandwidth for the current PUSCH in the 
               
               
                   
                 unit of subcarrier 
               
               
                   
                 number of codeblocks for the TB 
               
               
                 K r   0   
                 number of bits for code block number r in CW#0 
               
               
                 K r   1   
                 number of bits for code block number r in CW#1 
               
               
                 C(0) 
                 number of codeblocks for the TB#0 (CW#0) 
               
               
                 C(1) 
                 number of codeblocks for the TB#1 (CW#1) 
               
               
                 β OFFSET   PUSCH   
                 offsets configured by higher layers 
               
               
                 N SYMB   PUSCH-initial   
                 number of SC-FDMA symbols in the subframe for 
               
               
                   
                 initial PUSCH transmission 
               
               
                 N SYMB   
                 number of SC-FDMA symbols in the current PUSCH 
               
               
                   
                 transmission subframes 
               
               
                   
               
             
          
         
       
     
         [0152]    The CQI is transmitted on the layers to which one codeword is mapped. The number of CQI symbols can be determined according to a method for mapping the CQI to one selected codeword in the first and second embodiments. For CQI transmission, the UE determines the number of coded symbols Q /  using Equation 37. In Equation 37, ◯ denotes the number of CQI bits, and N denotes the number of layers to which the codewords carrying the CQI. M SC   PUSCH  denotes the bandwidth scheduled for PUSCH transmission in the current subframe and is expressed as a number of subcarriers. N SYMB   PUSCH-initial  denotes the number of SC-FDMA symbols per subframe used in initial transmission. The parameters used in Equation 37 are defined in Table 18. 
         [0000]    
       
         
           
             
               
                 
                   
                     Q 
                     / 
                   
                   = 
                   
                     
                       min 
                        
                       
                         ( 
                         
                           
                             ⌈ 
                             
                               
                                 
                                   ( 
                                   
                                     O 
                                     + 
                                     L 
                                   
                                   ) 
                                 
                                 · 
                                 
                                   M 
                                   SC 
                                   
                                     PUSCH 
                                     - 
                                     initial 
                                   
                                 
                                 · 
                                 
                                   N 
                                   SYMB 
                                   
                                     PUSCH 
                                     - 
                                     initial 
                                   
                                 
                                 · 
                                 
                                   β 
                                   OFFSET 
                                   PUSCH 
                                 
                               
                               
                                 
                                   ∑ 
                                   
                                     r 
                                     = 
                                     0 
                                   
                                   
                                     C 
                                     - 
                                     1 
                                   
                                 
                                  
                                 
                                   K 
                                   r 
                                 
                               
                             
                             ⌉ 
                           
                           , 
                           
                             
                               
                                 M 
                                 SC 
                                 PUSCH 
                               
                               · 
                               
                                 N 
                                 SYMB 
                                 PUSCH 
                               
                             
                             - 
                             
                               
                                 Q 
                                 RI 
                               
                               
                                 
                                   Q 
                                   m 
                                 
                                 · 
                                 N 
                               
                             
                           
                         
                         ) 
                       
                     
                     . 
                   
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     37 
                   
                   ] 
                 
               
             
           
         
       
     
         [0000]    
       
         
               
               
               
             
           
               
                   
                 TABLE 18 
               
               
                   
                   
               
             
             
               
                   
                 O 
                 number of CQI bits 
               
               
                   
                 M SC   PUSCH-initial   
                 Initially scheduled bandwidth for the same  
               
               
                   
                   
                 TB, expressed as # of subcarriers 
               
               
                   
                 M SC   PUSCH   
                 scheduled bandwidth for the current  
               
               
                   
                   
                 PUSCH in the unit of subcarrier 
               
               
                   
                 C 
                 number of codeblocks for the TB 
               
               
                   
                 K τ   
                 number of bits for code block number r 
               
               
                   
                 β OFFSET   PUSCH   
                 offsets configured by higher layers 
               
               
                   
                 N SYMB   PUSCH-initial   
                 number of SC-FDMA symbols in the  
               
               
                   
                   
                 subframe for initial PUSCH transmission 
               
               
                   
                 N SYMB   
                 number of SC-FDMA symbols in the  
               
               
                   
                   
                 current PUSCH transmission subframes 
               
               
                   
                 L 
                 the number of CRC bits where 
               
               
                   
                   
                 
                   
                     
                       
                         L 
                         = 
                         
                           { 
                           
                             
                               
                                 
                                   0 
                                 
                                 
                                   
                                     O 
                                     ≤ 
                                     11 
                                   
                                 
                               
                               
                                 
                                   8 
                                 
                                 
                                   otherwise 
                                 
                               
                             
                             , 
                           
                         
                       
                     
                   
                 
               
               
                   
                   
               
             
          
         
       
     
         [0153]    In order to calculate the total number of CQI bits, Equation 38 is used. In Equation 38, Q CQI  denotes the total number of coded CQI bits, Q m  is 2 for QPSK, 4 for 16QAM, and 6 for 64QAM. Q /   CQI  denotes the number of coded symbols. N denotes the number of layers mapped to one codeword. 
         [0000]        Q   CQI   =Q   m   ·Q   /   CQI   ·N    [Eqn. 38]
 
         [0154]    The CQI and data multiplexing can be performed with the methods described in the first and second embodiments. That is, the procedure for processing the transport and physical layers with the uplink channel interleaver is performed in the same way described in the first and second embodiments. The CQI and data multiplexing can be performed in another way as depicted in  FIG. 12 . There is a case in which the number of layers is not considered in calculating the total number of bits Q QCI  and the number of CQI symbols Q /   CQI  is odd as shown in Equation 39. If the method of the first embodiment is used for this case, the CQI symbols are unequally distributed onto different layers, and the method of the second embodiment cannot use Equation 39 because the number of layers should be taken into consideration. By writing the CQI symbols  1201  in order as depicted in  FIG. 12  and reading out the CQI symbols  1201  from the first column for the case where the CQI symbols are mapped to two layers, the CQI symbols  1 ,  3 ,  5 ,  7 ,  9 , and  11  are transmitted on the first layer, and the CQI symbols  2 ,  4 ,  6 ,  8 , and  10  are transmitted on the second layer. 
         [0155]    Also shown are coded symbols  1202  of the codeblock. 
         [0000]        Q   CQI   =Q   m   ·Q   /   CQI    [Eqn. 39]
 
         [0156]    In order to output of a bit sequence of channel interleaver for distributing the odd number-th CQI symbols as equal as possible, C mux =N symb   PUSCH =12 is assumed at k=0, 1, . . . H /  to generate (R mux ×C mux ) matrix as shown in Equation 40. In Equation 40,  y k   = g k   , and  g k    is a sequence output by multiplexing data symbols and CQI symbols. In the matrix of Equation 40, the part that is already occupied by the RI symbols is skipped while writing the vector sequence in the matrix. 
         [0000]    
       
         
           
             
               
                 
                   [ 
                   
                       
                   
                    
                   
                     
                       
                         
                           
                             y 
                             0 
                           
                           _ 
                         
                       
                       
                         
                           
                             y 
                             2 
                           
                           _ 
                         
                       
                       
                         … 
                       
                       
                         
                           
                             y 
                             22 
                           
                           _ 
                         
                       
                     
                     
                       
                         
                           
                             y 
                             1 
                           
                           _ 
                         
                       
                       
                         
                           
                             y 
                             3 
                           
                           _ 
                         
                       
                       
                         … 
                       
                       
                         
                           
                             y 
                             23 
                           
                           _ 
                         
                       
                     
                     
                       
                         
                           
                             y 
                             24 
                           
                           _ 
                         
                       
                       
                         
                           
                             y 
                             26 
                           
                           _ 
                         
                       
                       
                         … 
                       
                       
                         
                           
                             y 
                             
                               
                                 4 
                                  
                                 
                                   C 
                                   max 
                                 
                               
                               - 
                               2 
                             
                           
                           _ 
                         
                       
                     
                     
                       
                         
                           
                             y 
                             25 
                           
                           _ 
                         
                       
                       
                         
                           
                             y 
                             27 
                           
                           _ 
                         
                       
                       
                         … 
                       
                       
                         
                           
                             y 
                             
                               
                                 4 
                                  
                                 
                                   C 
                                   max 
                                 
                               
                               - 
                               1 
                             
                           
                           _ 
                         
                       
                     
                     
                       
                         ⋮ 
                       
                       
                         ⋮ 
                       
                       
                         … 
                       
                       
                         ⋮ 
                       
                     
                   
                    
                   
                       
                   
                   ] 
                 
               
               
                 
                   [ 
                   
                     Eqn 
                     . 
                     
                         
                     
                      
                     40 
                   
                   ] 
                 
               
             
           
         
       
     
         [0157]    The uplink transmission method and apparatus for uplink transmission in the LTE-Advanced system using two codewords and multiple transmit antennas according to an embodiment of this disclosure is capable of distributing, one codeword mapped to two layers, the UCI information onto two layers equally and, when two codewords are mapped to multiple layers, onto all of the layers equally.In some embodiments of this disclosure, the uplink control information is mapped or allocated onto a subset of the Ns layers being transmitted on the uplink in a MIMO uplink subframe. This subset of layers could be implicitly inferred by the UE according to (1) the number of codewords; (2) the codeword to layer mapping structure; and (3) the codeword that uses a highest MCS value. For example, if N=4 and layers  1 , 2  are used for codeword  1  transmission while layers  3 ,  4  are used for codeword  2  transmission, and if the MCS used by codeword  1  is better than the MCS used by codeword  2 , then the UE can decide to transmit UL control information on layers  1  and  2 , which correspond to the layers with the better MCS value. 
         [0158]    Therefore, for one CW transmission, the UCI is mapped onto the layers of that CW. For two CWs transmission with different MCS value indicated by the UL grant, the UCI is mapped onto the layers of the CW with higher MCS value. 
         [0159]    In addition, for the case in which two codewords have the same the same MCS, the following approaches are proposed: 
         [0160]    Method 1: the UE always maps the UCI on CW 0  (codeword 0 , or the first codeword), which is mapped to either layer  0  or layers and  1 , according to the CW to layer mapping table and transmission rank. 
         [0161]    Method 2: the UE always maps the UCI on CW 1  (codewordl, or the second codeword). 
         [0162]    Method 3: the UE maps UCI on CW 1  (the second codeword) for the case of rank 3 (3 layers) transmission, and maps UCI on CW 0  for other rank transmissions. The reason for the special, treatment for rank 3 is that in rank3 CW 0  is mapped to layer 0 , and CW 1  is mapped to layers  1  and  2 . Therefore, it may be better to map UCI to the CW with 2-layer transmission since this provides more resources for UCI transmission. 
         [0163]    In some embodiments of this disclosure, some types of UCI are mapped onto all the N layers being transmitted on the uplink in a MIMO uplink subframe, while other types of UCI are mapped onto a subset of N layers, where the number of layers in a subset is denoted by Ns. 
         [0164]    The types of UCIs that need more reliable reception at the eNodeB are mapped onto all the N layers. 
         [0165]    Some examples of the subset of N layers, where the subset has Ns layers, are: 
         [0166]    all the layers in CW 0 ; 
         [0167]    all the layers in CW 1 ; 
         [0168]    all the layers in a CW having higher MCS; and 
         [0169]    smallest numbered layer in a CW having higher MCS. 
         [0170]    In some embodiments, ACK/NACK and RI are mapped onto all the N layers, while CQI is mapped onto a subset of N layers, where the subset has the size Ns, and where the subset corresponds to all the layers in one of the two CWs. For example, CQI is mapped onto all the 2 layers in CW 0 , while ACK/NACK and RI are mapped onto all the 4 layers, in a 4-layer uplink transmission. 
         [0171]    Q m   AN (n) and Q m   RI (n) used for A/N and RI, respectively, in n-th layer of the N layers are determined by a function of the modulation orders used for data transmission in the N layers, Q m   Data (n), n=1, . . . , N. 
         [0172]    In particular, in 3GPP LTE and LTE-A system, in the case of 2 CWs, two modulation orders can be used for data transmissions in the N layers. └N/2┘ layers corresponding to one CW use one modulation order Q 1 , and ┌N/2┐ layers corresponding to another CW use another modulation order Q 2 : 
         [0000]    
       
         
           
             
               
                 Q 
                 m 
                 Data 
               
                
               
                 ( 
                 n 
                 ) 
               
             
             = 
             
               { 
               
                 
                   
                     
                       
                         Q 
                          
                         
                             
                         
                          
                         1 
                       
                       , 
                       
                         n 
                         = 
                         1 
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         ⌊ 
                         
                           N 
                           / 
                           2 
                         
                         ⌋ 
                       
                     
                   
                 
                 
                   
                     
                       
                         Q 
                          
                         
                             
                         
                          
                         2 
                       
                       , 
                       
                         n 
                         = 
                         
                           
                             ⌊ 
                             
                               N 
                               / 
                               2 
                             
                             ⌋ 
                           
                           + 
                           1 
                         
                       
                       , 
                       
                         … 
                          
                         
                             
                         
                          
                         
                           N 
                           . 
                         
                       
                     
                   
                 
               
             
           
         
       
     
         [0173]    Here, Q 1  and Q 2  may or may not be the same and Q 1 , Q 2 ∓{2,4,6}. 
         [0174]    In one example of the function determining the modulation orders for A/N and RI, the modulation orders in all the N layers are determined to be min(Q 1 , Q 2 ), i.e. Q m   AN (n)=min(Q 1 , Q 2 ) and Q m   RI (n)=min(Q 1 , Q 2 ), for all n. This function ensures that A/N and RI use a modulation method that consumes the smaller amount of power between the two modulation methods of Q 1  and Q 2 . 
         [0175]    In another example of the function determining the modulation orders for A/N and RI, the modulation orders in all the N layers are determined to be max(Q 1 , Q 2 ), i.e., Q n   An (n)=max(Q 1 , Q 2 ) and Q n   RI (n)=max(Q 1 , Q 2 ), for all n. This function ensures that A/N and RI use a modulation method that provides the higher reliability between the two modulation methods of Q 1  and Q 2 . 
         [0176]    In another example of the function determining the modulation orders for A/N and RI, the modulation orders in all the N layers are determined to be 2, i.e., Q n   AN (n)=2 and Q m   RI (n)=2, for all n. This function ensures that A/N and RI use a modulation method that consumes the smallest amount of power. 
         [0177]    In another example of the function determining the modulation orders for A/N and RI, the modulation orders in all the N layers are determined to be 6, i.e., Q n   AN (n)=6 and Q m   RI (n)=6, for all n. This function ensures that A/N and RI use a modulation method that provides the highest reliability. 
         [0178]    In one example of the function determining the modulation orders for A/N and RI, a modulation order in each of the N layers follows the modulation order used for data transmission, i.e., Q n   AN (n)=Q n   Data (n) and Q m   RI (n)=Q m   Data (n), for all n. 
         [0179]    Given a modulation order of each layer, A/N and RI can be encoded according to methods described in Section 5.2.2.6 in 3GPP LTE 36.212 9.0.0, which is hereby incorporated by reference into the present application as if fully set forth herein. 
         [0180]    Although the present disclosure has been described with an exemplary embodiment, various changes and modifications may be suggested to one skilled in the art. It is intended that the present disclosure encompass such changes and modifications as fall within the scope of the appended claims.