# Patent

## Title
Method and device for control information transmission in a wireless communication system

## Abstract

The present invention relates to a wireless communication system. More particularly, the present invention relates to a method for transmitting control information through a PUCCH in a wireless system and to a device therefore.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is the National Stage filing under 35 U.S.C. 371 of International Application No. PCT/KR2011/002940, filed on Apr. 22, 2011, which claims the benefit of earlier filing date and right of priority to Korean Patent Application No. 10-2010-0129070, filed on Dec. 16, 2010, and also claims the benefit of U.S. Provisional Application Serial No. 61/326,661, filed on Apr. 22, 2010, the contents of which are all hereby incorporated by reference herein in their entirety.


TECHNICAL FIELD
The present invention relates to a wireless communication system, and more particularly to a method and apparatus for transmitting control information in a wireless communication system supporting carrier aggregation (CA).
BACKGROUND ART
Wireless communication systems have been widely used to provide various kinds of communication services such as voice or data services. Generally, a wireless communication system is a multiple access system that can communicate with multiple users by sharing available system resources (bandwidth, transmission (Tx) power, and the like). A variety of multiple access systems can be used. For example, a Code Division Multiple Access (CDMA) system, a Frequency Division Multiple Access (FDMA) system, a Time Division Multiple Access (TDMA) system, an Orthogonal Frequency Division Multiple Access (OFDMA) system, a Single Carrier Frequency-Division Multiple Access (SC-FDMA) system, and the like.
DISCLOSURE
Technical Problem
Accordingly, the present invention is directed to a method and apparatus for efficiently transmitting control information in a wireless communication system that substantially obviate one or more problems due to limitations and disadvantages of the related art. An object of the present invention is to provide a method and apparatus for efficiently transmitting control information in a wireless communication system. Another object of the present invention is to provide a channel format and signal processing for effectively transmitting control information, and an apparatus for the channel format and the signal processing. A further object of the present invention is to provide a method and apparatus for effectively allocating resources for transmitting control information.
It will be appreciated by persons skilled in the art that the objects that can be achieved through the present invention are not limited to what has been particularly described hereinabove and the above and other objects that the present invention can achieve will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings.
Technical Solution
The object of the present invention can be achieved by providing a method for transmitting control information through a Physical Uplink Control Channel (PUCCH) by a user equipment (UE) in a wireless communication system, the method including: obtaining a first modulation symbol and a second modulation symbol from the control information; spreading the first modulation symbol to a plurality of subcarriers in a frequency domain; spreading the first modulation symbol spread in the frequency domain to a plurality of first contiguous SC-FDMA symbols in a time domain; spreading the second modulation symbol to a plurality of subcarriers in a frequency domain; spreading the second modulation symbol spread in the frequency domain to the plurality of second contiguous SC-FDMA symbols in a time domain; and transmitting the spread first modulation symbol and the spread second modulation symbol through the PUCCH, wherein the plurality of first contiguous SC-FDMA symbols and the plurality of second contiguous SC-FDMA symbols are located in the same slot.
In another aspect of the present invention, a user equipment (UE) configured to transmit control information through a physical uplink control channel (PUCCH) in a wireless communication system includes: a radio frequency (RF) unit; and a processor, wherein the processor obtains a first modulation symbol and a second modulation symbol from the control information, spreads the first modulation symbol to a plurality of subcarriers in a frequency domain, spreads the first modulation symbol spread in the frequency domain to a plurality of first contiguous SC-FDMA symbols in a time domain, spreads the second modulation symbol to a plurality of subcarriers in a frequency domain, spreads the second modulation symbol spread in the frequency domain to the plurality of second contiguous SC-FDMA symbols in a time domain, and transmits the spread first modulation symbol and the spread second modulation symbol through the PUCCH, wherein the plurality of first contiguous SC-FDMA symbols and the plurality of second contiguous SC-FDMA symbols are located in the same slot.
The first modulation symbol and the second modulation symbol may be obtained from channel-coded control information.
The control information may include a plurality of control information, and the first modulation symbol and the second modulation symbol may be obtained from a single codeword generated through joint coding.
The first modulation symbol may be transmitted using any one of a plurality of resources occupied in the plurality of first contiguous SC-FDMA symbols, and the second modulation symbol may be transmitted using any one of a plurality of resources occupied in the plurality of second contiguous SC-FDMA symbols.
An index related to a first resource from among a plurality of resources occupied for the first or second modulation symbol may be decided by a Control Channel Element (CCE) index used for Physical Downlink Control Channel (PDCCH) transmission, and an index related to a second resource may be decided by the index related to the first resource and an offset value.
A sequence used for time-domain spreading of the first modulation symbol and the second modulation symbol may have a spreading factor (SF) of 2 (SF=2).
A sequence used for frequency-domain spreading of the first modulation symbol and the second modulation symbol may include a Constant Amplitude Zero Auto Correlation (CAZAC) sequence or a Computer Generated (CG)-CAZAC sequence.
Advantageous Effects
Exemplary embodiments of the present invention have the following effects. Control information can be effectively transmitted in a wireless system. In addition, the embodiments of the present invention can provide a channel format and a signal processing method to effectively transmit control information. In addition, resources for transmitting control information can be effectively assigned.
It will be appreciated by persons skilled in the art that the effects that can be achieved through the present invention are not limited to what has been particularly described hereinabove and other advantages of the present invention will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings.



DESCRIPTION OF DRAWINGS
The accompanying drawings, which are included to provide a further understanding of the invention, illustrate embodiments of the invention and together with the description serve to explain the principle of the invention.
FIG. 1 is a conceptual diagram illustrating physical channels used in a 3GPP LTE system acting as an exemplary mobile communication system and a general method for transmitting a signal using the physical channels.
FIG. 2 is a conceptual diagram illustrating a method for processing an uplink signal.
FIG. 3 is a conceptual diagram illustrating a method for processing a downlink signal.
FIG. 4 is a conceptual diagram illustrating an SC-FDMA scheme and an OFDMA scheme applicable to embodiments of the present invention.
FIG. 5 is a conceptual diagram illustrating a signal mapping scheme in a frequency domain so as to satisfy single carrier characteristics.
FIG. 6 is a conceptual diagram illustrating the signal processing for mapping DFT process output samples to a single carrier in a clustered SC-FDMA.
FIGS. 7 and 8 show the signal processing in which DFT process output samples are mapped to multiple carriers in a clustered SC-FDMA.
FIG. 9 shows exemplary segmented SC-FDMA signal processing.
FIG. 10 shows an uplink subframe structure.
FIG. 11 is a conceptual diagram illustrating a signal processing procedure for transmitting a reference signal (RS) on uplink.
FIG. 12 shows demodulation reference signal (DMRS) structures for a physical uplink shared channel (PUSCH).
FIGS. 13 and 14 exemplarily show slot level structures of PUCCH formats 1a and 1b.
FIGS. 15 and 16 exemplarily show slot level structures of PUCCH formats 2/2a/2b.
FIG. 17 is a diagram showing ACK/NACK channelization of PUCCH formats 1a and 1b.
FIG. 18 is a diagram showing channelization of a structure in which PUCCH formats 1/1a/1b and PUCCH formats 2/2a/2b are mixed within the same PRB.
FIG. 19 is a diagram showing allocation of a physical resource allocation (PRB) used to transmit a PUCCH.
FIG. 20 is a conceptual diagram of management of a downlink component carrier (DL CC) in a base station (BS).
FIG. 21 is a conceptual diagram of management of an uplink component carrier (UL CC) in a user equipment (UE).
FIG. 22 is a conceptual diagram of the case where one MAC layer manages multiple carriers in a BS.
FIG. 23 is a conceptual diagram of the case where one MAC layer manages multiple carriers in a UE.
FIG. 24 is a conceptual diagram of the case where one MAC layer manages multiple carriers in a BS.
FIG. 25 is a conceptual diagram of the case where a plurality of MAC layers manages multiple carriers in a UE.
FIG. 26 is a conceptual diagram of the case where a plurality of MAC layers manages multiple carriers in a BS according to one embodiment of the present invention.
FIG. 27 is a conceptual diagram of the case where a plurality of MAC layers manages multiple carriers from the viewpoint of UE reception according to another embodiment of the present invention.
FIG. 28 is a diagram showing asymmetric carrier aggregation (CA) in which a plurality of downlink component carriers (DL CCs) and one uplink CC are linked.
FIGS. 29 and 30 show that Spreading Factor (SF) reduction is applied to Slot 0 contained in a subframe according to one embodiment of the present invention.
FIG. 31 shows a PUCCH format to which joint coding and SF reduction are applied, and signal processing for the PUCCH format according to one embodiment of the present invention.
FIG. 32 shows a PUCCH format to which channel selection and SF reduction are applied, and signal processing for the PUCCH format according to one embodiment of the present invention.
FIGS. 33 and 34 show QPSK constellation illustrating the mapping rule according to embodiments of the present invention.
FIG. 35 is a block diagram illustrating precoding applied to channel selection according to one embodiment of the present invention.
FIG. 36 exemplarily shows 8QPSK constellation based on gray mapping.
FIGS. 37 and 38 exemplarily show a transmit diversity method according to one embodiment of the present invention.
FIGS. 39 and 40 exemplarily show a transmit diversity method according to another embodiment of the present invention.
FIGS. 41 and 42 exemplarily show a transmit diversity method according to another embodiment of the present invention.
FIG. 43 is a block diagram illustrating a base station (BS) and a user equipment (UE) applicable to embodiments of the present invention.



