# 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 in which a terminal transmits control information in a wireless communication system, and to an apparatus for the method, wherein the method comprises the following steps: spreading a control information block corresponding to one single carrier frequency division multiplexing (SC-FDMA) symbol, such that the spread control information blocks correspond to a plurality of first SC-FDMA symbols; performing a discrete Fourier transform (DFT) precoding process on the spread control information blocks on an SC-FDMA symbol basis; transmitting, in the plurality of first SC-FDMA symbols in a subframe, the DFT precoded control information blocks; and transmitting, in a plurality of second SC-FDMA symbols in the subframe, a reference signal sequence, wherein an orthogonal code is applied to the plurality of second SC-FDMA symbols in a time domain.

## Background
This Application is a 35 U.S.C. §371 National Stage Entry of International Application No. PCT/KR2011/000287, filed Jan. 14, 2011 and claims the benefit of U.S. Provisional Application Nos. 61/295,741, filed Jan. 17, 2010, 61/301,160, filed Feb. 3, 2010, 61/361,529, filed Jul. 6, 2010, 61/368,641, filed Jul. 28, 2010, and Korean Application No:10-2011-0003087, filed Jan. 12, 2011, all of which are incorporated by reference in their entirety herein.


BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a wireless communication system and, more particularly, to a method and apparatus for transmitting control information. The wireless communication system can support carrier aggregation (CA).
2. Discussion of the Related Art
Extensive research has been conducted to provide various types of communication services including voice and data services in wireless communication systems. In general, a wireless communication system is a multiple access system that supports communication with multiple users by sharing available system resources (e.g. bandwidth, transmission power, etc.) among the multiple users. The multiple access system may adopt a multiple access scheme such as Code Division Multiple Access (CDMA), Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA), Orthogonal Frequency Division Multiple Access (OFDMA), Single Carrier Frequency Division Multiple Access (SC-FDMA), etc.
SUMMARY OF THE INVENTION
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, signal processing method and apparatus for efficiently transmitting control information. Another object of the present invention is to provide a method and apparatus for efficiently allocating resources for transmitting control information.
It will be appreciated by persons skilled in the art that the objects that could be achieved with the present invention are not limited to what have been particularly described hereinabove and the above and other objects that the present invention could achieve will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings.
According to an aspect of the preset invention, a method for transmitting control information at a user equipment (UE) in a wireless communication system includes: spreading a control information block corresponding to one single carrier frequency division multiplexing (SC-FDMA) symbol, such that the spread control information blocks correspond to a plurality of first SC-FDMA symbols; DFT(discrete Fourier transform)-precoding the spread control information blocks on an SC-FDMA symbol basis; transmitting the DFT-precoded control information blocks through the plurality of first SC-FDMA symbols in a subframe; and transmitting a reference signal sequence through a plurality of second SC-FDMA symbols in the subframe, wherein an orthogonal code is applied to the plurality of second SC-FDMA symbols in a time domain.
The plurality of first SC-FDMA symbols and the plurality of second SC-FDMA symbols may be transmitted through multiple antennas, and the orthogonal code applied to the plurality of second SC-FDMA symbols may be differently configured for each of the multiple antennas.
Spreading codes used for the spreading the control information block are orthogonal between the multiple antennas.
The orthogonal code may be applied to the plurality of second SC-FDMA symbols at a slot level.
An orthogonal code may be additionally applied to the plurality of second SC-FDMA symbols at a subframe level.
The method may further includes generating a plurality of reference signal sequences corresponding to the plurality of second SC-FDMA symbols, wherein each of the reference signal sequences is generated by circular-shifting a base sequence.
According to another aspect of the present invention, a UE configured to transmit control information in a wireless communication system includes: a radio frequency (RF) unit; and a processor connected to the RF unit, the processor configured to spread a control information block corresponding to one single carrier frequency division multiplexing (SC-FDMA) symbol such that the spread control information blocks correspond to a plurality of first SC-FDMA symbols, to DFT-precode the spread control information blocks on an SC-FDMA symbol basis, to transmit the DFT-precoded control information blocks through the plurality of first SC-FDMA symbols in a subframe, and to transmit a reference signal sequence through a plurality of second SC-FDMA symbols in the subframe, wherein an orthogonal code is applied to the plurality of second SC-FDMA symbols in a time domain.
The plurality of first SC-FDMA symbols and the plurality of second SC-FDMA symbols may be transmitted through multiple antennas, and the orthogonal code applied to the plurality of second SC-FDMA symbols may be differently configured for each of the multiple antennas.
Spreading codes used for the spreading the control information block are orthogonal between the multiple antennas.
The orthogonal code may be applied to the plurality of second SC-FDMA symbols at a slot level.
An orthogonal code may be additionally applied to the plurality of second SC-FDMA symbols at a subframe level.
The processor may be configured to generate a plurality of reference signal sequences corresponding to the plurality of second SC-FDMA symbols, wherein each of the reference signal sequences is generated by circular-shifting a base sequence.
ADVANTAGEOUS EFFECTS
According to embodiments of the present invention, control information can be efficiently transmitted in a wireless communication system. Furthermore, a channel format and a signal processing method for efficiently transmitting control information can be provided. In addition, resources for control information transmission can be efficiently allocated.
It will be appreciated by persons skilled in the art that the effects that could be achieved with the present invention are not limited to what has been particularly described hereinabove and these and other advantages of the present invention will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the principle of the invention. In the drawings:
FIG. 1 illustrates physical channels used in a 3GPP LTE system and a signal transmission method using the same;
FIG. 2 illustrates an uplink signal processing procedure;
FIG. 3 illustrates a downlink signal processing procedure;
FIG. 4 illustrates SC-FDMA and OFDMA schemes;
FIG. 5 illustrates a signal mapping scheme in a frequency domain, which satisfies single carrier property;
FIG. 6 illustrates a signal processing procedure of mapping DFT process output samples to a single carrier in clustered SC-FDMA;
FIGS. 7 and 8 illustrate a signal processing procedure of mapping DFT process output samples to multiple carriers in clustered SC-FDMA;
FIG. 9 illustrates a signal processing procedure in segmented SC-FDMA;
FIG. 10 illustrates an uplink subframe structure;
FIG. 11 illustrates a signal processing procedure for transmitting a reference signal (RS) on uplink;
FIG. 12 illustrates a demodulation reference signal (DMRS) structure for PUSCH;
FIGS. 13 and 14 illustrate slot level structures of PUCCH formats 1a and 1b;
FIGS. 15 and 16 illustrate slot level structures of PUCCH formats 2/2a/2b;
FIG. 17 illustrates ACK/NACK channelization for PUCCH formats 1a and 1b;
FIG. 18 illustrates channelization for a hybrid structure of PUCCH formats 1/1a/1b and 2/2a/2b in the same PRB;
FIG. 19 illustrates PRB allocation for PUCCH transmission;
FIG. 20 illustrates a concept of management of downlink component carriers in a base station (BS);
FIG. 21 illustrates a concept of management of uplink component carriers in a user equipment (UE);
FIG. 22 illustrates a concept of management of multiple carriers by one MAC layer in a BS;
FIG. 23 illustrates a concept of management of multiple carriers by one MAC layer in a UE;
FIG. 24 illustrates a concept of management of multiple carriers by multiple MAC layers in a BS;
FIG. 25 illustrates a concept of management of multiple carriers by multiple MAC layers in a UE;
FIG. 26 illustrates a concept of management of multiple carriers by multiple MAC layers in a BS;
FIG. 27 illustrates a concept of management of multiple carriers by one or more MAC layers in a UE;
FIG. 28 illustrates asymmetrical carrier aggregation in which a plurality of DL CCs are linked to one UL CC;
FIG. 29 illustrates signal transmission through a PUCCH according to an embodiment of the present invention;
FIGS. 30 and 31 illustrate a PUCCH format and a signal processing procedure for the same according to an embodiment of the present invention;
FIGS. 32 and 33 illustrate a PUCCH format having an increased RS multiplexing capacity and a signal processing procedure therefor according to an embodiment of the present invention.
FIG. 34 illustrates a signal processing block for transmitting a PUCCH through multiple antennas according to an embodiment of the present invention;
FIG. 35 illustrates PUCCHs generated for respective antenna ports in the signal processing block shown in FIG. 34;
FIGS. 36 and 37 illustrate a signal processing block for transmitting a PUCCH through multiple antennas according to another embodiment of the present invention;
FIG. 38 illustrates PUCCHs generated for respective antenna ports in the signal processing block shown in FIGS. 36 and 38;
FIG. 39 illustrates a signal processing block for transmitting a PUCCH through multiple antennas according to another embodiment of the present invention;
FIG. 40 illustrates a signal processing block for transmitting a PUCCH through multiple antennas according to another embodiment of the present invention;
FIGS. 41 to 44 illustrate PUCCH formats and signal processing procedures for the same according to an embodiment of the present invention;
FIGS. 45 to 52 illustrate PUCCH resource allocation according to embodiments of the present invention;
FIG. 53 illustrates a PUCCH format and a signal processing procedure for the same according to another embodiment of the present invention;
FIGS. 54 to 65 illustrate PUCCH resource allocation according to other embodiments of the present invention;
FIG. 66 illustrates configurations of a BS and a UE applicable to the present invention.



DETAILED DESCRIPTION OF THE INVENTION
Embodiments of the present invention are applicable to a variety of wireless access technologies such as Code Division Multiple Access (CDMA), Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA), Orthogonal Frequency Division Multiple Access (OFDMA), Single Carrier Frequency Division Multiple Access (SC-FDMA), etc. CDMA can be implemented as a wireless technology such as Universal Terrestrial Radio Access (UTRA) or CDMA2000. TDMA can be implemented as a wireless technology such as Global System for Mobile communications (GSM)/General Packet Radio Service (GPRS)/Enhanced Data Rates for GSM Evolution (EDGE). OFDMA can be implemented as a wireless technology such as Institute of Electrical and Electronics Engineers (IEEE) 802.11 (Wireless Fidelity (Wi-Fi)), IEEE 802.16 (Worldwide interoperability for Microwave Access (WiMAX)), IEEE 802.20, Evolved UTRA (E-UTRA). UTRA is a part of Universal Mobile Telecommunications System (UMTS). 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) is a part of Evolved UMTS (E-UMTS) using E-UTRA. LTE-Advanced (LTE-A) is an evolution of 3GPP LTE. While the following description is given, centering on 3GPP LTE/LTE-A for clarity of description, this is purely exemplary and thus should not be construed as limiting the present invention.
In a wireless communication system, a UE receives information from a BS through downlink and transmits information to the BS through uplink. Information transmitted and received between the BS and the UE includes data and various types of control information. Various physical channels are present according to type/usage of information transmitted and received between the BS and the UE.
FIG. 1 illustrates physical channels used in a 3GPP LTE system and a signal transmission method using the same.
When powered on or when a UE initially enters a cell, the UE performs initial cell search involving synchronization with a BS in step S101. For initial cell search, the UE may be synchronized with the BS and acquire information such as a cell Identifier (ID) by receiving a Primary Synchronization Channel (P-SCH) and a Secondary Synchronization Channel (S-SCH) from the BS. Then the UE may receive broadcast information from the cell on a Physical Broadcast Channel (PBCH). In the mean time, the UE may determine a downlink channel status by receiving a Downlink Reference Signal (DL RS) during initial cell search.
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.
The UE may perform a random access procedure to access 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) (S103) and receive a response message for preamble on a PDCCH and a PDSCH corresponding to the PDCCH(S104). In the case of contention-based random access, the UE may perform a contention resolution procedure by further transmitting the PRACH (S105) and receiving a PDCCH and a PDSCH corresponding to the PDCCH (S106).
After the foregoing procedure, the UE may receive a PDCCH/PDSCH (S107) and transmit a Physical Uplink Shared Channel (PUSCH)/Physical Uplink Control Channel (PUCCH) (S108), as a general downlink/uplink signal transmission procedure. Here, control information transmitted from the UE to the BS is called uplink control information (UCI). The UCI may include a Hybrid Automatic Repeat and request Acknowledgement/Negative-ACK (HARQ ACK/NACK) signal, scheduling request (SR), a Channel Quality Indicator (CQI), a Precoding Matrix Index (PMI), a Rank Indication (RI), etc. While the UCI is transmitted through a PUCCH in general, it may be transmitted through a PUSCH when control information and traffic data need to be simultaneously transmitted. The UCI may be aperiodically transmitted through a PUSCH at the request/instruction of a network.
FIG. 2 illustrates a signal processing procedure through which a UE transmits an uplink signal.
To transmit the uplink signal, a scrambling module 210 of the UE may scramble the uplink signal using a UE-specific scrambling signal. The scrambled signal is input to a modulation mapper 220 in which the scrambled signal is modulated into complex symbols using Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK) or 16-Quadrature Amplitude Modulation (QAM)/64-QAM according to signal type and/or channel status. The modulated complex symbols are processed by a transform precoder 230, and then applied to a resource element mapper 240. The resource element mapper 240 may map the complex symbols to time-frequency resource elements. The signal processed in this manner may be subjected to an SC-FDMA signal generator 250 and transmitted to a BS through an antenna.
FIG. 3 illustrates a signal processing procedure through which the BS transmits a downlink signal.
In a 3GPP LTE system, the BS may transmit one or more codewords on downlink. The codewords may be processed into complex symbols through scrambling modules 301 and modulation mappers 302 as in the uplink shown in FIG. 2. Then, the complex symbols are mapped to a plurality of layers by a layer mapper 303. The layers may be multiplied by a precoding matrix in a precoding module 304 and allocated to each of transmit antennas. The processed signals for the respective antennas may be mapped to time-frequency resource elements by a resource element mapper 305 and subjected to an OFDM signal generator 306 to be transmitted through the antennas.
When the UE transmits an uplink signal in a wireless communication system, a peak-to-average ratio (PAPR) becomes a problem, as compared to a case in which the BS transmits a downlink signal. Accordingly, uplink signal transmission uses SC-FDMA while downlink signal transmission uses OFDMA, as described above with reference to FIGS. 2 and 3.
FIG. 4 illustrates SC-FDMA and OFDMA schemes. The 3GPP system employs OFDMA scheme in downlink and employs SC-FDMA scheme in uplink.
Referring to FIG. 4, both a UE for transmitting an uplink signal and a BS for transmitting a downlink signal include a serial-to-parallel converter 401, a subcarrier mapper 403, an M-point IDFT module 404, and a cyclic prefix (CP) adder 406. The UE for transmitting a signal according to SC-FDMA additionally includes an N-point DFT module 402.
FIG. 5 illustrates a signal mapping scheme in a frequency domain, which satisfies single carrier property. FIG. 5(a) illustrates a localized mapping scheme and FIG. 5(b) illustrates a distributed mapping scheme.
Clustered SC-FDMA, which is a modified version of SC-FDMA, will now be described. In clustered SC-FDMA, DFT process output samples are divided into sub-groups in a subcarrier mapping process and the sub-groups are discretely mapped to the frequency domain (or subcarrier domain).
FIG. 6 illustrates a signal processing procedure for mapping DFT process output samples to a single carrier in clustered SC-FDMA. FIGS. 7 and 8 illustrate a signal processing procedure for mapping DFT process output samples to multiple carriers in clustered SC-FDMA. FIG. 6 shows an example of applying intra-carrier clustered SC-FDMA while FIGS. 7 and 8 show examples of applying inter-carrier clustered SC-FDMA. FIG. 7 illustrates a case in which a signal is generated through a single IFFT block when subcarrier spacing between neighboring component carriers is configured while component carriers are contiguously allocated in the frequency domain. FIG. 8 shows a case in which a signal is generated through a plurality of IFFT blocks when component carriers are non-contiguously allocated in the frequency domain.
FIG. 9 illustrates a signal processing procedure in segmented SC-FDMA.
Segmented SC-FDMA is a simple extension of the DFT spreading and IFFT subcarrier mapping structure of the conventional SC-FDMA, when the number of DFT blocks is equal to the number of IFFT blocks and thus the DFT blocks and the IFFT blocks are in one-to-one correspondence. While the term ‘segmented SC-FDMA’ is adopted herein, it may also be called NxSC-FDMA or NxDFT spread OFDMA (NxDFT-s-OFDMA). Referring to FIG. 9, the segmented SC-FDMA is characterized in that total time-domain modulation symbols are divided into N groups (N is an integer larger than 1) and a DFT process is performed on a group-by-group basis to relieve the single carrier property constraint.
FIG. 10 illustrates an uplink subframe structure.
Referring to FIG. 10, an uplink subframe includes a plurality of slots (e.g. two slots). The slots may include different numbers of SC-FDMA symbols according to CP length. For example, the slot can include 7 SC-FDMA symbols in case of normal CP. The uplink 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 data. The control region includes a PUCCH and is used to transmit UCI. The PUCCH includes RB pairs (e.g. 7 RB pairs in frequency mirrored positions, and m=0, 1, 2, 3, 4) located on both ends of the data region on the frequency axis and is hopped at the boundary of slots. The UCI includes HARQ ACK/NACK, CQI, PMI, RI, etc.
FIG. 11 illustrates a signal processing procedure for transmitting a reference signal (RS) on uplink. While data is converted into a frequency domain signal through a DFT precoder, frequency-mapped, and then transmitted through IFFT, an RS does not passes the DFT precoder. Specifically, an RS sequence is generated directly in the frequency domain (S11) and then is sequentially subjected to localization mapping (S12), IFFT (S13) and CP addition (S14) to be transmitted.
RS sequence ru,v(α)(n) is defined by a cyclic shift α of a base sequence and may be represented by Equation 1.

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

