# Patent

## Title
Method and apparatus for transmitting control information in a wireless communication system

## Abstract

The present invention relates to a wireless communication system. More particularly, the present invention relates to a method and apparatus for transmitting a plurality of PUCCHs in a wireless communication system, wherein the method comprises the following steps: checking a resource for a first PUCCH among the plurality of PUCCHs; inferring, from the resource for the first PUCCH, a resource for the remaining one or more second PUCCHs excluding the first PUCCH among the plurality of PUCCHs; and transmitting the plurality of PUCCHs simultaneously via corresponding relevant resources.

## Background
This application is a 35 U.S.C. §371 National Stage Entry of International Application No. PCT/KR2011/001987, filed Mar. 23, 2011 and claims the benefit of U.S. Provisional Application No. 61/316,393, filed Mar. 23, 2010 and Korean Application No. 10-2011-0002267, filed Jan. 10, 2011, all of which are incorporated by reference in their entirety herein.


TECHNICAL FIELD
The present invention relates to a wireless communication system, and more particularly to a method and apparatus for transmitting control information (channel) 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 (channel) 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 (channel) in a wireless communication system. Another object of the present invention is to provide resource allocation for efficiently transmitting control information (channel) and an apparatus for the same.
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 simultaneously transmitting a plurality of physical uplink control channel (PUCCHs) by a user equipment (UE) in a wireless communication system, the method including recognizing resources of a first PUCCH from among the plurality of PUCCHs; inferring, from the first PUCCH resources, resources of the remaining one or more second PUCCHs other than the first PUCCH from among the plurality of PUCCHs; and simultaneously transmitting the plurality of PUCCHs through corresponding resources.
In another aspect of the present invention, a user equipment (UE) configured to simultaneously transmit a plurality of physical uplink control channel (PUCCHs) in a wireless communication system includes: a radio frequency (RF) unit; and a processor, wherein the processor recognizes resources of a first PUCCH from among the plurality of PUCCHs, infers, from the first PUCCH resources, resources of the remaining one or more second PUCCHs other than the first PUCCH from among the plurality of PUCCHs, and simultaneously transmits the plurality of PUCCHs through corresponding resources.
The recognizing of the first PUCCH resources may include: receiving a physical downlink control channel (PUCCH); and recognizing PUCCH resources linked to the lowest control channel element (CCE) used for transmission of the PDCCH.
The first PUCCH resources may be given through higher layer signaling.
A resource index of the one or more second PUCCHs may be inferred by applying an offset value to a resource index of the first PUCCH.
The resources of the one or more second PUCCHs may be inferred from the first PUCCH resources so that the plurality of PUCCHs is transmitted through the same physical resource block (PRB).
The resources of the one or more second PUCCHs may be obtained from the following equation:

(a+δn)mod(NCS·NOC+nPRB·NCS·NOC), or

(a−δn)mod(NCS·NOC+nPRB·NCS·NOC)  [Equation]