BEST MODE
Reference will now be made in detail to the preferred embodiments of the present invention with reference to the accompanying drawings. The detailed description, which will be given below with reference to the accompanying drawings, is intended to explain exemplary embodiments of the present invention, rather than to show the only embodiments that can be implemented according to the invention. The following embodiments of the present invention can be applied to a variety of wireless access technologies, for example, CDMA, FDMA, TDMA, OFDMA, SC-FDMA, MC-FDMA, and the like. CDMA can be implemented by wireless communication technologies, such as Universal Terrestrial Radio Access (UTRA) or CDMA2000. TDMA can be implemented by wireless communication technologies, for example, Global System for Mobile communications (GSM), General Packet Radio Service (GPRS), Enhanced Data rates for GSM Evolution (EDGE), etc. OFDMA can be implemented by wireless communication technologies, for example, IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, E-UTRA (Evolved UTRA), and the like. UTRA is a part of the Universal Mobile Telecommunications System (UMTS). 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) is a part of Evolved UMTS (E-UMTS) that uses E-UTRA. The LTE-Advanced (LTE-A) is an evolved version of 3GPP LTE. Although the following embodiments of the present invention will hereinafter describe inventive technical characteristics on the basis of the 3GPP LTE/LTE-A system, it should be noted that the following embodiments will be disclosed only for illustrative purposes and the scope and spirit of the present invention are not limited thereto.
In a wireless communication system, the UE may receive information from the base station (BS) via a downlink, and may transmit information via an uplink. The information that is transmitted and received to and from the UE includes data and a variety of control information. A variety of physical channels are used according to categories of transmission (Tx) and reception (Rx) information of the UE.
FIG. 1 is a conceptual diagram illustrating physical channels for use in a 3GPP system and a general method for transmitting a signal using the physical channels.
Referring to FIG. 1, when powered on or when entering a new cell, a UE performs initial cell search in step S101. The initial cell search involves synchronization with a BS. Specifically, the UE synchronizes with the BS and acquires a cell Identifier (ID) and other information by receiving a Primary Synchronization CHannel (P-SCH) and a Secondary Synchronization CHannel (S-SCH) from the BS. Then the UE may acquire information broadcast in the cell by receiving a Physical Broadcast CHannel (PBCH) from the BS. During the initial cell search, the UE may monitor a downlink channel status by receiving a downlink Reference Signal (DL RS).
After initial cell search, the UE may acquire more specific system information by receiving a Physical Downlink Control CHannel (PDCCH) and receiving a Physical Downlink Shared CHannel (PDSCH) based on information of the PDCCH in step S102.
Thereafter, if the UE initially accesses the BS, it may perform random access to the BS in steps S103 to S106. For random access, the UE may transmit a preamble to the BS on a Physical Random Access CHannel (PRACH) in step S103 and receive a response message for the random access on a PDCCH and a PDSCH corresponding to the PDCCH in step S104. In the case of contention-based random access, the UE may transmit an additional PRACH in step S105, and receive a PDCCH and a PDSCH corresponding to the PDCCH in step S106 in such a manner that the UE can perform a contention resolution procedure.
After the above random access procedure, the UE may receive a PDCCH/PDSCH (S107) and transmit a Physical Uplink Shared CHannel (PDSCH)/Physical Uplink Control CHannel (PUCCH) (S108) in a general uplink/downlink signal transmission procedure. Control information that the UE transmits to the BS is referred to as uplink control information (UCI). The UCI includes a Hybrid Automatic Repeat and reQuest ACKnowledgment/Negative-ACK (HARQ ACK/NACK) signal, a Scheduling Request (SR), Channel Quality Indictor (CQI), a Precoding Matrix Index (PMI), and a Rank Indicator (RI). The UCI is transmitted on a PUSCH, in general. However, the UCI can be transmitted on a PUSCH when control information and traffic data need to be transmitted simultaneously. Furthermore, the UCI can be aperiodically transmitted on a PUSCH at the request/instruction of a network.
FIG. 2 is a conceptual diagram illustrating a signal processing method for transmitting an uplink signal by a user equipment (UE).
Referring to FIG. 2, the scrambling module 201 may scramble a transmission signal in order to transmit the uplink signal. The scrambled signal is input to the modulation mapper 202, such that the modulation mapper 202 modulates the scrambled signal to complex symbols in Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK), or 16-ary Quadrature Amplitude Modulation (16QAM) according to the type of the transmission signal and/or a channel status. A transform precoder 203 processes the complex symbols and a resource element mapper 204 may map the processed complex symbols to time-frequency resource elements, for actual transmission. The mapped signal may be transmitted to the BS through an antenna after being processed in a Single Carrier-Frequency Division Multiple Access (SC-FDMA) signal generator 205.
FIG. 3 is a conceptual diagram illustrating a signal processing method for transmitting a downlink signal by a base station (BS).
Referring to FIG. 3, the BS can transmit one or more codewords via a downlink in a 3GPP LTE system. Codewords may be processed as complex symbols by the scrambling module 301 and the modulation mapper 302 in the same manner as in the uplink operation shown in FIG. 2. Thereafter, the complex symbols are mapped to a plurality of layers by the layer mapper 303, and each layer is multiplied by a predetermined precoding matrix and is then allocated to each transmission antenna by the precoder 304. The processed transmission signals of individual antennas are mapped to time-frequency resource elements (REs) to be used for data transmission by the RE mapper 305. Thereafter, the mapped result may be transmitted via each antenna after passing through the OFDMA signal generator 306.
In the case where a UE for use in a wireless communication system transmits an uplink signal, a Peak to Average Power Ratio (PAPR) may become more serious than in the case where the BS transmits a downlink signal. Thus, as described in FIGS. 2 and 3, the SC-FDMA scheme is used for uplink signal transmission in a different way from the OFDMA scheme used for downlink signal transmission.
FIG. 4 is a conceptual diagram illustrating an SC-FDMA scheme and an OFDMA scheme applicable to embodiments of the present invention. In the 3GPP system, the OFDMA scheme is used in downlink and the SC-FDMA scheme is used in uplink.
Referring to FIG. 4, not only a UE for uplink signal transmission but also a BS for downlink signal transmission includes a Serial-to-Parallel converter 401, a subcarrier mapper 403, an M-point IDFT module 404 and a Cyclic Prefix (CP) addition module 406. However, a UE for transmitting a signal using the SC-FDMA scheme further includes an N-point DFT module 402, and compensates for a predetermined part of the IDFT processing influence of the M-point IDFT module 1504 so that a transmission signal can have single carrier characteristics (i.e., single-carrier properties).
FIG. 5 illustrates a signal mapping scheme in the frequency domain for satisfying the single carrier properties. FIG. 5 (a) shows a localized mapping scheme and FIG. 5 (b) shows a distributed mapping scheme.
A clustered SC-FDMA scheme which is a modified form of the SC-FDMA scheme is described as follows. In the clustered SC-FDMA scheme, DFT process output samples are divided into sub-groups in a subcarrier mapping procedure and are non-contiguously mapped in the frequency domain (or subcarrier domain).
FIG. 6 shows signal processing in which DFT-process output samples are mapped to one carrier in the clustered SC-FDMA. FIGS. 7 and 8 show signal processing in which DFT process output samples are mapped to multicarriers in a clustered SC-FDMA. FIG. 6 shows the example of intra-carrier cluster SC-FDMA application. FIGS. 7 and 8 show examples of the inter-carrier clustered SC-FDMA application. FIG. 7 shows the example in which a signal is generated through a single IFFT block under the condition that component carriers are contiguously allocated to a frequency domain and the subcarrier spacing between contiguous component carriers is arranged. FIG. 8 shows another example in which a signal is generated through several IFFT blocks under the condition that component carriers are non-contiguously allocated to a frequency domain.
FIG. 9 shows exemplary segmented SC-FDMA signal processing.
The segmented SC-FDMA to which the same number of IFFTs as an arbitrary number of DFTs is applied may be considered to be an extended version of the conventional SC-FDMA DFT spread and the IFFT frequency subcarrier mapping structure because the relationship between DFT and IFFT is one-to-one basis. If necessary, the segmented SC-FDMA may also be represented by NxSC-FDMA or NxDFT-s-OFDMA. For convenience of description and better understanding of the present invention, the segmented SC-FDMA, NxSC-FDMA and NxDFT-s-OFDMA may be generically referred to as ‘segment SC-FDMA’. Referring to FIG. 9, in order to reduce single carrier characteristics, the segment SC-FDMA groups all the time domain modulation symbols into N groups, such that a DFT process is performed in units of a group.
FIG. 10 shows an uplink subframe structure.
As shown in FIG. 10, the UL subframe includes a plurality of slots (e.g., two slots). Each slot may include a plurality of SC-FDMA symbols, the number of which varies according to the length of a CP. For example, in the case of a normal CP, a slot may include seven SC-FDMA symbols. A UL subframe is divided into a data region and a control region. The data region includes a PUSCH and is used to transmit a data signal such as voice. The control region includes a PUCCH and is used to transmit control information. The PUCCH includes a pair of RBs (e.g., m=0, 1, 2, 3) located at both ends of the data region on the frequency axis (specifically, a pair of RBs at frequency mirrored locations) and hops between slots. The UL control information (i.e., UCI) includes HARQ ACK/NACK, Channel Quality Information (CQI), Precoding Matrix Indicator (PMI), and Rank Indication (RI).
FIG. 11 illustrates a signal processing procedure for transmitting a Reference Signal (RS) in the uplink. As shown in FIG. 11, data is transformed into a frequency domain signal by a DFT precoder and the signal is then transmitted after being subjected to frequency mapping and IFFT. On the other hand, an RS does not pass through the DFT precoder. More specifically, an RS sequence is directly generated in the frequency domain (S11) and is then transmitted after being sequentially subjected to a localized-mapping process (S12), an IFFT process (S13), and a CP attachment process (S14).
The RS sequence ru,ν(α)(n) is defined by a cyclic shift α of a base sequence and may be expressed by the following equation 1.

ru,ν(α)(n)=ejαn ru,ν(n),0≦n≦MscRS  [Equation 1]

where MscRS=mNscRB denotes the length of the RS sequence, NscRB denotes the size of a resource block represented in subcarriers, and m is 1≦m≦NRBmax,UL. NRBmax,UL denotes a maximum UL transmission band.
A base sequence ru,ν(n) is divided into several groups. uε{0, 1, . . . , 29} denotes group number, and ν corresponds to a base sequence number in a corresponding group. Each group includes one base sequence ν=0 having a length of MscRS=mNscRB (1≦m≦5) and two base sequences ν=0,1 having a length of MscRS=mNscRB (6≦m≦NRBmax,UL). The sequence group number u and the number v within a corresponding group may be changed with time. The base sequence ru,ν(0), . . . , ru,ν(MscRS−1) is defined based on a sequence length MscRS.
The base sequence having a length of 3NscRB or more may be defined as follows.
With respect to MscRS≧3NscRB, the base sequence ru,ν(0), . . . , ru,ν(MscRS−1) is given by the following equation 2.

 ru,ν(n)=xq(n mod NZCRS),0≦n<MscRS,  [Equation 2]

where a q-th root Zadoff-Chu sequence may be defined by the following equation 3.




  
    
      
        
          
            
              x
              q
            
            ⁡
            
              (
              m
              )
            
          
          =
          
            e
            
              
                -
                j
              
              ⁢
              
                
                  π
                  ⁢
                  
                    
                  
                  ⁢
                  q
                  ⁢
                  
                    
                  
                  ⁢
                  
                    m
                    ⁡
                    
                      (
                      
                        m
                        +
                        1
                      
                      )
                    
                  
                
                
                  N
                  ZC
                  RS
                
              
            
          
        
        ,
        
          0
          ≤
          m
          ≤
          
            
              N
              ZC
              RS
            
            -
            1
          
        
        ,
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          3
        
        ]
      
    
  




where q satisfies the following equation 4.

q=└ q+1/2┘+ν·(−1)└2 q┘

 q=NZCRS·(u+1)/31  [Equation 4]

where the length NZCRS′ of the Zadoff-Chue sequence is given by the largest prime number, thus satisfying MZCRS<MscRS.
A base sequence having a length of less than 3NscRB may be defined as follows. First, for MscRS=NscRB and MscRS=2NscRB, the base sequence is given as shown in Equation 5.

 ru,ν(n)=ejφ(n)π/4,0≦n≦MscRS−1,  [Equation 5]

where values φ(n) for MscRS=NscRB and MscRS=2NscRB are given by the following Table 1, respectively.








TABLE 1





u
φ(0), . . . , φ(11)



























0
−1
1
3
−3
3
3
1
1
3
1
−3
3


1
1
1
3
3
3
−1
1
−3
−3
1
−3
3


2
1
1
−3
−3
−3
−1
−3
−3
1
−3
1
−1


3
−1
1
1
1
1
−1
−3
−3
1
−3
3
−1


4
−1
3
1
−1
1
−1
−3
−1
1
−1
1
3


5
1
−3
3
−1
−1
1
1
−1
−1
3
−3
1


6
−1
3
−3
−3
−3
3
1
−1
3
3
−3
1


7
−3
−1
−1
−1
1
−3
3
−1
1
−3
3
1


8
1
−3
3
1
−1
−1
−1
1
1
3
−1
1


9
1
−3
−1
3
3
−1
−3
1
1
1
1
1


10
−1
3
−1
1
1
−3
−3
−1
−3
−3
3
−1


11
3
1
−1
−1
3
3
−3
1
3
1
3
3


12
1
−3
1
1
−3
1
1
1
−3
−3
−3
1


13
3
3
−3
3
−3
1
1
3
−1
−3
3
3


14
−3
1
−1
−3
−1
3
1
3
3
3
−1
1


15
3
−1
1
−3
−1
−1
1
1
3
1
−1
−3


16
1
3
1
−1
1
3
3
3
−1
−1
3
−1


17
−3
1
1
3
−3
3
−3
−3
3
1
3
−1


18
−3
3
1
1
−3
1
−3
−3
−1
−1
1
−3


19
−1
3
1
3
1
−1
−1
3
−3
−1
−3
−1


20
−1
−3
1
1
1
1
3
1
−1
1
−3
−1


21
−1
3
−1
1
−3
−3
−3
−3
−3
1
−1
−3


22
1
1
−3
−3
−3
−3
−1
3
−3
1
−3
3


23
1
1
−1
−3
−1
−3
1
−1
1
3
−1
1


24
1
1
3
1
3
3
−1
1
−1
−3
−3
1


25
1
−3
3
3
1
3
3
1
−3
−1
−1
3


26
1
3
−3
−3
3
−3
1
−1
−1
3
−1
−3


27
−3
−1
−3
−1
−3
3
1
−1
1
3
−3
−3


28
−1
3
−3
3
−1
3
3
−3
3
3
−1
−1


29
3
−3
−3
−1
−1
−3
−1
3
−3
3
1
−1


















TABLE 2





u
φ(0), . . . , φ(23)








































0
−1
3
1
−3
3
−1
1
3
−3
3
1
3
−3
3
1
1
−1
1
3
−3
3
−3
−1
−3


1
−3
3
−3
−3
−3
1
−3
−3
3
−1
1
1
1
3
1
−1
3
−3
−3
1
3
1
1
−3


2
3
−1
3
3
1
1
−3
3
3
3
3
1
−1
3
−1
1
1
−1
−3
−1
−1
1
3
3


3
−1
−3
1
1
3
−3
1
1
−3
−1
−1
1
3
1
3
1
−1
3
1
1
−3
−1
−3
−1


4
−1
−1
−1
−3
−3
−1
1
1
3
3
−1
3
−1
1
−1
−3
1
−1
−3
−3
1
−3
−1
−1


5
−3
1
1
3
−1
1
3
1
−3
1
−3
1
1
−1
−1
3
−1
−3
3
−3
−3
−3
1
1


6
1
1
−1
−1
3
−3
−3
3
−3
1
−1
−1
1
−1
1
1
−1
−3
−1
1
−1
3
−1
−3


7
−3
3
3
−1
−1
−3
−1
3
1
3
1
3
1
1
−1
3
1
−1
1
3
−3
−1
−1
1


8
−3
1
3
−3
1
−1
−3
3
−3
3
−1
−1
−1
−1
1
−3
−3
−3
1
−3
−3
−3
1
−3


9
1
1
−3
3
3
−1
−3
−1
3
−3
3
3
3
−1
1
1
−3
1
−1
1
1
−3
1
1