Here, MscRS=mNscRB is the length of the RS sequence, NscRB is a resource block size on a subcarrier basis, 1≦m≦NRBmax,UL, and NRBmax,UL represents a maximum uplink transmission bandwidth.
Base sequences ru,v(n) are divided into several groups. uε{0, 1, . . . , 29} denotes the group number and v corresponds to the base sequence number within the corresponding group. Each group contains one base sequence (v=0) of each length MscRS=mNscRB (1≦m≦5) and two base sequences (v=0,1) of each length MscRS=mNscRB (6≦m≦NRBmax,UL). The sequence group number u and the base sequence number v within the corresponding group may vary with time. Base sequence ru,v(0), . . . , ru,v(MscRS−1) depends on the sequence length MscRS.
A base sequence of length 3NscRB or larger can be defined as follows.
For 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]

Here, the q-th root Zadoff-Chu sequence can 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
        
        ]
      
    
  




Here, q is given by the following Equation 4.

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

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

The length NZCRS of the Zadoff-Chue sequence is given by the largest prime number such that NZCRS<MscRS is satisfied.
A base sequence of length less than 3NscRB can be defined as follows. The base sequence is given by the following Equation 5 for MscRS=NscRB and MscRS=2NscRB.

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

Here, for MscRS=NscRB and MscRS=2NscRB, φ(n) is given as shown in Tables 1 and 2, 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 will now be described.
The sequence group number u in slot ns can be defined by group hopping pattern fgh(ns) and a sequence-shift pattern fss according to Equation 6.

u=(fgh(nS)+fSS)mod 30  [Equation 6]

Here, mod denotes a modulo operation.
There are 17 different hopping patterns and 30 different sequence-shift patterns. Sequence group hopping may be enabled or disabled by means of a parameter that enables group hopping and is provided by higher layers.
PUCCH and PUSCH have the same hopping pattern but may have different sequence-shift patterns.
The group hopping pattern fgh(ns) is the same for PUSCH and PUCCH and 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
        
        ]
      
    
  




Here, c(i) corresponds to a pseudo-random sequence and the pseudo-random sequence generator may be initialized with




  
    c
    init
  
  =
  
    ⌊
    
      
        N
        ID
        cell
      
      30
    
    ⌋
  




at the beginning of each radio frame.

Sequence-shift pattern fss differs between PUCCH and PUSCH.
For PUCCH, sequence-shift pattern fssPUCCH is given by fssPUCCH=NIDcell mod 30. For PUSCH, sequence shift patter fssPUSCH is given by fssPUSCH=(fssPUCCH+Δss)mod 30. Δssε{0, 1, . . . , 29} is configured by higher layers.
Sequence hopping will now be described.
Sequence hopping only applies for reference signals of length MscRS≧6NscRB.
For reference signals of length MscRS<6NscRB, the base sequence number v within the base sequence group is given by v=0.
For reference signals of length MscRS≧6NscRB, the base sequence number v within the base sequence group in 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
        
        ]
      
    
  




Here, c(i) corresponds to the pseudo-random sequence and a parameter that is provided by higher layers and enables sequence hopping determines if sequence hopping is enabled or not. The pseudo-random sequence generator may be initialized with




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




at the beginning of each radio frame.

A reference signal for PUSCH is determined as follows.
Reference signal sequence rPUSCH(·) for PUSCH is defined by rPUSCH(m·MscRS+n)=ru,v(α)(n) where



  
    
      m
      =
      0
    
    ,
    1
  




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



and MscRS=MscPUSCH.

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




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




at the beginning of each radio frame.

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










TABLE 3







Cyclic shift field in 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 an uplink RS in a PUSCH will now be described.
The sequence is multiplied with the amplitude scaling factor βPUSCH and mapped to the same set of a physical resource block (PRB) used for the corresponding PUSCH in a sequence starting with rPUSCH(0). Mapping to resource elements (k,l), with l=3 for normal CP and l=2 for extended CP, in the subframe will be in increasing order of first k, then the slot number.
In summary, a ZC sequence is used with cyclic extension for length 3NscRB or larger, whereas a computer generated sequence is used for length less than 3NscRB. A cyclic shift is determined according to cell-specific cyclic shift, UE-specific cyclic shift and hopping pattern.
FIG. 12a shows a DMRS structure for PUSCH in case of normal CP and FIG. 12b shows a DMRS structure for PUSCH in case of extended CP. A DMRS is transmitted through the fourth and eleventh SC-FDMA symbols in FIG. 12a and transmitted through the third and ninth SC-FDMA symbols in FIG. 12b. 
FIGS. 13 to 16 illustrate slot level structures of PUCCH formats. A PUCCH has the following formats in order to transmit control information.
(1) Format 1: on-off keying (OOK) modulation, used for scheduling request (SR).
(2) Formats 1a and 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: QPSK modulation, used for CQI transmission.
(4) Formats 2a and 2b: used for simultaneous transmission of CQI and ACK/NACK
Table 4 shows modulation schemes according to PUCCH format and the number of bits per subframe. Table 5 shows the number of RSs per slot according to PUCCH format and Table 6 shows SC-FDMA symbol position in an RS according to PUCCH format. In Table 4, PUCCH formats 2a and 2b correspond to 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 position in RS










format
Normal CP
Extended CP





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


2, 2a, 2b
1, 5
3









FIG. 13 illustrates PUCCH formats 1a and 1b in case of normal CP and FIG. 14 illustrates PUCCH formats 1a and 1b in case of extended CP. In PUCCH formats 1a and 1b, the same control information is repeated in a subframe on a slot-by-slot basis. ACK/NACK signals are respectively transmitted from UEs through different resources configured by different cyclic shifts (CSs) (frequency domain codes) and orthogonal cover codes (OCs or OCCs) (time domain spreading codes) of a computer-generated constant amplitude zero auto correlation (CG-CAZAC) sequence. An OC includes a Walsh/DFT orthogonal code, for example. If the number of CSs is 6 and the number of OCs is 3, a total of 18 UEs can be multiplexed in the same physical resource block (PRB) on a single antenna basis. Orthogonal sequences w0,w1,w2,w3 may be applied in the arbitrary time domain (after FFT modulation) or in the arbitrary frequency domain (prior to FFT modulation).
An ACK/NACK resource composed of CS, OC and PRB may be given to a UE through radio resource control (RRC) for SR and persistent scheduling. The ACK/NACK resource may be implicitly provided to the UE by the lowest CCE index of a PUCCH corresponding to a PDSCH for dynamic ACK/NACK and non-persistent scheduling.
FIG. 15 illustrates PUCCH formats 2/2a/2b in case of normal CP and FIG. 16 illustrates PUCCH formats 2/2a/2b in case of extended CP. Referring to FIGS. 15 and 16, one subframe includes 10 QPSK data symbols in addition to RS symbols in case of normal CP. Each of the QPSK symbols is spread in the frequency domain by CS and then mapped to the corresponding SC-FDMA symbol. SC-FDMA symbol level CS hopping may be applied to randomize inter-cell interference. An RS may be multiplexed by CDM using CSs. For example, if the number of available CSs is 12 or 6, 12 or 6 UEs can be multiplexed in the same PRB. That is, a plurality of UEs can be multiplexed by CS+OC+PRB and CS+PRB in PUCCH formats 1/1a/1b and 2/2a/2b respectively.
Orthogonal sequences with length-4 and length-3 for PUCCH formats 1/1a/1b are shown in Table 7 and Table 8.







TABLE 7







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










Sequence
Orthogonal sequences



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








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





0
[1 1 1]


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


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









Orthogonal sequences for RS in 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. FIG. 17 corresponds to a case of ΔshiftPUCCH=2.
FIG. 18 illustrates channelization for a hybrid structure of PUCCH formats 1/1a/1b and 2/2a/2b in the same PRB.
CS hopping and OC remapping may be applied as follows.
(1) Symbol-based cell-specific CS hopping for randomization of inter-cell interference
(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)
Resource nr for PUCCH formats 1/1a/1b includes the following combination.
(1) CS (corresponding to a DFT orthogonal code at a symbol level) ncs 
(2) OC (orthogonal code at a slot level) noc 
(3) Frequency resource block (RB) nrb 
A representative index nr includes nr includes ncs, noc and nrb, where indexes indicating CS, OC and RB are ncs, noc, and nrb, respectively. Here, nr satisfies nr=(ncs, noc, nrb).
CQI, PMI, RI and a combination of CQI and ACK/NACK may be transmitted through PUCCH formats 2/2a/2b. In this case, Reed-Muller (RM) channel coding is applicable.
For example, channel coding for a UL CQI in an LTE system is described as follows. Bit stream a0, a1, a2, a3, . . . , aA-1 is channel-coded using RM code (20,A). Table 10 shows a base sequence for code (20,A). Here, a0 and aA-1 denote the most significant bit (MSB) and the least significant bit (LSB). In the case of extended CP, a maximum number of information bits is 11 in cases other than a case in which CQI and ACK/NACK are simultaneously transmitted. The UL CQI may be subjected to QPSK modulation after being coded into 20 bits using the RM code. The coded bits may be scrambled before being subjected to QPSK modulation.




















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-coded 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
        
        ]
      
    
  




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










TABLE 11







Field
Band









Wideband CQI
4










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









TABLE 12









Band










2 antenna ports
4 antenna ports











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





Wideband CQI
4
4
4
4


Spatial
0
3
0
3


differential


CQI


PMI(Precoding
2
1
4
4


Matrix Index)









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









TABLE 13









Bit widths










4 antenna ports














2 antenna
Maximum 2
Maximum 4



Field
ports
layers
layers







RI(Rank
1
1
2



Indication)










FIG. 19 illustrates PRB allocation. As shown in FIG. 19, a PRB may be used for PUCCH transmission in slot ns.
A multi-carrier system or a carrier aggregation system means a system using aggregation of a plurality of carriers having a bandwidth narrower than a target bandwidth for supporting wideband. When the plurality of carriers having a bandwidth narrower than the target bandwidth are aggregated, the bandwidth of the aggregated carriers may be limited to the bandwidths used in existing systems for backward compatibility with the existing systems. For example, an LTE system supports bandwidths of 1.4 MHz, 3 MHz, 5 MHz, 10 MHz, 15 MHz and 20 MHz and an LTE-A system evolved from the LTE system can support bandwidths wider than 20 MHz by using bandwidths supported by the LTE system. Alternatively, a new bandwidth may be defined to support carrier aggregation irrespective of the bandwidths used in existing systems. The term ‘multi-carrier’ can be used with carrier aggregation and bandwidth aggregation. Carrier aggregation collectively refers to both contiguous carrier aggregation and non-contiguous carrier aggregation.
FIG. 20 illustrates a concept of management of downlink component carriers in a BS and FIG. 21 illustrates a concept of management of uplink component carriers in a UE. For convenience of description, higher layers are simply referred to as a MAC layer in the following description.
FIG. 22 illustrates a concept of management of multiple carriers by one MAC layer in a BS and FIG. 23 illustrates a concept of management of multiple carriers by MAC layer in a UE.
Referring to FIGS. 22 and 23, one MAC layer manages and operates one or more frequency carriers for transmission and reception. In this case, resource management is flexible because frequency carriers managed by one MAC layer need not be contiguous. In FIGS. 22 and 23, one PHY layer corresponds to one component carrier. Here, one PHY layer does not necessarily mean an independent radio frequency (RF) device. While one independent RF device means one PHY layer in general, one RF device is not limited thereto and may include multiple PHY layers.
FIG. 24 illustrates a concept of management of multiple carriers by multiple MAC layers in a BS and FIG. 25 illustrates a concept of management of multiple carriers by multiple MAC layers in a UE. FIG. 26 illustrates a concept of management of multiple carriers by multiple MAC layers in a BS and FIG. 27 illustrates a concept of management of multiple carriers by one or more MAC layers in a UE.
Distinguished from the structures shown in FIGS. 22 and 23, multiple carriers may be controlled by multiple MAC layers as shown in FIGS. 24 to 27.
Multiple MAC layers may control one-to-one multiple carriers as shown in FIGS. 24 and 25. Referring to FIGS. 26 and 27, MAC layers may control one-to-one some carriers and one MAC layer may control other carriers.
The above-described system includes one to N carriers which are contiguous or non-contiguous. This can be applied in both uplink and downlink. A TDD system is configured such that N carriers for downlink transmission and uplink transmission are operated and an FDD system is configured such that multiple carriers are respectively used for uplink and downlink. The FDD system may support asymmetrical carrier aggregation in which the numbers of aggregated carriers and/or carrier bandwidths are different between uplink and downlink.
When the number of aggregated component carriers in uplink equals that of downlink, it is possible to configure all component carriers such that they are compatible with the existing systems. However, the configurations of component carriers that are not considered to be compatible with the existing systems are not excluded from the present invention.
While the following description is made on the assumption that, when a PDCCH is transmitted using downlink component carrier #0, a PDSCH corresponding to the PDCCH is transmitted through downlink component carrier #0, it is apparent that the PDSCH can be transmitted through a different downlink component carrier using cross-carrier scheduling. The term ‘component carrier’ can be replaced with an equivalent term (e.g. cell).
FIG. 28 illustrates a scenario of transmitting uplink control information (UCI) in a wireless communication system that supports carrier aggregation. This scenario is based on the assumption that UCI is ACK/NACK (A/N) information. However, this is exemplary and UCI can include control information such as channel status information (e.g. CQI, PMI, RI, etc.) and scheduling request information (e.g. SR).
FIG. 28 illustrates asymmetrical carrier aggregation in which 5 DL CCs are linked to one UL CC. This asymmetrical carrier aggregation may be configured from the viewpoint of UCI transmission. That is, DL CC-UL CC linkage for the UCI and DL CC-UL CC linkage for data may be different from each other. For convenience, when it is assumed that one DL CC can transmit a maximum of two codewords, at least two UL ACK/NACK bits are needed. In this case, for data received through 5 DL CCs, at least 10 ACK/NACK bits are needed to transmit ACK/NACK information through one UL CC. If DTX status is also supported for each DL CC, at least 12 bits (=5^5=3125=11.61 bits) are needed for ACK/NACK transmission. The conventional PUCCH formats 1a/1b can transmit ACK/NACK information having a maximum of 2 bits, and thus it cannot transmit ACK/NACK information having an increased number of bits. While it has been described that carrier aggregation increases the quantity of UCI, an increase in the number of antennas, presence of a backhaul subframe in a TDD system and a relay system, etc. may cause an increase in the quantity of UCI. Similarly to ACK/NACK information, when control information related to a plurality of DL CCs is transmitted through one UL CC, the quantity of the control information to be transmitted increases. For example, when CQI/PMI/RI for a plurality of DL CCs is transmitted, a UCI payload may increase. A DL CC and a UL CC may also be respectively referred to as a DL cell and a UL cell and an anchor DL CC. Also, an anchor UL CC may be respectively referred to as a DL primary cell (PCell) and a UL PCell.
The DL primary CC may be defined as a DL CC linked with the UL primary CC. Here, linkage includes both implicit linkage and explicit linkage. In LTE, one DL CC and one UL CC are uniquely paired. For example, a DL CC linked with the UL primary CC according to LTE paring can be called the DL primary CC. This can be regarded as implicit linkage. Explicit linkage means that a network configures a linkage in advance and it may be signaled through RRC. In explicit linkage, a DL CC paired with the UL primary CC may be called the DL primary CC. Here, the UL primary (anchor) CC may be a UL CC that carries a PUCCH. Alternatively, the UL primary CC may be a UL CC that carries UCI over a PUCCH or a PUSCH. The DL primary CC can be configured through higher layer signaling. The DL primary CC may be a DL CC through which a UE performs initial access. DL CCs other than the DL primary CC can be called DL secondary CCs. Similarly, UL CCs other than the UL primary CC can be called UL secondary CCs.
DL-UL pairing may be applied to FDD only. DL-UL pairing may not be additionally defined for TDD because TDD uses the same frequency. DL-UL linkage may be determined from UL linkage through UL EARFCN information of SIB2. For example, DL-UL linkage can be obtained through SIB2 decoding in the event of initial access and acquired through RRC signaling in other cases. Accordingly, there is only SIB2 linkage and other DL-UL pairing may not be explicitly defined. For example, in a 5DL:1UL structure shown in FIG. 28, DL CC #0 and UL CC #0 is in a SIB2 linkage relationship with each other and other DL CCs may be in a SIB2 linkage relationship with other UL CCs that are not configured for the corresponding 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.
EXAMPLES
A scheme for efficiently transmitting an increased quantity of UCI will now be described. Specifically, a new PUCCH format/signal processing procedure/resource allocation method for transmitting UCI in increased quantity are proposed. In the following description, the PUCCH format proposed by the present invention is referred to as a new PUCCH format, LTE-A PUCCH format, or PUCCH format 3 in view of the fact that up to PUCCH format 2 has been defined in LTE. To assist in understanding of the present invention, the following description is focused on a case in which multiple ACK/NACK bits are used as an example of an increased quantity of control information. However, the control information is not limited to multiple ACK/NACK bits in the present invention. New PUCCH formats and transmission schemes may include the following. The present invention can further include other PUCCH formats other than the following examples.

    
    
        Reuse of PUCCH format 2
        DFT based CDM (time domain Walsh/DFT cover)
        DFT based CDM/FDM
        SF reduction to 2
        Channel selection with SF reduction to 2
        MSM (Multi-sequence modulation) with SF reduction to 2
    
    