where ‘a’ is a resource index of the first PUCCH, δn is an offset value for an n-th second PUCCH, NCS is the number of cyclic shifts (CSs) available within one PRB, NOC is the number of orthogonal covers (OCs) available within one PRB, and nPRB is a PRB index on which the first PUCCH resources exist.
Advantageous Effects
Exemplary embodiments of the present invention have the following effects. The embodiments of the present invention can efficiently transmit control information (channel) in a wireless communication system. In addition, resources for transmitting control information (channel) can be efficiently allocated.
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.
FIG. 29 exemplarily shows Inter-Modulation Distortion (IMD) problems.
FIG. 30 is a conceptual diagram illustrating a method for transmitting control information using a plurality of PUCCH resources according to one embodiment of the present invention.
FIG. 31 is a conceptual diagram illustrating a method for transmitting ACK/NACK information through a plurality of PUCCH resources according to one embodiment of the present invention.
FIG. 32 is a block diagram illustrating a base station (BS) and a user equipment (BS) 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 (PUSCH)/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 PUCCH, 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 N×SC-FDMA or N×DFT-s-OFDMA. For convenience of description and better understanding of the present invention, the segmented SC-FDMA, N×SC-FDMA and N×DFT-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,v(α)(n) is defined by a cyclic shift α of a base sequence and may be expressed by the following equation 1.




  
    
      
        
          
            
              r
              
                u
                ,
                v
              
              
                (
                α
                )
              
            
            ⁡
            
              (
              n
              )
            
          
          =
          
            
              e
              
                j
                ⁢
                
                  
                
                ⁢
                α
                ⁢
                
                  
                
                ⁢
                n
              
            
            ⁢
            
              
                
                  r
                  _
                
                
                  u
                  ,
                  v
                
              
              ⁡
              
                (
                n
                )
              
            
          
        
        ,
        
          0
          ≤
          n
          <
          
            M
            sc
            RS
          
        
        ,
      
    
    
      
        [
        
          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,v(n) is divided into several groups. uε{0,1, . . . , 29} denotes group number, and v corresponds to a base sequence number in a corresponding group. Each group includes one base sequence v=0 having a length of MscRS=mNscRB (1≦m≦5) and two base sequences v=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,v(0), . . . , ru,v(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,v(0), . . . , ru,v(MscRS−1) is given by the following equation 2.

 ru,v(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
              
              ⁢
              
                
                  π
                  ⁢
                  
                    
                  
                  ⁢
                  
                    qm
                    ⁡
                    
                      (
                      
                        m
                        +
                        1
                      
                      )
                    
                  
                
                
                  N
                  ZC
                  RS
                
              
            
          
        
        ,
        
          0
          ≤
          m
          ≤
          
            
              N
              ZC
              RS
            
            -
            1
          
        
        ,
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          3
        
        ]
      
    
  




where q satisfies the following equation 4.

q=└ q+1/2┘+v·(−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 NZCRS<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,v(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.




  
    
      
        
          
            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
                  
                  ,
                
              
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          7
        
        ]
      
    
  




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 mod 30 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 v within a base sequence group is v=0.
For an RS having a length of MscRS≧6NscRB, a base sequence ns number v 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,v(α)(n). Here, m and n satisfy



  
    
      m
      =
      0
    
    ,
    1
  




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



and satisfy MscRS=MscPUSCH.

A cyclic shift in one slot is given by α=2 ncs/12 together with ncs=(nDMRS(1)+nDMRS(2)+nPRS(ns))mod 12.
Here, nDMRS(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 (00K) 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,
3
2



1b





2
2
1



2a, 2b
2
N/A



















TABLE 6









SC-FDMA symbol location




PUCCH
of RS












format
Normal CP
Extended CP






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



1b





2, 2a,
1, 5
3



2b









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










Sequence index
Orthogonal sequences



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








Sequence index
Orthogonal sequences


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










Normal
Extended


Sequence index noc (ns)
cyclic prefix
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 coded bits. Before QPSK modulation, the coded bits may be scrambled.




















TABLE 10





I
Mi, 0
Mi, 1
Mi, 2
Mi, 3
Mi, 4
Mi, 5
Mi, 6
Mi, 7
Mi, 8
Mi, 9
Mi, 10
Mi, 11
Mi, 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 (Precoding Matrix
2
1
4
4


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.
In order to solve the above-mentioned problems, a method for transmitting increased control information using a plurality of PUCCH resources may be used. For convenience of description, a method for multiplexing ACK/NACK information using a plurality of PUCCH resources will hereinafter be described on the basis of control information denoted by ACK/NACK.
ACK/NACK is one example of control information, and can also be applied to a variety of control channel information such as CSI, PMI, RI, SR, etc. without departing from the scope or spirit of the present invention.
ACK/NACK multiplexing indicates that a plurality of ACK/NACK information is transmitted using at least two PUCCH resources. As examples of ACK/NACK multiplexing using a plurality of PUCCH resources, multi-sequence modulation (MSM) and channel (sequence) selection may be used.

    
    
        MSM (Multi-Sequence Modulation): The MSM scheme modulates ACK/NACK information, and transmits the modulated result through individual PUCCH resources. For example, provided that 4-bit ACK/NACK information is transmitted, after a first bit sequence (e.g., 2 bits) is modulated (e.g., QPSK-modulated) and a second bit sequence (e.g., 2 bits) is modulated (e.g., QPSK-modulated), a modulation symbol obtained from the first bit sequence is transmitted through a first resource and a modulation symbol obtained from the second bit sequence is transmitted through a second resource, and the first resource and the second resource are simultaneously transmitted (for example, add operation).
    
    


Channel (sequence) selection: The channel (sequence) selection scheme selects N resources from among M resources, modulates the corresponding PUCCH resources, and transmits information using the modulated result. That is, ACK/NACK information is indicated by a combination of a selected PUCCH resource and a modulation value applied to the corresponding PUCCH resource. The channel (sequence) selection method can be transmitted using a total of




  
    2
    
      M
      order
    
  
  ·
  
    (
    
      
        
          M
        
      
      
        
          N
        
      
    
    )
  




information pieces. In this case, Morder is a modulation order, where





   
  
    (
    
      
        
          M
        
      
      
        
          N
        
      
    
    )
  




is denoted by





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




For example, when M=2, N=1, and Morder=2, information regarding a total of 8 states (=22×2) can be transmitted.

FIG. 29 exemplarily shows Inter-Modulation Distortion (IMD) problems encountered when a plurality of physical channels is simultaneously transmitted. FIG. 29 shows OOB emission encountered when a plurality of physical channels (i.e., resource blocks) is transmitted at a band-edge.
Referring to FIG. 29, a solid line exemplarily shows small frequency spacing between RBs, and a dotted line exemplarily shows large frequency spacing between RBs.
In association with two frequencies (f1, f2), a period for generating a harmonic component is denoted by a function of |f1−f2|. That is, as the frequency spacing between two chunks is wider, the positions at which third and fifth harmonic components occur are farther from the transmission band. As the frequency spacing between two chunks is narrower, the positions at which the third/fifth harmonic components occur are closer to the transmission band. A harmonic component located close to a transmission band may cause intra-band interference. A harmonic component located far from the transmission band may cause inter-band interference. The intra-band interference can be solved through power control or resource allocation when a signal is transmitted at a band-edge in the same manner as in a PUCCH. In contrast, the inter-band interference may cause serious problems when a contiguous band is a security band (e.g., Band13).
Embodiment:Transmission of Control Information Using a Plurality of PUCCH Resources
A method for efficiently allocating resources when control information is transmitted using a plurality of PUCCH resources will hereinafter be described in detail. In addition, this embodiment provides a resource allocation method for solving the IMD problem shown in FIG. 29. For convenience of description, while the embodiment of the present invention is exemplarily focused on MSM, it should be noted that the scope or spirit of the present invention is not limited thereto.
FIG. 30 is a conceptual diagram illustrating a method for transmitting control information using a plurality of PUCCH resources according to one embodiment of the present invention.
Referring to FIG. 30, a user equipment (UE) allocates PUCCH resources to transmit a plurality of PUCCHs in step S3010. For convenience of description, it is assumed that M PUCCH resources are utilized. In this case, a first PUCCH resource (for convenience of description, referred to as a first resource) from among M PUCCH resources may be allocated through PDCCH, BCH, RRC, and MAC signaling. For convenience of description, the BCH, RRC, and MAC signaling are generically called higher layer signaling. In contrast, the remaining PUCCH resources (for convenience of description, referred to as a second resource) from among M PUCCH resources can be inferred from a reference PUCCH resource. Each of the first resource index and the second resource index (i.e., PUCCH resource index) may be a cyclic shift (CS) index (nCS), an orthogonal cover (OC) index (nOC) or a PRB index (nPRB), or may be a representative logical index of a combination of the CS index (nCS), the OC index (nOC), and the PRB index (nPRB).
For example, the first resource and the second resource may be given as follows.

    
    
        The first resource index is given through higher layer signaling (preferably, RRC signaling), and the second resource index can be inferred from the first resource index.
        The first resource index candidate is given through higher layer signaling (preferably, RRC signaling), and a first resource index to be actually used can be dynamically given through physical layer signaling (e.g., PDCCH). Thereafter, the second resource index can be inferred from the first resource index.
        The first resource index is established to correspond to the lowest CCE index for transmission of a DL grant PDCCH according to a dynamical ACK/NACK resource allocation rule of the legacy LTE, and the second resource index can be inferred from the first resource index. For reference, according to the dynamic ACK/NACK resource allocation rule of the legacy LTE, the PUCCH resource index is determined according to nr=ncce+N_PUCCH(1), where nr is a PUCCH resource index, ncce is the lowest CCE index constructing a PDCCH, and N_PUCCH(1) is a value established by higher layer signaling. The CS index (nCS), the OC index (nOC) or the PRB index (nPRB) can be obtained from the PUCCH resource index (nr).
    
    


In another example, the first resource index is established to correspond to the lowest CCE index for transmission of a DL grant PDCCH according to a dynamical ACK/NACK resource allocation rule of the legacy LTE, and the second resource index can be allocated through higher layer signaling.
Preferably, a plurality of PUCCH resources can be allocated to have frequency spacing of zero in step S3010. For example, when the second resource index is inferred from the first resource index, the second resource can be inferred in a manner that all PUCCH resources are present in the same PRB. Since all PUCCH resources are present in the same PRB, the IMD problem can be solved with reference to FIG. 29.
If a PUCCH resource allocation procedure is completed in step S3010, the UE transmits a plurality of control information to the eNode B (or a relay or RN) through the corresponding PUCCH resources in step S3020.
FIG. 31 is a conceptual diagram illustrating a method for transmitting ACK/NACK information through a plurality of PUCCH resources according to one embodiment of the present invention. In FIG. 31, the first resource is established to correspond to the lowest CCE index for PDCCH transmission according to the legacy LTE dynamic resource allocation rule, and the second resource index is inferred from the first resource index.
Referring to FIG. 31, a user equipment (UE) receives a plurality of PDCCHs carrying a DL grant from a base station (BS) in step S3110. For convenience of description, it is assumed that the UE receives two PDCCHs. When supporting carrier aggregation (CA), a plurality of PDCCHs can be received through the same or different DL CCs. For example, the first PDCCH can be received through a DL PCC, and the second PDCCH can be received through a DL SCC. Thereafter, the UE receives DL data (i.e., PDSCH) indicated by the first PDCCH and DL data indicated by the second PDCCH. If cross-carrier scheduling is allowed, PDCCH and DL data corresponding thereto can be received through different DL CCs.
Thereafter, the UE generates an ACK/NACK result of DL data received from the BS and performs a PUCCH resource allocation process for feeding back the ACK/NACK result (Steps S3130 and S3140). In more detail, the UE determines the first PUCCH resource index on the basis of the lowest CCE index used to transmit the first PDCCH in step S3130. In contrast, the second PUCCH resource index is inferred from the first PUCCH resource index and the offset value in step S3140. A process for selecting a PDCCH used in step S3130 from among a plurality of PDCCHs can be determined according to a predetermined rule or signaling. For example, a PDCCH for use in step S3130 may be a PDCCH received through a PCC, or may be a first or last PDCCH of a frequency domain.
If the PUCCH resource allocation steps S3130 and S3140 are completed, the UE transmits ACK/NACK information using the corresponding PUCCH resource in step S3150. Preferably, a plurality of PUCCHs can be transmitted through the same PRB. If control information is transmitted using a channel (sequence) selection method, the control information can be transmitted through some PUCCH resources (i.e., a first PUCCH resource or a second PUCCH resource).
Assuming that PUCCH formats 1/1a/1b of the legacy LTE are used, a method for determining the second resource index from the first resource index will hereinafter be described. Resource indices of the LTE PUCCH formats 1/1a/1b can be represented by a combination of the CS value (ncs), the OC index (noc), and the PRB index (nPRB), and the resource indices can be indexed in the order of CS domain, →OC domain→PRB resource domain.
Assuming that the first resource index is denoted by (a), the second resource index can be determined using the following equation 10. Equation 10 shows an example of cyclic indexing of the second resource.

(a+δn)mod(NCS·NOC+nPRB·NCS·NOC), or

(a−δn)mod(NCS·NOC+nPRB·NCS·NOC)  [Equation 10]

In Equation 10, δn is an offset value versus a first resource for the n-th second resource, and may be an arbitrary integer (n=1, 2, . . . ). NCS is the number of cyclic shifts (CSs) available within one PRB. NOC is the number of orthogonal covers (OCs) available within one PRB. nPRB is a PRB index including a currently used resource index.
If δn=n, the second resource index can be determined using the following equation 11. The following equation 11 exemplarily shows that the second resource index is sequentially increased on the basis of the first resource index.

(a+n)mod(NCS·NOC+nPRB·NCS·NOC)  [Equation 11]

In Equation 11, a, n, NCS NOC, and nPRB are identical to those of Equation 10.
If δn=−n, the second resource index can be determined using the following equation 12. Equation 12 exemplarily shows that the second resource index is sequentially reduced on the basis of the first resource index.

(a−n)mod(NCS·NOC+nPRB·NCS·NOC)  [Equation 12]

In Equation 12, a, n, NCS, NOC, and nPRB are identical to those of Equations 10 and 11.
In another example, Δoffset×n may be used instead of ‘n’ in Equations 10 and 11, where Δoffset×n is an integer of 1 or more.
Assuming that PUCCH formats 2/2a/2b of the legacy LTE are used, a method for determining the second resource index from the first resource index will hereinafter be described. The PUCCH formats 2/2a/2b of the legacy LTE have no orthogonal cover (OC) resources, so that the above-mentioned equations 10 to 12 can be modified into the following equations 13 to 15. If it is assumed that the first resource index is set to ‘a’ in Equations 13 to 15, the second resource index can be cyclically indexed as shown in the following equation 13.

(a+δn)mod(NSC), or

(a−δn)mod(NSC)  [Equation 13]

In Equation 13, δn is an offset value versus a first resource for the n-th second resource, and may be an arbitrary integer (n=1, 2, . . . ). NSC is the number (e.g., 12) of subcarriers contained in one PRB.
If δn=n, the second resource index can be determined using the following equation 14. The following equation 14 exemplarily shows that the second resource index is sequentially increased on the basis of the first resource index.

(a+n)mod(NSC)  [Equation 14]

In Equation 14, a, n, and NSC are identical to those of the above-mentioned equations.
If δn=−n, the second resource index can be determined using the following equation 15. Equation 15 exemplarily shows that the second resource index is sequentially reduced on the basis of the first resource index.

(a−n)mod(NSC)  [Equation 15]

In Equation 15, a, n, and NSC are identical to those of the above-mentioned equations.
In another example, offset×n may be used instead of ‘n’ more.
In the above-mentioned example, the first resource index denoted by ‘a’ can be given by an arbitrary method. For example, “first resource index=a” can be allocated through either higher layer signaling (e.g., BCH, RRC, MAC signaling) or physical layer signaling (e.g., PDCCH). Provided that the legacy LTE dynamic resource allocation rule is used, “first resource index=a” can be established to correspond to the lowest CCE index for PDCCH transmission.
Although the above-mentioned example has disclosed a predetermined value of δn, it should be noted that δn may be given through higher layer signaling (e.g., BCH, RRC, MAC signaling) or physical layer signaling (e.g., PDCCH).
FIG. 32 is a block diagram illustrating a base station (BS) and a user equipment (BS) applicable to embodiments of the present invention.
Referring to FIG. 32, 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 change which comes 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 simultaneously transmitting a plurality of physical uplink control channels (PUCCHs) by a user equipment (UE) in a wireless communication system, the method comprising:
receiving a downlink grant including at least one Physical Downlink Control Channel (PDCCH);
decoding the at least one PDCCH to recognize a first resource index;
determining a first Physical Uplink Control Channel (PUCCH) resource required for a first PUCCH from the first resource index and determining a second PUCCH resource required for a second PUCCH from the first resource index and an offset value; and
simultaneously transmitting Hybrid Automatic Repeat and reQuest ACKnowledgment (HARQ-ACK) information via both the first and second PUCCHs using the first and second PUCCH resources.

2. The method according to claim 1, wherein the recognizing of the first resource index includes
recognizing a lowest control channel element (CCE) used for transmission of the at least one PDCCH.

3. The method according to claim 1, wherein the first PUCCH resource is given through higher layer signaling.

4. The method according to claim 1, wherein the second PUCCH resource is inferred by adding the offset value to the first resource index.

5. The method according to claim 1, wherein the second PUCCH resource is inferred from the first PUCCH resource so that the plurality of PUCCHs is transmitted through the same physical resource block (PRB).

6. The method according to claim 1, wherein the second PUCCHs resources is obtained from the following equation:


(a+δn)mod(NCS·NOC+nPRB·NCS·NOC), or



(a−δn)mod(NCS·NOC+nPRB·NCS·NOC)  [Equation]

where a is the first resource index, δn is the offset value for inferring the second PUCCH resource, NCS is the number of cyclic shifts (CSs) available within one PRB, NOC is the number of orthogonal covers (OCs) available within one PRB, and nPRB is a PRB index on which the first PUCCH resources exists.

7. A user equipment (UE) configured to simultaneously transmit a plurality of physical uplink control channels (PUCCHs) in a wireless communication system, said user equipment comprising:
a radio frequency (RF) unit configured to receive at least one Physical Downlink Control Channel (PDCCH) and transmit Hybrid Automatic Repeat and reQuest ACKnowledgment (HARQ-ACK) information; and
a processor configured to:
receive a downlink grant including the at least one PDCCH,
decode the at least one PDCCH to recognize a first resource index,
determine a first Physical Uplink Control Channel (PUCCH) resource required for a first PUCCH from the first resource index and determine a second PUCCH resource required for a second PUCCH from the first resource index and an offset value, and
simultaneously transmit Hybrid Automatic Repeat and reQuest ACKnowledgment (HARQ-ACK) information via both the first and second PUCCHs using the first and second PUCCH resources.

8. The user equipment (UE) according to claim 7, wherein the recognizing of the first resource index includes
recognizing a lowest control channel element (CCE) used for transmission of the at least one PDCCH.

9. The user equipment (UE) according to claim 7, wherein the first PUCCH resource is given through higher layer signaling.

10. The user equipment (UE) according to claim 7, wherein the second PUCCH resource is inferred by adding the offset value to the first resource index.

11. The user equipment (UE) according to claim 7, wherein the second PUCCH resource is inferred from the first PUCCH resource so that the plurality of PUCCHs are transmitted through the same physical resource block (PRB).

12. The user equipment (UE) according to claim 7, wherein the second PUCCH resource is obtained from the following equation:


(a+δn)mod(NCS·NOC+nPRB·NCS·NOC), or



(a−δn)mod(NCS·NOC+nPRB·NCS·NOC)  [Equation]

where a is the first resource index, δn is an offset value for inferring the second PUCCH resource, NCS is the number of cyclic shifts (CSs) available within one PRB, NOC is the number of orthogonal covers (OCs) available within one PRB, and nPRB is a PRB index on which the first PUCCH resources exists.