10
−1
1
−3
−3
3
−1
3
−1
−1
−3
−3
−3
−1
−3
−3
1
−1
1
3
3
−1
1
−1
3


11
1
3
3
−3
−3
1
3
1
−1
−3
−3
−3
3
3
−3
3
3
−1
−3
3
−1
1
−3
1


12
1
3
3
1
1
1
−1
−1
1
−3
3
−1
1
1
−3
3
3
−1
−3
3
−3
−1
−3
−1


13
3
−1
−1
−1
−1
−3
−1
3
3
1
−1
1
3
3
3
−1
1
1
−3
1
3
−1
−3
3


14
−3
−3
3
1
3
1
−3
3
1
3
1
1
3
3
−1
−1
−3
1
−3
−1
3
1
1
3


15
−1
−1
1
−3
1
3
−3
1
−1
−3
−1
3
1
3
1
−1
−3
−3
−1
−1
−3
−3
−3
−1


16
−1
−3
3
−1
−1
−1
−1
1
1
−3
3
1
3
3
1
−1
1
−3
1
−3
1
1
−3
−1


17
1
3
−1
3
3
−1
−3
1
−1
−3
3
3
3
−1
1
1
3
−1
−3
−1
3
−1
−1
−1


18
1
1
1
1
1
−1
3
−1
−3
1
1
3
−3
1
−3
−1
1
1
−3
−3
3
1
1
−3


19
1
3
3
1
−1
−3
3
−1
3
3
3
−3
1
−1
1
−1
−3
−1
1
3
−1
3
−3
−3


20
−1
−3
3
−3
−3
−3
−1
−1
−3
−1
−3
3
1
3
−3
−1
3
−1
1
−1
3
−3
1
−1


21
−3
−3
1
1
−1
1
−1
1
−1
3
1
−3
−1
1
−1
1
−1
−1
3
3
−3
−1
1
−3


22
−3
−1
−3
3
1
−1
−3
−1
−3
−3
3
−3
3
−3
−1
1
3
1
−3
1
3
3
−1
−3


23
−1
−1
−1
−1
3
3
3
1
3
3
−3
1
3
−1
3
−1
3
3
−3
3
1
−1
3
3


24
1
−1
3
3
−1
−3
3
−3
−1
−1
3
−1
3
−1
−1
1
1
1
1
−1
−1
−3
−1
3


25
1
−1
1
−1
3
−1
3
1
1
−1
−1
−3
1
1
−3
1
3
−3
1
1
−3
−3
−1
−1


26
−3
−1
1
3
1
1
−3
−1
−1
−3
3
−3
3
1
−3
3
−3
1
−1
1
−3
1
1
1


27
−1
−3
3
3
1
1
3
−1
−3
−1
−1
−1
3
1
−3
−3
−1
3
−3
−1
−3
−1
−3
−1


28
−1
−3
−1
−1
1
−3
−1
−1
1
−1
−3
1
1
−3
1
−3
−3
3
1
1
−1
3
−1
−1


29
1
1
−1
−1
−3
−1
3
−1
3
−1
1
3
1
−1
3
1
3
−3
−3
1
−1
−1
1
3









RS hopping is described below.
The sequence group number u in a slot ns may be defined as shown in the following equation 6 by a group hopping pattern fgh(ns) and a sequence shift pattern fss.

u =(fgh(ns)+fss)mod 30  [Equation 6]

where mod denotes a modulo operation.
17 different hopping patterns and 30 different sequence shift patterns are present. Sequence group hopping may be enabled or disabled by a parameter for activating group hopping provided by a higher layer.
Although the PUCCH and the PUSCH have the same hopping pattern, the PUCCH and the PUSCH may have different sequence shift patterns.
The group hopping pattern fgh(ns) is the same for the PUSCH and the PUCCH and is given by the following equation 7.



  
    
      
    
    ⁢
    
      [
      
        Equation
        ⁢
        
          
        
        ⁢
        7
      
      ]
    
  




  
    
      
        f
        gh
      
      ⁡
      
        (
        
          n
          s
        
        )
      
    
    =
    
      {
      
        
          
            
              0
            
            
              
                if
                ⁢
                
                  
                
                ⁢
                group
                ⁢
                
                  
                
                ⁢
                hopping
                ⁢
                
                  
                
                ⁢
                is
                ⁢
                
                  
                
                ⁢
                disabled
              
            
          
          
            
              
                
                  (
                  
                    
                      ∑
                      
                        i
                        =
                        0
                      
                      7
                    
                    ⁢
                    
                      
                        c
                        ⁡
                        
                          (
                          
                            
                              8
                              ⁢
                              
                                n
                                s
                              
                            
                            +
                            i
                          
                          )
                        
                      
                      ·
                      
                        2
                        i
                      
                    
                  
                  )
                
                ⁢
                mod
                ⁢
                
                  
                
                ⁢
                30
              
            
            
              
                if
                ⁢
                
                  
                
                ⁢
                group
                ⁢
                
                  
                
                ⁢
                hopping
                ⁢
                
                  
                
                ⁢
                is
                ⁢
                
                  
                
                ⁢
                enabled
              
            
          
        
        ,
      
    
  



where c(i) denotes a pseudo-random sequence and a pseudo-random sequence generator may be initialized by




  
    c
    init
  
  =
  
    ⌊
    
      
        N
        ID
        cell
      
      30
    
    ⌋
  




at the start of each radio frame.

The definition of the sequence shift pattern fss varies between the PUCCH and the PUSCH.
The sequence shift pattern fssPUCCH of the PUCCH is fssPUCCH=NIDcell mod30 and the sequence shift pattern fssPUSCH of the PUSCH is fssPUSCH=(fssPUCCH+Δss)mod 30. Δssε{0, 1, . . . , 29} is configured by a higher layer.
The following is a description of sequence hopping.
Sequence hopping is applied only to an RS having a length of MscRS≧6NscRB.
For an RS having a length of MscRS<6NscRB, a base sequence number ν within a base sequence group is v=0.
For an RS having a length of MscRS≧6NscRB, a base sequence number ν within a base sequence group in a slot ns is given by the following equation 8.




  
    
      
        v
        =
        
          {
          
            
              
                
                  
                    c
                    ⁡
                    
                      (
                      
                        n
                        s
                      
                      )
                    
                  
                
                
                  
                    
                      
                        
                          if
                          ⁢
                          
                            
                          
                          ⁢
                          group
                          ⁢
                          
                            
                          
                          ⁢
                          hopping
                          ⁢
                          
                            
                          
                          ⁢
                          is
                          ⁢
                          
                            
                          
                          ⁢
                          disabled
                          ⁢
                          
                            
                          
                          ⁢
                          and
                        
                      
                    
                    
                      
                        
                          sequence
                          ⁢
                          
                            
                          
                          ⁢
                          hopping
                          ⁢
                          
                            
                          
                          ⁢
                          is
                          ⁢
                          
                            
                          
                          ⁢
                          enabled
                        
                      
                    
                  
                
              
              
                
                  0
                
                
                  otherwise
                
              
            
            .
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          8
        
        ]
      
    
  




where c(i) denotes a pseudo-random sequence and a parameter for enabling sequence hopping provided by a higher layer determines whether or not sequence hopping is possible. The pseudo-random sequence generator may be initialized as




  
    c
    init
  
  =
  
    
      
        ⌊
        
          
            N
            ID
            cell
          
          30
        
        ⌋
      
      ·
      
        2
        5
      
    
    +
    
      f
      ss
      PUSCH
    
  




at the start of a radio frame.

An RS for a PUSCH is determined in the following manner.
The RS sequence rPUSCH(•) for the PUCCH is defined as rPUSCH(m·MscRS+n)=ru, ν(α)(n). Here, m and n satisfy



  
    
      m
      =
      0
    
    ,
    1
  




  
    
      n
      =
      0
    
    ,
    ...
    ⁢
    
      
    
    ,
    
      
        M
        ss
        RS
      
      -
      1
    
  



and satisfy MscRS=MscPUSCH.

A cyclic shift in one slot is given by α=2ncs/12 together with ncs=(nDRMS(1)+nDMRS(2)+nPRS(ns))mod12.
Here, nDRMS(1) is a broadcast value, nDMRS(2) is given by UL scheduling allocation, and nPRS(ns) is a cell-specific cyclic shift value. nPRS(ns) varies according to a slot number ns, and is given by nPRS(ns)=Σi=07c(8·ns+i)·2i.
c(i) is a pseudo-random sequence and c(i) is also a cell-specific value. The pseudo-random sequence generator may be initialized as




  
    c
    init
  
  =
  
    
      
        ⌊
        
          
            N
            ID
            cell
          
          30
        
        ⌋
      
      ·
      
        2
        5
      
    
    +
    
      f
      ss
      PUSCH
    
  




at the start of a radio frame.

Table 3 shows a cyclic shift field and nDMRS(2) at a downlink control information (DCI) format 0.









TABLE 3






Cyclic shift field at DCI format 0
nDMRS(2)


















000
0



001
2



010
3



011
4



100
6



101
8



110
9



111
10









A physical mapping method for a UL RS at a PUSCH is as follows.
A sequence is multiplied by an amplitude scaling factor βPUSCH and is mapped to the same physical resource block (PRB) set used for the corresponding PUSCH within the sequence that starts at rPUSCH(0). When the sequence is mapped to a resource element (k, l) (l=3 for a normal CP and l=2 for an extended CP) within a subframe, the order of k is first increased and the slot number is then increased.
In summary, a ZC sequence is used along with cyclic extension if the length is greater than or equal to 3NscRB and a computer-generated sequence is used if the length is less than 3NscRB. The cyclic shift is determined according to a cell-specific cyclic shift, a UE-specific cyclic shift, a hopping pattern, and the like.
FIG. 12A illustrates the structure of a demodulation reference signal (DMRS) for a PUSCH in the case of normal CP and FIG. 12B illustrates the structure of a DMRS for a PUSCH in the case of extended CP. In the structure of FIG. 12A, a DMRS is transmitted through fourth and eleventh SC-FDMA symbols and, in the structure of FIG. 12B, a DMRS is transmitted through third and ninth SC-FDMA symbols.
FIGS. 13 to 16 illustrate a slot level structure of a PUCCH format. The PUCCH includes the following formats in order to transmit control information.

    
    
        (1) Format 1: Used for on-off keying (OOK) modulation and scheduling request (SR)
        (2) Format 1a and Format 1b: Used for ACK/NACK transmission
        
            1) Format 1a: BPSK ACK/NACK for one codeword
            2) Format 1b: QPSK ACK/NACK for two codewords
        
        
        (3) Format 2: Used for QPSK modulation and CQI transmission
        (4) Format 2a and Format 2b: Used for CQI and ACK/NACK simultaneous transmission.
    
    


Table 4 shows a modulation scheme and the number of bits per subframe according to PUCCH format. Table 5 shows the number of RSs per slot according to PUCCH format. Table 6 shows SC-FDMA symbol locations of an RS according to PUCCH format. In Table 4, the PUCCH formats 2a and 2b correspond to the case of normal CP.










TABLE 4






PUCCH

Number of bits per



format
Modulation scheme
subframe, Mbit








1
N/A
N/A



1a
BPSK
1



1b
QPSK
2



2
QPSK
20



2a
QPSK + BPSK
21



2b
QPSK + BPSK
22



















TABLE 5






PUCCH





format
Normal CP
Extended CP








1, 1a, 1b
3
2



2
2
1



2a, 2b
2
N/A



















TABLE 6








PUCCH
SC-FDMA symbol location of RS












format
Normal CP
Extended CP






1, 1a, 1b
2, 3, 4
2, 3



2, 2a, 2b
1, 5
3









FIG. 13 shows a PUCCH format 1a and 1b structure in the case of a normal CP. FIG. 14 shows a PUCCH format 1a and 1b structure in the case of an extended CP. In the PUCCH format 1a and 1b structure, the same control information is repeated in each slot within a subframe. UEs transmit ACK/NACK signals through different resources that include orthogonal covers or orthogonal cover codes (OCs or OCCs) and different cyclic shifts (i.e., different frequency domain codes) of a Computer-Generated Constant Amplitude Zero Auto Correlation (CG-CAZAC) sequence. For example, the OCs may include orthogonal Walsh/DFT codes. When the number of CSs is 6 and the number of OCs is 3, a total of 18 UEs may be multiplexed in the same Physical Resource Block (PRB) based on a single antenna. Orthogonal sequences w0, w1, w2, and w3 may be applied to an arbitrary time domain (after FFT modulation) or an arbitrary frequency domain (before FFT modulation).
For SR and persistent scheduling, ACK/NACK resources composed of CSs, OCs and PRBs may be assigned to UEs through Radio Resource Control (RRC). For dynamic ACK/NACK and non-persistent scheduling, ACK/NACK resources may be implicitly assigned to the UE using the lowest CCE index of a PDCCH corresponding to the PDSCH.
FIG. 15 shows a PUCCH format 2/2a/2b structure in the case of the normal CP. FIG. 16 shows a PUCCH format 2/2a/2b structure in the case of the extended CP. As shown in FIGS. 15 and 16, one subframe includes 10 QPSK data symbols in addition to an RS symbol in the normal CP case. Each QPSK symbol is spread in the frequency domain by a CS and is then mapped to a corresponding SC-FDMA symbol. SC-FDMA symbol level CS hopping may be applied in order to randomize inter-cell interference. RSs may be multiplexed by CDM using a CS. For example, if it is assumed that the number of available CSs is 12 or 6, 12 or 6 UEs may be multiplexed in the same PRB. For example, in PUCCH formats 1/1a/1b and 2/2a/2b, a plurality of UEs may be multiplexed by CS+OC+PRB and CS+PRB.
Length-4 and length-3 orthogonal sequences (OCs) for PUCCH formats 1/1a/1b are shown in the following Tables 7 and 8.