FIG. 29 illustrates signal transmission using the new PUCCH format.
Referring to FIG. 29, one DL primary component carrier (DL PCC) and one DL secondary component carrier (DL SCC) are present. The DL PCC may be linked with a UL PCC. It is assumed that there is one DL grant in each of the DL PCC and the DL SCC and a PDCCH is transmitted through each CC. If each DL CC transmits 2 codewords (a total of 4 codewords), it is possible to transmit 4 bits when a DTX status is not reported and 5 bits when the DTX status is reported over the UL PCC through the new PUCCH format.
As an example of the new PUCCH format, a DFT-based PUCCH format will be described with reference to the attached drawings.
In the following description, the UCI/RS symbol structure of the existing PUCCH format 1 (normal CP) of LTE is used as a subframe/slot based UCI/RS symbol structure applied to a PUCCH format according to an embodiment of the present invention. However, the subframe/slot based UCI/RS symbol structure is exemplary and the present invention is not limited to a specific UCI/RS symbol structure. In the PUCCH format according to the present invention, the number of UCI/RS symbols, positions of the UCI/RS symbols, etc. may be freely changed according to system designs. For example, the PUCCH format according to the present invention can be defined using the RS symbol structures of the existing PUCCH format 2/2a/2b of LTE.
The PUCCH format according to embodiments of the present invention can be used to transmit arbitrary types/sizes of UCI. For example, the PUCCH format 3 according to the present invention can transmit information such as HARQ ACK/NACK, CQI, PMI, RS, SR, etc. This information may have a payload of an arbitrary size. Description of the following embodiments and drawings are focused on a case in which the PUCCH format according to the present invention transmits ACK/NACK information.
Example 1
FIGS. 30a to 30f illustrate structures of a PUCCH format 3 and signal processing procedures for the same according to an embodiment of the present invention.
FIG. 30a illustrates a case in which PUCCH format 3 according to the present invention is applied to PUCCH format (normal CP). Referring to FIG. 30a, a channel coding block performs channel coding for information bits a_0, a_1, . . . , a_M−1 (e.g. multiple ACK/NACK bits) to generate encoded bits (coded bits or coding bits) (or a codeword) b_0, b_1, . . . , b_N−1. Here, M denotes an information bit size and N denotes an encoded bit size. The information bits include multiple ACK/NACK bits for a plurality of data (or PDSCH) received through a plurality of DL CCs, for example. The information bits a_0, a_1, . . . , a_M−1 are joint-coded regardless of the type/number/size of UCI that forms the information bits. For example, when the information bits include multiple ACK/NACK bits for a plurality of DL CCs, channel coding is not performed for each DL CC or individual ACK/NACK bit but performed for all information bits, thereby generating a single codeword. 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. The encoded bits can be rate-matched in consideration of a modulation order and resource quantity, which is not shown in the figure. The rate matching function may be included as a part of the channel coding block or may be executed by a separate functional block.
A modulator modulates the encoded bits b_0, b_1, . . . , b_N−1 to generate modulation symbols c_0, c_1, . . . , c_L−1 where L denotes the size of the modulation symbols. A modulation method is performed by modifying the size and phase of a transmission signal. For example, the modulation method includes n-PSK (Phase Shift Keying) and n-QAM (Quadrature Amplitude Modulation) (n being an integer of 2 or greater). Specifically, the modulation method may include BPSK (Binary PSK), QPSK (Quadrature PSK), 8-PSK, QAM, 16-QAM, 64-QAM, etc.
A divider divides the modulation symbols c_0, c_1, . . . , c_L−1 into slots. The order/pattern/scheme of dividing the modulation symbols into slots are not particularly limited. For example, the divider can sequentially divide the modulation symbols into the slots (localized scheme). In this case, modulation symbols c_0, c_1, . . . , c_L/2−1 can be divided into slot 0 and modulation symbols c_L/2, c_L/2+1, . . . , c_L−1 can be divided into slot 1, as shown in FIG. 30a. Furthermore, the modulation symbols may be interleaved (or permuted) when divided into the slots. For example, even-numbered modulation symbols can be divided into slot 0 and odd-numbered modulation symbols can be divided into slot 1. The orders of the modulation operation and division operation may be changed with each other.
A DFT precoder performs DFT precoding (e.g. 12-point DFT) for the modulation symbols divided into each slot in order to generate a single carrier waveform. Referring to FIG. 30a, the modulation symbols c_0, c_1, . . . , c_L/2−1 divided into slot 0 can be DFT-precoded into DFT symbols d_0, d_1, . . . , d_L/2−1 and the modulation symbols c_L/2, c_L/2+1, . . . , c_L−1 divided into slot 1 can be DFT-precoded into DFT symbols d_L/2, d_L/2+1, . . . , d_L−1. DFT precoding can be replaced by other corresponding linear operations (e.g. Walsh precoding).
A spreading block spreads the DFT precoded signal at an SC-FDMA symbol level (time domain). Time domain spreading at an SC-FDMA symbol level is performed using a spreading code (sequence). The spreading code includes a quasi-orthogonal code and an orthogonal code. The quasi-orthogonal code includes a pseudo noise (PN) code. However, the quasi-orthogonal code is not limited thereto. The orthogonal code includes a Walsh code and a DFT code. However, the orthogonal code is not limited thereto. In the following description, the orthogonal code is used as the spreading code for ease of description. However, the orthogonal code is exemplary and can be replaced by the quasi-orthogonal code. The maximum value of spreading code size (or spreading factor SF) is limited by the number of SC-FDMA symbols used for control information transmission. For example, when 4 SC-FDMA symbols are used for control information transmission in one slot, a (quasi) orthogonal code w0,w1,w2,w3 having a length of 4 can be used for each slot. The SF means a spreading degree of control information and may be related to a UE multiplexing order or an antenna multiplexing order. The SF can be changed to 1, 2, 3, 4, . . . according to system requirements, and pre-defined between a BS and a UE or signaled to the UE through DCI or RRC signaling. For example, when one of SC-FDMA symbols for control information is punctured in order to transmit an SRS, a spreading code with a reduced SF (e.g. SF=3 instead of SF=4) can be applied to control information of the corresponding slot.
The signal generated through the above-mentioned procedure is mapped to subcarriers in a PRB and then subjected to IFFT to be transformed into a time domain signal. A cyclic prefix is added to the time domain signal to generate SC-FDMA symbols which are then transmitted through an RF unit.
The above-mentioned procedure will now be described in more detail on the assumption that ACK/NACK bits for 5 DL CCs are transmitted. When each DL CC can transmit 2 PDSCHs, ACK/NACK bits for the DL CC may be 12 bits if a DTX status is included. A coding block size (after rate matching) may be 48 bits on the assumption that QPSK and SF=4 time spreading are used. Encoded bits are modulated into 24 QPSK symbols and 12 QPSK symbols are divided into each slot. In each slot, 12 QPSK symbols are converted to 12 DFT symbols through 12-point DFT. In each slot, 12 DFT symbols are spread and mapped to 4 SC-FDMA symbols using a spreading code with SF=4 in the time domain. Since 12 bits are transmitted through [2 bits X 12 subcarriers X 8 SC-FDMA symbols], the coding rate is 0.0625(=12/192). In the case of SF=4, a maximum of 4 UEs can be multiplexed per PRB.
The signal mapped to the PRB in the procedure shown in FIG. 30a may be obtained through various equivalent signal processing procedures. Signal processing procedures equivalent to the signal processing procedure of FIG. 30a will now be described with reference to FIGS. 30b to 30g. 
FIG. 30b shows a case in which the order of operations of the DFT precoder and the spreading block of FIG. 30a is changed with each other. The function of the spreading block corresponds to operation of multiplying a DFT symbol stream output from the DFT precoder by a specific constant at the SC-FMDA symbol level, and thus the same signal value is mapped to SC-FDMA symbols even though the order of operations of the DFT precoder and the spreading block is changed. Accordingly, the signal processing procedure for the PUCCH format 3 can be performed in the order of channel coding, modulation, division, spreading and DFT precoding. In this case, the division and spreading may be performed by one functional block. For example, modulation symbols can be alternately divided into slots and, simultaneously, spread at the SC-FDMA symbol level. Alternatively, the modulation symbols can be copied such that they correspond to the size of a spreading code when divided into the slots, and the copied modulation symbols can be multiplied one-to-one by respective elements of the spreading code. Accordingly, a modulation symbol stream generated for each slot is spread to a plurality of SC-FDMA symbols. Then, a complex symbol stream corresponding to the SC-FDMA symbols is DFT-precoded for each SC-FDMA symbol.
FIG. 30c shows a case in which the order of operations of the modulator and the divider of FIG. 30a is changed. In this case, in the signal processing procedure for PUCCH format 3, joint channel coding and division are performed at the subframe level, and modulation, DFT precoding and spreading are sequentially performed at the slot level.
FIG. 30d shows a case in which the order of operations of the DFT precoder and the spreading block of FIG. 30c is changed. As described above, since the function of the spreading block corresponds to operation of multiplying a DFT symbol stream output from the DFT precoder by a specific constant at the SC-FMDA symbol level, the same signal value is mapped to SC-FDMA symbols even though the order of operations of the DFT precoder and the spreading block is changed. Accordingly, in the signal processing procedure for PUCCH format 3, joint channel coding and division are performed at the subframe level, and modulation is carried out at the slot level. The modulation symbol stream generated for each slot is spread to a plurality of SC-FDMA symbols and DFT-precoded for each SC-FDMA symbol. In this case, the modulation and spreading operations can be performed by one functional block. For example, the generated modulation symbols can be directly spread at the SC-FDMA symbol level during modulation of the encoded bits. Alternatively, during modulation of the encoded bits, the generated modulation symbols can be copied such that they correspond to the size of the spreading code and multiplied one-to-one by respective elements of the spreading code.
FIG. 30e shows a case in which PUCCH format 3 according to the present embodiment is applied to PUCCH format 2 (normal CP) and FIG. 30f shows a case in which PUCCH format 3 according to the present embodiment is applied to PUCCH format 2 (extended CP). While a basic signal processing procedure is the same as the procedures described with reference to FIGS. 30a to 30d, the numbers/positions of UCI SC-FDMA symbols and RS SC-FDMA symbols are different from those of FIG. 30a since PUCCH format 2 of LTE is reused.
Table 14 shows RS SC-FDMA symbol position in the PUCCH format 3. It is assumed that the number of SC-FDMA symbols in a slot is 7 (indexes: 0 to 6) in case of normal CP and 6 (indexes: 0 to 5) in case of extended CP.










TABLE 14









RS SC-FDMA symbol




position











Normal CP
Extended CP
Note
















PUCCH
2, 3, 4
2, 3
Reuse PUCCH



format 3


format 1




1, 5
3
Reuse PUCCH






format 2










Tables 15 and 16 show exemplary spreading codes according to SF value. Table 15 shows DFT codes with SF=5 and SF=3 and Table 16 shows Walsh codes with SF=4 and SF=2. A DFT code is an orthogonal code represented by wm=[w0 w1 . . . wk-1], where wk=exp(j2πkm/SF) where k denotes a DFT code size or SF value and m is 0, 1, . . . , SF−1. Tables 16 and 17 show a case in which m is used as an index for orthogonal codes.










TABLE 15









Orthogonal code wm = [w0 w1...wk−1]










Index m
SF = 5
SF = 3





0
[1 1 1 1 1]
[1 1 1]


1
[1 ej2π/5 ej4π/5 ej6π/5 ej8π/5]
[1 ej2π/3 ej4π/3]


2
[1 ej4π/5 ej8π/5 ej2π/5 ej6π/5]
[1 ej4π/3 ej2π/3]


3
[1 ej6π/5 ej2π/5 ej8π/5 ej4π/5]


4
[1 ej8π/5 ej6π/5 ej4π/5 ej2π/5]



















TABLE 16









Orthogonal code










Index m
SF = 4
SF = 2





0
[+1 +1 +1 +1]
[+1 +1]


1
[+1 −1 +1 −1]
[+1 −1]


2
[+1 +1 −1 −1]


3
[+1 −1 −1 +1]









Code index m may be designated in advance or signaled from the BS. For example, the code index m can be implicitly linked with an index (e.g. the lowest CCE index) of CCE constituting a PDCCH. The code index m may be explicitly designated through a PDCCH or RRC signaling. Furthermore, the code index m may be derived from a value designated through the PDCCH or RRC signaling. The code index m may be independently given for each subframe, each slot, and multiple SC-FDMA symbols. Preferably, the code index m can be changed for each subframe, each slot and multiple SC-FDMA symbols. That is, the code index m can be hopped for each predetermined time interval.
Cell-specific scrambling using a scrambling code (e.g. a PN code such as a Gold code) corresponding to a physical cell ID (PCI) or UE-specific scrambling using a scrambling code corresponding to a UE ID (e.g. RNTI) can be additionally applied for inter-cell interference randomization, which is not shown in the figure. Scrambling may be performed for the entire information, performed in SC-FDMA symbols, carried out between SC-FDMA symbols, or carried out for both the entire information and SC-FDMA symbols. Scrambling the entire information can be achieved by performing scrambling at the information bit level, encoded bit level and modulation symbol level prior to division. Intra-SC-FMDA symbol scrambling may be implemented by performing scrambling at the modulation symbol level or DFT symbol level after division. Inter-SC-FDMA symbol scrambling may be achieved by carrying out scrambling at the SC-FDMA symbol level in the time domain after spreading.
UE multiplexing can be achieved by applying CDM before being subjected to the DFT precoder. For example, the signal before being subjected to the DFT precoder is a time domain signal, and thus CDM can be implemented through circular shift (or cyclic shift) or Walsh (or DFT) spreading. CDM can be performed at the information bit level, encoded bit level or modulation symbol level. Specifically, a case of multiplexing 2 UEs to one SC-FDMA symbol using a Walsh code with SF=2 is exemplified. When QPSK is performed on 12 encoded bits, a complex signal of a0 a1 a2 a3 a4 a5 is generated. An example of spreading Control information of each UE using Walsh code [+1 +1] [+1 −1] is as follows.

    
    
        UE #0: [+1 +1] is applied. a0 a1 a2 a3 a4 a5 a0 a1 a2 a3 a4 a5 are transmitted.
        UE #1: [+1 −1] is applied. a0 a1 a2 a3 a4 a5 a0 a1 a2 a3 a4 a5 are transmitted.
    
    


