# Patent

## Title
Multiplexing of channel state information and hybrid automatic repeat request—acknowledgement information

## Abstract

Embodiments of the present disclosure describe devices, methods, computer-readable media and systems configurations for multiplexing channel state information and hybrid automatic repeat request-acknowledgement information. Other embodiments may be described and claimed.

## Background
CROSS REFERENCE TO RELATED APPLICATIONS
The present application is a continuation of U.S. patent application Ser. No. 13/934,095, filed Jul. 2, 2013, entitled “MULTIPLEXING OF CHANNEL STATE INFORMATION AND HYBRID AUTOMATIC REPEAT REQUEST-ACKNOWLEDGEMENT INFORMATION,” which claims priority to U.S. Provisional Patent Application No. 61/667,325, filed Jul. 2, 2012, entitled “ADVANCED WIRELESS COMMUNICATION SYSTEMS AND TECHNIQUES,” and to U.S. Provisional Patent Application No. 61/679,627, filed Aug. 3, 2012, entitled “ADVANCED WIRELESS COMMUNICATION SYSTEMS AND TECHNIQUES,” the entire disclosures of which are hereby incorporated by reference.


FIELD
Embodiments of the present invention relate generally to the field of wireless communications, and more particularly, to multiplexing channel state information and hybrid automatic repeat request-acknowledgement information.
BACKGROUND
In Release 10 of the 3rd Generation Partnership Project (3GPP) Long Term Evolution-Advanced (LTE-A) standard, a conflict may occur when a user equipment is configured for carrier aggregation and the timing for multi-cell hybrid automatic repeat request-acknowledgement (HARQ-ACK) transmission using by a physical uplink control channel (PUCCH) format 1b with channel selection and for CSI using PUCCH format 2 is overlapped in the same subframe. In such an event, the UE drops the CSI and transmits the HARQ-ACK information using PUCCH format 1b with channel selection. However, the frequent dropping of the CSI due to collision between the CSI and the HARQ-ACK information may result in downlink throughput loss due to the unavailability of proper CSI feedback.



BRIEF DESCRIPTION OF THE DRAWINGS
Embodiments will be readily understood by the following detailed description in conjunction with the accompanying drawings. To facilitate this description, like reference numerals designate like structural elements. Embodiments are illustrated by way of example and not by way of limitation in the figures of the accompanying drawings.
FIG. 1 schematically illustrates a network environment in accordance with various embodiments.
FIG. 2 illustrates a method of transmitting uplink control information (UCI) in accordance with various embodiments.
FIG. 3 schematically illustrates a transmit module in accordance with various embodiments.
FIG. 4 schematically illustrates a transmit module in accordance with various embodiments.
FIG. 5 schematically illustrates an encoder module in accordance with various embodiments.
FIG. 6 illustrates a method of transmitting uplink control information (UCI) in accordance with various embodiments.
FIG. 7 illustrates phase modulation concepts in accordance with various embodiments.
FIG. 8 illustrates a method of transmitting UCI in accordance with various embodiments.
FIG. 9 illustrates multiplexing of UCI on PUSCH in accordance with various embodiments.
FIG. 10 schematically depicts an example system in accordance with various embodiments.



DETAILED DESCRIPTION
Illustrative embodiments of the present disclosure include, but are not limited to, methods, systems, computer-readable media, and apparatuses for multiplexing channel state information (CSI) and hybrid automatic repeat request-acknowledgement (HARQ-ACK) information. Embodiments described may enhance downlink throughput while reducing a dropping loss of CSI or HARQ-ACK information.
Various aspects of the illustrative embodiments will be described using terms commonly employed by those skilled in the art to convey the substance of their work to others skilled in the art. However, it will be apparent to those skilled in the art that alternate embodiments may be practiced with only some of the described aspects. For purposes of explanation, specific numbers, materials, and configurations are set forth in order to provide a thorough understanding of the illustrative embodiments. However, it will be apparent to one skilled in the art that alternate embodiments may be practiced without the specific details. In other instances, well-known features are omitted or simplified in order not to obscure the illustrative embodiments.
Further, various operations will be described as multiple discrete operations, in turn, in a manner that is most helpful in understanding the illustrative embodiments; however, the order of description should not be construed as to imply that these operations are necessarily order dependent. In particular, these operations need not be performed in the order of presentation.
The phrase “in some embodiments” is used repeatedly. The phrase generally does not refer to the same embodiments; however, it may. The terms “comprising,” “having,” and “including” are synonymous, unless the context dictates otherwise.
The phrase “A and/or B” means (A), (B), or (A and B). The phrases “A/B” and “A or B” mean (A), (B), or (A and B), similar to the phrase “A and/or B.”
As used herein, the term “module” refers to, is part of, or includes hardware components such as an Application Specific Integrated Circuit (ASIC), an electronic circuit, a logic circuit, a processor (shared, dedicated, or group) and/or memory (shared, dedicated, or group) that are configured to provide the described functionality. In some embodiments, the module may execute one or more software or firmware programs to provide at least some of the described functionality.
FIG. 1 schematically illustrates a network environment 100 in accordance with various embodiments. The network environment 100 includes a user equipment (UE) 104 wirelessly coupled with a radio access network (RAN) 108. The RAN 108 may include an enhanced node base station (eNB) 112 configured to communicate with the UE 104 via an over-the-air (OTA) interface. The RAN 108 may be part of a 3GPP LTE Advanced (LTE-A) network and may be referred to as an evolved universal terrestrial radio access network (EUTRAN). In other embodiments, other radio access network technologies may be utilized.
The UE 104 may include a communication device 116 that implements various communication protocols in order to effectuate communication with the RAN 108. The communication device 116 may be a chip, chipset, or other collection of programmed and/or pre-configured circuitry. In some embodiments, the communication device 116 may include or be part of baseband circuitry, a radio transceiver circuitry, etc.
The communication device 116 may include a HARQ-ACK module 120, a channel state information (CSI) module 124, and a transmit module 128 coupled with one another at least as shown.
The HARQ-ACK module 120 may implement various HARQ processes. For example, in some embodiments, the HARQ-ACK module 120 may determine whether downlink data was correctly received on a Physical Downlink Shared Channel (PDSCH). The HARQ-ACK module 120 may generate HARQ-ACK bit stream, which includes acknowledgement/negative acknowledgement (ACK/NACK) bits, to indicate whether codewords of a downlink transmission were successfully received. In some embodiments, the HARQ-ACK module 120 may generate one ACK/NACK bit for a single codeword downlink transmission and two ACK/NACK bits for a two-codeword downlink transmission. The ACK/NACK bits that correspond to a PDSCH transmission in subframe i-k may be transmitted in subframe i. The value k may be different in various embodiments and may depend on, for example, a frame structure type, a time division duplex (TDD) uplink/downlink (UL/DL) configuration, etc. The value k may be equal to four in some FDD embodiments. In some embodiments, the HARQ processes may be in accordance with relevant technical specifications, for example, 3GPP Technical Specification (TS) 36.213 V10.6.0 (26 Jun. 2012).
The CSI module 124 may control generation and transmission of various CSI components that relate to channel state. The CSI components could include, but are not limited to, channel quality indicator (CQI), precoding matrix indicator (PMI), rank indicator (RI), and precoding type indicator (PTI). In some embodiments, the UE 104 may be semi-statically configured by higher layers to periodically feedback the various CSI components on the PUCCH. In some embodiments, the CSI feedback may be in accordance with relevant technical specifications, for example, 3GPP TS 36.213.
The transmit module 128 may be coupled with both the HARQ-ACK module 120 and the CSI module 124. The transmit module 128 may receive a HARQ bit stream from the HARQ-ACK module 120 and a CSI bit stream from the CSI module 124. In some embodiments, a scheduling conflict (or collision) may occur when attempting to encode the HARQ bit stream and the CSI bit stream for transmission. For example, this may occur when the CSI bit stream, which may correspond to a one-cell periodic CSI, is to be transmitted using PUCCH format 2 and the HARQ bit stream, which may correspond to a multi-cell HARQ-ACK, is to be transmitted using PUCCH format 1b with channel selection.
PUCCH format 2 may be used, for example, to report wideband CQI/PMI and, in some embodiments, may include up to 11 bits. The CSI transmitted by PUCCH format 2 can be the final CSI for a certain downlink (DL) cooperative multipoint (CoMP) set and/or for a certain serving cell in a carrier aggregation (CA) scheme. Hereafter, the CA case may be assumed for convenience; however, similar concepts may be equally applicable for DL CoMP CSI feedback, which may require a greater number of CSI bits than a single cell operation.
PUCCH format 1b with channel selection may be used so that some of the HARQ-ACK information to be conveyed is indicated by selecting one of a number of possible PUCCH resources. PUCCH format 1b with channel selection may be utilized for UEs that support no more than four ACK/NACK bits and are configured with up to two component carriers (CCs) in a CA scheme. The payload sizes for HARQ-ACK information using PUCCH format 1b with channel selection may be vary from two to four bits.
If a transmission resource, for example, PUCCH format 2, that is to be used for both the CSI and the HARQ-ACK has a payload size of up to, for example, 13 bits, then a scheduling conflict may occur when a total number of uplink control information (UCI) bits, which may include both the ACK/NACK bits and the CSI bits, is over 13 bits. With up to 11 bits for the CSI and up to 4 bits for the HARQ-ACK, the UCI may include up to 15 bits, for example.
Upon detecting a potential scheduling conflict, the transmit module 128 may perform various resolution processes in the transmitting of the UCI.
FIG. 2 illustrates a method 200 in accordance with some embodiments. Method 200 may be performed by a transmit module of a UE, such as transmit module 128 of UE 104. In some embodiments, the UE may include and/or have access to one or more computer-readable media having instructions stored thereon, that, when executed, cause the UE, or the transmit module 128, to perform some or all of the method 200.
For purposes of the present discussion, A may refer to a number of UCI bits, which may depend on the transmission format; A′ may refer to a number of CSI bits (for example, A′=4, 5, . . . 11), C may refer to a maximum payload size that may be conveyed by PUCCH format 2 (for example, C=11 or 13), N may refer to a number of ACK/NACK bits for channel selection (for example, N=2, 3, or 4), a CSI bit stream may be represented by a′0, a′1, a′2, a′3, . . . , a′A′-1, and a HARQ-ACK bit stream may be represented by a′′0, a′′1, . . . , a′′N-1.
At 204, the method 200 may include detecting a potential scheduling conflict. As mentioned above, a potential scheduling conflict may occur when the CSI bit stream is to be transmitted using PUCCH format 2 and the HARQ bit stream is to be simultaneously transmitted using PUCCH format 1b with channel selection. In some embodiments, detection of a potential scheduling conflict may be done when a particular parameter is set. For example, this may be when simultaneousAckNackAndCQI, or an updated parameter such as simultaneousAckNackAndCQI-ChSel-rX for PUCCH format 1b with channel selection where X is a release-dependent number (e.g., 12), is true. In some embodiments, the parameter may be set by RRC signaling as described in 3GPP TS 36.331 v9.10.0 (14 Mar. 2012), for example.
At 208, the method 200 may include determining a number of UCI bits to be transmitted in a PUCCH transmission of a subframe. As mentioned above, the UCI bits may include ACK/NACK bits and CSI bits. In some embodiments, the UCI bits may further include one or more scheduling request (SR) bits.
At 212, the method 200 may include determining whether number of UCI bits is greater than a payload size capable of being conveyed by the PUCCH transmission of a subframe. In various embodiments, a payload capacity of a PUCCH transmission, having format 2, may be 13 bits, given capabilities of presently-available Reed-Muller (RM) coding.
If it is determined that the number of UCI bits to be transmitted is not greater than the payload size, then the method 200 may include, at 216, jointly coding CSI bits and ACK/NACK bits. The CSI and ACK/NACK bits may be multiplexed together and jointly coded for transmission on, for example, a PUCCH format 2 resource.
FIG. 3 illustrates a transmit module 300 that may be capable of multiplexing the CSI and ACK/NACK bits and jointly coding them on a PUCCH format 2 resource in accordance with some embodiments. The transmit module 300 may be similar to and substantially interchangeable with transmit module 128. Transmit module 300 may be a time domain structure of PUCCH format 2 for normal cyclical prefix (CP). In other embodiments, other structures may be used.
A multiplexer module 304 may multiplex the CSI bit stream with the HARQ-ACK information bit stream to yield a UCI bit stream, a, according to Equation 1.