TABLE 7







Length-4 orthogonal sequences for PUCCH formats 1/1a/1b











Orthogonal sequences 



Sequence index noc (ns)
[w(0) . . . w(NSFPUCCH − 1)]






0
[+1 +1 +1 +1]



1
[+1 −1 +1 −1]



2
[+1 −1 −1 +1]
















TABLE 8







Length-3 orthogonal sequences for PUCCH formats 1/1a/1b











Orthogonal sequences 



Sequence index noc (ns)
[w(0) . . . w(NSFPUCCH − 1)]






0
[1 1 1]



1
[1 ej2π/3 ej4π/3]



2
[1 ej4π/3 ej2π/3]









The orthogonal sequences (OCs) for the RS in the PUCCH formats 1/1a/1b are shown in Table 9.







TABLE 9







1a and 1b









Sequence index noc (ns)
Normal cyclic prefix
Extended cyclic prefix





0
[1 1 1]
[1 1]


1
[1 ej2π/3 ej4π/3]
[1 −1]


2
[1 ej4π/3 ej2π/3]
N/A









FIG. 17 illustrates ACK/NACK channelization for PUCCH formats 1a and 1b when ΔshiftPUCCH=2.
FIG. 18 illustrates channelization of a structure in which PUCCH formats 1/1a/1b and PUCCH formats 2/2a/2b are mixed within the same PRB.
CS (Cyclic Shift) hopping and OC (Orthogonal Cover) remapping may be applied as follows.

    
    
        (1) Symbol-based cell-specific CS hopping for inter-cell interference randomization
        (2) Slot level CS/OC remapping
        
            1) For inter-cell interference randomization
            2) Slot-based access for mapping between ACK/NACK channels and resources (k)
        
        
    
    


A resource nr for PUCCH formats 1/1a/1b includes the following combination.

    
    
        (1) CS (=DFT OC in a symbol level) (ncs)
        (2) OC (OC in a slot level) (noc)
        (3) Frequency RB (nrb)
    
    


When indices representing the CS, the OC and the RB are ncs, noc and nrb, respectively, a representative index nr includes ncs, noc and nrb. That is, nr=(ncs, noc, nrb).
A CQI, a PMI, an RI, and a combination of a CQI and an ACK/NACK may be transmitted through PUCCH formats 2/2a/2b. Here, Reed Muller (RM) channel coding may be applied.
For example, in the LTE system, channel coding for a UL CQI is described as follows. A bit stream a0, a1, a2, a3, . . . , aA-1 is channel-coded using a (20, A) RM code. Table 10 shows a base sequence for the (20, A) code. a0 and aA-1 represent a Most Significant Bit (MSB) and a Least Significant Bit (LSB), respectively. In the extended CP case, the maximum number of information bits is 11, except when the CQI and the ACK/NACK are simultaneously transmitted. After the bit stream is coded into 20 bits using the RM code, QPSK modulation may be applied to the encoded bits. Before QPSK modulation, the encoded bits may be scrambled.




















TABLE 10





l
Mj,0
Mj,1
Mj,2
Mj,3
Mj,4
Mj,5
Mj,6
Mj,7
Mj,8
Mj,9
Mj,10
Mj,11
Mj,12




























0
1
1
0
0
0
0
0
0
0
0
1
1
0


1
1
1
1
0
0
0
0
0
0
1
1
1
0


2
1
0
0
1
0
0
1
0
1
1
1
1
1


3
1
0
1
1
0
0
0
0
1
0
1
1
1


4
1
1
1
1
0
0
0
1
0
0
1
1
1


5
1
1
0
0
1
0
1
1
1
0
1
1
1


6
1
0
1
0
1
0
1
0
1
1
1
1
1


7
1
0
0
1
1
0
0
1
1
0
1
1
1


8
1
1
0
1
1
0
0
1
0
1
1
1
1


9
1
0
1
1
1
0
1
0
0
1
1
1
1


10
1
0
1
0
0
1
1
1
0
1
1
1
1


11
1
1
1
0
0
1
1
0
1
0
1
1
1


12
1
0
0
1
0
1
0
1
1
1
1
1
1


13
1
1
0
1
0
1
0
1
0
1
1
1
1


14
1
0
0
0
1
1
0
1
0
0
1
0
1


15
1
1
0
0
1
1
1
1
0
1
1
0
1


16
1
1
1
0
1
1
1
0
0
1
0
1
1


17
1
0
0
1
1
1
0
0
1
0
0
1
1


18
1
1
0
1
1
1
1
1
0
0
0
0
0


19
1
0
0
0
0
1
1
0
0
0
0
0
0









Channel coding bits b0, b1, b2, b3, . . . , bB-1 may be generated by Equation 9.




  
    
      
        
          
            b
            i
          
          =
          
            
              ∑
              
                n
                =
                0
              
              
                A
                -
                1
              
            
            ⁢
            
              
                (
                
                  
                    a
                    n
                  
                  ·
                  
                    M
                    
                      i
                      ,
                      n
                    
                  
                
                )
              
              ⁢
              mod
              ⁢
              
                
              
              ⁢
              2
            
          
        
        ,
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          9
        
        ]
      
    
  




where i=0, 1, 2, . . . , B−1.
Table 11 shows an uplink control information (UCI) field for broadband reporting (single antenna port, transmit diversity or open loop spatial multiplexing PDSCH) CQI feedback.









TABLE 11






Field
Bandwidth



















Wideband CQI
4
5









Table 12 shows a UCI field for wideband CQI and PMI feedback. The field reports closed loop spatial multiplexing PDSCH transmission.








TABLE 12








Bandwidth










2 antenna ports
4 antenna ports











Field
Rank = 1
Rank = 2
Rank = 1
Rank > 1





Wideband CQI
4
4
4
4


Spatial differential CQI
0
3
0
3


PMI (Preceding
2
1
4
4


Matrix Index)









Table 13 shows a UCI field for RI feedback for wideband reporting.








TABLE 13








Bit widths










4 antenna ports














2 antenna
Up to two
Up to four



Field
ports
layers
layers






RI (Rank
1
1
2



Indication)