In this case, interleaving may be additionally performed. The interleaving may be applied before or after spreading. An example of applying both the spreading and interleaving is as follows.

    
    
        UE #0: [+1 +1] is applied. a0 a0 a1 a1 a2 a2 a3 a3 a4 a4 a5 a5 are transmitted.
        UE #1: [+1 −1] is applied. a0, −a0, a1, −a1, a2, −a2, a3, −a4, −a4, a5, −a5, are transmitted.
    
    


A signal generated from spreading and/or interleaving in a stage prior to the DFT precoder is subjected to DFT precoding (and additionally subjected to time spreading at the SC-FDMA symbol level as necessary) and mapped to subcarriers of the corresponding SC-FDMA symbols.
FIG. 31 illustrates another exemplary PUCCH format 3 according to the present invention. While PUCCH format 3 shown in FIG. 31 has the same basic structure as that of the PUCCH format shown in FIG. 30, PUCCH format of FIG. 31 is different from PUCCH format 3 of FIG. 30 in that the same encoded bits are repeated on a slot-by-slot basis. Accordingly, a signal processing block shown in FIG. 31 does not include a divider.
Referring to FIGS. 30e and 30f, multiplexing capacity of the control information becomes 5 due to SF=5. When the RS has the RS structure of LTE, that is, when the RS is given as a circular shift of a base sequence, the multiplexing capacity of the RS is determined by a circular shift spacing ΔshiftPUCCH. For example, when 12 subcarriers are present in one PRB, the multiplexing capacity of the RS is given by




  
    12
    
      Δ
      shift
      PUCCH
    
  
  .




In this case, multiplexing capacities when ΔshiftPUCCH=1, ΔshiftPUCCH=2 and ΔshiftPUCCH=3 are 12, 6 and 4, respectively.

If ΔshiftPUCCH=3 in FIGS. 30e and 30f, the multiplexing capacity of the RS becomes 4 whereas the multiplexing capacity of the control information is 5 due to SF=5, and thus the total multiplexing capacity becomes 4 because it is limited by the smaller one.
Accordingly, it is possible to increase the total multiplexing capacity by applying the above-mentioned SC-FDMA symbol level spreading to the RS. For example, the multiplexing capacity is doubled when a Walsh cover (or DFT code cover) with length−2 is applied to a slot in FIGS. 30e and 30f. That is, since the multiplexing capacity becomes 8 even when ΔshiftPUCCH=3, it can prevent the multiplexing capacity of the control information from being lost.
FIG. 32 illustrates an exemplary PUCCH structure having an increased multiplexing capacity. Referring to FIG. 32, SC-FDMA symbol level spreading is applied to a symbol in the RS, and thus the multiplexing capacity of the RS is doubled. An orthogonal code cover for the RS includes a Walsh cover of [y1 y2]=[1 1], [1 −1], a linear transformation of the Walsh cover (e.g. [j j] [j −j], [1 j] [1 −j], etc.) or the like. However, the orthogonal code cover is not limited thereto. In the Walsh cover, y1 is applied to the first RS SC-FDMA symbol in a slot and y2 is applied to the second RS SC-FDMA symbol in the slot.
FIG. 33 illustrates another exemplary PUCCH structure having an increased multiplexing capacity. If slot-level frequency hopping is not performed, the multiplexing capacity is further doubled by additionally performing slot-based spreading or covering (e.g. Walsh covering). If slot-based Walsh covering is applied when slot-level frequency hopping is performed, orthogonality may be damaged due to a channel condition difference between slots. A slot-based spreading code (e.g. orthogonal cover code) for the RS includes a Walsh cover of [x1 x2]=[1 1], [1 −1], a linear transformation of the Walsh cover (e.g. [j j] [j −j], [1 j][1 −j], etc.) or the like. However, the slot-based spreading code is not limited thereto. In the Walsh code, x1 is applied to the first slot and x2 is applied to the second slot. While FIG. 33 illustrates that slot level spreading (covering) is performed, and then SC-FDMA symbol level spreading (or covering) is carried out, the order of the operations may be changed.
The increased multiplexing capacity of the RS may be used for channel estimation for each antenna (port) for transmit diversity (TxD) transmission. On the contrary, when channel estimation for each antenna (port) for TxD transmission is needed, the multiplexing capacity of the RS can be increased using the aforementioned method. For example, the scheme of increasing the RS multiplexing capacity using a spreading code (e.g. Walsh cover) can be limited to a TxD transmission case. That is, the Walsh cover may be applied to RS symbols in TxD mode and may not be applied to RS symbols in non-TxD mode (which is equivalent to application of [+1 +1]). If separate channel estimation for each transmit antenna (port) is available in a TxD mode, a spatial multiplexing gain can be obtained using one orthogonal resource (i.e. the same PRB and orthogonal code). For example, the same orthogonal code can be applied to UCI symbols of antenna (port) 0 and antenna (port) 1 and different orthogonal cover codes (e.g. Walsh codes) can be applied to RS symbols of antenna (port) 0 and antenna (port) 1 in a 2TxD mode.
A TxD mode may be configured through higher layer signaling (e.g. RRC signaling, MAC signaling, etc.) or physical layer signaling (e.g. PDCCH). TxD transmission schemes include spatial orthogonal resource transmit diversity (SORTD), space frequency block coding (SFBC), space time block coding (STBC) and frequency-switched transmit diversity (FSTD). However, the TxD transmission schemes are not limited thereto.
SORTD and SFBC will now be described.
2Tx transmit diversity scheme according to SORTD is described in the following embodiment. However, the embodiment can be equally/similarly expanded to an n−Tx transmit diversity scheme. It is assumed that a (quasi) orthogonal resource for control information transmission is referred to as resource A and a (quasi) orthogonal resource for RS transmission is referred to as resource B. Logical indexes of resource A and resource B may be linked with each other. For example, if the logical index of resource B is given, the logical index of resource A can be automatically determined. The logical indexes of resource A and resource B may be configured through different physical configuration methods. The following two cases are present.
1) Control information can be transmitted through the same PRB at all antennas (ports).
A. The control information can be transmitted through two different resources A (e.g. an orthogonal code, a subcarrier shift (or offset or index) according to frequency factor, or combinations thereof). For example, the orthogonal code includes a Walsh code and a DFT code and the frequency factor can be given by Nsc/Nfreq or the reciprocal thereof. Here, Nsc denotes the number of subcarriers in a PRB and Nfreq denotes the number of subcarriers used for control information transmission.
B. An RS can be transmitted through two different resources B (e.g. a combination of a circular shift and a DFT cover) selected for each antenna (port).
2) The control information can be transmitted through different PRBs for antennas. For example, the control information can be transmitted through PRB #4 at antenna (port) 0 and transmitted through PRB #6 at antenna (port) 1.
A. Resources for the control information transmitted through different antennas (ports) are not particularly limited (i.e. the resources can be equal to and different from each other).
B. Resources for RSs transmitted through different antennas (ports) are not particularly limited (i.e. the resources can be equal to and different from each other).
In a multi-antenna transmit (e.g. 2Tx transmit) mode, two resources A for control information transmission and two resources B for RS transmission can be defined in advance or provided through physical control channel (e.g. PDCCH) or RRC signaling. In this case, signaling for the control information and RS can be individually performed.
When resource information for one antenna (port) is signaled, resource information for the other antenna (port) can be inferred from the previously signaled resource information. For example, code index m and/or the subcarrier position (e.g. shift, offset or index) according to frequency factor can be designated in advance or signaled from the BS. Otherwise, code index m and/or the subcarrier position (e.g. shift, offset or index) according to frequency factor can be implicitly linked with a CCE index that consists of a PDCCH. Or, code index m and/or the subcarrier position (e.g. shift, offset or index) according to frequency factor can be explicitly designated through PDCCH or RRC signaling. The code index m and/or the subcarrier position (e.g. shift, offset or index) according to frequency factor can be changed on a subframe, slot or multi-SC-FDMA symbol basis. That is, the code index m and/or the subcarrier position (e.g. shift, offset or index) according to frequency factor can be hopped in the unit of a specific time interval (e.g. slot).
FIG. 34 illustrates an exemplary signal processing block/procedure for SORTD. A basic process in the signal processing procedure, other than a process for multi-antenna transmission, corresponds to that described with reference to FIGS. 30 to 33. Referring to FIG. 34, modulation symbols c_0, . . . , c_23 are DFT-precoded and then transmitted through resources (e.g. an OC, a PRB or a combination thereof) assigned for each antenna port. While DFT operation is performed once for a plurality of antenna ports in the present embodiment, the DFT operation may be carried out for each antenna port. Furthermore, while the DFT-precoded symbols d_0, . . . , d_23 are copied and transmitted through a second OC/PRB in the present embodiment, a modified form (e.g. a complex conjugate form or scaled form) of the DFT-precoded symbols d_0, . . . , d_23 may be transmitted through the second OC/PRB.
The SORTD signal processing procedure will now be described in more detail. First, a case in which a signal is sequentially subjected to modulation, DFT precoding, and time-domain spreading, as show in FIG. 34, is described.
Equation 10 represents a process of DFT-precoding the modulation symbols on the assumption that the number of modulation symbols is 24 and 12 modulation symbols are divided into each slot.




  
    
      
        
          
            d
            ⁡
            
              (
              
                
                  n
                  ·
                  
                    N
                    sc
                  
                
                +
                k
              
              )
            
          
          =
          
            
              1
              
                
                  N
                  sc
                
              
            
            ⁢
            
              
                ∑
                
                  i
                  =
                  0
                
                
                  
                    N
                    sc
                  
                  -
                  1
                
              
              ⁢
              
                
                  c
                  ⁡
                  
                    (
                    i
                    )
                  
                
                ⁢
                
                  e
                  
                    
                      -
                      j
                    
                    ⁢
                    
                      
                        2
                        ⁢
                        π
                        ⁢
                        
                          
                        
                        ⁢
                        i
                        ⁢
                        
                          
                        
                        ⁢
                        k
                      
                      
                        N
                        sc
                      
                    
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            k
            =
            0
          
          ,
          ...
          ⁢
          
            
          
          ,
          
            
              N
              sc
            
            -
            1
          
        
        ⁢
        
          

        
        ⁢
        
          
            n
            =
            0
          
          ,
          1
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          10
        
        ]
      
    
  




Here, d( ) denotes a DFT-precoded modulation symbol stream, c( ) denotes a modulation symbol stream, and Nsc represents the number of subcarriers in a PRB.
Equation 11 represents a process of spreading the DFT-precoded modulation symbol stream such that the modulation symbol stream corresponds to a plurality of SC-FDMA symbols in a PUCCH.

z1(p)( )=woc0(l)(p)×d(n) 0<=n<12

zm(p)( )=woc1(m)(p)×d(n) 12<n<=23  [Equation 11]

Here, z( ) denotes a spread modulation symbol stream corresponding to SC-FDMA symbols for the control information, p denotes an antenna port, woc0 represents an orthogonal code applied to slot 0, woc1 represents an orthogonal code applied to slot 1, 1 is a value in the range of 0 to (the number of SC-FDMA symbols for the control information in slot 0)−1, and m is a value in the range of 0 to (the number of SC-FDMA symbols for the control information in slot 1)−1.
In case of 2Tx SORTD, z(0)( ) is transmitted in PRB(0) through antenna port 0 and z(1) ( ) is transmitted in PRB(1) through antenna port 1. To ensure orthogonality between PUCCHs transmitted through different antenna ports, [woc(0)≠woc(1); PRB(0)=PRB(1)], [woc(0)=woc(1); PRB(0)≠PRB(1)], or [woc(0)≠woc(1); PRB(0)≠PRB(1)] is possible.
A description will be given of a case in which a signal is sequentially subjected to modulation, time-domain spreading, and DFT-precoding on the assumption that the number of modulation symbols is 24 and 12 modulation symbols are divided into each slot.
Equation 12 represents a process of spreading the modulation symbol stream such that the modulation symbol stream corresponds to a plurality of SC-FDMA symbols in a PUCCH.

yl(p)( )=woc0(l)(p)×c(n) 0<=n<12

ym(p)( )=woc1(m)(p)×c(n) 12<n<=23  [Equation 12]

Here, y( ) denotes a modulation symbol stream spread such that the modulation symbol stream corresponds to a plurality of SC-FDMA symbols in a slot of the PUCCH, p denotes an antenna port, c( ) denotes a modulation symbol stream, woc0 represents an orthogonal code applied to slot 0, woc1 represents an orthogonal code applied to slot 1, 1 is a value in the range of 0 to (the number NSF,0 of SC-FDMA symbols for the control information in slot 0)−1, and m is a value in the range of 0 to (the number NSF,1 of SC-FDMA symbols for the control information in slot 1)−1.
Equation 13 represents a process of DFT-precoding the spread modulation symbols.




  
    
      
        
          
            
              d
              ⁡
              
                (
                
                  
                    n
                    ·
                    
                      N
                      sc
                    
                  
                  +
                  k
                
                )
              
            
            
              (
              p
              )
            
          
          =
          
            
              1
              
                
                  N
                  sc
                
              
            
            ⁢
            
              
                ∑
                
                  i
                  =
                  0
                
                
                  
                    N
                    sc
                  
                  -
                  1
                
              
              ⁢
              
                
                  
                    
                      y
                      n
                    
                    ⁡
                    
                      (
                      i
                      )
                    
                  
                  
                    (
                    p
                    )
                  
                
                ⁢
                
                  e
                  
                    
                      -
                      j
                    
                    ⁢
                    
                      
                        2
                        ⁢
                        πi
                        ⁢
                        
                          
                        
                        ⁢
                        k
                      
                      
                        N
                        sc
                      
                    
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            k
            =
            0
          
          ,
          ...
          ⁢
          
            
          
          ,
          
            
              N
              sc
            
            -
            1
          
        
        ⁢
        
          

        
        ⁢
        
          
            n
            =
            0
          
          ,
          ...
          ⁢
          
            
          
          ,
          
            
              N
              SF
            
            -
            1
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          13
        
        ]
      
    
  