[a0,a1,a2,a3, . . . ,aA-1]=[a′0,a′1,a′2a′3, . . . ,a′A′-1,a′′0,a′′1, . . . ,a′′N-1]   Equation 1

While the multiplexing of Equation 1 is shown with the HARQ-ACK information bit stream added to the end of the CSI bit stream, other embodiments may use other manners of multiplexing. For example, in another embodiment, the CSI bit stream may be added to the end of the HARQ-ACK bit stream. In still another embodiment, the CSI bit stream and HARQ-ACK bit stream may be interleaved with one another.
If SR is to be transmitted in the same subframe without an uplink shared channel (UL-SCH), the SR may also be multiplexed with the CSI and ACK/NACK bits. In some embodiments, the SR bit may be multiplexed at an end of the ACK/NACK bits. In some embodiments, an SR bit ‘1’ may represent a positive SR and an SR bit ‘0’ may represent a negative SR.
The UCI bit stream may be coded, by encoder module 308, using RM coding, tailbiting convolutional coding (TBCC), or some other suitable coding process to provide an encoded bit stream b. In some embodiments, the UCI bit stream may be coded according to a (20, A) RM code. The code words of the (20, A) RM code may be a linear combination of the 13 basis sequences denoted Mi,n and defined in Table 1.







TABLE 1







Basis sequences for (20, A) code




















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









The bits of the encoded bit stream may be denoted by b0, b1, b2, b3, . . . , bB-1 where B=20 and with




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

          
          ⁢
          where
        
        ⁢
        
          

        
        ⁢
        
          
            i
            =
            0
          
          ,
          1
          ,
          2
          ,
          ...
          ⁢
          
            
          
          ,
          
            B
            -
            1.
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        2
      
    
  




The encoded bit stream may be scrambled, by scrambler module 312, with a UE-specific scrambling sequence to provide a scrambled bit stream having scrambled bits {tilde over (b)}(0), . . . , {tilde over (b)}(19) according to

{tilde over (b)}(i)=(b(i)+c(i))mod 2,  Equation 3

where the scrambling sequence c(i) is a pseudo-random sequence (for example, a Gold sequence, pseudo-noise (PN) sequence, Kasami sequence, etc.). A scrambling sequence generator, which may be part of an encoder module 308, may be initialized with

cinit=(└ns/2┘+1)·(2NIDcell+1)·216+nRNTI  Equation 4

at the start of each subframe where nRNTI is a cell radio network temporary identifier (C-RNTI).
The scrambled bits {tilde over (b)}(0), . . . , {tilde over (b)}(19) may be modulated by modulator module 312. In some embodiments, the modulator module 314 may employ a quadrature phase shift keying (QPSK) modulation, resulting in a block of complex-valued modulation symbols d(0), . . . , d(9).
Each complex-valued symbol d(0), . . . , d(9) may be multiplied, by multiplier modules 3161-9, with a cyclically shifted length NseqPUCCH=12 sequence ru,v(α{tilde over (p)}) (n) for each of the P antenna ports used for PUCCH transmission according to




  
    
      
        
          
            
              z
              
                (
                
                  p
                  ~
                
                )
              
            
            ⁡
            
              (
              
                
                  
                    N
                    seq
                    PUCCH
                  
                  ·
                  n
                
                +
                i
              
              )
            
          
          =
          
            
              1
              
                P
              
            
            ⁢
            
              
                d
                ⁡
                
                  (
                  n
                  )
                
              
              ·
              
                
                  r
                  
                    u
                    ,
                    v
                  
                  
                    (
                    
                      α
                      
                        p
                        ~
                      
                    
                    )
                  
                
                ⁡
                
                  (
                  i
                  )
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            n
            =
            0
          
          ,
          1
          ,
          ...
          ⁢
          
            
          
          ,
          9
        
        ⁢
        
          

        
        ⁢
        
          
            i
            =
            0
          
          ,
          1
          ,
          ...
          ⁢
          
            
          
          ,
          
            
              N
              sc
              RB
            
            -
            1
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        5
        ⁢
        
          -
        
        ⁢
        7
      
    
  