FIG. 19 shows PRB allocation. As shown in FIG. 19, the PRB may be used for PUCCH transmission in slot ns.
The term “multi-carrier system” or “carrier aggregation system” refers to a system for aggregating and utilizing a plurality of carriers having a bandwidth smaller than a target bandwidth for broadband support. When a plurality of carriers having a bandwidth smaller than a target bandwidth is aggregated, the bandwidth of the aggregated carriers may be limited to a bandwidth used in the existing system for backward compatibility with the existing system. For example, the existing LTE system may support bandwidths of 1.4, 3, 5, 10, 15 and 20 MHz and an LTE-Advanced (LTE-A) system evolved from the LTE system may support a bandwidth greater than 20 MHz using only the bandwidths supported by the LTE system. Alternatively, regardless of the bandwidths used in the existing system, a new bandwidth may be defined so as to support carrier aggregation. The term “multi-carrier” may be used interchangeably with the terms “carrier aggregation” and “bandwidth aggregation”. The term “carrier aggregation” may refer to both contiguous carrier aggregation and non-contiguous carrier aggregation.
FIG. 20 is a conceptual diagram illustrating management of downlink component carriers (DL CCs) in a base station (BS) and FIG. 21 is a conceptual diagram illustrating management of uplink component carriers (UL CCs) in a user equipment (UE). For ease of explanation, the higher layer is simply described as a MAC (or a MAC entity) in the following description of FIGS. 20 and 21.
FIG. 22 is a conceptual diagram illustrating management of multiple carriers by one MAC entity in a BS. FIG. 23 is a conceptual diagram illustrating management of multiple carriers by one MAC entity in a UE.
As shown in FIGS. 22 and 23, one MAC manages and operates one or more frequency carriers to perform transmission and reception. Frequency carriers managed by one MAC need not be contiguous and as such they are more flexible in terms of resource management. In FIGS. 22 and 23, it is assumed that one PHY (or PHY entity) corresponds to one component carrier (CC) for ease of explanation. One PHY does not always indicate an independent radio frequency (RF) device. Although one independent RF device generally corresponds to one PHY, the present invention is not limited thereto and one RF device may include a plurality of PHYs.
FIG. 24 is a conceptual diagram illustrating management of multiple carriers by a plurality of MAC entities in a BS. FIG. 25 is a conceptual diagram illustrating management of multiple carriers by a plurality of MAC entities in a UE. FIG. 26 illustrates another scheme of management of multiple carriers by a plurality of MAC entities in a BS. FIG. 27 illustrates another scheme of management of multiple carriers by a plurality of MAC entities in a UE.
Unlike the structures of FIGS. 22 and 23, a number of carriers may be controlled by a number of MAC entities rather than by one MAC as shown in FIGS. 24 to 27.
As shown in FIGS. 24 and 25, carriers may be controlled by MACs on a one to one basis. As shown in FIGS. 26 and 27, some carriers may be controlled by MACs on a one to one basis and one or more remaining carriers may be controlled by one MAC.
The above-mentioned system includes a plurality of carriers (i.e., 1 to N carriers) and carriers may be used so as to be contiguous or non-contiguous to each other. This scheme may be equally applied to UL and DL. The TDD system is constructed so as to manage N carriers, each including downlink and uplink transmission, and the FDD system is constructed such that multiple carriers are applied to each of uplink and downlink. The FDD system may also support asymmetrical carrier aggregation in which the numbers of carriers aggregated in uplink and downlink and/or the bandwidths of carriers in uplink and downlink are different.
When the number of component carriers (CCs) aggregated in uplink (UL) is identical to the number of CCs aggregated in downlink (DL), all CCs may be configured so as to be compatible with the conventional system. However, this does not mean that CCs that are configured without taking into consideration such compatibility are excluded from the present invention.
Hereinafter, it is assumed for ease of explanation description that, when a PDCCH is transmitted through DL component carrier #0, a PDSCH corresponding to the PDCCH is transmitted through DL component carrier #0. However, it is apparent that cross-carrier scheduling may be applied such that the PDSCH is transmitted through a different DL component carrier. The term “component carrier” may be replaced with other equivalent terms (e.g., cell).
FIG. 28 shows a scenario in which uplink control information (UCI) is transmitted in a radio communication system supporting carrier aggregation (CA). For ease of explanation, it is assumed in this example that the UCI is ACK/NACK (A/N). However, the UCI may include control information such as channel state information (CSI) (e.g., CQI, PMI, RI, etc.) or scheduling request information (e.g., SR, etc.).
FIG. 28 shows asymmetric carrier aggregation in which 5 DL CCs and one UL CC are linked. The illustrated asymmetric carrier aggregation may be set from the viewpoint of UCI transmission. That is, a DL CC-UL CC linkage for UCI and a DL CC-UL CC linkage for data may be set differently. When it is assumed for ease of explanation that one DL CC can carry up to two codewords, at least two ACK/NACK bits are needed. In this case, in order to transmit an ACK/NACK for data received through 5 DL CCs through one UL CC, at least 10 ACK/NACK bits are needed. In order to also support a discontinuous transmission (DTX) state for each DL CC, at least 12 bits (=55=3125=11.61 bits) are needed for ACK/NACK transmission. The conventional PUCCH format 1a/1b structure cannot transmit such extended ACK/NACK information since the conventional PUCCH format 1a/1b structure can transmit up to 2 ACK/NACK bits. Although carrier aggregation has been illustrated as a cause of an increase in the amount of UCI information, the amount of UCI information may also be increased due to an increase in the number of antennas and the presence of a backhaul subframe in a TDD system or a relay system. Similar to the case of ACK/NACK, the amount of control information that should be transmitted is increased even when control information associated with a plurality of DL CCs is transmitted through one UL CC. For example, UCI payload may be increased when there is a need to transmit a CQI/PMI/RI for a plurality of DL CCs. DL CC may also be referred to as DL Cell, and UL CC may also be referred to as UL Cell. In addition, the anchor DL CC may also be referred to as DL PCell, and the anchor UL CC may also be referred to as UL PCell.
A DL primary CC may be defined as a DL CC linked with a UL primary CC. Here, linkage includes implicit and explicit linkage. In LTE, one DL CC and one UL CC are uniquely paired. For example, a DL CC that is linked with a UL primary CC by LTE pairing may be referred to as a DL primary CC. This may be regarded as implicit linkage. Explicit linkage indicates that a network configures the linkage in advance and may be signaled by RRC or the like. In explicit linkage, a DL CC that is paired with a UL primary CC may be referred to as a primary DL CC. A UL primary (or anchor) CC may be a UL CC in which a PUCCH is transmitted. Alternatively, the UL primary CC may be a UL CC in which UCI is transmitted through a PUCCH or a PUSCH. The DL primary CC may also be configured through higher layer signaling. The DL primary CC may be a DL CC in which a UE performs initial access. DL CCs other than the DL primary CC may be referred to as DL secondary CCs. Similarly, UL CCs other than the UL primary CC may be referred to as UL secondary CCs.
DL-UL may correspond only to FDD. DL-UL pairing may not be defined for TDD since TDD uses the same frequency. In addition, a DL-UL linkage may be determined from a UL linkage through UL E-UTRA Absolute Radio Frequency Channel Number (EARFCN) of SIB2. For example, the DL-UL linkage may be acquired through SIB2 decoding when initial access is performed and may be acquired through RRC signaling otherwise. Accordingly, only the SIB2 linkage may be present and other DL-UL pairing may not be defined. For example, in the 5DL:1UL structure of FIG. 28, DL CC #0 and UL CC #0 may be in an SIB2 linkage relation with each other and other DL CCs may be in an SIB2 linkage relation with other UL CCs which have not been set for the UE.
While some embodiments are focused on asymmetrical carrier aggregation, the present invention can be applied to various carrier aggregation scenarios including symmetrical carrier aggregation.
Embodiment: Transmission of Multiple UCIs using Spreading Factor (SF) Reduction
Hereinafter, the present invention proposes a method for efficiently transmitting increased uplink control information with reference to the attached drawings. In more detail, the present invention proposes a new PUCCH format, a signal processing step, and a resource allocation method for transmitting increased uplink control information. For convenience of description, the PUCCH format proposed by the present invention will hereinafter be referred to as PUCCH format 3 in terms of a new PUCCH format, an LTE-A PUCCH format, or a PUCCH format 2 defined in the legacy LTE. Technical scope or spirit of the PUCCH format proposed by the present invention can be easily applied to an arbitrary physical channel (e.g., PUSCH) capable of transmitting uplink control information using the same or similar scheme. For example, the embodiment of the present invention can be applied to a periodic PUSCH structure for periodically transmitting control information or an aperiodic PUSCH structure for aperiodically transmitting control information.
The following drawings and embodiments will focus upon an exemplary case in which a UCI/RS symbol structure of a PUCCH format 1 (normal CP) of the legacy LTE is used as a UCI/RS symbol structure of a subframe/slot level applied to a PUCCH format of the embodiment of the present invention. However, the UCI/RS symbol structure of the subframe/slot level for use in the above PUCCH format is not limited thereto will be disclosed only for illustrative purposes and the scope and spirit of the present invention are not limited thereto. In the PUCCH format of the present invention, the number of UCI/RS symbols, the location thereof, etc. can be freely modified according to a system design. For example, the PUCCH format according to the present invention can be defined using the PUCCH format 2/2a/2b structure of the legacy LTE.
The PUCCH format according to the embodiment of the present invention may be used to transmit arbitrary categorized/sized uplink control information (UCI). For example, the PUCCH format according to the embodiment of the present invention may transmit a variety of information, for example, HARQ ACK/NACK, CQI, PMI, RI, SR, etc., and this information may have an arbitrary-sized payload. For convenience of description, the present embodiment is focused upon the exemplary case in which PUCCH format transmits ACK/NACK information, and a detailed description thereof will be given later.
FIGS. 29 and 30 show that Spreading Factor (SF) reduction is applied to Slot 0 contained in a subframe according to one embodiment of the present invention. FIG. 29 shows the case of a normal CP, and FIG. 30 shows the case of an extended CP. In the examples shown in FIGS. 29 and 30, a spreading factor (SF) value of an OC for use in a PUCCH format of the legacy LTE is reduced from ‘4’ to ‘2’. Basic signal processing steps of FIGS. 29 and 30 are identical to those of FIGS. 13 and 14.
Referring to FIGS. 29 and 30, information bits (e.g. ACK/NACK) are converted into modulated symbols (symbols 0 and 1) through modulation (e.g. QPSK, 8PSK, 16QAM, 64QAM or the like). The modulated symbols are multiplied by a base sequence r0, and a cyclic shift and an orthogonal code (OC) ([w0 w1];[w2 w3]) with SF=2 are sequentially applied to the modulated symbols. Then, the modulated symbols to which the cyclic shift and OC have been applied are subjected to IFFT to be mapped to SC-FDMA symbols. Here, r0 includes a base sequence having a length of 12. The OC includes a Walsh cover or a DFT code defined in LTE. Orthogonal codes [w0 w1] and [w2 w3] may be independently provided or may have the same value according to implementation scheme.
The legacy LTE PUCCH format 1a/1b can transmit only one modulated symbol in one slot because it uses SF=4. Furthermore, since the same information is repeated on a slot basis, LTE PUCCH format 1a/1b can transmit only one modulated symbol at a subframe level. Accordingly, LTE PUCCH formats can transmit ACK/NACK information having a maximum of 2 bits in case of QPSK. However, the PUCCH format illustrated in FIGS. 29 and 30 can transmit two modulated symbols per slot due to SF reduction. Furthermore, if slots are configured such that they transmit different pieces of information, a maximum of 4 modulated symbols can be transmitted at the subframe level. Therefore, the illustrated PUCCH format can transmit UCI (e.g. ACK/NACK) having a maximum of 8 bits in case of QPSK.
However, SF reduction can transmit (1) a maximum of 8 bits in case of QPSK modulation; and (2) UCI having occupied four SC-FDMA symbols on a slot basis occupies two SC-FDMA symbols, so that energy per UCI is cut in half, resulting in a loss of 3 dB SNR (Signal to Noise Ratio).
A method for solving the above-mentioned problem will hereinafter be described. The following embodiments may be implemented independently or collectively.
The first scheme can perform joint coding of UCI. In other words, performance deterioration can be improved by a coding gain obtained through the joint coding. The coding gain can be used either when much more UCIs can be transmitted simultaneously while maintaining the same SNR, or when the same amount of UCI can be transmitted at a higher SNR.
The second scheme can solve the above-mentioned problem using channel selection. The channel selection means a method for transmitting




  
    (
    
      
        
          M
        
      
      
        
          N
        
      
    
    )
  
  =
  
    
      M
      !
    
    
      
        
          (
          
            M
            -
            N
          
          )
        
        !
      
      ⁢
      
        N
        !
      
    
  




information by selectively transmitting N resources from among a total of M resources. For example, assuming that M=2 and N=1 are given and QPSK modulation (2 bits) are applied to the selected resources, a total of 8 states (=3 bits) can be transmitted. That is, multiple orthogonal resources can be allocated and a resource selection domain can be used to transmit UCI information. The resource selection domain may be used either when much more UCIs can be transmitted simultaneously while maintaining the same modulation order, or when the same amount of UCI can be transmitted at a lower modulation order.

FIG. 31 shows a PUCCH format to which joint coding and SF reduction are applied, and signal processing for the PUCCH format according to one embodiment of the present invention. Since the basic processing of FIG. 31 is identical to those of FIGS. 29 and 30, the following description will focus upon joint coding.
Referring to FIG. 31, the channel coding and rate matching block performs channel coding of information bits (a_0, a_1, . . . , a_M−1) (e.g., multiple ACK/NACK bits), such that it can generates the encoded bits (coded bits or coding bits) (or codewords) b_0, b_1, . . . , b_N−1. M is the size of information bits, and N is the size of coded bits. The information bits may include uplink control information (UCI), for example, multiple ACK/NACK information for multiple data (or PDSCH) received through a plurality of DL CCs. In this case, the information bits (a_0, a_1, . . . , a_M−1) are joint-coded irrespective of categories/numbers/sizes of UCIs constructing the information bits. For example, if the information bits include multiple ACK/NACK data of several DL CCs, channel coding is not performed per DL CC or per ACK/NACK bit, but is performed for the entire bit information, such that a single codeword is generated. Channel coding is not limited thereto, and includes simple repetition, simplex coding, Reed Muller (RM) coding, punctured RM coding, Tail-biting convolutional coding (TBCC), low-density parity-check (LDPC) or turbo-coding. Although not shown in the drawings, the coding bit may be rate-matched in consideration of a modulation order and the amount of resources. The rate matching may include cyclic buffer rate matching or puncturing. The rate matching function may be performed through a separate functional block, or may be omitted as necessary.
The modulator modulates the encoded bits (b_0, b_1, . . . , b_N−1) so as to generate the modulation symbols (c_0, c_1, . . . , c_L−1). For example, the modulation method may include n-PSK (Phase Shift Keying), n-QAM (Quadrature Amplitude Modulation) (where n is an integer of 2 or higher). In more detail, the modulation method may include BPSK (Binary PSK), QPSK (Quadrature PSK), 8-PSK, QAM, 16-QAM, 64-QAM, etc.
Although not shown in the drawings, the divider distributes the modulation symbols (0, 1, 2, 3) to individual slots. The order/pattern/scheme for distributing the modulation symbols to individual slots is not specifically limited. For example, the divider may sequentially distribute the modulation symbols to individual slots on the basis of the front part of the modulation symbols. In this case, as shown in the drawings, the modulation symbols (0, 1) are distributed to Slot 0 and the modulation symbols (2, 3) may be distributed to Slot 1. In addition, the modulation symbols may be interleaved (or permuted) while being distributed to individual slots. For example, the even-th modulation symbols may be distributed to Slot 1, and the odd-th modulation symbols may be distributed to Slot 1. If necessary, the modulation process and the division process may be replaced with each other in order. Thereafter, the modulation symbols distributed to slots may be multiplied by the base sequence (r0), cyclic shift (CS) is applied to the resultant symbols, and OC (Orthogonal Code) ([w0 w1];[w2 w3]) of SF=2 is applied to the CS result, IFFT is applied to the OC result, and the IFFT result is mapped to SC-FDMA symbols.
The PUCCH format reduces an SF such that it can transmit many more modulation symbols. Transmit energy (or SNR) per UCI reduced by SF reduction can be compensated by joint coding. In addition, the coding gain obtained by the joint coding may be applied to the modulation scheme having a higher modulation order than the QPSK without causing SNR deterioration.
A method for using channel selection, i.e., a method for receiving multiple resources and using a resource selection domain as UCI information, will hereinafter be described in detail. For convenience of description and better understanding of the present invention, the following description will focus upon an exemplary case in which one resource (N=1) from among a total of two resources (M=2) is selected. Although the channel coding block can be omitted from the following description and drawings, it is assumed that the channel coding block exists for convenience of description and better understanding of the present invention.
Although a specific PRB including multiple resources for channel selection is not specially limited, it is assumed that the specific PRB is present in the same PRB for convenience of description. Multiple resources for channel selection may be explicitly allocated through physical channel signaling (e.g., PDCCH) or higher layer (e.g., RRC, MAC, BCH) signaling. In addition, the multiple resources for channel selection may be implicitly allocated in the same manner as in dynamic ACK/NACK resource allocation of the legacy LTE.
Allocation of multiple resources using the dynamic ACK/NACK resource allocation of the legacy LTE will hereinafter be described in detail. For convenience of description, it is assumed that two orthogonal resources (ORs) for channel selection are used (M=2). In this case, the first orthogonal resource (OR) index is determined to be an index corresponding to the lowest CCE index of a DL grant PDCCH, and the second orthogonal resource (OR) index may be obtained by combining the first OR index and an offset value. The offset value is not specially limited. For example, the offset value may be set to 1.
If multiple resources for channel selection are limited to a cyclic shift (CS) domain, the second orthogonal resource index can be represented as a modulo format of a total number of cyclic shifts (e.g., 12 cyclic shifts). For example, the cyclic shift (CS) index of the second orthogonal resource may be denoted by (nCS,OR1+offset)mod(12)=0. nCS, OR1 is a CS index of the first orthogonal resource, and mod is a modulo operation. In this case, multiple resources for channel selection are assigned different cyclic shifts.
In another example, assuming that multiple resources for channel selection are limited to cyclic shift (CS) and orthogonal code (i.e., assuming that multiple resources for channel selection are limited to resources belonging to the same PRB), if the number of available resources of one PRB is set to 18, an index of the second orthogonal resource may be denoted by (nOR1+offset)mod(18)=0. nOR1 is an index of the first orthogonal resource within the PRB. In this case, the orthogonal resource index represents a combination of a cyclic shift (CS) and an orthogonal code (OC).
FIG. 32 shows a PUCCH format to which channel selection and SF reduction are applied, and signal processing for the PUCCH format according to one embodiment of the present invention.
The channel coding block shown in FIG. 32 is provided for convenience of description, and may be omitted as necessary. Basic signal processing other than channel selection is identical to those of FIGS. 30 and 31.
Referring to FIG. 32, the modulator can perform modulation mapping in consideration of channel selection. For example, referring to Slot 0, the modulator generates four modulation symbols (0, 1, 2, 3) from the encoded bits. The modulation symbols (0, 2) correspond to the first orthogonal resource, and the modulation symbols (1, 3) corresponds to the second orthogonal resource. The first orthogonal resource and the second orthogonal resource are limited to cyclic shift (CS) and orthogonal code (OC). In the drawings, the same-number cyclic shifts (i.e., cyclic shift M (e.g., M=0 and M=1)) indicate cyclic shifts derived from the same orthogonal resource, but the derived cyclic shifts may not always have the same numbers. For example, if CS hopping is applied at an SC-FDMA or slot level, the cyclic shift M may have a different value according to an SC-FDMA symbol or slot. In the orthogonal codes (wa,b) (e.g., [w0,1; w1,1],[w2,1; w3,1] or [w0,1; w1,1; w2,1; w3,1]), a is an element index in an orthogonal code, and b is an orthogonal code index.
In response to channel selection, the modulator applies an actual modulation value to only one of the modulation symbols 0 and 1, and applies the value of 0 to the remaining one. Likewise, the modulator applies an actual modulation value to only one of the modulation symbols 2 and 3, and applies the value of 0 to the remaining one. The channel selection may be independently performed per modulation symbol, so that the first orthogonal resource is selected at SC-FDMA symbols 0 ̃1 and the second orthogonal resource is selected at SC-FDMA symbols 5 ̃6.
Although not shown in the drawings, the above-mentioned channel selection process may be equivalently carried out in the resource domain. For example, the modulator generates two modulation symbols (0, 1) respectively corresponding to the SC-FDMA symbols 0 ̃1 and the SC-FDMA symbols 5 ̃6. Thereafter, according to the channel selection result, one of the first orthogonal resource and the second orthogonal resource may be applied to the modulation symbol 0. Likewise, one of the first orthogonal resource and the second orthogonal resource may be applied to the modulation symbol 1.
The same physical result can be obtained irrespective of whether resource selection is performed either in the modulator or the resource domain. For convenience of description, it is assumed that resource selection to be described in the following description be achieved through the modulator for convenience of description and better understanding of the present invention. Although the modulation order is not specially limited, it should be noted that QPSK or 8PSK modulation may be specially carried out as necessary.
An exemplary case in which UCI corresponds to multiple ACK/NACK information will hereinafter be described in detail. The multiple ACK/NACK information includes ACK/NACK information of data received from a plurality of DL CCs. The channel coding block performs joint coding of multiple ACK/NACK information such that it generates a single codeword. The channel coding scheme includes, for example, RM-based coding, TBCC, or turbo-coding. Thereafter, the encoded bit (i.e., codeword) may be rate-matched. The rate-matching scheme includes cyclic buffer rate matching. In addition, the rate matching may include puncturing through which only the desired size of coded bits remains from the codeword. For example, it is assumed that RM coding (20, A) for use in LTE PUCCH is used. If four QPSK modulation symbols are used in case of M=2 and N=1, 12 encoded bits (or 12 coded bits) are needed. In this case, the encoded bits of a length 20 are generated from the LTE RM (20, A), the latter 8 bits may be punctured. Provided that RM supports the size of (8, A), cyclic buffer rate matching can be performed in such a manner that the encoded bits of the length 8 are generated and the resultant coded bits have the length of 12 ([a0, a1, . . . , a7, a0, a1, a2, a3]=>length of 12). Provided that four 8PSK modulation symbols are used in case of M=2 and N=1, a total of 16 coded bits are needed. In this case, the information bits are encoded into 20 bits using LTE RM (20,A), and are then punctured to be 16 bits.
After completion of channel coding, the encoded bits are modulated in a manner that the encoded bits can be mapped to a physical channel. In this example, the modulator generates a total of 8 modulation symbols using QPSK or 8PSK modulation. If M=2 and N=1, only one of Symbol 0 and Symbol 1 has an actual modulation symbol value, and the remaining one may be set to zero. The above-mentioned concept can also be applied to Symbol 2 and Symbol 3 in the same manner as described above. For convenience of description, the above-mentioned concept in which one of two symbols is set to zero can be conceptually covered by a symbol expression method. Thereafter, two orthogonal resources are applied to Symbol 0 and Symbol 1. Likewise, two orthogonal resources can also be applied to Symbol 2 and Symbol 3. It is assumed that the orthogonal resources are composed of OS0=(CS0,OC0) and OS1=(CS1,OC1) and are present in the same PRB.
In more detail, in case of using channel selection, UCI can be transmitted as follows.

    
    
        Modulation symbol 0 is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0 through OS0.
        Modulation symbol 1 is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0 through OS1.
        Modulation symbol 2 is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0 through OS0.
        Modulation symbol 3 is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0 through OS1.
        Modulation symbol 4 is transmitted through SC-FDMA symbols 0 ̃1 of Slot 1 through OS0.
        Modulation symbol 5 is transmitted through SC-FDMA symbols 0 ̃1 of Slot 1 through OS1.
        Modulation symbol 6 is transmitted through SC-FDMA symbols 5 ̃6 of Slot 1 through OS0.
        Modulation symbol 7 is transmitted through SC-FDMA symbols 5 ̃6 of Slot 1 through OS0.
    
    