Here, d( ) denotes a DFT-precoded modulation symbol stream, y( ) denotes a modulation symbol stream which has been spread to correspond to the SC-FDMA symbols for the control information, p represents an antenna port, NSC represents the number of subcarriers in a PRB, and NSF represents the number of SC-FDMA symbols for the control information in a subframe.
In case of 2Tx SORTD, d(0) ( ) is transmitted in PRB(0) through antenna port 0 and d(1) ( ) is transmitted in PRB(1) through antenna port 1. To ensure orthogonality between PUCCHs transmitted through different antenna ports, [woc(0)≠woc(1); PRB(0)=PRB(1)], [woc(0)=woc(1); PRB(0)≠PRB(1)], or [woc(0)≠woc(1); PRB(0)≠PRB(1)] is possible.
FIGS. 35a and 35b respectively illustrate PUCCH structures for antenna (port) 0 and antenna (port) 1 when SORTD is applied according to the signal processing procedure. Referring to FIGS. 35a and 35b, different PUCCH transmission resources (e.g. combinations of orthogonal codes and PRBs) are assigned to respective antennas (ports) (e.g. resource #0 for antenna 0 and resource #1 for antenna 1). Signals transmitted through antenna (port) 0 and antenna (port) 1 may be equal to each other or may have forms modified according to a predetermined rule.
FIG. 36 illustrates another exemplary signal processing block/procedure for SORTD. This signal processing block/procedure joint-codes the control information and then distributes and maps the coded control information to multiple resources to obtain a spatial coding gain. Referring back to FIG. 30, in 1Tx transmission, 48 coding bits are generated, modulated according to QPSK, and then mapped to 24 subcarriers across 2 slots. According to the Tx diversity scheme of this example, if 2 orthogonal resources are used, 96 (=48*2) coding bits can be uniformly distributed in the 2 orthogonal resources which are mapped to respective transmit antennas (ports) for transmission. A basic procedure in the signal processing procedure of FIG. 36 corresponds to that described with reference to FIGS. 30 to 33.
Referring to FIG. 36, modulation symbols c_0, . . . , c_47 are divided into each antenna port. For example, modulation symbols c_0, . . . , c_23 can be divided into antenna port 0 and modulation symbols c_24, . . . , c_47 can be divided into antenna port 1. The modulation symbols may be interleaved (or permuted) when divided to the antenna ports. For example, even-numbered modulation symbols can be divided into antenna port 0 whereas odd-numbered modulation symbols can be divided into antenna port 1. Then, the modulation symbol stream is DFT-precoded for each antenna port, and then transmitted using a resource (e.g. an OCC (or OC), a PRB, or a combination thereof) assigned to each antenna port. While FIG. 36 shows a case in which QPSK modulation symbols input to resource (allocation) blocks of the antenna ports are c_0, . . . , c_23 (for orthogonal resource0) and c_24, . . . , c_47 (for orthogonal resource1), the signal processing block/procedure of FIG. 36 is applicable to a QPSK modulation symbol interleaving pattern. For example, the signal processing block/procedure of FIG. 36 can be applied to an interleaving pattern such as c_0, c_2, . . . , c_46 (for orthogonal resource0) and c_1, c_3, . . . , c_47 (for orthogonal resource1).
FIG. 37 illustrates a modified form of the signal processing block/procedure of FIG. 36. A basic process of the signal processing procedure of FIG. 37 corresponds to that described with reference to FIGS. 30 to 33 and FIG. 36. FIG. 38a illustrates a PUCCH structure for antenna port 0 and FIG. 38b illustrates a PUCCH structure for antenna port 1. Referring to FIGS. 38a and 38b, a signal for antenna port 0 is transmitted through PRB #0 whereas a signal for antenna port 1 is transmitted through PRB #1. In this case, since PUCCHs are transmitted through different PRBs for the antenna ports, a spreading code (or orthogonal cover code (OCC) or OC) for the control information and a circular shift or spreading code (or OCC or OC) for the RS at antenna port 0 antenna port 1 may be equal to each other.
If the multiplexing order of the RS corresponds to more than twice the multiplexing order of the control information, the following 2Tx transmit diversity scheme can be applied. In this case, two from among resources CS+OC+PRB for the RS may be used for channel estimation of each of 2 transmit antennas (ports) and only one resource (subcarrier position+OC+PRB) may be used for the control information. Conversely, when the 2Tx transmit diversity scheme is configured, the multiplexing order of the RS can be increased using the aforementioned method. For example, the scheme of increasing the RS multiplexing capacity using a spreading code (e.g. Walsh cover) can be limited to a TxD transmission case. That is, the Walsh cover may be applied to RS symbols in a TxD mode and may not be applied to the RS symbols in a non-TxD mode (which is equivalent to application of [+1 +1]). If separate channel estimation for each transmit antenna (port) is available in a TxD mode, a spatial multiplexing gain can be obtained using one orthogonal resource (i.e. the same PRB and orthogonal code). For example, the same orthogonal code can be applied to UCI symbols of antenna (port) 0 and antenna (port) 1 and different orthogonal cover codes (e.g. Walsh codes) can be applied to RS symbols of antenna (port) 0 and antenna (port) 1 in a 2TxD mode.
SFBC will now be described with reference to FIG. 39. FIG. 39a illustrates a signal processing procedure for transmitting the control information through multiple antennas according to an embodiment of the present invention and FIGS. 39b and 39c respectively show extended forms of the PUCCH structures of antenna port 0 and antenna port 1. A basic process of the signal processing procedure of FIG. 39 is similar to that described with reference to FIGS. 30 to 33. Referring to FIG. 39a, a TxD mapper distributes a DFT precoder output value to multiple antennas. The TxD mapper performs a resource allocation/MIMO (Multiple Input Multiple Output) precoding/process to transmit the control information through multiple antenna (ports). However, the function of the TxD mapper is not limited thereto.
For example, the TxD mapper can apply an Alamouti scheme to the DFT precoder output value in the frequency domain. The Alamouti scheme can be represented by the following matrix.




  
    
      
        (
        
          
            
              
                s
                1
              
            
            
              
                -
                
                  s
                  2
                  *
                
              
            
          
          
            
              
                s
                2
              
            
            
              
                s
                1
                *
              
            
          
        
        )
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          14
        
        ]
      
    
  




Here, column 0 and column 1 respectively denote signal vectors transmitted through antenna (port) 0 and antenna (port) 1, row 0 and row 1 respectively denote complex signal vectors transmitted through first and second subcarriers, * represents complex conjugate operation. Any form linearly transformed from the matrix can be applied to the present invention.
When the Alamouti scheme is applied to the PUCCH format according to the embodiment of the present invention, the order of DFT symbols mapped to SC-FDMA symbols corresponding to antenna (port) 1 is changed for every two DFT symbols. For example, d_0, d_1, d_2, d_3 are mapped to the SC-FDMA symbols corresponding to antenna (port) 0 whereas −d_1*, d_0*, −d_3*, d_2* are mapped to the SC-FDMA symbols corresponding to antenna (port) 1. This damages single carrier property of the signal mapped to antenna (port) 1, and thus CM increases at antenna (port) 1.
To solve this problem, the present invention proposes a multi-antenna coding scheme that does not cause CM increase even when the Alamouti scheme is applied. Specifically, when the control information is mapped to antenna (port) 0, the complex signal is mapped to subcarriers after being subjected to DFT precoding. When the control information is mapped to antenna (port) 1, (1) mapping to subcarriers in SC-FDMA symbols in reverse order, (2) complex conjugate operation and (3) alternate addition of minus sign are performed. Operations (1), (2) and (3) are exemplary and the order of the operations can be changed. This scheme can be equally applied to the embodiments of the present invention. For example, referring to FIG. 30, a complex symbol stream mapped to SC-FDMA symbols transmitted through a first antenna (port) and a second antenna (port) can be given as follows.

First antenna (port): ak 

Second antenna (port): (−1)mod(k,2)·conj(a11-k)  [Equation 15]

Here, ak denotes the complex symbol stream mapped to subcarriers of the SC-FDMA symbols, k denotes a complex symbol index (0 to 11), mod(a, b) represents the remainder obtained when a is divided by b, and conj(a) represents the complex conjugate value of a.
Equation 15 assumes a case in which the complex signal is mapped to all subcarriers in the SC-FDMA symbols. Equation 15 can be normalized to Equation 16 considering a case in which the complex signal is mapped to only part of the subcarriers in the SC-FDMA symbols.

First antenna (port): ak 

Second antenna (port): (−1)mod(k,2)·conj(an-k)

or

(−1)mod(k+1,2)·conj(an-k)  [Equation 16]

Here, n represents (length of complex symbol stream ak mapped to the subcarriers of the SC-FDMA symbols)−1 (e.g. 0≦n≦11).
The complex symbol stream mapped to the SC-FDMA symbols transmitted through the first antenna (port) or the second antenna (port) can be circular-shifted (e.g. shifted by half the length of the complex symbol stream) in the frequency domain. Tables 17, 18 and 19 show cases in which the Alamouti scheme is applied according to the embodiment of the present invention.








TABLE 17







SC-FDMA
Subcarrier index



















symbol
0
1
2
3
4
5
6
7
8
9
10
11





Antenna
a0 
a1  
a2
a3 
a4
a5 
a6
a7 
a8
a9 
 a10
a11 


(port) 0


Antenna
−a11*
a10*
−a9*
a8*
−a7*
a6*
−a5*
a4*
−a3*
a2*
−a1*
a0*


(port) 1

















TABLE 18







SC-FDMA
Subcarrier index



















symbol
0
1
2
3
4
5
6
7
8
9
10
11





Antenna
a0
a1 
a2
a3 
a4
a5 
a6 
a7  
a8
a9 
 a10
a11 


(port) 0


Antenna
−a5*
a4*
−a3*
a2*
−a1*
a0*
−a11*
a10*
−a9*
a8*
−a7*
a6*


(port) 1

















TABLE 19







SC-FDMA
Subcarrier index



















symbol
0
1
2
3
4
5
6
7
8
9
10
11





Antenna
a0

a1 

a2

a3 

a4

a5 



(port) 0


Antenna
−a5*

a4*

−a3*

a2*

−a1*

a0*


(port) 1









Considering that the above-mentioned problem is generated only when ΔshiftPUCCH=3, the multiplexing capacity of the control information can conform to the multiplexing order, 4, of the RS only when ΔshiftPUCCH=3. That is, it is possible to obtain the total multiplexing capacity of 4 using only four of five orthogonal codes (e.g. DFT codes) for SF=5 when ΔshiftPUCCH=3. In other words, when the multiplexing capacity of the RS is less than that of the control information, the number of codes used for the control information can be reduced to correspond to the multiplexing capacity of the RS.
A description will be given of STBC and FSTD with reference to the attached drawings.
FIG. 40a illustrates a signal processing block/procedure for STBC. A basic process of this signal processing procedure, except for a process for multi-antenna transmission, is identical to that described with reference to FIGS. 30 to 33. Referring to FIG. 40a, space block coding is applied to contiguous virtual subcarriers before being subjected to DFT precoding. Specifically, Alamouti coding is applied to a time domain sequence [a0, a1, a2, a3, . . . , a10, a11]T before being subjected to DFT precoding. The time domain sequence [a0, a1, a2, a3, . . . , a10, a11]T includes a modulation sequence and is mapped to contiguous subcarriers of SC-FDMA symbols after spreading and DFT precoding. The Alamouti scheme can be represented by the following matrix.




  
    
      
        (
        
          
            
              
                s
                1
              
            
            
              
                -
                
                  s
                  2
                  *
                
              
            
          
          
            
              
                s
                2
              
            
            
              
                s
                1
                *
              
            
          
        
        )
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          17
        
        ]
      
    
  