where ru,v(α{tilde over (p)})(i) may be defined by section 5.5.1 of 3GPP TS 36.211 v10.5.0 (26 Jun. 2012) with MscRS=NseqPUCCH.
Resources used for transmission of PUCCH formats 2/2a/2b may be identified by a resource index nPUCCH(2,{tilde over (p)}) from which the cyclic shift α{tilde over (p)}(ns,l) is determined according to




  
    
      
        
          
        
        ⁢
        
          
            
              
                α
                
                  p
                  ~
                
              
              ⁡
              
                (
                
                  
                    n
                    s
                  
                  ,
                  l
                
                )
              
            
            =
            
              2
              ⁢
              
                
              
              ⁢
              
                π
                ·
                
                  
                    
                      n
                      cs
                      
                        (
                        
                          p
                          ~
                        
                        )
                      
                    
                    ⁡
                    
                      (
                      
                        
                          n
                          s
                        
                        ,
                        l
                      
                      )
                    
                  
                  /
                  
                    N
                    sc
                    RB
                  
                
              
            
          
          ,
          
            

          
          ⁢
          
            
          
          ⁢
          where
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        8
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            
              
                n
                cs
                
                  (
                  
                    p
                    ~
                  
                  )
                
              
              ⁡
              
                (
                
                  
                    n
                    s
                  
                  ,
                  l
                
                )
              
            
            =
            
              
                (
                
                  
                    
                      n
                      cs
                      cell
                    
                    ⁡
                    
                      (
                      
                        
                          n
                          s
                        
                        ,
                        l
                      
                      )
                    
                  
                  +
                  
                    
                      n
                      
                        p
                        ~
                      
                      ′
                    
                    ⁡
                    
                      (
                      
                        n
                        s
                      
                      )
                    
                  
                
                )
              
              ⁢
              mod
              ⁢
              
                
              
              ⁢
              
                N
                sc
                RB
              
            
          
          ⁢
          
            

          
          ⁢
          
            
          
          ⁢
          and
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        9
      
    
  
  
    
      
        
          
            n
            
              p
              ~
            
            ′
          
          ⁡
          
            (
            
              n
              s
            
            )
          
        
        =
        
          {
          
            
              
                
                  
                    
                      
                        n
                        PUCCH
                        
                          (
                          
                            2
                            ,
                            
                              p
                              ~
                            
                          
                          )
                        
                      
                      ⁢
                      mod
                      ⁢
                      
                        
                      
                      ⁢
                      
                        N
                        sc
                        RB
                      
                    
                  
                  
                    
                      
                        if
                        ⁢
                        
                          
                        
                        ⁢
                        
                          n
                          PUCCH
                          
                            (
                            
                              2
                              ,
                              
                                p
                                ~
                              
                            
                            )
                          
                        
                      
                      <
                      
                        
                          N
                          sc
                          RB
                        
                        ⁢
                        
                          N
                          RB
                          
                            (
                            2
                            )
                          
                        
                      
                    
                  
                
                
                  
                    
                      
                        (
                        
                          
                            n
                            PUCCH
                            
                              (
                              
                                2
                                ,
                                
                                  p
                                  ~
                                
                              
                              )
                            
                          
                          +
                          
                            N
                            cs
                            
                              (
                              1
                              )
                            
                          
                          +
                          1
                        
                        )
                      
                      ⁢
                      mod
                      ⁢
                      
                        
                      
                      ⁢
                      
                        N
                        sc
                        RB
                      
                    
                  
                  
                    otherwise
                  
                
              
              ⁢
              
                

              
              ⁢
              
                
              
              ⁢
              for
              ⁢
              
                
              
              ⁢
              
                n
                s
              
              ⁢
              
                
              
              ⁢
              mod
              ⁢
              
                
              
              ⁢
              2
            
            =
            
              0
              ⁢
              
                
              
              ⁢
              and
              ⁢
              
                
              
              ⁢
              by
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        10
      
    
  
  
    
      
        
          
            n
            
              p
              ~
            
            ′
          
          ⁡
          
            (
            
              n
              s
            
            )
          
        
        =
        
          {
          
            
              
                
                  
                    
                      [
                      
                        
                          N
                          sc
                          RB
                        
                        ⁡
                        
                          (
                          
                            
                              
                                n
                                
                                  p
                                  ~
                                
                                ′
                              
                              ⁡
                              
                                (
                                
                                  
                                    n
                                    s
                                  
                                  -
                                  1
                                
                                )
                              
                            
                            +
                            1
                          
                          )
                        
                      
                      ]
                    
                    ⁢
                    
                      mod
                      ⁡
                      
                        (
                        
                          
                            N
                            sc
                            RB
                          
                          +
                          1
                        
                        )
                      
                    
                  
                  -
                  1
                
              
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      
                        
                          
                            n
                            PUCCH
                            
                              (
                              
                                2
                                ,
                                
                                  p
                                  ~
                                
                              
                              )
                            
                          
                          <
                        
                      
                    
                    
                      
                        
                          
                            N
                            sc
                            RB
                          
                          ⁢
                          
                            N
                            RB
                            
                              (
                              2
                              )
                            
                          
                        
                      
                    
                  
                
              
            
            
              
                
                  
                    (
                    
                      
                        N
                        sc
                        RB
                      
                      -
                      2
                      -
                      
                        n
                        PUCCH
                        
                          (
                          
                            2
                            -
                            
                              p
                              ~
                            
                          
                          )
                        
                      
                    
                    )
                  
                  ⁢
                  mod
                  ⁢
                  
                    
                  
                  ⁢
                  
                    N
                    sc
                    RB
                  
                
              
              
                otherwise
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        11
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            for
            ⁢
            
              
            
            ⁢
            
              n
              s
            
            ⁢
            
              
            
            ⁢
            mod
            ⁢
            
              
            
            ⁢
            2
          
          =
          1.
        
      
    
    
      
        
      
    
  




For PUCCH formats 2a and 2b, supported for normal cyclic prefix only, the bit(s) b(20), . . . , b(Mbit−1) may be modulated as described in Table 2 resulting in a single modulation symbol d(10) used in the generation of the reference signal (RS) for PUCCH format 2a and 2b as described in section 5.4.2 of 3GPP TS 36.211 v10.5.0.









TABLE 2





PUCCH format
b(20), . . . , b(Mbit − 1)
d(10)

















2a
0
1



1
−1


2b
00
1



01
−j



10
 j



11
−1









The shifted symbols may then be transformed by respective inverse Fast Fourier Transform modules 3201-9 for transmission on respective PUCCH resource blocks. As can be seen in FIG. 3, resource blocks 1, 3, 4, 5, and 7 of the first and second slots may be PUCCH resource blocks, while resource blocks 2 and 6 are PUCCH demodulation reference signal (DRS) resource blocks.
In another embodiment, dual RM coding may be used to jointly code the CSI and ACK/NACK bits. Although any RM coding may be used, for example, (32, O) or (20, A), (20, A) may be assumed for purposes of discussion.
In another embodiment using dual RM coding, a first RM encoder can be used for the channel coding of first UCI and a second RM encoder can be used for the channel coding for a second UCI, where the first UCI may be CSI bits and the second UCI may be ACK/NACK bits or vice versa.
FIG. 4 illustrates a transmit module 400 in accordance with some embodiments. The transmit module 400 may be similar to and substantially interchangeable with transmit module 128. The transmit module 400 may be configured to provide dual RM coding for PUCCH format 2.
The transmit module 400 may include a multiplexer module 404 to multiplex the CSI bit stream with the ACK/NACK bit stream to yield the UCI bit stream similar to that discussed above.
The transmit module 400 may include a segmenter module 408 to segment the UCI bit stream into two parts. Each segment may be provided to a respective encoder module 412 and 416. The encoder modules 412 and 416 may be (20, A) RM encoders to encode the segmented bit streams.
The transmit module 400 may further include modulator modules 420 and 424 respectively coupled with the encoder modules 412 and 416. The modulator modules 420 and 424 may modulate the encoded bit streams, with QPSK modulation, for example, and provide five QPSK symbols each.
The transmit module 400 may further include a mapper module 428 coupled with the modulator modules 420 and 424 to receive the QPSK symbols. The mapper module 428 may alternatively map the 10 QPSK symbols as d(0)-d(9) for transmission on PUCCH format 2 resources.
In some embodiments, the mapper module 428 may be placed before the modulator modules 420 and 424. Such embodiments may provide a similar alternative mapping operation by mapping two bits from each segment in an alternative manner. Then, QPSK modulation may be applied.
In some embodiments, the joint coding of the CSI and ACK/NACK bits may be done with TBCC. A TBCC with constraint length of seven and a mother coding rate of 1/3 may be described below.
FIG. 5 illustrates an encoder module 500 that may be used in the transmit module 128 in accordance with various embodiments. The encoder module 500 may be a mother coding rate 1/3 tail biting convolutional encoder having an encoding section 504 and a rate matching section 508.
The encoding section 504 may include delay modules 512, serially coupled with one another, of a shift register 514 coupled with adder modules 516 as shown. An initial value of the shift register 514 of the encoding section 504 may be set to values corresponding to the last six information bits of an input stream, which may be the UCI bit stream, so that the initial and final stages of the shift register 514, corresponding to outputs of the first and last delay modules 512, respectively, are the same. Therefore, denoting the shift register 514 of the encoding section 504 by s0, s1, s2, . . . , s5, then the initial value of the shift register may be set to si=c(K-1-i).
The encoding section output streams, dk(0), dk(1) and dk(2), may correspond to the first, second, and third parity streams, respectively, as shown in FIG. 5.
The rate matching section 508 may include sub-block interleaver modules 520, 524, and 528 coupled with the encoding section 504 to respectively receive and subsequently interleave the output streams of the encoding section 504.
The bits input to the sub-block interleaver modules 520, 524, and 528 may be denoted by d0(i), d1(i), d2(i), . . . dD-1(i), where D is the number of bits. The interleaved streams may be derived as follows.
First, assign, CsubblockCC=32 to be the number of columns of a matrix. The columns of the matrix may be numbered 0, 1, 2, . . . , CsubblockCC−1 from left to right.
Second, determine a number of rows of the matrix RsubblockCC by finding a minimum integer RsubblockCC such that D≦(RsubblockCC×CsubblockCC). The rows of the rectangular matrix may be numbered 0, 1, 2, . . . RsubblockCC−1 from top to bottom.
Third, if RsubblockCC, then ND=(RsubblockCC×CsubblockCC−D) dummy bits may be padded such that yk=<NULL> for k=0, 1, . . . , ND−1. Then, yND+k=dk(i), k=0, 1, . . . , D−1, and the bit sequence yk is written into the (RsubblockCC×CsubblockCC) matrix row by row starting with bit y0 in column 0 or row 0:




  
    [
    
      
        
          
            y
            0
          
        
        
          
            y
            1
          
        
        
          
            y
            2
          
        
        
          ...
        
        
          
            y
            
              
                C
                subblock
                CC
              
              -
              1
            
          
        
      
      
        
          
            y
            
              C
              subblock
              CC
            
          
        
        
          
            y
            
              
                C
                subblock
                CC
              
              +
              1
            
          
        
        
          
            y
            
              
                C
                subblock
                CC
              
              +
              2
            
          
        
        
          ...
        
        
          
            y
            
              
                2
                ⁢
                
                  
                
                ⁢
                
                  C
                  subblock
                  CC
                
              
              -
              1
            
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
      
      
        
          
            y
            
              
                (
                
                  
                    R
                    subblock
                    CC
                  
                  -
                  1
                
                )
              
              ×
              
                C
                subblock
                CC
              
            
          
        
        
          
            y
            
              
                
                  (
                  
                    
                      R
                      subblock
                      CC
                    
                    -
                    1
                  
                  )
                
                ×
                
                  C
                  subblock
                  CC
                
              
              +
              1
            
          
        
        
          
            y
            
              
                
                  (
                  
                    
                      R
                      subblock
                      CC
                    
                    -
                    1
                  
                  )
                
                ×
                
                  C
                  subblock
                  CC
                
              
              +
              2
            
          
        
        
          ...
        
        
          
            y
            
              (
              
                
                  
                    
                      
                        R
                        subblock
                        CC
                      
                      ×
                    
                  
                
                
                  
                    
                      
                        C
                        subblock
                        CC
                      
                      -
                      1
                    
                  
                
              
              )
            
          
        
      
    
    ]
  
   




Fourth, perform inter-column permutation for the matrix based on the pattern P(j)jε{0, 1, . . . , CsubblockCC−1} that is shown in Table 3,







TABLE 3







Inter-column permutation for sub-block interleaver module








Number of columns
Inter-column permutation pattern


CsubblockCC
<P(0), P(1), . . . , P(CsubblockCC − 1)>





32
<1, 17, 9, 25, 5, 21, 13, 29, 3, 19,



11, 27, 7, 23, 15, 31, 0, 16, 8, 24,



4, 20, 12, 28, 2, 18, 10, 26, 6, 22,



14, 30>









where P(j) is an original column position of the jth permuted column. After permutation of the columns, the intercolumn permuted (RsubblockCC×CsubblockCC) matrix may be equal to:




  
    [
    
      
        
          
            y
            
              P
              ⁡
              
                (
                0
                )
              
            
          
        
        
          
            y
            
              P
              ⁡
              
                (
                1
                )
              
            
          
        
        
          
            y
            
              P
              ⁡
              
                (
                2
                )
              
            
          
        
        
          ...
        
        
          
            y
            
              P
              ⁡
              
                (
                
                  
                    C
                    subblock
                    CC
                  
                  -
                  1
                
                )
              
            
          
        
      
      
        
          
            y
            
              
                P
                ⁡
                
                  (
                  0
                  )
                
              
              +
              
                C
                subblock
                CC
              
            
          
        
        
          
            y
            
              
                P
                ⁡
                
                  (
                  1
                  )
                
              
              +
              
                C
                subblock
                CC
              
            
          
        
        
          
            y
            
              
                P
                ⁡
                
                  (
                  2
                  )
                
              
              +
              
                C
                subblock
                CC
              
            
          
        
        
          ...
        
        
          
            y
            
              
                
                  
                    
                      2
                      ⁢
                      P
                      ⁢
                      
                        (
                        
                          
                            C
                            subblock
                            CC
                          
                          -
                          1
                        
                        )
                      
                    
                    +
                  
                
              
              
                
                  
                    C
                    subblock
                    CC
                  
                
              
            
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋮
        
        
          ⋱
        
        
          ⋮
        
      
      
        
          
            y
            
              
                P
                ⁡
                
                  (
                  0
                  )
                
              
              +
              
                
                  (
                  
                    
                      R
                      subblock
                      CC
                    
                    -
                    1
                  
                  )
                
                ×
                
                  C
                  subblock
                  CC
                
              
            
          
        
        
          
            y
            
              
                P
                ⁡
                
                  (
                  1
                  )
                
              
              +
              
                
                  (
                  
                    
                      R
                      subblock
                      CC
                    
                    -
                    1
                  
                  )
                
                ×
                
                  C
                  subblock
                  CC
                
              
              +
              1
            
          
        
        
          
            Y
            
              
                P
                ⁡
                
                  (
                  2
                  )
                
              
              +
              
                
                  (
                  
                    
                      R
                      subblock
                      CC
                    
                    -
                    1
                  
                  )
                
                ×
                
                  C
                  subblock
                  CC
                
              
            
          
        
        
          ...
        
        
          
            y
            
              
                
                  
                    
                      P
                      ⁢
                      
                        (
                        
                          
                            C
                            subblock
                            CC
                          
                          -
                          1
                        
                        )
                      
                    
                    +
                  
                
              
              
                
                  
                    
                      (
                      
                        
                          R
                          subblock
                          CC
                        
                        -
                        1
                      
                      )
                    
                    ×
                  
                
              
              
                
                  
                    C
                    subblock
                    CC
                  
                
              
            
          
        
      
    
    ]
  
   




Fifth, the output of the sub-block interleaver modules 520, 524, and 528 may be the bit sequence read out column by column from the inter-column permuted (RsubblockCC×CsubblockCC)matrix. The bits after sub-block interleaving may be denoted by (RsubblockCC×CsubblockCC), where v0(i) corresponds to yP(0), v1(i) to yP(0)+CsubblockCC . . . and KΠ=(RsubblockCC×CsubblockCC). The interleaved streams, as shown in FIG. 5, may include vk(0), vk(1), and vk(2) respectively provided by sub-block interleaver modules 520, 524, and 528.
The sub-block interleaver modules 520, 524, and 528 may also be used in interleaving PDCCH modulation symbols. In that case, the input bit sequence may include PDCCH symbol quadruplets.
The rate matching section 508 may further include a bit collection module 532 coupled with the sub-block interleaver modules 520, 524, and 528 to receive the interleaved streams and a bit selection and pruning module 536 coupled with the bit collection module 532.
The bit collection module 532 may provide a virtual circular buffer to provide a bit-collection bit stream having a length of Kw=3KΠ that is generated as follows:

wk=vk(0) for k=0, . . . , KΠ−1

wKΠ+k=vk(1) for k=0, . . . , KΠ−1, and

w2KΠ+k=vk(2) for k=0, . . . , KΠ−1.

The rate matching output bit sequence may be ek, k=0, 1, . . . , E−1, wherein E denotes the rate matching output sequence length. The bit selection and pruning module 536 may generate the rate matching output bit sequence by the following algorithm.














Set k=0 and j=0



while {k < E}



 if wj mod Kw ≠< NULL >



  ek = wj mod Kw



  k=k+1



 end if



j=j+1



end while.









Referring again to FIG. 2, if it is determined, at 212, that the number of UCI bits to be transmitted is greater than the payload capacity, then the method 200 may include, at 220, discarding CSI bits and coding ACK/NACK bits for transmission using PUCCH format 1b with channel selection. While some embodiments may include discarding ACK/NACK bits instead of CSI bits, typically the ACK/NACK bits are associated with a relatively higher priority and, therefore, will not be discarded.
In some embodiments, only some of the CSI bits may be discarded. In such cases, a dropping rule may be implemented in order to provide a relative priority among the CSI bits. For example, CSI may be prioritized according to a PUCCH reporting type associated with the specific CSI information. For example, reporting types 3 (RI), 5 (RI/first PMI), 6 (RI/PTI), and 2a (wideband first PMI), may be associated with a first priority; reporting types 2 (wideband CQI/PMI), 2b (wideband first PMI), 2c (wideband CQI, first PMI, second PMI), and 4 (wideband CQI) may be associated with a second priority; and reporting types 1 (sub-band CQI) and 1a (sub-band CQI/second PMI) may be associated with a third priority. The specific type of CSI is shown in parentheticals. Thus, the third priority CSI will be dropped before the second priority CSI and the second priority CSI will be dropped before the first priority CSI. Among reporting types with the same priority, priority of a cell may decrease as a corresponding serving cell index (for example, ServCellIndex) increases. That is, the lower the cell index, the higher the priority.
The coding of the ACK/NACK bits, and any remaining CSI and/or SR bits, may be done using RM coding or TBCC such as the coding shown and described above.
In some embodiments, if the number of UCI bits includes an SR bit and is greater than the payload size and if SR is positive, the ACK/NACK bits may be transmitted on the SR PUCCH resource and CSI can be dropped.
FIG. 6 illustrates a method 600 in accordance with other embodiments. Method 600 may be performed by a transmit module of a UE, such as transmit module 128 of UE 104. In some embodiments, the UE may include and/or have access to one or more computer-readable media having instructions stored thereon, that, when executed, cause the UE, or the transmit module 128, to perform some or all of the method 600.
At 604, the method 600 may include detecting a potential scheduling conflict. As mentioned above, a potential scheduling conflict may occur when the CSI bit stream is to be transmitted using PUCCH format 2 and the HARQ bit stream is to be transmitted using PUCCH format 1b with channel selection.
At 608, the method 600 may include determining a number of UCI bits to be transmitted in a PUCCH transmission of a subframe.
At 612, the method 600 may include determining whether the number of UCI bits is greater than a payload capacity of the PUCCH transmission of a subframe. In various embodiments, a payload capacity of a PUCCH format 2 transmission may be 13 bits, given capabilities of presently-available RM coding.
If it is determined that the number of UCI bits to be transmitted is not greater than the payload capacity, then the method 600 may include, at 616, jointly coding CSI bits and ACK/NACK bits. This may be done similar to that described above with respect to 216 of method 200.
If it is determined, at 612, that the number of UCI bits to be transmitted is greater than the payload capacity, then the method 600 may include, at 620, bundling ACK/NACK bits. In some embodiments, if the number of ACK/NACK bits is more than two, they may be compressed (or bundled) to make the number of ACK/NACK bits no more than two.
If transmit module is configured for frequency division duplexing (FDD), spatial bundling per serving cell may be applied. A most significant bit (MSB) may represent spatial-bundled HARQ-ACK for a primary cell (PCell) and a least significant bit (LSB) may represent spatial-bundled HARQ-ACK for a secondary cell (SCell). The bundling may be done by a logical AND operation. For example, an ACK and NACK/discontinuous transmission (DTX) may be mapped to 1 and 0, respectively. The logical AND operation for the bit representation may then be applied as follows:
ACK, ACK→bundled HARQ-ACK is ACK;
ACK, NACK/DTX→bundled HARQ-ACK is NACK;
NACK/DTX, ACK→bundled HARQ-ACK is NACK; and
NACK/DTX, NACK/DTX→bundled HARQ-ACK is NACK.
Thus, four ACK/NACK bits (two for the PCell and two for the SCell) may be compressed to two bundled ACK/NACK bits (one for the PCell and one for the SCell).
While the above bundling describes use of a logical AND operation, other embodiments may use other logical operations, such as a logical OR operation.
If transmit module is configured for time division duplexing (TDD), the number of an ACK counter may be used for the bundling operation. The value of b(0), b(1) may be generated according to Table 4 from




  
    N
    SPS
  
  +
  
    
      ∑
      
        c
        =
        0
      
      
        
          N
          cells
          DL
        
        -
        1
      
    
    ⁢
    
      
    
    ⁢
    
      U
      
        DAI
        ,
        c
      
    
  




HARQ-ACK responses including ACK in response to PDCCH indicating downlink SPS release by spatial HARQ-ACK bundling across multiple codewords within each PDSCH transmission for all serving cells NcellsDL. For TDD UL-DL configurations 1-6, if





  
    
      ∑
      
        c
        =
        0
      
      
        
          N
          cells
          DL
        
        -
        1
      
    
    ⁢
    
      
    
    ⁢
    
      U
      
        DAI
        ,
        c
      
    
  
  >
  0




and VDAI,cDL≠(UDAI,c−1)mod 4+1 for a serving cell c, the UE may detect that at least one downlink assignment has been missed.








TABLE 4







Mapping between multiple HARQ-ACK responses and b(0), b(1)










Number of ACK among multiple   



  (
  
    
      N
      SPS
    
    +
    
      
        ∑
        
          c
          =
          0
        
        
          
            N
            cells
            DL
          
          -
          1
        
      
      ⁢
      
        
      
      ⁢
      
        U
        
          DAI
          ,
          c
        
      
    
  
  )



   HARQ-ACK responses
      b(0) , b(1)







0 or None (UE detect at least one DL
0 0



assignment is missed)




1
1, 1



2
1, 0



3
0, 1



4
1, 1



5
1, 0



6
0, 1



7
1, 1



8
1, 0



9
0, 1










NSPS may be the number of PDSCH transmissions without a corresponding PDCCH within the subframe(s) n-k in serving cell c, where kεK (0 or 1).
NcellsDL may be the number of configured DL serving cells (with channel selection, this value is 2).
VDAI,cDL may be the value of the downlink assignment index (DAI) in PDCCH with DCI format 1/1A/1B/1D/2/2A/2B/2C detected by the UE according to Table 5 in subframe n-km in serving cell c, where km is the smallest value in the set K, defined in Table 6 such that the UE detects a DCI format 1/1A/1B/1D/2/2A/2B/2C as defined in 3GPP TS 36.213.







TABLE 5







Value of Downlink Assignment Index











Number of subframes with




PDSCH transmission and


DAI

with PDCCH/EPDCCH


MSB, LSB
VDAIUL or VDAIDL
indicating DL SPS release





0, 0
1
1 or 5 or 9


0, 1
2
2 or 6


1, 0
3
3 or 7


1, 1
4
0 or 4 or 8
















TABLE 6







Downlink association set index K: for {k0, k1, . . . kM−1} TDD








UL/DL



Config-
Subframe n

















uration
0
1
2
3
4
5
6
7
8
9





0
—
—
6
—
4
—
—
6
—
4


1
—
—
7, 6
4
—
—
—
7, 6
4
—


2
—
—
8, 7, 4, 6
—
—
—
—
8, 7, 4, 6
—
—


3
—
—
7, 6, 11
6, 5
5, 4
—
—
—
—
—


4
—
—
12, 8, 7, 11
6, 5, 4, 7 
—
—
—
—
—
—


5
—
—
13, 12, 9, 8, 
—
—
—
—
—
—
—





7, 5, 4, 11, 6









6
—
—
7
7
5
—
—
7
7
—









UDAI,c may be the total number of PDCCH(s) with assigned PDSCH transmission(s) and PDCCH indicating downlink SPS release detected by the UE within the subframe(s) n-k in serving cell c, where kεK
Referring again to FIG. 6, upon bundling the ACK/NACK bits at 620, the method 600 may include, at 624, transmitting the bundled ACK/NACK bits and the CSI bits. The bundled HARQ-ACK may be transmitted either by phase modulation on a second reference signal (RS) using PUCCH format 2 or by joint coding of the CSI and the bundled HARQ-ACK using PUCCH format 2. The joint coding may be TBCC, RM coding, or dual RM coding, similar to that described above
In another embodiment, the phase modulation process may be used for normal CP case and the joint coding process, for example TBCC, may be used for extended CP since the number of RS symbols in a slot for extended CP is one that is not available for RS modulation. This embodiment may be described in further detail below with respect to FIG. 8. If SR is also part of the UCI, then the SR may be treated as a part of the ACK/NACK bits. If an SR bit is not part of the UCI and a scheduling request is positive, then the bundled HARQ-ACK may be transmitted on an SR resource.
In some embodiments, phase modulation may be applied as follows. For PUCCH formats 2a and 2b, supported for normal cyclic prefix only, the bits b(20), . . . , b(Mbit−1) may be modulated as described in Table 7 resulting in a single modulation symbol d(10) used in the generation of the reference signal for PUCCH format 2a and 2b. Since the above-bundled HARQ-ACK bits may be two, Mbit may be 22. That is, b(20) and b(21) may be bundled HARQ-ACK bits.







TABLE 7







Modulation symbol d(10) for PUCCH formats 2a and 2b









PUCCH format
b(20), . . . , b(Mbit − 1)
d(10)












2a
0
1



1
−1


2b
00
1



01
−j



10
 j



11
−1









FIG. 7 illustrates phase modulation using PUCCH format 2b in accordance with some embodiments. As can be seen in FIG. 7, the second RS of each slot may be modulated by d(10) to transmit the bundled HARQ-ACK.
In still another embodiment, for normal CP, a hybrid scheme may be used, while joint coding is used for extended CP. A hybrid scheme may involve a first operation in which HARQ-ACK mapped states are developed using, for example, time-domain compression. This may result in four bundled ACK/NACK bits, b0, b1, b2, and b3. A first set of the bundled ACK/NACK bits, for example, two bits, b0 and b1, may be jointly coded with CSI bits, while a second set of the bundled ACK/NACK bits, for example, the remaining two bits, b2 and b3, may be separately coded. The encode first set may be moduled on a non-referency symbol, while the second encoded set may modulated with an RS symbol in a second slot of PUCCH format 2.
The above methods 200 and 600 respectively describe that, when a number of UCI bits is greater than a payload capacity of a PUCCH format 2 transmission, for example, the CSI bits may be dropped or the ACK/NACK bits may be bundeled. However, in other embodiments, the UCI bits may be jointly coded using TBCC, which in some embodiments may be capable of increasing payload capacity to 15 or even 20 bits.
FIG. 8 illustrates a method 800 in accordance with another embodiment. Method 200 may be performed by a transmit module of a UE, such as transmit module 128 of UE 104. In some embodiments, the UE may include and/or have access to one or more computer-readable media having instructions stored thereon, that, when executed, cause the UE, or the transmit module 128, to perform some or all of the method 200.
The method 800 may include, at 804, recognizing a potential collision between transmitting periodic CSI and HARQ-ACK in a subframe. In some embodiments, this may be similar to determining a potential scheduling conflict as discussed above.
At 808, the method 800 may include determining a number of UCI bits to be transmitted.
At 812, the method 800 may include determining whether a number of UCI bits is greater than a payload capacity of a subframe using PUCCH format 2, for example.
If, at 812, it is determined that the number of UCI bits is not greater than the payload capacity, then the method 800 may include, at 816, jointly coding the UCI bits, using TBCC, for example, and modulating them on non-reference symbols of the subframe. Other embodiments described herein may similarly modulate the jointly coded UCI bits on the non-reference symbols of the subframe.
If, at 812, it is determined that the number of UCI bits is greater than the payload capacity, then the method 800 may include, at 820, determining whether an extended CP is used.
If, at 820, it is determined that an extended CP is used, then the method 800 may loop back to jointly coding the UCI bits and modulating them on non-reference symbols of the subframe at 816.
If, at 820, it is determined that an extended CP is not used (for example, a normal CP is used), then the method may include, at 824, bundling ACK/NACK bits and encoding CSI bits.
Following 824, the method 800 may include, at 828, modulating bundled ACK/NACK bits on second reference symbol of the subframe and encoded CSI bits on non-reference symbols.
In a general HARQ-ACK procedure, the HARQ-ACK codebook size may be determined by a radio resource control (RRC) configuration level such as the number of configured serving cells and configured transmission modes. On the other hand, the CSI reporting may be done for the activated cells only by a media access control (MAC) control element (CE). In general, the change by the MAC CE is more frequent than by RRC. In Rel-10 of 3GPP LTE-A, the CSI reporting in a transient period by activation/deactivation may be ignored by the eNB since the information may not be available until the eNB knows the UE successfully receives the MAC CE. However, with joint coding of HARQ-ACK and CSI, the contents may not be easily ignored because the HARQ-ACK may not be ignored due to its importance. These situations may be handled as follows. As used below, “multiplexing of CSI and HARQ-ACK” may refer to jointly encoding CSI and ACK/NACK bits, for example.
In some embodiments, in case of multiplexing of CSI and HARQ-ACK information, the payload size may be a predetermined value, for example, 13 bits, that corresponds to the payload capacity of PUCCH format 2. Any remaining information bits, other than CSI and ACK/NACK bits, may be padded by a predetermined bit or bit pattern, for example, all ‘0’. An eNB may decode the PUCCH based on the predetermined value. Thus, even if the eNB assumes a wrong CSI payload size, the HARQ-ACK information can survive.
In some embodiments, in case of multiplexing of CSI and HARQ-ACK, a concatenation may be performed according to a predefined order to ensure the reliability of the HARQ-ACK information. In such embodiments, the CSI bits may be appended at an end of a sequence of concatenated ACK/NACK bits.
In some embodiments, in case of multiplexing of CSI and HARQ-ACK, the multiplexed CSI may always be for the PCell. In particular, this may be done for the CC activation/deactivation ambiguity period. As the PCell will not be deactivated, there will be no ambiguity. If the subframe in which the CSI and HARQ-ACK is to be transmitted is not for CSI reporting for the PCell, the payload for CSI may be reserved, zero-padded, or predetermined value-padded. Alternatively, if the subframe in which the CSI and HARQ-ACK is to be transmitted is not for CSI reporting for the PCell, the CSI content may be dropped and the HARQ-ACK information may be transmitted by PUCCH format 1b with channel selection.
In some embodiments, in case of multiplexing of CSI and HARQ-ACK, the jointly-coded CSI may be for a serving cell that is predetermined or RRC-configured. In particular, this may be useful during the CC activation/deactivation ambiguity period. If the subframe in which the CSI and HARQ-ACK is to be transmitted is not for CSI reporting for the configured (or predetermined) SCell, the payload for CSI may be reserved, zero-padded, or predetermined value-padded. Alternatively, if the subframe in which the CSI and HARQ-ACK is to be transmitted is not for CSI reporting for the configured (or predetermined) SCell, the CSI content may be dropped and the HARQ-ACK information may be transmitted by PUCCH format 1b with channel selection.
In some embodiments, the multiplexing of CSI and HARQ-ACK may be done only when the CSI reporting is to be done for the predetermined serving cell(s). In particular, this may be useful during the CC activation/deactivation ambiguity period. The predetermined serving cells may be predetermined by a technical specification, primary cell (or cell with the lowest cell index), or RRC-configured cell(s). When CSI reporting is not to be done for the predetermined serving cell(s), the CSI may be dropped and the HARQ-ACK may be done by PUCCH format 1b with channel selection, or other multiplexing methods may be used, for example, phase modulation for bundled ACK/NACK on the second RS in a slot or joint coding of CSI and bundled ACK/NACK.
FIG. 9 illustrates multiplexing of UCI on PUSCH (for normal CP) in accordance with some embodiments. FIG. 9 illustrates resource blocks of a subframe. The RBs may include one or more single-carrier (SC) frequency division multiple access (FDMA) symbols over one or more virtual sub-carriers (discrete Fourier transform (DFT) input).
If a UE is not configured by simultaneous transmission of PUSCH and PUCCH and if PUSCH is transmitted on the subframe that is also transmitted by PUCCH that contains periodic CSI and/or ACK/NACK bits, the CSI and/or ACK/NACK bits may be piggybacked on PUSCH together with the UL-SCH.
The periodic CSI and the HARQ-ACK may be piggybacked on PUSCH as seen in FIG. 9. The piggybacked HARQ-ACK may be either original HARQ-ACK for PUCCH format 1b with channel selection or bundled HARQ-ACK depending on the use case. Alternatively, individual ACK/NACK bits as in PUCCH format 3 may be piggybacked on PUSCH.
The UE 104 described herein may be implemented into a system using any suitable hardware and/or software to configure as desired. FIG. 10 illustrates, for one embodiment, an example system 1000 comprising one or more processor(s) 1004, system control logic 1008 coupled with at least one of the processor(s) 1004, system memory 1012 coupled with system control logic 1008, non-volatile memory (NVM)/storage 1016 coupled with system control logic 1008, a network interface 1020 coupled with system control logic 1008, and input/output (I/O) devices 1032 coupled with system control logic 1008.
The processor(s) 1004 may include one or more single-core or multi-core processors. The processor(s) 1004 may include any combination of general-purpose processors and dedicated processors (e.g., graphics processors, application processors, baseband processors, etc.).
System control logic 1008 for one embodiment may include any suitable interface controllers to provide for any suitable interface to at least one of the processor(s) 1004 and/or to any suitable device or component in communication with system control logic 1008.
System control logic 1008 for one embodiment may include one or more memory controller(s) to provide an interface to system memory 1012. System memory 1012 may be used to load and store data and/or instructions, e.g., feedback logic 1024. System memory 1012 for one embodiment may include any suitable volatile memory, such as suitable dynamic random access memory (DRAM), for example.
NVM/storage 1016 may include one or more tangible, non-transitory computer-readable media used to store data and/or instructions, e.g., feedback logic 1024. NVM/storage 1016 may include any suitable non-volatile memory, such as flash memory, for example, and/or may include any suitable non-volatile storage device(s), such as one or more hard disk drive(s) (HDD(s)), one or more compact disk (CD) drive(s), and/or one or more digital versatile disk (DVD) drive(s), for example.
The NVM/storage 1016 may include a storage resource physically part of a device on which the system 1000 is installed or it may be accessible by, but not necessarily a part of, the device. For example, the NVM/storage 1016 may be accessed over a network via the network interface 1020 and/or over Input/Output (I/O) devices 1032.
The feedback logic 1024 may include instructions that, when executed by one or more of the processors 1004, cause the system 1000 to perform feedback of UCI as described with respect to the above embodiments. In various embodiments, the feedback logic 1024 may include hardware, software, and/or firmware components that may or may not be explicitly shown in system 1000.
Network interface 1020 may have a transceiver 1022 to provide a radio interface for system 1000 to communicate over one or more network(s) and/or with any other suitable device. In various embodiments, the transceiver 1022 may be integrated with other components of system 1000. For example, the transceiver 1022 may include a processor of the processor(s) 1004, memory of the system memory 1012, and NVM/Storage of NVM/Storage 1016. Network interface 1020 may include any suitable hardware and/or firmware. Network interface 1020 may include a plurality of antennas to provide a multiple input, multiple output radio interface. Network interface 1020 for one embodiment may include, for example, a wired network adapter, a wireless network adapter, a telephone modem, and/or a wireless modem.
For one embodiment, at least one of the processor(s) 1004 may be packaged together with logic for one or more controller(s) of system control logic 1008. For one embodiment, at least one of the processor(s) 1004 may be packaged together with logic for one or more controllers of system control logic 1008 to form a System in Package (SiP). For one embodiment, at least one of the processor(s) 1004 may be integrated on the same die with logic for one or more controller(s) of system control logic 1008. For one embodiment, at least one of the processor(s) 1004 may be integrated on the same die with logic for one or more controller(s) of system control logic 1008 to form a System on Chip (SoC).
In various embodiments, the I/O devices 1032 may include user interfaces designed to enable user interaction with the system 1000, peripheral component interfaces designed to enable peripheral component interaction with the system 1000, and/or sensors designed to determine environmental conditions and/or location information related to the system 1000.
In various embodiments, the user interfaces could include, but are not limited to, a display (e.g., a liquid crystal display, a touch screen display, etc.), speakers, a microphone, one or more cameras (e.g., a still camera and/or a video camera), a flashlight (e.g., a light emitting diode flash), and a keyboard.
In various embodiments, the peripheral component interfaces may include, but are not limited to, a non-volatile memory port, a universal serial bus (USB) port, an audio jack, and a power supply interface.
In various embodiments, the sensors may include, but are not limited to, a gyro sensor, an accelerometer, a proximity sensor, an ambient light sensor, and a positioning unit. The positioning unit may also be part of, or interact with, the network interface 1020 to communicate with components of a positioning network, e.g., a global positioning system (GPS) satellite.
In various embodiments, the system 1000 may be a mobile computing device such as, but not limited to, a laptop computing device, a tablet computing device, a netbook, a smartphone, etc. In various embodiments, system 1000 may have more or less components, and/or different architectures.
Although certain embodiments have been illustrated and described herein for purposes of description, a wide variety of alternate and/or equivalent embodiments or implementations calculated to achieve the same purposes may be substituted for the embodiments shown and described without departing from the scope of the present disclosure. This application is intended to cover any adaptations or variations of the embodiments discussed herein. Therefore, it is manifestly intended that embodiments described herein be limited only by the claims and the equivalents thereof.
Some non-limiting examples are provide below.
Example 1 includes an apparatus for transmitting uplink control information comprising: a hybrid automatic repeat request-acknowledgement (HARQ-ACK) module to generate a HARQ-ACK bit stream to indicate whether downlink data was successfully received on a physical downlink shared channel (PDSCH); a channel state indicator module (CSI) to generate a CSI bit stream that relates to a channel state; and a transmit module coupled with the HARQ-ACK module to receive the HARQ-ACK bit stream and further coupled with the CSI module to receive the CSI bit stream, the transmit module to: jointly code the HARQ-ACK bit stream and the CSI bit stream on a physical uplink control channel (PUCCH) transmission if the number of uplink control information (UCI) bits, which include bits of the HARQ-ACK bit stream and the CSI bit stream, to be transmitted is not greater than a payload capacity of the PUCCH transmission; and discard at least some bits of the CSI bit stream or bundle at least some of the bits of the HARQ-ACK bit stream if the number of UCI bits is greater than the payload capacity.
Example 2 includes the apparatus of example claim 1, wherein if the number of the UCI bits is less than or equal to the payload capacity, the transmit module is to jointly code the bits of the HARQ-ACK bit stream and the CSI bit stream with a Reed-Muller (RM) code.
Example 3 includes the apparatus of example 2, wherein the RM code is a dual RM code.
Example 4 includes the apparatus of example 3, wherein the transmit module further comprises: a first RM encoder module to code a first segment of a UCI bit stream; and a second RM encoder module to code a second segment of the UCI bit stream.
Example 5 includes the apparatus of example 4, wherein the first segment is bits of the CSI bit stream and the second segment is bits of the HARQ-ACK bit stream.
Example 6 includes the apparatus of example 1, wherein the number of the UCI bits is less than or equal to the payload capacity and the transmit module is to jointly code the bits of the HARQ-ACK bit stream and the CSI bit stream with a tailbiting convolutional code (TBCC).
Example 7 includes the apparatus of example 1, wherein the PUCCH transmission is a PUCCH Format 2 transmission.
Example 8 includes the apparatus of any of examples 1-7, wherein the UCI bits includes a scheduling request (SR) bit that indicates a positive SR, the number of UCI bits is greater than the payload capacity, and the transmit module is further to: transmit bits of the HARQ-ACK bit stream on an SR PUCCH and drop the bits of the CSI bit stream.
Example 9 includes an apparatus for transmitting uplink control information comprising: a hybrid automatic repeat request-acknowledgement (HARQ-ACK) module to generate a HARQ-ACK bit stream to indicate whether downlink data was successfully received on a physical downlink shared channel (PDSCH); a channel state indicator module (CSI) to generate a CSI bit stream that relates to a channel state; and
a transmit module coupled with the HARQ-ACK module to receive the HARQ-ACK bit stream and further coupled with the CSI module to receive the CSI bit stream, the transmit module to:
detect a potential scheduling conflict between a hybrid automatic repeat request-acknowledgement (HARQ-ACK) transmission using channel selection and a channel state information (CSI) transmission; and jointly code, based on detection of a potential scheduling conflict CSI bits of the CSI transmission and ACK/NACK bits of the HARQ-ACK transmission, on a physical uplink control channel (PUCCH) of a subframe with a tailbiting convolutional code (TBCC).
Example 10 includes the apparatus of example 9, wherein the PUCCH transmission is a PUCCH Format 2 transmission.
Example 11 includes the apparatus of example 9, wherein the transmit module comprises: an encoder section to generate a plurality of output streams based on the CSI bit stream and the HARQ-ACK bit stream; and a rate matcher coupled with the encoding section to receive the plurality of output streams and to generate a serial output bit sequence based on the plurality of output streams.
Example 12 includes the apparatus of example 11, wherein the encoding section comprises: a plurality of delay elements serially coupled with one another; and a plurality of adder elements coupled with the plurality of delay elements.
Example 13 includes the apparatus of example 11, wherein the rate matcher comprises: a plurality of sub-block interleaver modules to respectively receive the plurality of output streams from the encoder section and to provide a respective plurality of interleaved streams; a bit collection module coupled with the plurality of sub-block interleaver modules to receive the plurality of interleaved streams, to provide a virtual circular buffer to output a bit-collection bit stream; and a bit selection and pruning module coupled with the bit collection module to receive the bit-collection bit stream and provide a rate-matched output bit sequence.
Example 14 includes the apparatus of any of examples 9-13, wherein the TBCC has a constraint length of seven and a mother coding rate of 1/3.
Example 15 includes a method for transmitting uplink control information comprising: recognizing a potential collision between transmitting periodic channel state information (CSI) and transmitting hybrid automatic repeat request-acknowledgement (HARQ-ACK) in a subframe; determining a number of uplink control information (UCI) bits, which includes CSI bits of the CSI transmission and ACK/NACK bits of the HARQ-ACK transmission, to be transmitted in the subframe using a physical uplink control channel (PUCCH); if a normal cyclic prefix is used, modulating bundled ACK/NACK bits on a second reference signal (RS) symbol of the subframe and modulating, after channel coding, encoded CSI bits on non-RS symbols; and if an extended cyclic prefix is used, jointly coding the CSI bits and the ACK/NACK bits and modulating the jointly encoded CSI bits and ACK/NACK bits on non-RS symbols of the subframe.
Example 16 includes the method of example 15, wherein if a normal cyclic prefix is used, the method further comprises: bundling the ACK/NACK bits.
Example 17 includes the method of example 16, wherein a transmit module is configured for frequency division duplexing and the bundling of the ACK/NACK bits comprises: spatially bundling the ACK/NACK bits by having a most significant bit represent spatially-bundled HARQ-ACK for a primary cell and a least significant bit represent spatially-bundled HARQ-ACK for a secondary cell.
Example 18 includes the method of example 17, wherein the spatial bundling is based on a logical AND operation.
Example 19 includes the method of example 16, wherein a transmit module is configured for time division duplexing and the bundling of the ACK/NACK bits comprises: using a number of an ACK counter that tracks a number of ACKs among multiple HARQ-ACK responses to generate the bundled ACK/NACK bits.
Example 20 includes a system for wireless communications comprising: user interfaces that include a display, a speaker, and a microphone; and a communication device coupled with the user interfaces to transmit and receive data over a wireless network, the communication device including: a hybrid automatic repeat request-acknowledgement (HARQ-ACK) module to generate a HARQ-ACK bit stream to indicate whether downlink data was successfully received on a physical downlink shared channel (PDSCH); a channel state indicator module (CSI) to generate a CSI bit stream that relates to a channel state; and a transmit module coupled with the HARQ-ACK module to receive the HARQ-ACK bit stream and further coupled with the CSI module to receive the CSI bit stream, the transmit module to: if an extended cyclic prefix is used, jointly code bits of the HARQ-ACK bit stream and bits of the CSI bit stream; and if a normal cyclic prefix is used, jointly code a first set of bits of the HARQ-ACK bit stream with bits of the CSI bit stream and separately code a second set of bits of the HARQ-ACK bit stream.
Example 21 includes the system of example 20, wherein, if a normal cyclic prefix is used, the transmit module is further to: modulate jointly encoded first set of bits of the HARQ-ACK bit stream and bits of the CSI bit stream on a non-reference signal (RS) symbol of a subframe; and modulate the seperately coded second set of bits of the HARQ-ACK bit stream on a RS symbol of the subframe.
Example 22 includes the system of example 21, wherein the reference signal symbol is in a second slot of the subframe.
Example 23 includes the system of example 20, wherein the transmit module is to jointly code the bits of the HARQ-ACK bit stream and bits of the CSI bit stream with a dual RM code.
Example 24 includes the system of example 20, wherein the transmit module is to jointly code the bits of the HARQ-ACK bit stream and the bits of the CSI bit stream with a tailbiting convolutional code (TBCC).
Example 25 includes the system of any of examples 20-24, wherein transmit module is to transmit the HARQ-ACK bit stream and the CSI bit stream on a physical uplink control channel (PUCCH) Format 2 transmission.
Example 26 includes an apparatus for transmitting uplink control information comprising: means for recognizing a potential collision between transmitting periodic channel state information (CSI) and transmitting hybrid automatic repeat request-acknowledgement (HARQ-ACK) in a subframe; means for determining a number of uplink control information (UCI) bits, which includes CSI bits of the CSI transmission and ACK/NACK bits of the HARQ-ACK transmission, to be transmitted in the subframe using a physical uplink control channel (PUCCH); if a normal cyclic prefix is used, means for modulating bundled ACK/NACK bits on a second reference signal (RS) symbol of the subframe and modulating, after channel coding, encoded CSI bits on non-RS symbols; and if an extended cyclic prefix is used, means for jointly coding the CSI bits and the ACK/NACK bits and modulating the jointly encoded CSI bits and ACK/NACK bits on non-RS symbols of the subframe.
Example 27 includes the apparatus of example 26, further comprising: means for bundling the ACK/NACK bits if a normal cyclic prefix is used.
Example 28 includes the apparatus of example 27, wherein the apparatus is configured for frequency division duplexing and further comprises: means for spatially bundling the ACK/NACK bits by having a most significant bit represent spatially-bundled HARQ-ACK for a primary cell and a least significant bit represent spatially-bundled HARQ-ACK for a secondary cell.
Example 29 includes the apparatus of example 28, wherein the spatial bundling is based on a logical AND operation.
Example 30 includes the apparatus of example 27, wherein the apparatus is configured for time division duplexing and further comprises: means for using a number of an ACK counter that tracks a number of ACKs among multiple HARQ-ACK responses to generate the bundled ACK/NACK bits.
Example 31 includes one or more computer readable media having instructions that, when executed, cause a communication device to jointly code bits of an hybrid automatic repeat request-acknowledgement (HARQ-ACK) bit stream and bits of a channel state information (CSI) bit stream if an extended cyclic prefix is used; and jointly code a first set of bits of the HARQ-ACK bit stream with bits of the CSI bit stream and separately code a second set of bits of the HARQ-ACK bit stream if a normal cyclic prefix is used.
Example 32 includes the one or more computer readable media of example 31, wherein, if a normal cyclic prefix is used, the instructions further cause the device to: modulate jointly encoded first set of bits of the HARQ-ACK bit stream and bits of the CSI bit stream on a non-reference signal (RS) symbol of a subframe; and modulate the seperately coded second set of bits of the HARQ-ACK bit stream on a RS symbol of the subframe.
Example 33 includes the one or more computer-readable media of example 32, wherein the reference signal symbol is in a second slot of the subframe.
Example 34 includes an apparatus for transmitting uplink control information comprising: means for generating a HARQ-ACK bit stream to indicate whether downlink data was successfully received on a physical downlink shared channel (PDSCH); means for generating a CSI bit stream that relates to a channel state; and means for detecting a potential scheduling conflict between a hybrid automatic repeat request-acknowledgement (HARQ-ACK) transmission using channel selection and a channel state information (CSI) transmission; and jointly coding, based on detection of a potential scheduling conflict CSI bits of the CSI transmission and ACK/NACK bits of the HARQ-ACK transmission, on a physical uplink control channel (PUCCH) of a subframe with a tailbiting convolutional code (TBCC).

## Claims

1. A system, comprising:
user interfaces that include a display, a speaker, and a microphone; and
a communication device coupled with the user interfaces to transmit and receive data over a wireless network, the communication device including:
a hybrid automatic repeat request-acknowledgement (HARQ-ACK) module to generate a HARQ-ACK bit stream to indicate whether downlink data was successfully received on a physical downlink shared channel (PDSCH);
a channel state indicator module to generate a channel state information (CSI) bit stream that relates to a channel state; and

a transmit module coupled with the HARQ-ACK module to receive the HARQ-ACK bit stream and further coupled with the channel state indicator module to receive the CSI bit stream, the transmit module to:
recognize a potential collision between transmission of periodic CSI and transmission of hybrid automatic repeat request-acknowledgement (HARQ-ACK) in a subframe;
determine a number of uplink control information (UCI) bits, which includes CSI bits of the CSI bit stream and acknowledgement/negative acknowledgement (ACK/NACK) bits of the HARQ-ACK bit stream, to be transmitted in the subframe with utilization of a physical uplink control channel (PUCCH);
if the number is not greater than a threshold, spatially bundle the ACK/NACK bits by having a most significant bit represent spatially-bundled HARQ-ACK for a primary cell and a least significant bit represent spatially-bundled HARQ-ACK for a secondary cell, and modulate the spatially-bundled ACK/NACK bits on a second reference signal (RS) symbol of the subframe and modulate encoded CSI bits on non-RS symbols; and
if the number is greater than the threshold, jointly code the CSI bits and the ACK/NACK bits and modulate the jointly encoded CSI bits and ACK/NACK bits on non-RS symbols of the subframe.

2. The system of claim 1, the transmit module to:
ascertain whether a value of a parameter of radio resource control (RRC) signaling is equal to a predetermined value; and
perform detection of a potential scheduling conflict if the value of the parameter is equal to the predetermined value.

3. The system of claim 2, wherein the parameter includes a simultaneous ACK/NACK and channel quality indicator (CQI) parameter.

4. The system of claim 2, wherein the predetermined value is one.

5. The system of claim 2, wherein the parameter indicates at least one of whether the CSI bit stream is to be transmitted with utilization of PUCCH 2 format or the HARQ-ACK bit stream is to be transmitted with utilization of PUCCH format 1b with channel selection.

6. The system of claim 2, the transmit module to recognize the potential collision responsive to a result of the detection.

7. The system of claim 1, wherein the transmit module is to:
ascertain whether the CSI bit stream is to be transmitted with utilization of PUCCH 2 format and the HARQ-ACK bit stream is to be transmitted with utilization of PUCCH format 1b with channel selection; and
recognize the potential collision responsive to an ascertainment that the CSI bit stream is to be transmitted with utilization of PUCCH 2 format and the HARQ-ACK bit stream is to be transmitted with utilization of PUCCH format 1b with channel selection.

8. The system of claim 1, the transmit module to operate in a frequency division duplex mode to spatially bundle the ACK/NACK bits.

9. The system of claim 8, the transmit module to spatially bundle the ACK/NACK bits based on a logical AND operation.

10. The system of claim 1, the transmit module to channel code prior to modulation of the encoded CSI bits on the non-RS symbols.

11. One or more non-transitory computer readable media having instructions that, when executed, cause a communication device to:
recognize a potential collision between transmission of periodic channel state information (CSI) and transmission of hybrid automatic repeat request-acknowledgement (HARQ-ACK) in a subframe;
determine a number of uplink control information (UCI) bits, which includes CSI bits of a CSI bitstream and acknowledgement/negative acknowledgement (ACK/NACK) bits of a HARQ-ACK bitstream, to be transmitted in the subframe with utilization of a physical uplink control channel (PUCCH);
if the number is not greater than a threshold, spatially bundle the ACK/NACK bits by having a most significant bit represent spatially-bundled HARQ-ACK for a primary cell and a least significant bit represent spatially-bundled HARQ-ACK for a secondary cell, and modulate the spatially-bundled ACK/NACK bits on a second reference signal (RS) symbol of the subframe and modulate encoded CSI bits on non-RS symbols; and
if the number is greater than the threshold, jointly code the CSI bits and the ACK/NACK bits and modulate the jointly encoded CSI bits and ACK/NACK bits on non-RS symbols of the subframe.

12. The one or more non-transitory computer readable media of claim 11, wherein the instructions further cause the communication device to operate in a frequency division duplex mode to spatially bundle the ACK/NACK bits.

13. The one or more non-transitory computer readable media of claim 12, wherein the instructions further cause the communication device to spatially bundle the ACK/NACK bits based on a logical AND operation.

14. The one or more non-transitory computer readable media of claim 11, wherein the instructions further cause the communication device to spatially bundle the ACK/NACK bits based on a logical AND operation.

15. The one or more non-transitory computer readable media of claim 11, wherein the instructions further cause the communication device to:
ascertain whether a value of a parameter of radio resource control (RRC) signaling is equal to a predetermined value; and
perform detection of a potential scheduling conflict if the value of the parameter is equal to the predetermined value.

16. The one or more non-transitory computer readable media of claim 15, wherein the parameter is the simultaneous ACK/NACK and channel quality indicator (CQI) parameter.

17. The one or more non-transitory computer readable media of claim 15, wherein the predetermined value is one.

18. The one or more non-transitory computer readable media of claim 15, wherein the instructions further cause the communication device to recognize the potential collision responsive to a result of the detection.

19. The one or more non-transitory computer readable media of claim 15, wherein the parameter indicates at least one of whether the CSI bit stream is to be transmitted with utilization of PUCCH 2 format or the HARQ-ACK bit stream is to be transmitted with utilization of PUCCH format 1b with channel selection.

20. The one or more non-transitory computer readable media of claim 11, wherein the instructions further cause the communication device to:
ascertain whether the CSI bit stream is to be transmitted with utilization of PUCCH 2 format and the HARQ-ACK bit stream is to be transmitted with utilization of PUCCH format 1b with channel selection; and
recognize the potential collision responsive to an ascertainment that the CSI bit stream is to be transmitted with utilization of PUCCH 2 format and the HARQ-ACK bit stream is to be transmitted with utilization of PUCCH format 1b with channel selection.

21. An apparatus, comprising:
a hybrid automatic repeat request-acknowledgement (HARQ-ACK) circuitry to generate a HARQ-ACK bit stream to indicate whether downlink data was successfully received on a physical downlink shared channel (PDSCH);
a channel state indicator circuitry to generate a channel state information (CSI) bit stream that relates to a channel state; and

a transmit circuitry coupled with the HARQ-ACK circuitry to receive the HARQ-ACK bit stream and further coupled with the channel state indicator circuitry to receive the CSI bit stream, the transmit circuitry to:
recognize a potential collision between transmission of periodic CSI and transmission of hybrid automatic repeat request-acknowledgement (HARQ-ACK) in a subframe;
determine a number of uplink control information (UCI) bits, which includes CSI bits of the CSI bit stream and acknowledgement/negative acknowledgement (ACK/NACK) bits of the HARQ-ACK bit stream, to be transmitted in the subframe with utilization of a physical uplink control channel (PUCCH);
if the number is not greater than a threshold, spatially bundle the ACK/NACK bits by having a most significant bit represent spatially-bundled HARQ-ACK for a primary cell and a least significant bit represent spatially-bundled HARQ-ACK for a secondary cell, and modulate the spatially-bundled ACK/NACK bits on a second reference signal (RS) symbol of the subframe and modulate encoded CSI bits on non-RS symbols; and
if the number is greater than the threshold, jointly code the CSI bits and the ACK/NACK bits and modulate the jointly encoded CSI bits and ACK/NACK bits on non-RS symbols of the subframe.

22. The apparatus of claim 21, the transmit circuitry to:
ascertain whether a value of a parameter of radio resource control (RRC) signaling is equal to a predetermined value; and
perform detection of a potential scheduling conflict if the value of the parameter is equal to the predetermined value.

23. The apparatus of claim 22, wherein the parameter includes a simultaneous ACK/NACK and channel quality indicator (CQI) parameter.

24. The apparatus of claim 22, wherein the predetermined value is one.

25. The apparatus of claim 22, wherein the parameter indicates at least one of whether the CSI bit stream is to be transmitted with utilization of PUCCH 2 format or the HARQ-ACK bit stream is to be transmitted with utilization of PUCCH format 1b with channel selection.

26. The apparatus of claim 22, the transmit circuitry to recognize the potential collision responsive to a result of the detection.

27. The apparatus of claim 21, wherein the transmit circuitry is to:
ascertain whether the CSI bit stream is to be transmitted with utilization of PUCCH 2 format and the HARQ-ACK bit stream is to be transmitted with utilization of PUCCH format 1b with channel selection; and
recognize the potential collision responsive to an ascertainment that the CSI bit stream is to be transmitted with utilization of PUCCH 2 format and the HARQ-ACK bit stream is to be transmitted with utilization of PUCCH format 1b with channel selection.

28. The apparatus of claim 21, the transmit circuitry to operate in a frequency division duplex mode to spatially bundle the ACK/NACK bits.

29. The apparatus of claim 28, the transmit circuitry to spatially bundle the ACK/NACK bits based on a logical AND operation.

30. The apparatus of claim 21, the transmit circuitry to channel code prior to modulation of the encoded CSI bits on the non-RS symbols.