Cyclic shift may be cell-specifically hopped in units of an SC-FDMA symbol. OC may define the hopping pattern either in units of a modulation symbol or in units of a slot. Through the above-mentioned transmission method, signal carrier characteristics can be satisfied without increasing CM as compared to LTE.
The channel selection process for use in QPSK modulation will hereinafter be described in detail. Assuming that 4 QPSK modulation symbols are transmitted through one of two resources, 12 coded bits (b0, . . . , b11) are obtained from ACK/NACK information after completion of the channel coding and rate matching. 3 coded bits correspond to one combination (one modulation symbol or one resource selection) and the encoded bit sequence can be modulated into s0, . . . , s7. In accordance with the channel selection, each of four elements from among s0, . . . , s7 has an actual modulation value, and each of the remaining four elements is set to zero.
Table 14 exemplarily shows the mapping rule after QPSK modulation. Table 15 shows the application result of Table 14 in case that the encoded bit sequences are denoted by <b0, . . . , b11>=<1,1,1, 0,1,0, 1,0,0, 0,0,1>.











TABLE 14








Ics1

Ics2












Encoded Bits
I
Q
I
Q





000
1/{square root over (2)}
1/{square root over (2)}




001
1/{square root over (2)}
−1/{square root over (2)}




010
−1/{square root over (2)}
1/{square root over (2)}




011
−1/{square root over (2)}
−1/{square root over (2)}




100


1/{square root over (2)}
1/{square root over (2)}


101


1/{square root over (2)}
−1/{square root over (2)}


110


−1/{square root over (2)}
1/{square root over (2)}


111


−1/{square root over (2)}
−1/{square root over (2)}









In Table 14, ICS1 is a first orthogonal resource index, and ICS2 is a second orthogonal resource index. A blank denotes zero (0). I is an in-phase component and Q is a quadrature phase component.















TABLE 15






s0
s1
s2
s3
s4
s5
s6
s7























I
0
−1/{square root over (2)}
−1/{square root over (2)}
0
0
1/{square root over (2)}
 1/{square root over (2)}
0


Q
0
−1/{square root over (2)}
 1/{square root over (2)}
0
0
1/{square root over (2)}
−1/{square root over (2)}
0









Table 14 can be modified into another equivalent format. For example, the mapping rule of Table 14 can be modified using the QPSK mapping table for use in the LTE PUCCH format. Table 16 shows the QPSK mapping table defined in the LTE PUCCH format 1a/1b, and Table 17 shows the mapping rule based on QPSK constellation.










TABLE 16






PUCCH format
ACK/NACK
d(0)



















1a
0
 1




1
−1



1b
00
 1




01
−j




10
J




11
−1


















TABLE 17





ACK/NACK
1st ACK/NACK
2nd ACK/NACK


Bits
resource
resource







000
 1



001
−j



010
J



011
−1



100

 1


101

−j


110

J


111

−1









Table 18 shows another mapping rule for use in QPSK modulation. The mapping rule of Table 18 has been designed considering the Eucledian distance. FIG. 33 shows QPSK constellation based on the mapping rule of Table 18. The Eucledian distance reaches the longest distance between symbols located at a diagonal line. The longer the Eucledian distance, the lowest the probability of generating errors between symbols. The mapping rule shown in Table 18 and FIG. 33 is configured in a manner that a specific bit having the longest Hamming distance is located at a diagonal line.











TABLE 18








Ics1

Ics2












Encoded Bits
I
Q
I
Q





000
−1/{square root over (2)}
−1/{square root over (2)}




001


−1/{square root over (2)}
−1/{square root over (2)}


010
−1/{square root over (2)}
1/{square root over (2)}




011


−1/{square root over (2)}
1/{square root over (2)}


100


1/{square root over (2)}
−1/{square root over (2)}


101
1/{square root over (2)}
−1/{square root over (2)}




110


1/{square root over (2)}
1/{square root over (2)}


111
1/{square root over (2)}
1/{square root over (2)}









Assuming that the encoded bit sequence is denoted by <b0, . . . , b11>=<1,1,1, 0,1,0, 1,0,0, 0,0,1>, Table 19 shows the application result of Table 18.















TABLE 19






s0
s1
s2
s3
s4
s5
s6
s7







I
1/{square root over (2)}
0
−1/{square root over (2)}
0
0
 1/{square root over (2)}
0
−1/{square root over (2)}


Q
1/{square root over (2)}
0
 1/{square root over (2)}
0
0
−1/{square root over (2)}
0
−1/{square root over (2)}









The channel selection procedure for use in 8PSK modulation will hereinafter be described in detail.
Provided that 4 8PSK modulation symbols are transmitted through one of two resources, 16 coded bits (b0, . . . , b15) are obtained from ACK/NACK information after completion of the channel coding and rate matching. Four coded bits correspond to one combination of [modulation symbol, resource selection], and the encoded bit sequence may be modulated into s0, . . . , s7. In accordance with the channel selection, each of four elements from among s0, . . . , s7 has an actual modulation value, and each of the remaining four elements is set to zero.
Table 20 shows the mapping rule for use in 8PSK modulation. The mapping rule of Table 20 has been designed considering the Eucledian distance. FIG. 34 shows QPSK constellation based on the mapping rule of Table 20. Referring to FIG. 34, the modulation symbols are arranged on the basis of gray mapping so as to obtain an optimum Eucledian distance. A higher coding gain can be obtained through 8PSK mapping.











TABLE 20








Ics1

Ics2














Encoded Bits
I
Q
I
Q






0000
−1/{square root over (2)}
−1/{square root over (2)}





0001
−1 
0





0010


−1 
0



0011


−1/{square root over (2)}
−1/{square root over (2)}



0100


0
1



0101
−1/{square root over (2)}
1/{square root over (2)}
0
0



0110


−1/{square root over (2)}
1/{square root over (2)}



0111
0
1





1000
0
−1 





1001


1/{square root over (2)}
−1/{square root over (2)}



1010
1/{square root over (2)}
−1/{square root over (2)}





1011


0
−1 



1100


1/{square root over (2)}
1/{square root over (2)}



1101


1
0



1110
1
0





1111
1/{square root over (2)}
1/{square root over (2)}









In Table 20, ICS1 is a first orthogonal resource index, and ICS2 is a second orthogonal resource index. A blank denotes zero (0). I is an in-phase component and Q is a quadrature phase component.
Assuming that the encoded bit sequence is denoted by <b0, . . . , b15>=<1,1,0,1, 1,0,0,0, 1,0,1,0, 1,0,1,1>, Table 21 shows the application result of Table 20.















TABLE 21






s0
s1
s2
s3
s4
s5
s6
s7























I
0
1
0
0
 1/{square root over (2)}
0
0
0


Q
0
0
−1
0
−1/{square root over (2)}
0
0
−1









Table 22 exemplarily shows another mapping rule for use in 8PSK modulation. Assuming that the encoded bit sequence is denoted by <b0, . . . , b15>=<1,1,0,1, 1,0,0,0, 1,0,1,0, 1,0,1,1>, Table 23 shows the application result of Table 20.











TABLE 22








Ics1

Ics2












Encoded Bits
I
Q
I
Q





0000
−1/{square root over (2)}
−1/{square root over (2)}




0001


0
−1 


0010
0
−1 




0011


−1/{square root over (2)}
−1/{square root over (2)}


0100
−1 
0




0101


1/{square root over (2)}
−1/{square root over (2)}


0110
1/{square root over (2)}
−1/{square root over (2)}




0111


−1 
0


1000