Here, column 0 and column 1 respectively represent signal vectors transmitted through antenna (port) 0 and antenna (port) 1 and row 0 and row 1 respectively denote the first and second elements which form the time domain sequence before being subjected to DFT precoding. In the matrix, * represents a complex conjugate operation. Any linear transformation of the above matrix is applicable to the present invention.
When separate channel estimation can be performed for each transmit antenna (port), a spatial multiplexing gain can be obtained using one orthogonal resource. To achieve this, an OCC can be applied to RS symbols transmitted through each antenna (port) in the time domain. That is, the same orthogonal code [wu(5)(0) wu(5)(1) wu(5)(2) wu(5)(3) wu(5)(4)] can be applied to UCI symbols of antenna (port) 0 and antenna (port) 1. In wu(a)(b), u denotes a code index, a denotes the length of the orthogonal code, and b denotes an element number in the orthogonal code. On the other hand, different orthogonal code covers (e.g. Walsh codes) can be applied to RS symbols of antenna (port) 0 and antenna (port) 1. For example, [+1 +1] can be applied to RS symbols corresponding to antenna (port) 0 and [+1 −1] can be applied to RS symbols corresponding to antenna (port) 1.
FIG. 40b illustrates a signal processing block/procedure for FSTD. A basic process of this signal processing procedure, other than a process for multi-antenna transmission, is identical to that described with reference to FIGS. 30 to 33. Referring to FIG. 40b, the control information is sequentially subjected to channel encoding, scrambling and modulation. Modulation symbols (slot 0: [d(0), . . . , d(NscRB−1)], slot 1: [d(NscRB), . . . , d(2NscRB−1)]) are spread at the SC-FDMA symbol level and transmitted after being subjected to DFT precoding and IFFT. A modulation symbol sequence in each slot is divided into two in the frequency domain, and then transmitted through different antennas. For example, [d(0), . . . , d(NscRB−1)] in slot 0 is spread at the SC-FDMA symbol level, and then transformed into two frequency domain complex sequences according to 6-point DFT for each SC-FDMA symbol. These two complex sequences are respectively transmitted through antenna (port) 0 and antenna (port) 1. The same operation is performed in slot 1. When separate channel estimation can be performed for each transmit antenna (port), a spatial multiplexing gain can be obtained using one orthogonal resource. To achieve this, an OCC can be applied to the RS symbols transmitted through each antenna (port) in the time domain.
A description will be given of methods of allocating a PUCCH resource to a UE on the assumption that multiple ACK/NACK bits are transmitted for data received through a plurality of DL CCs. For convenience of description, the PUCCH resource includes a resource for control information transmission and/or a resource for RS transmission and it is assumed that a (quasi) orthogonal resource for control information transmission is referred to as resource A and a (quasi) orthogonal resource for RS transmission is referred to as resource B. Resource A includes at least one of a PRB index and a spreading code (e.g. Walsh code) index. One representative logical index may be given for resource A and the PRB index and spreading code index may be derived from the representative logical index. Resource B includes at least one of a PRB index, a circular shift index and an orthogonal cover index. One representative logical index may be given for resource B, and the PRB index, circular shift index and orthogonal cover index may be inferred from the representative logical index. The logical indexes of resource A and resource B may be linked with each other. Furthermore, indexes of resources constituting resource A and resource B may be linked with each other. Alternatively, a separate (representative) PUCCH resource index may be defined and linked with resource A and/or resource B. That is, resource A and/or resource B may be inferred from the separate PUCCH resource index.
A first resource allocation method signals both resource A and resource B. For example, both resource A and resource B can be signaled through physical control channel (e.g. PUCCH) or RRC signaling. In this case, the resource A index for control information transmission and the resource B index for RS transmission may be respectively signaled or only one thereof may be signaled. For example, if RS format and indexing conform to LTE, only resource B index for RS transmission can be signaled. Because it is preferable to transmit control information in the same PRB as that of the RS, the PRB index for the control information may be derived from the resource B index for the RS, and the control information may be transmitted through a PRB corresponding to the PRB index. The orthogonal code index used for the control information may be derived from the orthogonal cover index or circular shift index used for the RS. Alternatively, it is possible to signal an additional PUCCH resource index and infer resource A and/or resource B from the additional PUCCH resource index. That is, when the additional PUCCH resource index is given, the PRB and/or the orthogonal cover index for the control information and the PRB, orthogonal cover index and/or circular shift index for the RS can be inferred from the additional PUCCH resource index.
To reduce signaling overhead and efficiently use resources, a plurality of candidate PUCCH resources (indexes) can be signaled to a UE or a UE group through higher layer signaling (e.g. RRC signaling) and a specific PUCCH resource (index) can be indicated through a physical control channel (e.g. PDCCH). As described above, a PUCCH resource (index) can be given as [resource A index and resource B index], [resource A index or resource B index] or [separate PUCCH resource index]. Specifically, the PUCCH resource index can be signaled through a PDCCH of a DL secondary CC. When carrier aggregation is applied, transmit power control (TPC) of a DL secondary CC need not be used because a PUCCH is transmitted through the UL primary CC only. Accordingly, the PUCCH resource (index) can be signaled through a TPC field of a PDCCH transmitted through a DL secondary CC.
A second resource allocation method reuses the implicit method of LTE in case of dynamic ACK/NACK resource allocation. For example, a resource index that corresponds to the lowest CCE index of a PDCCH corresponding to a DL grant of a specific DL CC (e.g. primary DL CC) and conforms to LTE rule (nr=ncce+N_PUCCH(1)) can be inferred. Here, nr denotes the resource A (and/or resource B) index, ncce denotes the lowest CCE index constituting the PDCCH, and N_PUCCH(1) denotes a value configured by a higher layer. For example, the RS can use a resource corresponding to the inferred resource index. In case of control information, the PRB index can be derived from the inferred resource index and ACK/NACK information for a plurality of DL CCs can be transmitted using a corresponding resource (e.g. spreading code) in the PRB corresponding to the PRB index. When the resource index corresponding to the RS is inferred from the resource index corresponding to the control information, the circular shift index used for the RS cannot be derived from the resource index corresponding to the control information because the resource corresponding to the circular shift index from among RS resources (e.g. a combination of the circular shift, orthogonal cover and PRB index) is not used for the control information. In this case, the circular shift index used for the RS can use a specific value (e.g. ncs=0).
FIGS. 41 and 42 illustrate a structure of PUCCH format 3 and signal processing procedures for the same according to another embodiment of the present invention. In the present embodiment, control information is FDM-mapped to the frequency domain in interleaved and localized manners respectively. FDM mapping can be used for UE multiplexing or antenna (port) multiplexing. The present embodiment can be applied to CDM mapping using time/frequency domain cyclic shift.
Referring to FIG. 41, a channel coding block channel-codes information bits a_0, a_1, . . . , a_M−1 (e.g. multiple ACK/NACK bits) to generate encoded bits (coded bits or coding bits) (or a codeword) b_0, b_1, . . . , b_N−1. Here, M denotes an information bit size and N denotes an encoded bit size. The information bits include multiple ACK/NACK bits, for example. The information bits a_0, a_1, . . . , a_M−1 are joint-coded regardless of the type/number/size of UCI that forms the information bits. For example, when the information bits include multiple ACK/NACK bits for a plurality of DL CCs, channel coding is not performed per each DL CC or individual ACK/NACK bit but performed for all information bits, thereby generating a single codeword. Channel coding is not limited thereto and includes simple repetition, simplex coding, RM coding, punctured Reed Muller (RM) coding, Tail-biting convolutional coding (TBCC), low-density parity-check (LDPC) or turbo-coding. The encoded bits can be rate-matched in consideration of a modulation order and resource quantity, which is not shown in the figure. The rate matching function may be included as a part of the channel coding block or may be executed by a separate functional block.
A modulator modulates the encoded bits b_0, b_1, . . . , b_N−1 to generate modulation symbols c_0, c_1, . . . , c_L−1 where L denotes the size of the modulation symbols. A modulation method is performed by modifying the size and phase of a transmission signal. For example, the modulation method includes n-PSK (Phase Shift Keying) and n-QAM (Quadrature Amplitude Modulation) (n being an integer of 2 or greater). Specifically, the modulation method may include BPSK (Binary PSK), QPSK (Quadrature PSK), 8-PSK, QAM, 16-QAM, 64-QAM, etc.
A divider divides the modulation symbols c_0, c_1, . . . , c_L−1 into slots. The order/pattern/scheme of dividing the modulation symbols into slots are not particularly limited. For example, the divider can sequentially divide the modulation symbols into the slots (localized type). In this case, modulation symbols c_0, c_1, . . . , c_L/2−1 can be divided into slot 0 and modulation symbols c_L/2, c_L/2+1, . . . , c_L−1 can be divided into slot 1, as shown in FIG. 30a. Furthermore, the modulation symbols may be interleaved (or permuted) when divided into the slots. For example, even-numbered modulation symbols can be divided into slot 0 and odd-numbered modulation symbols can be divided into slot 1. The order of the modulation operation and division operation may be changed.
A DFT precoder performs DFT precoding (e.g. 6-point DFT) for the modulation symbols divided into each slot in order to generate a single carrier waveform. Referring to FIG. 30a, the modulation symbols c_0, c_1, . . . , c_L/2−1 divided into slot 0 can be DFT-precoded into DFT symbols d_0, d_1, . . . , d_L/2−1 and the modulation symbols c_L/2, c_L/2+1, . . . , c_L−1 divided into slot 1 can be DFT-precoded into DFT symbols d_L/2, d_L/2+1, . . . , d_L−1. DFT precoding can be replaced by another corresponding linear operation (e.g. Walsh precoding).
A spreading block spreads the DFT precoded signal at an SC-FDMA symbol level (time domain). Time domain spreading at an SC-FDMA symbol level is performed using a spreading code (sequence). The spreading code includes a quasi-orthogonal code and an orthogonal code. The orthogonal code includes a Walsh code and a DFT code. However, the orthogonal code is not limited thereto. The maximum spreading code size (or spreading factor SF) is limited by the number of SC-FDMA symbols used for control information transmission. For example, when 4 SC-FDMA symbols are used for control information transmission in one slot, a (quasi) orthogonal code w0,w1,w2,w3 having a length of 4 can be used for each slot. The SF means a spreading degree of control information and may be related to a UE multiplexing order or an antenna multiplexing order. The SF can be changed to 1, 2, 3, 4, . . . according to system requirements, and pre-defined between a BS and a UE or signaled to the UE through DCI or RRC signaling. For example, when an SC-FDMA symbol for transmitting control information according to an SRS, a spreading code with SF=3 can be applied to control information of the corresponding slot. Examples of the spreading code may refer to Tables 15 and 16.
The signal generated through the above-mentioned procedure is mapped to subcarriers in a PRB. Distinguished from the first embodiment, the spread signal is non-contiguously mapped to the subcarriers in SC-FDMA symbols. FIG. 41 shows a case in which the spread signal is mapped in the SC-FDMA symbols in an interleaving manner and FIG. 42 shows a case in which the spread signal is mapped in the SC-FDMA symbols in a localized manner. The frequency domain signal mapped to the subcarriers is transformed to a time domain signal through IFFT. A CP is added to the time domain signal to generate SC-FDMA symbols which are then transmitted through an RF unit.
The above-mentioned procedure will now be described in more detail on the assumption that ACK/NACK bits for 5 DL CCs are transmitted. When each DL CC can transmit 2 PDSCHs, ACK/NACK bits for the DL CC may be 12 bits when a DTX status is included. A coding block size (after rate matching) may be 24 bits on the assumption that QPSK, SF=4 time spreading and non-contiguous mapping are used. Encoded bits are modulated into 12 QPSK symbols and 6 QPSK symbols are divided into each slot. In each slot, 6 QPSK symbols are converted to 6 DFT symbols through 6-point DFT. In each slot, 6 DFT symbols are spread and mapped to 4 SC-FDMA symbols using a spreading code with SF=4 in the time domain. Since 12 bits are transmitted through [2 bits×6 subcarriers×8 SC-FDMA symbols], the coding rate is 0.125(=12/96). In the case of SF=4, a maximum of 8 UEs can be multiplexed per PRB.
If a subcarrier spacing is changed from 2 blocks to 3 blocks when the DFT symbols are mapped to the frequency domain, a maximum of 12 UEs can be multiplexed. When the subcarrier interval is configured to 4/6 blocks, a maximum of 16/24 UEs can be multiplexed. Here, the RS can employ the DFT code with SF=3 and circular shift used in LTE. In the case of a Walsh code with SF=4 in LTE, [1 1 −1 −1] is not used because the multiplexing order is limited by SF=3 of the RS. However, the present invention can define [1 1 −1 −1] such that it can be reused.
Cell-specific scrambling using a scrambling code (e.g. a PN code such as a Gold code) corresponding to a physical cell ID (PCI) or UE-specific scrambling using a scrambling code corresponding to a UE ID (e.g. RNTI) can be additionally applied for inter-cell interference randomization, which is not shown in the figure. Scrambling may be performed for the entire information, performed in SC-FDMA symbols, performed between SC-FDMA symbols, or performed for both the entire information and SC-FDMA symbols. Scrambling the entire information can be achieved by performing scrambling at the information bit level, encoded bit level or modulation symbol level prior to division. Intra-SC-FMDA symbol scrambling may be implemented by performing scrambling on the modulation symbols or DFT symbols after division. Inter-SC-FDMA symbol scrambling may be achieved by carrying out scrambling on the SC-FDMA symbols in the time domain after spreading.
UE multiplexing can be achieved by applying CDM to a signal before being subjected to the DFT precoder. For example, the signal before being subjected to the DFT precoder is a time domain signal, and thus CDM can be implemented through circular shift (or cyclic shift) or Walsh (or DFT) spreading. CDM multiplexing can be performed at the information bit level, encoded bit level and modulation symbol level. Specifically, a case of multiplexing 2 UEs to one SC-FDMA symbol using a Walsh code with SF=2 is illustrated. When QPSK is performed on 6-bit encoded bits, a complex signal of a0,a1,a2 is generated. Control information of each UE is spread using Walsh code [+1 +1] [+1 −1] as follows.

    
    
        UE #0: [+1 +1] is applied. a0,a1,a2,a0,a1,a2 are transmitted.
        UE #1: [+1 −1] is applied. a0,a1,a2,−a0,−a1,−a2 are transmitted.
    
    


In this case, interleaving may be additionally performed. The interleaving may be applied before or after spreading. Both the spreading and interleaving are applied as follows.

    
    
        UE #0: [+1 +1] is applied. a0,a0,a1,a1,a2,a2 are transmitted.
        UE #1: [+1 −1] is applied. a0,−a0,a1,−a1,a2,−a2 are transmitted.
    
    


FIGS. 43 and 44 illustrate another exemplary PUCCH format according to the present embodiment of the invention. While the PUCCH formats shown in FIGS. 43 and 44 has the same basic structure as that of the PUCCH format shown in FIGS. 41 and 42, the PUCCH format of FIGS. 43 and 44 is distinguished from the PUCCH format of FIGS. 41 and 42 in that the same encoded bits are repeated on a slot-by-slot basis. Accordingly, a signal processing block shown in FIGS. 43 and 44 does not include a divider.
A description will be given of methods of allocating a PUCCH resource to a UE on the assumption that multiple ACK/NACK bits are transmitted for data received through a plurality of DL CCs. For convenience of description, it is assumed that a (quasi) orthogonal resource for control information transmission is referred to as resource A and a (quasi) orthogonal resource for RS transmission is referred to as resource B. Resource A includes at least one of a PRB index, a spreading code (e.g. Walsh code) index and a subcarrier shift (or offset or index) according to frequency factor. One representative logical index may be given for resource A and the PRB index, spreading code index and a subcarrier shift (or offset or index) according to frequency factor may be derived from the representative logical index. Resource B includes at least one of a PRB index, a circular shift index and an orthogonal cover index. One representative logical index may be given for resource B, and the PRB index, circular shift index and orthogonal cover index may be inferred from the representative logical index. The logical indexes of resource A and resource B may be linked with each other. Furthermore, indexes of resources constituting resource A and resource B may be linked with each other.
A first resource allocation method signals both resource A and resource B. For example, both resource A and resource B can be signaled through physical control channel (e.g. PUCCH) or RRC signaling. In this case, the resource A index for control information transmission and the resource B index for RS transmission may be respectively signaled or only one thereof may be signaled. For example, if RS format and indexing conform to LTE, only resource B index for RS transmission can be signaled. Because it is preferable to transmit control information in the same PRB as that of the RS, the PRB index for the control information may be derived from the resource B index for the RS and the control information may be transmitted through a PRB corresponding to the PRB index. The orthogonal code index used for the control information may be derived from the orthogonal cover index or circular shift index used for the RS. The subcarrier shift (or offset or index) according to frequency factor for resource A may be inferred from the circular shift index used for the RS. Alternatively, the subcarrier shift (or offset or index) according to frequency factor for resource A may be RRC signaled. Here, the frequency factor (or linear operation corresponding thereto, e.g. the reciprocal of the frequency factor) can be RRC signaled or implicitly determined on the basis of the number of DL CCs. That is, the frequency factor can be configured by the system or previously designated.
FDM mapping can also be applied to the RS. The RS can be directly generated in the frequency domain without a DFT precoder (i.e. the DFT precoder can be omitted) because a previously designated low-CM sequence is used whereas a low PAPR/CM signal is generated using DFT precoding in the case of control information. However, it may be technically preferable to apply CDM mapping using circular shift to the RS rather than FDM mapping for the following reason.

    
    
        Design of sequences with various lengths is required when FDM mapping is used for the RS. That is, a new sequence with a length of 6 is needed when a frequency factor (FF) (or subcarrier interval) is 2 although a minimum sequence length for the RS is 12 in LTE.
        When FDM mapping is used for the RS, channel estimation performance may be deteriorated in a high frequency selective channel because a channel of a specific frequency position is estimated and interpolation is performed on other positions. However, the channel estimation performance is not deteriorated because the RS covers all frequency regions in the case of CDM mapping.
    
    


A second resource allocation method reuses the implicit method of LTE in case of dynamic ACK/NACK resource allocation. For example, a resource index that corresponds to the lowest CCE index of a PDCCH corresponding to a DL grant of a specific DL CC (e.g. primary DL CC) and conforms to LTE rule (nr=ncce+N_PUCCH(1)) can be inferred. Here, nr denotes the resource A (and/or resource B) index, ncce denotes the lowest CCE index constituting the PDCCH, and N_PUCCH(1) denotes a value configured by higher layers. For example, the RS can use a resource corresponding to the inferred resource index. In the case of control information, the PRB index can be derived from the inferred resource index and ACK/NACK information for a plurality of DL CCs can be transmitted using a corresponding resource (e.g. spreading code and/or subcarrier shift (or offset or index) according to frequency factor) in the PRB corresponding to the PRB index. When the resource index corresponding to the RS is inferred from the resource index corresponding to the control information, the circular shift index used for the RS cannot be derived from the resource index corresponding to the control information because the resource corresponding to the circular shift index from among RS resources (e.g. a combination of the circular shift, orthogonal cover and PRB index) is not used for the control information. In this case, the circular shift index for the RS can use a specific value (e.g. ncs=0).
FIGS. 45 to 51 illustrate a method of defining a resource index according to an embodiment of the present invention. FIGS. 45 to 51 show a case in which a resource index (i.e. resource A index) for control information is defined as a combination of a subcarrier mapping pattern/position (e.g. subcarrier index of offset) and a spreading code (e.g. orthogonal code). When a PRB for RS transmission is confirmed, a PRB for control information transmission can be configured as the PRB for RS transmission. Otherwise, the PRB for control information transmission can be signaled through physical control channel (e.g. PDCCH)/RRC signaling. In the present embodiment, a subcarrier shift (or offset or index) according to frequency factor for the control information can be inferred from the circular shift index of the RS. Otherwise, the subcarrier shift (or offset or index) according to frequency factor can be RRC signaled. Here, the frequency factor can be RRC signaled or implicitly determined on the basis of the number of DL CCs. That is, the frequency factor can be configured by the system or previously designated. In this case, a representative index for indicating a combination (e.g. [PRB, spreading code] or [PRB, spreading code, frequency factor]) of detailed resources may not be separately defined in a channel resource for the control information.
Referring to FIGS. 45 to 51, numerals in boxes mean resource indexes (i.e. resource A indexes for control information transmission). In the present embodiment, resource indexes for the control information are linked with [orthogonal code indexes, subcarrier shifts (or offsets or indexes)]. Accordingly, the control information is spread at the SC-FDMA symbol level using an orthogonal code corresponding to resource indexes and mapped to subcarriers corresponding to the resource indexes. While the resource indexes are counted in ascending order of frequency resource (subcarrier index) in FIGS. 45 to 51, the resource indexes may be counted on the basis of the orthogonal code index axis. FIGS. 45b, 46b, 47b, 48b, 49b and 50b show that resource indexing for the control information is limited by an RS multiplexing order. For example, if the RS multiplexing order is 3 and a Walsh code with SF=4 is used for control information transmission, [+1 +1 −1 −1] (resource index 3) may not be used, as in LTE.
The resource indexes may be relative values (e.g. offset). For example, PUCCH format 2/2a/2b may be transmitted through the outermost portion of a band, 1 PRB in which PUCCH formats 1/1a/1b and 2/2a/2b coexist may be located inside the outermost portion of the band, and PUCCH format 1/1a/1b may be transmitted through a portion inside the portion where PUCCH formats 1/1a/1b and 2/2a/2b coexist in LTE. When a PRB for PUCCH format 1/1a/1b and a PRB for PUCCH format 2/2a/2b are present together (only one PRB is allowed in LTE), if the number of HARQ-ACK/NACK resources is M in the corresponding PRBs, n substantially represents M+n. Here, each frequency resource (e.g. frequency factor) or orthogonal code index can be cell-specifically/UE-specifically hopped on an SC-FDMA symbol level/slot basis.
FIG. 51 illustrates a case in which orthogonal resource indexes are staggered for each orthogonal code index or circularly shifted along the frequency axis. In this case, the resource indexes in FIG. 47a are staggered subcarrier by subcarrier for each orthogonal code index. Circular shifts or orthogonal code indexes can be cell-specifically/UE-specifically hopped at the SC-FDMA symbol level/slot level.
FIG. 52 illustrates a resource indexing method for an RS. Resource indexing for an RS may conform to the method defined in LTE.
Referring to FIG. 52, numerals in boxes denote resource indexes (i.e. indexes of resource B for RS transmission). In this example, the resource indexes for the RS are linked with [circular shift values, orthogonal code indexes]. Accordingly, an RS sequence is circular-shifted by a value corresponding to a resource index along the frequency axis and covered in the time domain with an orthogonal code corresponding to the resource index. In FIG. 52, ΔshiftPUCCH denotes a circular shift spacing and a used circular shift value may be c·ΔshiftPUCCH (c being a positive integer). A phase shift value according to a circular shift can be given as α(ns,l)=2π·ncs(ns,l)/NscRB where ns is a slot index, l is an SC-FDMA symbol index, ncs(ns,l) is a circular shift value, and NRBsc denotes the number of subcarriers that form a resource block.
In this example, the resource indexes for the RS are counted first along the circular shift axis. However, the resource indexes may be counted first along the orthogonal code axis.
ΔshiftPUCCH of the RS and the frequency factor of control information (or a corresponding linear operation, e.g. the reciprocal of the frequency factor) can be signaled through physical control channel (e.g. PDCCH) or RRC signaling.
Resource indexing for the control information may correspond to resource indexing for the RS. In this case, only one of the control information resource index and RS resource index may be signaled to a UE through physical control channel (e.g. PDCCH)/RRC signaling and the other may be inferred from the resource index signaled to the UE. For example, the frequency factor can be inferred from information (e.g. the circular shift spacing) about circular shift used in the RS. If conventional ΔshiftPUCCH signaling is reused, both ΔshiftPUCCH for the RS and the frequency factor (interval) for the control information can be designated through one ΔshiftPUCCH signaling. Specifically, the one ΔshiftPUCCH signaling is associated with resource indexing shown in FIG. 52 and resource indexing shown in FIGS. 45b, 46b, 47b, 48b, 49b and 50b, respectively.
Table 20 shows an example of mapping ΔshiftPUCCH and the frequency factor.