1/{square root over (2)}
1/{square root over (2)}


1001
0
1




1010


0
1


1011
1/{square root over (2)}
1/{square root over (2)}




1100


1
0


1101
−1/{square root over (2)}
1/{square root over (2)}




1110


−1/{square root over (2)}
1/{square root over (2)}


1111
1
0
























TABLE 23






s0
s1
s2
s3
s4
s5
s6
s7























I
0
−1/{square root over (2)}
0
1/{square root over (2)}
0
0
1/{square root over (2)}
0


Q
0
 1/{square root over (2)}
0
1/{square root over (2)}
0
1
1/{square root over (2)}
0









The following description shows an example for applying precoding to channel selection, so that the amount of payload can be increased and a relatively low CM can be achieved. For convenience of description, the following description will focus upon an exemplary case in which precoding is applied to the 8PSK mapping table.
FIG. 35 is a block diagram illustrating precoding applied to channel selection. Payload (UCI) is converted into the encoded bits by the encoding block 910. By the resource selection and mapping module 920, the encoded bits are mapped and converted into the modulation symbols according to the predetermined modulation scheme. By the precoding module 930, the modulation symbols are precoded using the precoding matrix (or a precoding vector) corresponding to the resource index. Each row of the precoding matrix corresponds to a resource index. The precoded modulation symbol is spread to a sequence corresponding to the corresponding resource index. By the resource mapping module 950, the spread sequence is mapped to a physical resource and then transmitted.
FIG. 36 exemplarily shows 8PSK constellation based on gray mapping. Table 24 exemplarily shows the mapping rule considering constellation of FIG. 35.









TABLE 24





Encoded Bits
I
Q







000
−1/{square root over (2)}
−1/{square root over (2)}


001
−1 
0


010
0
1


011
−1/{square root over (2)}
1/{square root over (2)}


100
0
−1 


101
1/{square root over (2)}
−1/{square root over (2)}


110
1/{square root over (2)}
1/{square root over (2)}


111
1
0









As can be seen from Equation 10, the precoding vector [+1+1] is applied to the first resource index and the precoding vector [+1 −1] is applied to the second resource index ICS2.




  
    
      
        
          (
          
            
              
                
                  I
                  
                    cs
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
              
            
            
              
                
                  I
                  
                    cs
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
              
            
          
          )
        
        =
        
          
            (
            
              
                
                  1
                
                
                  1
                
              
              
                
                  1
                
                
                  
                    -
                    1
                  
                
              
            
            )
          
          ⁢
          
            (
            
              
                
                  
                    d
                    ⁡
                    
                      (
                      i
                      )
                    
                  
                
              
              
                
                  
                    d
                    ⁡
                    
                      (
                      
                        i
                        +
                        1
                      
                      )
                    
                  
                
              
            
            )
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          10
        
        ]
      
    
  




For example, as can be seen from Table 24, assuming that the precoding vector [+1+1] is applied not only to modulation symbols (−0, 1) corresponding to bits (001), but also to modulation symbols (0, 1) corresponding to bits (010), symbols (−1, 1) can be achieved and applied to the first resource index Ics1. In addition, assuming that the precoding vector [+1 −1] is applied not only to symbols (−1, 0) corresponding to bits (001) but also to modulation symbols (0, 1) corresponding to bits (010), symbols (−1, −1) can be achieved and applied to the second resource index Ics2. If precoding and two resource indices are used, the encoded bits mapped to one modulation symbol can be extended from 3 bits to 6 bits.
Table 25 exemplarily shows the mapping rule used when precoding is applied to 8PSK precoding of Table 24. Table 25 assumes that one resource is selected from two resource indices (for example, cyclic shift (CS) indices (Ics1, Ics2)).









TABLE 25








Ics1
Ics2











Encoded Bits
I
Q
I
Q





000000
−1/{square root over (2)} − 1/{square root over (2)}
−1/{square root over (2)} − 1/{square root over (2)}
0
0


000001
−1/{square root over (2)} − 1
−1/{square root over (2)}
−1/{square root over (2)} + 1
−1/{square root over (2)}


000010
−1/{square root over (2)}
−1/{square root over (2)} + 1
−1/{square root over (2)}
−1/{square root over (2)} − 1


000011
−1/{square root over (2)} − 1/{square root over (2)}
0
0
−1/{square root over (2)} − 1/{square root over (2)}


000100
−1/{square root over (2)}
−1/{square root over (2)} − 1
−1/{square root over (2)}
−1/{square root over (2)} + 1


000101
0
−1/{square root over (2)} − 1/{square root over (2)}
−1/{square root over (2)} − 1/{square root over (2)}
0


000110
0
0
−1/{square root over (2)} − 1/{square root over (2)}
−1/{square root over (2)} − 1/{square root over (2)}


000111
−1/{square root over (2)} + 1
−1/{square root over (2)}
−1/{square root over (2)} − 1
−1/{square root over (2)}


001000
−1 − 1/{square root over (2)}
−1/{square root over (2)}
−1 + 1/{square root over (2)}
−1/{square root over (2)}


001001
−1 − 1
0
0
0


001010
−1 
1
−1 
−1 


001011
−1 − 1/{square root over (2)}
1/{square root over (2)}
−1 + 1/{square root over (2)}
−1/{square root over (2)}


001100
−1 
−1 
−1 
1


001101
−1 + 1/{square root over (2)}
−1/{square root over (2)}
−1 − 1/{square root over (2)}
1/{square root over (2)}


001110
−1 + 1/{square root over (2)}
1/{square root over (2)}
−1 − 1/{square root over (2)}
−1/{square root over (2)}


001111
0
0
−1 − 1
0


010000
−1/{square root over (2)}
1 − 1/{square root over (2)}
1/{square root over (2)}
1 + 1/{square root over (2)}


010001
−1 
1
1
1


010010
0
1 + 1
0
0


010011
−1/{square root over (2)}
1 + 1/{square root over (2)}
1/{square root over (2)}
1 − 1/{square root over (2)}


010100
0
0
0
1 + 1


010101
1/{square root over (2)}
1 − 1/{square root over (2)}
−1/{square root over (2)}
1 + 1/{square root over (2)}


010110
1/{square root over (2)}
1 + 1/{square root over (2)}
−1/{square root over (2)}
1 − 1/{square root over (2)}


010111
1
1
−1 
1


011000
−1/{square root over (2)} − 1/{square root over (2)}
0
0
1/{square root over (2)} + 1/{square root over (2)}


011001
−1 − 1/{square root over (2)}
1/{square root over (2)}
1 − 1/{square root over (2)}
1/{square root over (2)}


011010
−1/{square root over (2)}
1 + 1/{square root over (2)}
−1/{square root over (2)}
−1 + 1/{square root over (2)}


011011
−1/{square root over (2)} − 1/{square root over (2)}
1/{square root over (2)} + 1/{square root over (2)}
0
0


011100
−1/{square root over (2)}
−1 + 1/{square root over (2)}
−1/{square root over (2)}
1 + 1/{square root over (2)}


011101
0
0
−1/{square root over (2)} − 1/{square root over (2)}
1/{square root over (2)} + 1/{square root over (2)}


011110
0
1/{square root over (2)} + 1/{square root over (2)}
−1/{square root over (2)} − 1/{square root over (2)}
0


011111
1 − 1/{square root over (2)}
1/{square root over (2)}
−1 − 1/{square root over (2)}
1/{square root over (2)}


100000
−1/{square root over (2)}
−1 − 1/{square root over (2)}
1/{square root over (2)}
−1 + 1/{square root over (2)}


100001
−1 
−1 
1
−1 


100010
0
0
0
−1 − 1


100011
−1/{square root over (2)}
−1 + 1/{square root over (2)}
1/{square root over (2)}
−1 − 1/{square root over (2)}


100100
0
−1 − 1
0
0


100101
1/{square root over (2)}
−1 − 1/{square root over (2)}
−1/{square root over (2)}
−1 + 1/{square root over (2)}


100110
1/{square root over (2)}
−1 + 1/{square root over (2)}
−1/{square root over (2)}
−1 − 1/{square root over (2)}


100111
1
−1 
−1 
−1 


101000
0
−1/{square root over (2)} − 1/{square root over (2)}
1/{square root over (2)} + 1/{square root over (2)}
0


101001
−1 + 1/{square root over (2)}
−1/{square root over (2)}
1 + 1/{square root over (2)}
−1/{square root over (2)}


101010
1/{square root over (2)}
1 − 1/{square root over (2)}
1/{square root over (2)}
−1 − 1/{square root over (2)}


101011
0
0
1/{square root over (2)} + 1/{square root over (2)}
−1/{square root over (2)} − 1/{square root over (2)}


101100
1/{square root over (2)}
−1 − 1/{square root over (2)}
1/{square root over (2)}
1 − 1/{square root over (2)}


101101
1/{square root over (2)} + 1/{square root over (2)}
−1/{square root over (2)} − 1/{square root over (2)}
0
0


101110
1/{square root over (2)} + 1/{square root over (2)}
0
0
−1/{square root over (2)} − 1/{square root over (2)}


101111
1 + 1/{square root over (2)}
−1/{square root over (2)}
−1 + 1/{square root over (2)}
−1/{square root over (2)}


110000
0
0
1/{square root over (2)} + 1/{square root over (2)}
1/{square root over (2)} + 1/{square root over (2)}


110001
−1 + 1/{square root over (2)}
1/{square root over (2)}
1 + 1/{square root over (2)}
1/{square root over (2)}


110010
1/{square root over (2)}
1 + 1/{square root over (2)}
1/{square root over (2)}
−1 + 1/{square root over (2)}


110011
0
1/{square root over (2)} + 1/{square root over (2)}
1/{square root over (2)} + 1/{square root over (2)}
0


110100
1/{square root over (2)}
−1 + 1/{square root over (2)}
1/{square root over (2)}
1 + 1/{square root over (2)}


110101
1/{square root over (2)} + 1/{square root over (2)}
0
0
−1/{square root over (2)} − 1/{square root over (2)}


110110
1/{square root over (2)} + 1/{square root over (2)}
1/{square root over (2)} + 1/{square root over (2)}
0
0


110111
1 + 1/{square root over (2)}
1/{square root over (2)}
−1 + 1/{square root over (2)}
1/{square root over (2)}


111000
1 − 1/{square root over (2)}
−1/{square root over (2)}
1 + 1/{square root over (2)}
1/{square root over (2)}


111001
0
0
1 + 1
0


111010
1
1
1
−1 


111011
1 − 1/{square root over (2)}
1/{square root over (2)}
1 + 1/{square root over (2)}
−1/{square root over (2)}


111100
1
−1 
1
1


111101
1 + 1/{square root over (2)}
−1/{square root over (2)}
1 − 1/{square root over (2)}
1/{square root over (2)}


111110
1 + 1/{square root over (2)}
1/{square root over (2)}
1 − 1/{square root over (2)}
−1/{square root over (2)}


111111
1 + 1
0
0
0









In Table 25, the number of encoded bits mapped to one modulation symbol is set to 6. In this case, the modulation symbol indicates a set of two modulated symbols for two resource indices.
In the modified example of Table 25, only some modulation symbols each having a low PAPR/CM are selected from Table 23 (that is, modulation symbols are selected in a manner that a signal is present in only one resource and the value of 0 is transmitted to the remaining resources), so that a new mapping table can be configured. For example, only modulation symbols corresponding to (000000), (000110) and (001001) are selected from Table 25 so as to configure a reduced mapping table, and the encoded bits can be newly mapped according to the reduced mapping table. In this case, although the amount of UCI transmission information is reduced, the above modified example has an advantage in terms of power control.
The transmit diversity methods according to the present invention will hereinafter be described in detail.
The first transmit diversity scheme will hereinafter be described in detail.
The first transmit diversity scheme relates to a transmit diversity method in which the Alamouti code is applied to an orthogonal resource domain and an antenna domain. For convenience of description and better understanding of the present invention, it is assumed that the number of Tx antennas is set to 2. Two RS orthogonal resources may be used to perform channel estimation for each antenna. In other words, in order to perform channel estimation per antenna, a first orthogonal resource of an RS symbol can be transmitted to a first antenna and a second orthogonal resource of the RS symbol can be transmitted to a second antenna. In addition, although the present invention has disclosed only Slot 0 for convenience of description, it should be noted that the present invention can also be applied to Slot 1.
FIG. 37 shows a method for transmitting control information to Antenna 0 using the first transmit diversity scheme, and FIG. 38 shows a method for transmitting control information to Antenna 1 using the first transmit diversity scheme. Referring to FIGS. 37 and 383, a modulation symbol transmitted through Antenna 0 can be transmitted in the same manner as in 1Tx transmission. On the other hand, the Alamouti coding for use in an orthogonal resource domain is applied to the modulation symbol transmitted through Antenna 1. In this case, the Alamouti coding may include not only a matrix shown in Equation 11 but also all unitary conversion formats for the matrix.




In Equation 11, (.)* is denoted by a complex conjugate operation of (.).
In the present invention, one of s0 and s1 is certainly set to zero, so that Equation 11 can be modified into Equation 12.




For example, assuming that s2=s1=0 is provided in case of SC-FDMA symbols 0 and 1, the following transmission can be achieved at Slot 0 of each antenna.
Antenna 0

    
    
        Through OS0, a modulation symbol (s0) is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS1, a modulation symbol (s1=0) is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS0, a modulation symbol (s2=0) is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
        Through OS1, a modulation symbol (s3) is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
    
    


Antenna 1

    
    
        Through OS0, a modulation symbol −(s1)* is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS1, a modulation symbol (s0)* is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS0, a modulation symbol −(s3)* is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
        Through OS1, a modulation symbol (s2)*=0 is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
    
    


In FIGS. 37 and 38, although multiple orthogonal resources allocated to the first antenna are different from multiple orthogonal resources allocated to the second antenna for convenience of description and index assignment reasons, the scope or spirit of the present invention is not limited thereto, and can also be applied to other examples as necessary. Multiple orthogonal resources allocated to the first antenna are actually identical to multiple orthogonal resources allocated to the second antenna.
A method for applying precoding (e.g., an Alamouti code) for transmit diversity to a time (i.e., an SC-FDMA symbol) domain and an antenna domain according to the second transmit diversity scheme will hereinafter be described in detail. For convenience of description, it is assumed that the number of Tx antennas is set to 2. Two RS orthogonal resources can be used for channel estimation for each antenna. In other words, in order to perform channel estimation per antenna, a first orthogonal resource can be transmitted to a first antenna, and a second orthogonal resource of the RS symbol can be applied to a second antenna. In addition, although Slot 0 is disclosed only for illustrative purposes, it is apparent that the present invention can also be applied to Slot 0 as necessary.
FIG. 39 shows a method for transmitting control information to Antenna 0 using the second transmit diversity scheme, and FIG. 40 shows a method for transmitting control information to Antenna 1 using the second transmit diversity scheme. Referring to FIGS. 39 and 40, a modulation symbol transmitted through Antenna 0 can be transmitted in the same manner as in 1Tx transmission. On the other hand, Alamouti coding for use in a time domain is applied to the modulation symbol transmitted through Antenna 1. That is, the Alamouti coding is applied to the same orthogonal resource in units of an SC-FDMA symbol to which OC is applied. In this case, the Alamouti coding may include not only a matrix shown in Equation 13 but also all unitary conversion formats for the matrix.




In Equation 13, (.)* is denoted by a complex conjugate operation of (.).
In the present invention, one of s0 and s1 is certainly set to zero, so that Equation 13 can be modified into Equation 14.




For example, assuming that s2=s1=0 is provided in case of SC-FDMA symbols 0, 1, 5 and 6, the following transmission can be achieved at Slot 0 of each antenna.
Antenna 0

    
    
        Through OS0, a modulation symbol (s0) is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS1, a modulation symbol (s1=0) is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS0, a modulation symbol (s2=0) is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
        Through OS1, a modulation symbol (s3) is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
    
    


Antenna 1

    
    
        Through OS0, a modulation symbol −(s2)*=0 is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS1, a modulation symbol −(s3)* is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS0, a modulation symbol (s0)* is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
        Through OS1, a modulation symbol (s1)*=0 is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
    
    


In FIGS. 39 and 40, although multiple orthogonal resources allocated to the first antenna are different from multiple orthogonal resources allocated to the second antenna for convenience of description and index assignment reasons, the scope or spirit of the present invention is not limited thereto, and can also be applied to other examples as necessary. Multiple orthogonal resources allocated to the first antenna are actually identical to multiple orthogonal resources allocated to the second antenna.
A transmit diversity or spatial multiplexing scheme in which a modulation symbol is transmitted through different orthogonal resources at each antenna according to a third transmit diversity scheme will hereinafter be described in detail. That is, two orthogonal resources corresponding to the number of antennas can be further allocated, and the same information can be transmitted using the same format through individual resources. In this case, after joint coding is performed considering the extended symbol space, different modulation symbols are transmitted through individual orthogonal resources, so that spatial multiplexing can be achieved.
FIG. 41 shows a method for transmitting control information to Antenna 0 using a third transmit diversity scheme, and FIG. 42 shows a method for transmitting control information to Antenna 1 using the third transmit diversity scheme. Resources allocated for the second antenna may be defined as an offset value of a resource used in the first antenna, and the offset value may be set to 1. In relation to a CCE index, the smallest CCE index may be used for the first antenna, and the next CCE index may be used for the second antenna. If a DL grant PDCCH has a CCE aggregation level of 2 or more, the DL grant PDCCH can be efficiently used without resource consumption.
For example, assuming that s2=s1=0 is provided in case of SC-FDMA symbols 0, 1, 5 and 6, the following transmission can be achieved at Slot 0 of each antenna.
Antenna 0

    
    
        Through OS0_0, a modulation symbol (s0) is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS1_0, a modulation symbol (s1=0) is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS0_0, a modulation symbol (s2=0) is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
        Through OS1_0, a modulation symbol (s3) is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
    
    


Antenna 1

    
    
        Through OS0_1, a modulation symbol (s0) is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS1_1, a modulation symbol (s1=0) is transmitted through SC-FDMA symbols 0 ̃1 of Slot 0.
        Through OS0_1, a modulation symbol (s2=0) is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
        Through OS1_1, a modulation symbol (s3) is transmitted through SC-FDMA symbols 5 ̃6 of Slot 0.
    
    


In case of using the spatial multiplexing scheme, modulation symbols s0 ̃s3 transmitted at Antenna 0 have information different from those of modulation symbols s0-s3 transmitted at Antenna 1.
FIG. 43 is a block diagram illustrating a base station (BS) and a user equipment (UE) applicable to embodiments of the present invention.
Referring to FIG. 43, the wireless communication system includes a base station (BS) 110 and a UE 120. The BS 110 includes a processor 112, a memory 114, and a radio frequency (RF) unit 116. The processor 112 may be constructed to implement the procedures and/or methods disclosed in the embodiments of the present invention. The memory 114 may be connected to a processor 112, and store various information related to operations of the processor 112. The RF unit 116 is connected to the processor 112, and transmits and/or receives RF signals. The UE 120 includes a processor 122, a memory 124, and an RF unit 126. The processor 122 may be constructed to implement the procedures and/or methods disclosed in the embodiments of the present invention. The memory 124 may be connected to a processor 122, and store various information related to operations of the processor 122. The RF unit 126 is connected to the processor 122, and transmits and/or receives RF signals. The BS 110 and/or the UE 120 may include a single antenna or multiple antennas.
The aforementioned embodiments are achieved by combination of structural elements and features of the present invention in a predetermined fashion. Each of the structural elements or features should be considered selectively unless specified otherwise. Each of the structural elements or features may be carried out without being combined with other structural elements or features. Also, some structural elements and/or features may be combined with one another to constitute the embodiments of the present invention. The order of operations described in the embodiments of the present invention may be changed. Some structural elements or features of one embodiment may be included in another embodiment, or may be replaced with corresponding structural elements or features of another embodiment. Moreover, it will be apparent that some claims referring to specific claims may be combined with other claims referring to claims other than the specific claims to constitute the embodiment or add new claims by means of amendment after the application is filed.
The embodiments of the present invention have been described based on data transmission and reception between a BS (or eNB) and a UE. A specific operation which has been described as being performed by the eNB (or BS) may be performed by an upper node of the eNB (or BS) as the case may be. In other words, it will be apparent that various operations performed for communication with the UE in the network which includes a plurality of network nodes along with the eNB (or BS) can be performed by the BS or network nodes other than the eNB (or BS). The term eNB (or BS) may be replaced with terms such as fixed station, Node B, eNode B (eNB), and access point. Also, the term UE may be replaced with terms such as mobile station (MS) and mobile subscriber station (MSS).
The embodiments according to the present invention can be implemented by various means, for example, hardware, firmware, software, or combinations thereof. If the embodiment according to the present invention is implemented by hardware, the embodiment of the present invention can be implemented by one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, microcontrollers, microprocessors, etc.
If the embodiment according to the present invention is implemented by firmware or software, the embodiment of the present invention may be implemented by a module, a procedure, or a function, which performs functions or operations as described above. Software code may be stored in a memory unit and then may be driven by a processor. The memory unit may be located inside or outside the processor to transmit and receive data to and from the processor through various well known means.
It will be apparent to those skilled in the art that the present invention can be embodied in other specific forms without departing from the spirit and essential characteristics of the invention. Thus, the above embodiments are to be considered in all respects as illustrative and not restrictive. The scope of the invention should be determined by reasonable interpretation of the appended claims and all changes which come within the equivalent scope of the invention are included in the scope of the invention.
[Industrial Applicability]
Exemplary embodiments of the present invention can be applied to a user equipment (UE), a base station (BS), and other devices. In more detail, the present invention can be applied to a method and apparatus for transmitting uplink control information.

## Claims

1. A method for transmitting control information through a Physical Uplink Control Channel (PUCCH) by a user equipment (UE) in a wireless communication system, the method comprising:
obtaining a first modulation symbol and a second modulation symbol from the control information;
spreading the first modulation symbol to a plurality of first contiguous Single Carrier-Frequency Division Multiple Access (SC-FDMA) symbols in a time domain;
spreading the second modulation symbol to a plurality of second contiguous SC-FDMA symbols in the time domain; and
transmitting the spread first modulation symbol and the spread second modulation symbol through the PUCCH,
wherein the plurality of first contiguous SC-FDMA symbols and the plurality of second contiguous SC-FDMA symbols are located in a same slot, and
wherein an index related to a first resource, from among a plurality of resources, occupied for the first or second modulation symbol is decided by a Control Channel Element (CCE) index used for Physical Downlink Control Channel (PDCCH) transmission, and an index related to a second resource, from among the plurality of resources, is decided by the index related to the first resource and an offset value.

2. The method according to claim 1, wherein the first modulation symbol and the second modulation symbol are obtained from channel-coded control information.

3. The method according to claim 2, wherein:
the control information includes a plurality of control information, and
the first modulation symbol and the second modulation symbol are obtained from a single codeword generated through joint coding.

4. The method according to claim 1, wherein:
the first modulation symbol is transmitted using any one of a plurality of resources occupied in the plurality of first contiguous SC-FDMA symbols, and
the second modulation symbol is transmitted using any one of a plurality of resources occupied in the plurality of second contiguous SC-FDMA symbols.

5. The method according to claim 1, wherein a sequence used for time-domain spreading of the first modulation symbol and the second modulation symbol has a spreading factor (SF) of 2 (SF=2).

6. The method according to claim 1, wherein a sequence used for frequency-domain spreading of the first modulation symbol and the second modulation symbol includes a Constant Amplitude Zero Auto Correlation (CAZAC) sequence or a Computer Generated (CG)-CAZAC sequence.

7. A user equipment (UE) configured to transmit control information through a physical uplink control channel (PUCCH) in a wireless communication system comprising:
a radio frequency (RF) device; and
a processor operatively connected to the RF device and configured to,
obtain a first modulation symbol and a second modulation symbol from the control information,
spread the first modulation symbol to a plurality of first contiguous Single Carrier-Frequency Division Multiple Access (SC-FDMA) symbols in a time domain,
spread the second modulation symbol to a plurality of second contiguous SC-FDMA symbols in the time domain, and
transmit the spread first modulation symbol and the spread second modulation symbol through the PUCCH,

wherein the plurality of first contiguous SC-FDMA symbols and the plurality of second contiguous SC-FDMA symbols are located in a same slot, and
wherein an index related to a first resource, from among a plurality of resources, occupied for the first or second modulation symbol is decided by a Control Channel Element (CCE) index used for Physical Downlink Control Channel (PDCCH) transmission, and an index related to a second resource, from among the plurality of resources, is decided by the index related to the first resource and an offset value.

8. The user equipment (UE) according to claim 7, wherein the first modulation symbol and the second modulation symbol are obtained from channel-coded control information.

9. The user equipment (UE) according to claim 8, wherein:
the control information includes a plurality of control information, and
the first modulation symbol and the second modulation symbol are obtained from a single codeword generated through joint coding.

10. The user equipment (UE) according to claim 7, wherein:
the first modulation symbol is transmitted using any one of a plurality of resources occupied in the plurality of first contiguous SC-FDMA symbols, and
the second modulation symbol is transmitted using any one of a plurality of resources occupied in the plurality of second contiguous SC-FDMA symbols.

11. The user equipment (UE) according to claim 7, wherein a sequence used for time-domain spreading of the first modulation symbol and the second modulation symbol has a spreading factor (SF) of 2 (SF=2).

12. The user equipment (UE) according to claim 7, wherein a sequence used for frequency-domain spreading of the first modulation symbol and the second modulation symbol includes a Constant Amplitude Zero Auto Correlation (CAZAC) sequence or a Computer Generated (CG)-CAZAC sequence.