TABLE 20







 shiftPUCCH
Frequency Factor (FF)



















1
1



2
2



3
3



4
4



6
6



12
12










Table 21 shows an example of mapping ΔshiftPUCCH and the frequency factor in consideration of the number of available resources (i.e. multiplexing order). For example, when the multiplexing order according to circular shift is 6 in one SC-FDMA symbol, ΔshiftPUCCH=2 and FF=6 can be paired.









TABLE 21







Multiplexing order



Frequency Factor
due to circular shift


 shiftPUCCH
(FF)
only

















1
12
12


2
6
6


3
4
4


4
3
3


6
2
2


12
1
1









Alternatively, the frequency factor can be RRC signaled or implicitly determined on the basis of the number of DL CCs. Specifically, the frequency factor can be implicitly determined on the basis of the number of configured DL CCs or on the basis of the number of activated DL CCs. For example, a frequency factor for 5 configured (activated) DL CCs can be configured to 2 in advance and used. Frequency factors for 4, 3, 2 and 1 configured (activated) DL CCs can be implicitly configured to 3, 4, 6 and 12 and used, respectively.
Third Embodiment
FIG. 53 illustrates a PUCCH format structure and a signal processing procedure for the same according to a third embodiment of the present invention. Since the overall flow of the signal processing procedure is similar to those described with reference to FIGS. 30 to 43, the following description is focused on a CAZAC modulator that is a main difference between the signal processing procedure of FIG. 44 and the signal processing procedures of FIGS. 29 to 43.
Referring to FIG. 53, the CAZAC modulator modulates the modulation symbols [c_0, c_1, . . . , c_L/2−1] and [c_L/2, c_L/2+1, . . . , c_L−1]) divided into corresponding slots into corresponding sequences to generate CAZAC modulation symbols [d_0, d_1, . . . , d_L/2−1] and [d_L/2, d_L/2+1, . . . , d_L−1]. The CAZAC modulator includes a CAZAC sequence or a LTE computer generated (CG) sequence for 1RB. For example, if the LTE CG sequence is r_0, . . . , r_L/2−1, a CAZAC modulation symbol may be d_n=c_n*r_n or d_n=conj(c_n)*r_n. While FIG. 44 illustrates slot-level joint coding, the present invention can be equally applied to separate coding for each slot, slot-level repetition, and a case in which a frequency factor is applied. In the present embodiment, cell-specific scrambling can be omitted because a CAZAC or CG sequence functioning as a base sequence is cell-specific. Otherwise, only UE-specific scrambling can be applied for greater randomization. A resource allocation method, relation with RS indexes, a signaling method, and transmit diversity can use the methods described in the above embodiments.
Fourth Embodiment
A description will be given of a case in which dynamic ACK/NACK resource allocation is applied to the new PUCCH formats described in the first, second and third embodiments. The following description can be equally applied to other new PUCCH formats as well as the new PUCCH formats according to the present invention. For example, LTE PUCCH format 2 can be reused as a new PUCCH format for multi-ACK/NACK. In this case, resource indexing for ACK/NACK can employ the method used in LTE PUCCH format 2, that is, the method of indexing resources on the circular shift axis first, and then indexing PRBs. Use of LTE PUCCH format 2 as a new PUCCH format has the advantage of using an existing format. However, because only up to 13 bits can be supported and a coding rate is limited in PUCCH format 2, the PUCCH format 2 is inferior to the PUCCH formats described in the above embodiments in terms of flexibility and performance.
A region (or PRB) for a new PUCCH format can be defined as follows.
1. An additional PUCCH region (or PRB) for LTE-A can be defined in addition to the PUCCH region defined in LTE.
2. Part of the PUCCH region (or PRB) defined in LTE can be derived. That is, some resources of the PUCCH region can be used as resources for the new PUCCH format while the PUCCH region is defined according to LTE.
A description will be given of PUCCH format adaptation according to a carrier aggregation scenario. A PUCCH format used for PUCCH format adaptation is not limited. The PUCCH format adaptation described in the specification is divided into the following two types.
1. PUCCH format adaptation according to carrier aggregation configuration
2. Format adaptation on the basis of the number of PDSCHs and/or PDSCHs allocated to a UE
A. PUCCH format adaptation based only on the number of PDSCHs/PDSCHs
B. Format adaptation based on the number of DL CCs carrying PDSCHs or PDSCHs
The format adaptation scheme according to carrier aggregation configuration is described as a first PUCCH format adaptation scheme. When the number (N) of cell-specifically or UE-specifically aggregated DL CCs is less than a specific value (e.g. 2), a HARQ-ACK/NACK resource may correspond to the lowest CCE index as in LTE. Here, the aggregated DL CCs may be candidate DL CCs from which a PDCCH is detected for cross-carrier scheduling. Furthermore, the aggregated DL CCs may be some of DL CC sets configured for respective cells. Moreover, the aggregated DL CCs may be activated DL CCs. The PUCCH format used in this case may be the LTE PUCCH format 1/1a/1b. Schemes that can be used when N≧3 include multi-sequence modulation (MSM) that performs simultaneous transmission using M (M≦N) resources and HARQ-ACK/NACK multiplexing (or sequence selection) that selects some of resources and transmits the selected resources. The PUCCH format used in this case may be the LTE PUCCH format 1/1a/1b. When N=1, that is, when carrier aggregation is not performed (i.e. 1DL-1UL pairing), HARQ-ACK/NACK resources can use the LTE rule and PUCCH format 1/1a/1b.
When more than N DL CCs are cell-specifically or UE-specifically aggregated, HARQ-ACK/NACK can be transmitted through the new PUCCH formats described in the first, second and third embodiments. A PUCCH resource can be configured such that it corresponds to the lowest CCE index regardless of whether a region (or PRB) for a new PUCCH format is defined exclusively of LTE or defined compatibly with LTE. In this case, transmitted HARQ-ACK/NACK information may correspond to data transmitted through multiple DL CCs.
PUCCH format adaptation on the basis of the number of PDSCHs and/or PDSCHs assigned to a UE is described as a second PUCCH format adaptation scheme. While the number of DL CCs including PDSCHs equals the number of DL CCs including PDSCHs in general, they may become different from each other when cross-carrier scheduling is employed. Furthermore, if the number of PDSCHs or PDSCHs for each DL CC is limited to 1, the number of PDSCHs/PDSCHs may correspond to the number of DL CCs used for the PDSCHs. An implicit rule for HARQ-ACK/NACK resources may relate to the PDSCHs. Since the number of PDSCHs equals the number of PDSCHs, the following description is made on the basis of the number of PDSCHs. Furthermore, since PUCCH format adaptation based on the number of DL CCs carrying PDSCHs/PDSCHs can be achieved by extending the PUCCH format adaptation based on the number of PDSCHs, detailed description thereof is omitted.
When the number (N) of PDSCHs scheduled for one UE is less than a specific value, resources for HARQ-ACK/NACK transmission may correspond to the lowest CCE index according to the LTE rule. Here, a PUCCH format used in this case may be LTE PUCCH format 1/1a/1b. A scheme used when N≧3 may be MSM that performs simultaneous transmission using M (M≦N) resources and HARQ-ACK/NACK multiplexing (or sequence selection) that selects some resources and transmits the selected resources. A PUCCH format used in this case may be LTE PUCCH format 1/1a/1b. When N=1, that is, when only one PDCCH of one UE is scheduled, HARQ-ACK/NACK resources can use the LTE rule and PUCCH format 1/1a/1b.
HARQ-ACK/NACK can be transmitted through the new PUCCH format when N or more PDCCHs are scheduled for one UE. A PUCCH resource can be configured such that it corresponds to the lowest CCE index regardless of whether regions (or PRBs) for the new PUCCH format are defined exclusively or compatibly with regions for an LTE PUCCH format. In this case, multiple HARQ-ACK/NACK information may correspond to data transmitted through multiple DL CCs.
A description will be given of error handling. For convenience of description, it is assumed that N=2. If a scheduler transmits 2 PDCCHs (which may correspond to 2 PDSCHs transmitted through 2 DL CCs, in general) to one UE, the UE may mis-detect that one PDCCH has been scheduled. In this case, while the BS expects to receive HARQ-ACK/NACK information through the new PUCCH format for two or more PDCCHs, the UE transmits HARQ-ACK/NACK information through an LTE PUCCH format since the UE has detected one PDCCH. The BS recognizes that DTX is generated for the one PDCCH because the BS receives a PUCCH format different from the expected format.
Recognition of DTX status of the UE by the BS may affect performance in incremental redundancy (IR) based HARQ. When DTX is generated, for example, because the UE is not aware of the fact that a PDCCH has been transmitted, the UE cannot store a decoded soft bit result value of a PDSCH corresponding to the PDCCH in a soft buffer. Accordingly, when DTX is generated, it is necessary for the BS not to change a redundancy version (RV) or to transmit as many system bits as possible in the event of HARQ retransmission. However, if the BS is not aware of the DTX status of the UE and performs retransmission with a different RV value, system throughput may be decreased because the RV is changed and system bits are lost during retransmission. For this reason, since the WCDMA specification, 3GPP specifies that the DTX status of the UE is signaled to the BS.
A description will be given of a resource determination method for HARQ-ACK/NACK and a DTX handing method in the new PUCCH format. Here, it is assumed that the new PUCCH format can simultaneously transmit information including HARQ-ACK/NACK corresponding to multiple DL CCs and DTX statuses of the respective DL CCs all. For example, if 5 DL CCs are present and each DL CC transmits 2 codewords, the new PUCCH format can carry at least 12-bit information for supporting ACK/NACK and DTX for the 5 DL CCs.
While a case in which PUCCH resources for the new PUCCH format are exclusively reserved for each CC and a case in which at least part of a plurality of CCs are shared are described for ease of explanation, the present invention is not limited thereto. As an example of exclusive reservation of resources for PUCCH transmission for each CC, If 4 DL CCs are present and 10 PUCCH resources are reserved for each DL CC, 40 (=10*4) PUCCH resources can be reserved, PUCCH resource indexes 0 to 9 can be used for DL CC #0, PUCCH resource indexes 10 to 19 can be used for DL CC #1, PUCCH resource indexes 20 to 29 can be used for DL CC #2, and PUCCH resource indexes 30 to 39 can be used for DL CC #3 (PUCCH resource stacking). If 4 DL CCs are present and 10 PUCCH resources are reserved for each DL CC as an example of sharing PUCCH resources by multiple CCs, PUCCH resource indexes 0 to 9 can be shared for all DL CCs.
As described above, a PUCCH region (or PRB) in which the new PUCCH format can be used can be defined as a new region (or a specific section of resources) for LTE-A or defined using some resources defined in LTE. Furthermore, “the lowest CCE” concept can be used as in LTE or another implicit method can be applied.
A detailed example of resource allocation according to the present invention will now be described. It is assumed that 4 HARQ-ACK/NACK signals need to be transmitted for 4 PDSCHs transmitted through 4 DL CCs and the HARQ-ACK/NACK signals are transmitted through one UL CC (e.g. anchor UL carrier). Here, HARQ-ACK/NACK includes ACK, NACK, DTX and NACK/DTX. It is assumed that 10 PUCCH resources are reserved for each DL CC such that a total of 40 PUCCH resources are reserved. While the present embodiment is described for one UE (i.e. UE #0), it can be equally applied to multiple UEs. Furthermore, while the present embodiment is described in terms of sequential resource indexing 0 to 39 in exclusive resource definition, it can also be applied to a case in which 4 PUCCH resource regions each having indexes 0 to 9 for each DL CCs are present.
FIG. 54 illustrates an example of transmitting multiple PDCCHs in association with a downlink assignment carrier index (DACI) at UE #0. In this case, statuses of all DL CCs for PDSCHs are transmitted according to the new PUCCH format, and thus it is difficult to apply CCE based implicit mapping of LTE. In the present embodiment, for ease of explanation, it is assumed that one PDCCH is transmitted to UE #0 for each CC, UE #0 successfully decodes all PDCCHs to generate no DTX, and CCE indexing in each DL CC starts from 0. Furthermore, CCE indexing can include CCE indexing of previous DL CCs. For example, CCE indexes for DL CC #1 may be 10 to 19.
A DACI is a counter for PDCCHs transmitted to a UE and is configured for each UE. When a plurality of PDCCHs are transmitted, the DACI can indicate the order of the PDCCHs. If 4 PDCCHs are transmitted, as shown in FIG. 54, the DACI has values of 0 to 3. The DACI may be included in a DCI field of the corresponding PDCCHs and signaled to the corresponding UE, or signaled to the UE through other signaling methods. A downlink assignment index (DAI) field used in LTE TDD can be reused as a DACI field.
The DACI can represent the number of PDSCHs (or the number of PDCCHs) in all DL CCs, not a counter. For example, if the DACI indicates the number of PDCCHs in the example shown in FIG. 54, all the DACI values in the PDCCHs may be 4. When the DACI represent the number of PDCCHs, the DACI can be applied to a case in which the UE transmits ACK/NACK in ACK/NACK bundling mode. ACK/NACK bundling is a method of transmitting representative ACK/NACK through a logical AND operation. For example, NACK is transmitted as a representative value when at least one of ACK/NACK results corresponds to NACK and ACK is transmitted as a representative value when all the ACK/NACK results correspond to ACK. If the number of PDCCHs successfully decoded by the UE is 3 although a DACI value indicating the total number of PDCCHs is 4, which means that one PDCCH is not decoded, NACK, DTX or NACK/DTX can be signaled as a representative value to the BS. Accordingly, the BS and the UE can be aware of a DTX status using the DACI. The method of transmitting NACK when DTX is generated is exemplary and a DTX status may be signaled by transmitting no information. The present invention is not limited by the DTX signaling scheme.
For ease of description, a case of utilizing the DACI as a CC index counter is described. A DACI counter can be configured such that it corresponds to a carrier indicator field (CIF) for cross-carrier scheduling. For example, if a CIF value is 3 bits, a DACI value may also be 3 bits. Furthermore, The DACI may be counted from a low frequency CC to a high frequency CC (or counted from a high frequency CC to a low frequency CC). Alternatively, the DACI may be circularly counted in ascending order from the primary carrier. If multiple PDCCHs are transmitted in one DL CC, the DACI can be counted from a low CCE index to a high CCE index. For example, when the lowest CCE index of PDCCH0 in DL CC #0 for a PDSCH of DL CC #1 is 10 and the lowest CCE index of PDCCH1 in DL CC #0 for a PDSCH of DL CC #2 is 20, a DACI value of PDCCH0 may be lower than that of PDCCH1. Alternatively, a DACI value transmitted in each PDCCH may be determined by the network without a particular rule and transmitted. That is, the DACI may not need to follow a particular rule.
The DACI may be defined as a combination with a DAI used in LTE TDD. For example, when 4 DAI statuses and 5 DACI statuses are present, a total of 20 combinations of DAI and DACI can be defined with indexes of 0 to 19. Even in this case, the present invention is applicable.
A primary objective of the DACI is to enable the UE to detect DTX. For example, if decoding of a PDCCH corresponding to DL CC #2 fails in the example of FIG. 54, UE #0 acquires DACI counter values 0, 1 and 3 through DCI0, DCI1 and DCI3, respectively. UE #0 may recognize that blind decoding of DCI2 has failed (i.e. enters a DTX status) because DACI=2 is absent and may transmit the corresponding status to the BS.
However, even though the DACI is used, UE #0 cannot be aware of whether or not blind decoding of the last DCI fails. In other words, when UE #0 fails to decode the last DCI even though the BS has transmitted the last DCI to UE #0, UE #0 cannot be aware of whether decoding of the last DCI fails or the BS does not transmit the last DCI. Referring to FIG. 54, when UE #0 fails to decode DCI3 although the BS has transmitted DCI3 in DL CC #3, UE #0 does not know whether DCI3 is absent or decoding of DCI3 fails.
Therefore, the present embodiment proposes a method for correctly providing ACK/NACK (including DTX) statuses for all DL PDSCHs to the BS and UEs. Specifically, the present embodiment proposes a method of transmitting ACK/NACK information using resources of PUCCH corresponding to a PDCCH over which the last value of the DACI counter is transmitted.
FIG. 55 illustrates an embodiment according to the present invention. This embodiment shows a case in which the BS transmits 4 PDCCHs and UE #0 successfully decodes all PDCCHs. In this case, HARQ-ACK/NACK information for 4 PDSCHs transmitted through 4 DL CCs is delivered through PUCCH resource 34 corresponding to the lowest CCE index 4 of a PDCCH having the largest DACI value 3 from among the detected PDCCHs. If the DACI is counted in reverse order (e.g. 3, 2, 1, 0), the HARQ-ACK/NACK information can be transmitted through PUCCH resource 2 corresponding to the lowest CCE index 2 of the first PDCCH (DL CC #0).
FIG. 56 illustrates a case in which UE #0 successfully decodes a PDCCH for DCI2 and fails to decode a PDCCH for DCI3. The BS will expect to receive HARQ-ACK/NACK information through PUCCH resource 34 from UE #0 on the assumption that UE #0 successfully decodes DCI3. However, when UE #0 successfully decodes DCI2 (it is not necessary to consider whether or not DCI0 and DCI1 are successfully decoded because UE #0 can recognize it through DACI) but fails to decode DCI3, UE #0 transmits the HARQ-ACK/NACK information through PUCCH resource 20 corresponding to DCI2. Accordingly, the BS can recognize whether DTX was occurred as for the last DCI3 through the transmitted resource.
FIG. 57 illustrates a case in which UE #0 fails to decode DCI0, DCI2 and DCI3. UE #0 can recognize whether decoding of DCI0 fails through a received DACI because it has successfully decoded DCI1. However, UE #0 cannot be aware of whether DTX is generated for DCI2 and DCI3. UE #0 transmits HARQ-ACK/NACK information through PUCCH resource 16 corresponding to the lowest CCE index 6 of a PDCCH having the largest DACI value 1 from among detected PDCCHs although it does not know whether DTX is generated for DCI2 and DCI3. Accordingly, the BS can recognize that DTX is generated for DCI2 and DCI3.
FIG. 58 illustrates a case in which 2 PDCCHs are transmitted through DL CC #3. It is assumed that the DACI is counted from a lower CCE index to a higher CCE index when a plurality of PDCCHs are transmitted through one DL CC. In this case, UE #0 transmits HARQ-ACK/NACK information through PUCCH resource 36 corresponding to the lowest CCE index 6 of a PDCCH having the largest DACI value 3 from among detected PDCCHs.
FIG. 59 illustrates a case in which 2 PDCCHs are transmitted through DL CC #3 and a DCI having a lower CCE index has a larger DACI value. In this case, UE #0 transmits HARQ-ACK/NACK information through PUCCH resource 34 corresponding to the lowest CCE index 4 of a PDCCH having the largest DACI value 3 from among detected PDCCHs.
A case in which PUCCHs for DL CCs are defined such that the PUCCHs are shared will now be described with reference to FIGS. 60 and 61.
FIG. 60 illustrates a case in which UE #0 successfully decodes all 4 PDCCHs where the PUCCHs for the respective DL CCs are shared. In this case, UE #0 transmits HARQ-ACK/NACK information through PUCCH resource 4 corresponding to the lowest CCE index 4 of a PDCCH having the largest DACI value 3 from among the detected PDCCHs.
FIG. 61 illustrates a case in which UE #0 fails to decode DCI3 with DACI=3. In this case, UE #0 transmits HARQ-ACK/NACK information through PUCCH resource 0 corresponding to the lowest CCE index 0 of a PDCCH having the largest DACI value 2 from among the detected PDCCHs. Accordingly, the BS can recognize that DTX is generated for DCI3.
FIG. 62 illustrates a case in which PUCCH resources for DL CCs partially overlap. UE #0 transmits HARQ-ACK/NACK information in the same manner as the above cases.
Another scheme for solving a DTX problem for the last DACI value will now be described. Specifically, a scheme of simultaneously using a parameter representing a PDCCH counter value and a parameter representing the number of PDCCHs is proposed.
For example, if DACI0 serves as a PDCCH counter (e.g. in the range of 0 to 7 when it is 3 bits), DACI1 can transmit the number of allocated PDCCHs (or PDSCHs) (e.g. in the range of 1 to 8 when it is 3 bits; 0 need not be transmitted). For example, when 4 PDCCHs are transmitted, each PDCCH may carry the following information.

    
    
        DCI0: DACI0=0, DACI1=4
        DCI1: DACI0=1, DACI1=4
        DCI2: DACI0=2, DACI1=4
        DCI3: DACI0=3, DACI1=4
    
    


Here, DACI1 can be additionally defined with DACI0. Alternatively, DACI1 may be transmitted over one or more of the PDCCHs. Alternatively, if any of DCIs is limited such that cross-carrier scheduling is not permitted, the CIF field of the corresponding DCI can be used to carry DACI1. Alternatively, DACI0 and DACI1 can be transmitted through RRC signaling or broadcasting signaling.
Next, another method for using RRC signaling to solve the DTX problem in the last DACI value will now be described. In this method, a specific UE can be assigned a unique PUCCH resource through RRC signaling. The PUCCH resource may be a resource shared by several UEs or a resource allocated for SPS or ACK/NACK repetition. When DTX is generated in at least one PDCCH, the specific UE transmits HARQ-ACK/NACK information through the PUCCH resource allocated through RRC signaling. When no DTX is generated, the UE performs dynamic ACK/NACK operation in an implicit manner. Conversely, the UE may transmit the HARQ-ACK/NACK information using the PUCCH resource allocated by RRC when no DTX is generated and may implicitly perform the dynamic ACK/NACK operation when DTX is generated. In this case, the DACI value may simply be the number of transmitted PDCCHs. When the DACI represents the number of transmitted PDCCHs, it is impossible to know exactly which PDCCH is lost and it is only possible to recognize whether DTX is generated. The implicit rule for the dynamic ACK/NACK operation is to transmit HARQ-ACK/NACK information using a PUCCH resource corresponding to the lowest CCE index of a PDCCH having the largest CCE index among PDCCH(s) of the largest CC index, a PUCCH resource corresponding to the lowest CCE index of a PDCCH having the lowest CCE index among PDCCH(s) of the largest CC index, a PUCCH resource corresponding to the lowest CCE index of a PDCCH having the lowest CCE index among PDCCH(s) of the lowest CC index, or a PUCCH resource corresponding to the lowest CCE index of a PDCCH having the largest CCE index among PDCCH(s) of the lowest CC index.
If the DACI is defined as a counter, it is possible to perform implicit mapping using the lowest CCE index of a PDCCH having the largest DACI value.
As an example, FIG. 63 illustrates a case in which a PUCCH resource is defined by the lowest CCE index of a PDCCH having the lowest CCE index among PDCCH(s) of the largest CC index by way of implicit rule and DTX is not generated for any PDCCH. Since DTX is not generated, UE #0 transmits HARQ-ACK/NACK information through PUCCH resource 34 corresponding to the lowest CCE index 4 of a PDCCH having the largest DACI value 3 from among detected PDCCHs. The HARQ-ACK/NACK information may be information bundled for control information of all PDSCHs.
FIG. 64 illustrates a case in which DTX is generated in DCI1. In this case, UE #0 recognizes that DTX is generated in a DCI corresponding to DACI=2 because UE #0 has successfully performed decoding for DACI=0, DACI=1 and DACI=3. UE #0 transmits HARQ-ACK/NACK information through RRC-signaled PUCCH resource 100 because DTX has been generated. The HARQ-ACK/NACK information may be information bundled for control information of all PDSCHs.
FIG. 65 illustrates a case in which UE #0 fails to decode a PDCCH having the last DACI value. In this case, UE #0 cannot be aware of whether DTX is generated in a DCI corresponding to DACI=3. Accordingly, UE #0 recognizes that DTX is not generated and transmits HARQ-ACK/NACK information through PUCCH resource 36 corresponding to the lowest CCE index 6 of a PDCCH having the largest DACI value 2 from among detected PDCCHs. On the other hand, the BS expects to receive HARQ-ACK/NACK information (combined ACK/NACK) through
PUCCH resource 34 corresponding to DCI2, the PDCCH having the largest DACI value, or RRC-signaled PUCCH resource 100. However, UE #0 transmits the HARQ-ACK/NACK information through PUCCH resource 36 corresponding to DCI3, and thus the BS recognizes that DTX is generated for DCI2.
The above-mentioned methods may be combined. For example, the format adaptation schemes and the DTX detection schemes (i.e. using the corresponding CCE index of the PDCCH carrying the last DACI value, simultaneously transmitting DACI0 and DACI1, and using RRC signaling) can be implemented in combinations.
FIG. 66 is a block diagram showing configurations of a BS and a UE.
Referring to FIG. 66, a wireless communication system includes a 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 configured to implement the procedures and/or methods proposed according to the present invention. The memory 114 is connected to the processor 112 and stores various information related to operations of the processor 112. The RF unit 116 is connected to the processor 112, transmits and/or receives an RF signal. The UE 120 includes a processor 122, a memory 124, and an RF unit 126. The processor 112 may be configured to implement the procedures and/or methods proposed by the present invention. The memory 124 is connected to the processor 122 and stores information related to operations of the processor 122. The RF unit 126 is connected to the processor 122, transmits and/or receives an RF signal. The BS 110 and/or 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 type. Each of the structural elements or features should be considered selectively unless specified separately. 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 another claims referring to the other 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 the data transmission and reception between the base station and the user equipment. These embodiments may be equally/similarly expandable to the data transmission and reception between UE and relay or between BS and relay. A specific operation which has been described as being performed by the base station may be performed by an upper node of the base station as the case may be. In other words, it will be apparent that various operations performed for communication with the user equipment in the network which includes a plurality of network nodes along with the base station can be performed by the base station or network nodes other than the base station. The base station may be replaced with terms such as a fixed station, Node B, eNode B (eNB), and access point. Also, the user equipment 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 their combination. 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 type of a module, a procedure, or a function, which performs functions or operations described as above. A 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 means which are well known.
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
The present invention can be used for a UE, a BS or other devices in a wireless communication system. Specifically, the present invention is applicable to a method and apparatus for transmitting uplink control information.

## Claims

1. A method for transmitting control information at a user equipment (UE) in a wireless communication system, the method comprising:
spreading a control information block corresponding to one single carrier frequency division multiplexing (SC-FDMA) symbol, such that spread control information blocks correspond to a plurality of first SC-FDMA symbols;
DFT(discrete Fourier transform)-precoding the spread control information blocks on an SC-FDMA symbol basis;
generating a plurality of reference signal sequences corresponding to a plurality of second SC-FDMA symbols, wherein each of the plurality of reference signal sequences is generated by circular-shifting a base sequence;
transmitting the DFT-precoded control information blocks through the plurality of first SC-FDMA symbols in a subframe through at least one antenna; and
transmitting the plurality of reference signal sequences through the plurality of second SC-FDMA symbols in the subframe through the at least one antenna,
wherein an orthogonal code is applied to the plurality of second SC-FDMA symbols in a time domain.

2. The method according to claim 1, wherein the plurality of first SC-FDMA symbols and the plurality of second SC-FDMA symbols are transmitted through multiple antennas, and the orthogonal code applied to the plurality of second SC-FDMA symbols are differently configured for each of the multiple antennas.

3. The method according to claim 2, wherein spreading codes used for the spreading the control information block are orthogonal between the multiple antennas.

4. The method according to claim 1, wherein the orthogonal code is applied to the plurality of second SC-FDMA symbols at a slot level.

5. The method according to claim 4, wherein an orthogonal code is additionally applied to the plurality of second SC-FDMA symbols at a subframe level.

6. A UE configured to transmit control information in a wireless communication system, comprising:
at least one antenna; and
a processor
configured to:
spread a control information block corresponding to one single carrier frequency division multiplexing (SC-FDMA) symbol such that spread control information blocks correspond to a plurality of first SC-FDMA symbols,
DFT-precode the spread control information blocks on an SC-FDMA symbol basis,
generate a plurality of reference signal sequences corresponding to a plurality of second SC-FDMA symbols, wherein each of the plurality of reference signal sequences is generated by circular-shifting a base sequence,
transmit the DFT-precoded control information blocks through the plurality of first SC-FDMA symbols in a subframe through the at least one antenna, and
transmit the plurality of reference signal sequences through the plurality of second SC-FDMA symbols in the subframe through the at least one antenna,
wherein an orthogonal code is applied to the plurality of second SC-FDMA symbols in a time domain.

7. The UE according to claim 6, wherein the plurality of first SC-FDMA symbols and the plurality of second SC-FDMA symbols are transmitted through multiple antennas, and the orthogonal code applied to the plurality of second SC-FDMA symbols are differently configured for each of the multiple antennas.

8. The UE according to claim 7, wherein spreading codes used for the spreading the control information block are orthogonal between the multiple antennas.

9. The UE according to claim 6, wherein the orthogonal code is applied to the plurality of second SC-FDMA symbols at a slot level.

10. The UE according to claim 9, wherein an orthogonal code is additionally applied to the plurality of second SC-FDMA symbols at a subframe level.