Abstract:
The apparatus for appending CRC to the data or signaling to be transmitted in the communication systems is proposed in present invention. If the length of the CRC-bit sequence is 16, one of the CRC generation polynomials listed in present invention can be adopted. If the length of the CRC bit sequence is 18, one of the CRC generation polynomials listed in present invention can be adopted. If the length of the CRC bit sequence is 20, one of the CRC generation polynomials listed in present invention can be adopted. With the optimized CRC generation polynomials proposed in present invention, mistakes in signaling detection can be effectively reduced so that system spectrum utility can be improved.

Description:
BACKGROUND OF THE INVENTION 
       [0001]    1. Field of the Invention 
         [0002]    The present invention relates to a communication system, especially to an apparatus for appending cyclic redundancy check apparatus in the communication system. 
         [0003]    2. Description of the Related Art 
         [0004]    Now, 3GPP (the 3 rd  Generation Mobile Communication System Partnership Project) Standardization Organization has commenced on Long-term Evolution (referred to as LTE) to existing system criteria. Among numerous physical layer transmission techniques, both a downlink transmission technique based on OFDM (Orthogonal Frequency Division Multiplexing) and an uplink transmission technique based on SCFDMA (Single Carrier Frequency Division Multiple Access) are in hot research. In nature, OFDM is a multi-carrier modulation communication technique. Its basic principle is to divide a high rate data stream into multiple low rate data streams to transmit via a group of orthogonal sub-carriers simultaneously. Because of the nature of multi-carrier, the OFDM technique bears superior performance in many aspects. SCFDMA is essentially a single carrier transmission technique with comparatively lower PAPR (Peak to Average Power Ratio). Therefore, the power amplifier of a mobile terminal can be operated effectively to enlarge the cell coverage. In addition, with the adoption of cyclic prefix and frequency domain filtering, SCFDMA technique bears comparatively lower processing complexity. 
         [0005]    The cyclic redundancy check (CRC) is a hash function for generating a few fixed number of data bits according to data such as network data packets or computer file bock. It is adopted to detect possible error for data transmission or data storage. CRC is calculated before the data transmission or data storage and is appended at the end of the data. And in a receiver, the data is checked whether it is changed or not. 
         [0006]    One CRC calculation is as follows. Suppose sequence a 0 , a 1 , a 2 , a 3 , . . . , a A−1  is input into a CRC calculation module and a generated check-bit sequence is p 0 , p 1 , p 2 , p 3 , . . . , p L−1 , where A indicates a length of the input sequence, and L indicates a length of the check-bit sequence. Then, a sequence appended with check bits is a 0 , a 1 , a 2 , a 3 , . . . , a A−1 , p 0 , p 1 , p 2 , p 3 , . . . , p L−1 . The check bits are calculated as follows: in GF(2), a polynomial expression 
         [0000]    a 0 D A+L−1 +a 1 D A+L−2 + . . . +a A−1 D L +p 0 D L−1 +p 1 D L−2 + . . . +p L−2 D 1 +p L−1  is divided by corresponding generation polynomial, and a remainder must be zero. 
         [0007]    At present, the CRC generation polynomials applied in LTE are as follows: if the length of CRC L=16, the CRC generation polynomial g CRC16 (D)=D 16 +D 12 +D 5 +1; if the length of CRC L=24, the CRC generation polynomials are g CRC24A (D)=D 24 +D 23 +D 18 +D 17 +D 14 +D 11 +D 10 +D 7 +D 6 +D 5 +D 4 +D 3 +D+1 and g CRC24B (D)=D 24 +D 23 +D 6 +D 5 +D+1. 
         [0008]    In current LTE, a DCI processing flow is illustrated in  FIG. 1 . In module  101 , DCI adds the CRC in the data sequence. Suppose load information for PDCCH is a 0 , a 1 , a 2 , a 3 , . . . , a A−1 . The check-bit sequence generated according to the CRC generation polynomial is p 0 , p 1 , p 2 , p 3 , . . . , p L−1 , where A indicates the length of the load information and L indicates the length of the check-bit sequence. Suppose the sequence appended with CRC is b 0 , b 1 , b 2 , b 3 , . . . , b B−1 , where B=A+L. Then the relationships between a k , b k  and p k  are as follows: 
         [0000]    
       
         
           
             
               
                 b 
                 k 
               
               = 
               
                 
                   
                     a 
                     k 
                   
                    
                   
                       
                   
                    
                   k 
                 
                 = 
                 0 
               
             
             , 
             1 
             , 
             2 
             , 
             … 
              
             
                 
             
             , 
             
               A 
               - 
               1 
             
           
         
       
       
         
           
             
               
                 b 
                 k 
               
               = 
               
                 
                   
                     p 
                     
                       k 
                       - 
                       A 
                     
                   
                    
                   
                       
                   
                    
                   k 
                 
                 = 
                 A 
               
             
             , 
             
               A 
               + 
               1 
             
             , 
             
               A 
               + 
               2 
             
             , 
             … 
              
             
                 
             
             , 
             
               A 
               + 
               L 
               - 
               1 
             
           
         
       
     
         [0009]    After appending the CRC, a scrambling process is performed on the CRC check-bit sequence with the user equipment (UE) ID sequence x ue,0 , x ue,1 , . . . , x ue,15  to form a sequence c 0 , c 1 , c 2 , c 3 , . . . , c B−1 . The relationship between b k  and c k  is as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       c 
                       k 
                     
                     = 
                     
                       
                         
                           b 
                           k 
                         
                          
                         
                             
                         
                          
                         k 
                       
                       = 
                       0 
                     
                   
                   , 
                   1 
                   , 
                   2 
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     A 
                     - 
                     1 
                   
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       c 
                       k 
                     
                     = 
                     
                       
                         
                           ( 
                           
                             
                               b 
                               k 
                             
                             + 
                             
                               x 
                               
                                 ue 
                                 , 
                                 
                                     
                                 
                                  
                                 
                                   k 
                                   - 
                                   A 
                                 
                               
                             
                           
                           ) 
                         
                          
                         mod 
                          
                         
                             
                         
                          
                         2 
                          
                         
                             
                         
                          
                         k 
                       
                       = 
                       A 
                     
                   
                   , 
                   
                     A 
                     + 
                     1 
                   
                   , 
                   
                       
                   
                    
                   
                     A 
                     + 
                     2 
                   
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     A 
                     + 
                     15 
                   
                 
               
               
                 
                     
                 
               
             
           
         
       
     
         [0010]    A channel coding is performed on the sequence c 0 , c 1 , c 2 , c 3 , . . . , c B−1  in module  102 . In LTE, a convolution coding scheme is applied. A rate matching is performed on the encoded data in module  103 . 
         [0011]    At present, an existed problem is that the adopted CRC generation polynomial is not optimal. Suppose the length of the load information for the PDCCH is A and L is the length of the check-bit sequence. Then the CRC corresponds to a linear block code (A+L, A). One technical index of the CRC generation polynomial is P ue . P ue  can be defined as a probability that a linear block codeword is detected by error as another codeword after the channel transmission. A Binary Symmetric Channel (BSC) is taken as an example in following description. 
         [0012]    The performance of g CRC16 (D)=D 16 +D 12 +D 5 +1 is illustrated in  FIG. 2 . In this figure, x-axis indicates an error probability (ε) in BSC, y-axis indicates a corresponding P ue . The four curves in this figure corresponds to the cases A=16, 24, 32 and 48 respectively. From this figure, it is obviously seen: when ε is within the range [0.05, 0.3], P ue  is even greater than that when ε = 0.5. This means that the performance of the generation polynomial is very poor within the range. 
       SUMMARY OF THE INVENTION 
       [0013]    The object of this invention is to provide an apparatus for appending a CRC in a communication system. With this apparatus, the CRC is appended to transmitted data or signaling. If a length of the CRC-bit sequence is 16, one of CRC generation polynomials listed below is adopted in present application:
       D 16 +D 15 +D 12 +D 9 +D 6 +D 3 +D 2 30 1   D 16 +D 14 +D 13 +D 10 +D 7 +D 4 +D+1   D 16 +D 15 +D 14 +D 12 +D 11 +D 8 +D 7 +D 6 +D 5 +D 4 +D 3 +1   D 16 +D 13 +D 12 +D 11 +D 10 +D 9 +D 8 +D 5 +D 4 +D 2 +D+1   D 16 +D 15 +D 12 +D 10 +D 9 +D 8 +D 7 +D 6 +D 5 +D 3 +D 2 +1   D 16 +D 14 +D 13 +D 11 +D 10 +D 9 +D 8 +D 7 +D 6 +D 4 +D+1   D 16 +D 15 +D 14 +D 12 +D 11 +D 9 +D 8 +D 7 +D 6 +D 5 +D 4 +1   D 16 +D 12 +D 11 +D 10 +D 9 +D 8 +D 7 +D 5 +D 4 +D 2 +D+1       
 
         [0022]    If the length of the CRC bit sequence is 18, one of the CRC generation polynomials listed below is adopted in present application:
       D 18 +D 16 +D 14 +D 10 +D 9 +D 8 +D 4 +1   D 18 +D 14 +D 10 +D 9 +D 8 +D 4 +D 2 30 1   D 18 +D 16 +D 15 +D 12 +D 9 +D 8 +D 5 30 1   D 18 +D 13 +D 10 +D 9 +D 6 +D 3 +D 2 +1   D 18 +D 17 +D 11 +D 10 +D 9 +D 8 +D 6 +1   D 18 +D 12 +D 10 +D 9 +D 8 +D 7 +D+1   D 18 +D 17 +D 16 +D 14 +D 11 +D 9 +D 8 +D 5 +D 3 +1   D 18 +D 15 +D 13 +D 10 +D 9 +D 7 +D 4 +D 2 +D+1       
 
         [0031]    If the length of the CRC bit sequence is 20, one of the CRC generation polynomials listed below is adopted in present application:
       D 20 +D 19 +D 18 +D 17 +D 15 +D 14 +D 12 +D 11 +D 10 +D 8 +D 7 +D 6 +D 4 +1   D 20 +D 16 +D 14 +D 13 +D 12 +D 10 +D 9 +D 8 +D 6 +D 5 +D 3 +D 2 +D+1   D 20 +D 19 +D 14 +D 13 +D 11 +D 7 +D 6 +D 5 +D 3 +D 2 +D+1   D 20 +D 19 +D 18 +D 17 +D 15 +D 14 +D 13 +D 9 +D 7 +D 6 +D+1   D 20 +D 18 +D 17 +D 16 +D 11 +D 9 +D 8 +D 7 +D 6 +D 3 +D 2 +1   D 20 +D 18 +D 17 +D 14 +D 13 +D 12 +D 11 +D 9 +D 4 +D 3 +D 2 +1   D 20 +D 19 +D 17 +D 13 +D 12 +D 10 +D 9 +D 8 +D 7 +D 6 +D 3 +D 2 +D+1   D 20 +D 19 +D 18 +D 17 +D 14 +D 13 +D 12 +D 11 +D 10 +D 8 +D 7 +D 3 +D+1       
 
         [0040]    With the optimized CRC generation polynomials proposed in present invention, mistakes in signaling detection can be effectively reduced so that system spectrum utility can be improved. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0041]      FIG. 1  shows a DCI processing flow; 
           [0042]      FIG. 2  shows a performance of existing CRC generation polynomials; 
           [0043]      FIG. 3  shows a performance of CRC generation polynomial D 16 +D 15 +D 14 +D 12 +D 11 +D 9 +D 8 +D 7 +D 6 +D 5 +D 4 +1; 
           [0044]      FIG. 4  shows a flow of processing the 16-bit check information; 
           [0045]      FIG. 5  shows a flow of processing the 18-bit or 20-bit check information. 
       
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
       [0046]    Suppose the load information for data or signaling is a 0 , a 1 , a 2 , a 3 , . . . , a A−1 , and the CRC sequence to be appended to data or signaling is p 0 , p 1 , p 2 , p 3 , . . . , p L−1 , where A indicates the length of the load information and L indicates the length of the check bit sequence (for the 16-bit check information, L=16; for the 18-bit check information, L=18; and for the 20-bit check information, L=20). The check-bit sequence is calculated with the method below: in GF(2), the polynomial a 0 D A+L−1 +a 1 D A+L−2 + . . . +a A−1 D L +p 0 D L−1 +p 1 D L−2 + . . . +p L−2 D 1 +p L−1  is divided by corresponding generation polynomials. And the remainders are zeros. Suppose the sequence appended with CRC is b 0 , b 1 , b 2 , b 3 , . . . , b B−1 , where B=A+L. Then the relationships between a k , b k  and p k  are as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       b 
                       k 
                     
                     = 
                     
                       
                         
                           a 
                           k 
                         
                          
                         
                             
                         
                          
                         k 
                       
                       = 
                       0 
                     
                   
                   , 
                   1 
                   , 
                   2 
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     A 
                     - 
                     1 
                   
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       b 
                       k 
                     
                     = 
                     
                       
                         
                           p 
                           
                             k 
                             - 
                             A 
                           
                         
                          
                         
                             
                         
                          
                         k 
                       
                       = 
                       A 
                     
                   
                   , 
                   
                     A 
                     + 
                     1 
                   
                   , 
                   
                       
                   
                    
                   
                     A 
                     + 
                     2 
                   
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     A 
                     + 
                     L 
                     - 
                     1 
                   
                 
               
               
                 
                     
                 
               
             
           
         
       
     
         [0047]    Several optimized CRC generation polynomials that bear superior performance to existing one are proposed in present invention. 
         [0048]    In the case that the length of the CRC bit sequence is 16, one of the CRC generation polynomials listed below is adopted in our application:
       D 16 +D 15 +D 12 +D 9 +D 6 +D 3 +D 2 +1   D 16 +D 14 +D 13 +D 10 +D 7 +D 4 +D+1   D 16 +D 15 +D 14 +D 12 +D 11 +D 8 +D 7 +D 6 +D 5 +D 4 +D 3 +1   D 16 +D 13 +D 12 +D 11 +D 10 +D 9 +D 8 +D 5 +D 4 +D 2 +D+1   D 16 +D 15 +D 12 +D 10 +D 9 +D 8 +D 7 +D 6 +D 5 +D 3 +D 2 +1   D 16 +D 14 +D 13 +D 11 +D 10 +D 9 +D 8 +D 7 +D 6 +D 4 +D+1   D 16 +D 15 +D 14 +D 12 +D 11 +D 9 +D 8 +D 7 +D 6 +D 5 +D 4 +1   D 16 +D 12 +D 11 +D 10 +D 9 +D 8 +D 7 +D 5 +D 4 +D 2 +D+1       
 
         [0057]    In the case that the length of the CRC bit sequence is 18, one of the CRC generation polynomials listed below is adopted in our application:
       D 18 +D 16 +D 14 +D 10 +D 9 +D 8 +D 4 +1   D 18 +D 14 +D 10 +D 9 +D 8 +D 4 +D 2 +1   D 18 +D 16 +D 15 +D 12 +D 9 +D 8 +D 5 +1   D 18 +D 13 +D 10 +D 9 +D 6 +D 3 +D 2 +1   D 18 +D 17 +D 11 +D 10 +D 9 +D 8 +D 6 +1   D 18 +D 12 +D 10 +D 9 +D 8 +D 7 +D+1   D 18 +D 17 +D 16 +D 14 +D 11 +D 9 +D 8 +D 5 +D 3 +1   D 18 +D 15 +D 13 +D 10 +D 9 +D 7 +D 4 +D 2 +D+1       
 
         [0066]    In the case that the length of the CRC bit sequence is 20, one of the CRC generation polynomials listed below is adopted in our application:
       D 20 +D 19 +D 18 +D 17 +D 15 +D 14 +D 12 +D 11 +D 10 +D 8 +D 7 +D 6 +D 4 +1   D 20 +D 16 +D 14 +D 13 +D 12 +D 10 +D 9 +D 8 +D 6 +D 5 +D 3 +D 2 +D+1   D 20 +D 19 +D 14 +D 13 +D 11 +D 7 +D 6 +D 5 +D 3 +D 2 +D+1   D 20 +D 19 +D 18 +D 17 +D 15 +D 14 +D 13 +D 9 +D 7 +D 6 +D+1   D 20 +D 18 +D 17 +D 16 +D 11 +D 9 +D 8 +D 7 +D 6 +D 3 +D 2 +1   D 20 +D 18 +D 17 +D 14 +D 13 +D 12 +D 11 +D 9 +D 4 +D 3 +D 2 +1   D 20 +D 19 +D 17 +D 13 +D 12 +D 10 +D 9 +D 8 +D 7 +D 6 +D 3 +D 2 +D+1   D 20 +D 19 +D 18 +D 17 +D 14 +D 13 +D 12 +D 11 +D 10 +D 8 +D 7 +D 3 +D+1       
 
         [0075]    The CRC bit sequence with the length of 16 is taken as an example in following description. The 16-bit CRC generation polynomial bears superior performances to existing one g CRC16 (D)=D 16 +D 12 +D 5 +1. The generation polynomial D 16 +D 15 +D 14 +D 12 +D 11 +D 9 +D 8 +D 7 +D 6 +D 5 +D 4 +1 is taken as an example. Its performance is shown in  FIG. 3 . From this figure, it can be seen that: the generation polynomial has no limitation existed in g CRC16 (D) (i.e., when ε is within the range [0.05, 0.3], P ue  is even greater than the P ue  when ε=0.5). Meanwhile, from a comparison between  FIG. 2  and  FIG. 3 , it can be seen that: generation polynomial D 16 +D 15 +D 14 +D 12 +D 11 +D 9 +D 8 +D 7 +D 6 +D 5 +D 4 +1 bears significantly better performance than g CRC16 (D)=D 16 +D 12 +D 5 +1 (for the same A and ε, the less the P ue  is, the better the performance is.) 
         [0076]    One application scenario is to apply present invention in data transmission in a communication system. For example, in the case that a base station (BS) transmits data to a user equipment (UE) or UE transmits data to a BS, if the length of the CRC bit sequence is 16, 18 or 20, the CRC generation polynomials proposed in present invention can adopted for the invention. 
         [0077]    Another application scenario is to apply present invention in the transmission of control signaling in a communication system. In a communication system, the BS controls resource allocation and the transmitting and receiving for the to UEs by transmitting control signaling at each scheduling moment. In present invention, the control signaling for each UE is called a Physical Downlink Control Channel (PDCCH). And the load information in PDCCH is called a Downlink Control Information (DCI). 
         [0078]    With the CRC generation polynomials proposed in present invention, a method for transmitting control signaling includes steps of: 
         [0079]    Step a) BS generating the check information on the control signaling according to the load information on the control signaling and the optimized CRC generation polynomial. 
         [0080]    Suppose the load information on the control signaling is a 0 , a 1 , a 2 , a 3 , . . . , a A−1 , and the check-bit sequence generated according to the CRC generation polynomial is p 0 , p 1 , p 2 , p 3 , . . . , p L−1 , where A is the length of the load information, and L is the length of the check-bit sequence (for the 16-bit check information, L=16, for the 18-bit check information, L=18, and for the 20-bit check information, L=20). The check-bit sequence is calculated with the method below: in GF(2), the polynomial a 0 D A+L−1 +a 1 D A+L−2 + . . . +a A−1 D L +p 0 D L−1 +p 1 D L−2 + . . .  30  p L−2 D 1 +p L−1  is divided by corresponding generation polynomials. And the remainders are zeros. Suppose the sequence appended with CRC is b 0 , b 1 , b 2 , b 3 , . . . , b B−1 , where B=A+L. Then the relationships between a k , b k  and p k  are as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       b 
                       k 
                     
                     = 
                     
                       
                         
                           a 
                           k 
                         
                          
                         
                             
                         
                          
                         k 
                       
                       = 
                       0 
                     
                   
                   , 
                   1 
                   , 
                   2 
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     A 
                     - 
                     1 
                   
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       b 
                       k 
                     
                     = 
                     
                       
                         
                           p 
                           
                             k 
                             - 
                             A 
                           
                         
                          
                         
                             
                         
                          
                         k 
                       
                       = 
                       A 
                     
                   
                   , 
                   
                     A 
                     + 
                     1 
                   
                   , 
                   
                       
                   
                    
                   
                     A 
                     + 
                     2 
                   
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     A 
                     + 
                     L 
                     - 
                     1 
                   
                 
               
               
                 
                     
                 
               
             
           
         
       
     
         [0081]      FIG. 4  shows a flow of processing the 16-bit check information.  FIG. 5  shows a flow of processing the 18-bit or 20-bit check information. In the case that the check information is 16 bits long, the operations in step a) correspond to that implemented in module  401  (CRC appending) in  FIG. 4 . In the case that the check information is 18 bits long or 20 bits long, the operations in step a) correspond to that implemented in module  501  (CRC appending) in  FIG. 5 . 
         [0082]    Step b) BS performing the scrambling operation on the check information with the information obtained according to UE ID. 
         [0083]    In the case that the check information is 16 bits long, since UE ID bears the same length as the check information, BS directly performs the scrambling operation on the check information with the UE ID. This process is implemented in module  402  (scrambling) in  FIG. 4 . Details are described as follows. Suppose the sequence appended with CRC is b 0 , b 1 , b 2 , b 3 , . . . , b B−1 , where B=A+L with A indicating the length of the load information and L indicating the length of the check-bit sequence. Then sequence c 0 , c 1 , c 2 , c 3 , . . . , C B−1  obtained by scrambling the CRC bit sequence with the UE ID x ue.0 , x ue.1 , . . . , x ue.15 . And the relationship between b k  and c k  is as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       c 
                       k 
                     
                     = 
                     
                       
                         
                           b 
                           k 
                         
                          
                         
                             
                         
                          
                         k 
                       
                       = 
                       0 
                     
                   
                   , 
                   1 
                   , 
                   2 
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     A 
                     - 
                     1 
                   
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       c 
                       k 
                     
                     = 
                     
                       
                         
                           ( 
                           
                             
                               b 
                               k 
                             
                             + 
                             
                               x 
                               
                                 ue 
                                 , 
                                 
                                     
                                 
                                  
                                 
                                   k 
                                   - 
                                   A 
                                 
                               
                             
                           
                           ) 
                         
                          
                         mod 
                          
                         
                             
                         
                          
                         2 
                          
                         
                             
                         
                          
                         k 
                       
                       = 
                       A 
                     
                   
                   , 
                   
                     A 
                     + 
                     1 
                   
                   , 
                   
                       
                   
                    
                   
                     A 
                     + 
                     2 
                   
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     A 
                     + 
                     15 
                   
                 
               
               
                 
                     
                 
               
             
           
         
       
     
         [0084]    In the case that the check information is 18 bits long or 20 bits long, since the UE ID is 16 bits long, it is necessary to expand the UE ID to be the same length as the check information. One method is to perform channel coding to the UE ID. This process is implemented in module  504  (channel coding 2) in  FIG. 5 . For example, the check information is 18 bits long, the linear block code encoding scheme ( 18 , 16 ) can be adopted here to expand the UE ID to be a 18-bit codeword. In the case that the check information is 20 bits long, the linear block code encoding scheme ( 20 , 16 ) can be adopted to expand the UE ID to be a 20-bit codeword. The subsequent scrambling operation is implemented in module  502  (scrambling operation) in  FIG. 5 . The details are as follows. Suppose the sequence appended with CRC is b 0 , b 1 , b 2 , b 3 , . . . , b B−1 , where B=A+L with A indicating the length of the check information and L the length of the check-bit sequence. Suppose the UE ID x ue.0 , x ue.1 , . . . , x ue.15  is encoded to be the sequence y 0 , y 1 , y 2 , y 3 , . . . , y L−1 , the sequence c 0 , c 1 , c 2 , c 3 , . . . , c B−1  is obtained by scrambling operation the CRC sequence with the information sequence y 0 , y 1 , y 2 , y 3 , . . . , y L−1  obtained according to UE ID. And the relationship between b k  and c k  is as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       c 
                       k 
                     
                     = 
                     
                       
                         
                           b 
                           k 
                         
                          
                         
                             
                         
                          
                         k 
                       
                       = 
                       0 
                     
                   
                   , 
                   1 
                   , 
                   2 
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     A 
                     - 
                     1 
                   
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       c 
                       k 
                     
                     = 
                     
                       
                         
                           ( 
                           
                             
                               b 
                               k 
                             
                             + 
                             
                               y 
                               
                                 k 
                                 - 
                                 A 
                               
                             
                           
                           ) 
                         
                          
                         mod 
                          
                         
                             
                         
                          
                         2 
                          
                         
                             
                         
                          
                         k 
                       
                       = 
                       A 
                     
                   
                   , 
                   
                     A 
                     + 
                     1 
                   
                   , 
                   
                       
                   
                    
                   
                     A 
                     + 
                     2 
                   
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     A 
                     + 
                     L 
                     - 
                     1 
                   
                 
               
               
                 
                     
                 
               
             
           
         
       
     
         [0085]    Step c) implementing operations of channel coding, rate matching on the load information and the scrambled information obtained in step b). Then the processed information is transmitted by the BS. 
         [0086]    In this step, channel coding and rate matching are implemented by BS on the scrambled information c 0 , c 1 , c 2 , c 3 , . . . , c B−1  obtained in step b) and then the processed information is transmitted. Here, a convolution coding scheme or any other can be adopted. 
         [0087]    In the case that the check information is 16 bits long, the operations in step c) correspond to that operated in module  403  (channel coding/rate matching) in  FIG. 4 . And in the case that the check information is 18 or 20 bits long, the operations in step c) correspond to that operated in module  503  (channel coding/rate matching) in  FIG. 5 . 
       EMBODIMENTS 
       [0088]    Four embodiments of the present invention are described in the following. To avoid making the description too tedious, detailed descriptions for functions or equipments well known are omitted. 
       A First Embodiment 
       [0089]    In this embodiment, the transmission control signaling shares the same length with the check information, i.e., 16 bits. Suppose the adopted CRC generation polynomial is D 16 +D 15 +D 14 +D 12 +D 11 +D 9 +D 8 +D 7 +D 6 +D 5 +D 4 +1, and the UE ID is x ue.0 , x ue.1 , . . . , x ue.15 =1000110000101111, the load information on the control signaling is the 20-bit sequence a 0 , a 1 , a 2 , a 3 , . . . , a 19 =00011111001010011110. Please be noted that all these settings are only done for the convenience of description. Any other of the CRC generation polynomials proposed in present invention, UE IDs, and load information sequences of control signaling can be applied. 
         [0090]    The check-bit sequence generated according to the load information on the control signaling and the optimized CRC generation polynomial is p 0 , p 1 , p 2 , p 3 , . . . , p 15 =0001010000000001. Then the sequence appended with CRC is b 0 , b 1 , b 2 , b 3 , . . . , b 35 =000111110010100111100001010000000001. The scrambling operation is performed on the CRC bit sequence with the UE ID to obtain a scrambled sequence c 0 , c 1 , c 2 , c 3 , . . . , c 35 =000111110010100111101001100000101110. Then, operations of channel coding and rate matching are performed by BS on sequence c 0 , c 1 , c 2 , c 3 , . . . , c 35 . And the processed information is finally transmitted. 
       A Second Embodiment 
       [0091]    In this embodiment, the transmission control signaling shares the same length with the check information, i.e., 18 bits. Suppose the adopted CRC generation polynomial is D 18 +D 16 +D 14 +D 10 +D 9 +D 8 +D 4 +1, and the UE ID is x ue.0, x   ue.1 , . . . , x ue.15 =1000110000101111 the load information on the control signaling is the 20-bit sequence a 0 , a 1 , a 2 , a 3 , . . . , a 19 =00011111001010011110. Please be noted that all these settings are only done for the convenience of description. Any other of the CRC generation polynomials proposed in present invention, UE IDs, and load information sequences of control signaling can be applied. 
         [0092]    The check-bit sequence generated according to the load information on the control signaling and the optimized CRC generation polynomial is p 0 , p 1 , p 2 , p 3 , . . . , p 17 =111010001110001111. Then the sequence appended with CRC is b 0 , b 1 , b 2 , b 3 , . . . , b 37 =00011111001010011110111010001110001111. By systematic linear block coding, the UE ID x ue.0 , x ue.1 , . . . , x ue.15  is converted to the sequence y 0 , y 1 , y 2 , y 3 , . . . , y 17 . The coding rule is as follows: 
         [0000]    
       
         
           
             
               
                 y 
                 k 
               
               = 
               
                 
                   
                     x 
                     
                       
                         ue 
                         , 
                         k 
                       
                        
                       
                           
                       
                     
                   
                    
                   k 
                 
                 = 
                 0 
               
             
             , 
             1 
             , 
             2 
             , 
             … 
              
             
                 
             
             , 
             15 
           
         
       
       
         
           
             
               y 
               16 
             
             = 
             
               
                 ( 
                 
                   
                     ∑ 
                     
                       k 
                       = 
                       0 
                     
                     7 
                   
                    
                   
                     x 
                     
                       ue 
                       , 
                       
                           
                       
                        
                       k 
                     
                   
                 
                 ) 
               
                
               mod 
                
               
                   
               
                
               2 
             
           
         
       
       
         
           
             
               y 
               17 
             
             = 
             
               
                 ( 
                 
                   
                     ∑ 
                     
                       k 
                       = 
                       8 
                     
                     7 
                   
                    
                   
                     x 
                     
                       ue 
                       , 
                       
                           
                       
                        
                       k 
                     
                   
                 
                 ) 
               
                
               mod 
                
               
                   
               
                
               2 
             
           
         
       
     
         [0093]    Therefore by the UE ID x ue.0 , x ue.1 , . . . , x ue.15 =1000110000101111, the encoded sequence y 0 , y 1 , y 2 , y 3 , . . . , y 17 =100011000010111111 can be obtained. The scrambling operation is performed on CRC bit sequence with sequence y 0 , y 1 , y 2 , y 3 , . . . , y 17  to obtain sequence c 0 , c 1 , c 2 , c 3 , . . . , c 37 =00011111001010011110011001001100110000. Then, operations like channel coding and rate matching are performed by BS on the sequence c 0 , c 1 , c 2 , c 3 , . . . , c 37 . And the processed information is finally transmitted. 
       A Third Embodiment 
       [0094]    In this embodiment, the transmission control signaling shares the same length with the check information, i.e., 20 bits. Suppose the adopted CRC generation polynomial is D 20 +D 19 +D 18 +D 17 +D 15 +D 14 +D 12 +D 11 +D 10 +D 8 +D 7 +D 6 +D 4 +1, and the UE ID is x ue.0 , Xx ue.1 , . . . , x ue.15 =1000110000101111, the load information on the control signaling is the 20-bit sequence=a 0 , a 1 , a 2 , a 3 , . . . , a 19 =00011111001010011110. Please be noted that all these settings are only done for the convenience of description. Any other of the CRC generation polynomials proposed in present invention, UE IDs, and load information sequences of control signaling can be applied. 
         [0095]    The check-bit sequence generated according to the load information on the control signaling and the optimized CRC generation polynomial is p 0 , p 1 , p 2 , p 3 , . . . , p 19 =10110010110010001100. Then the sequence appended with CRC is b 0 , b 1 , b 2 , b 3 , . . . , b 39 =0001111100101001111010110010110010001100. By systematic linear block coding, the UE ID x ue.0 , x ue.1 , . . . , x ue.15  is converted to the sequence y 0 , y 1 , y 2 , y 3 , . . . , y 19 . The coding rule is as follows: 
         [0000]    
       
         
           
             
               
                 y 
                 k 
               
               = 
               
                 
                   
                     x 
                     
                       ue 
                       , 
                       
                           
                       
                        
                       k 
                     
                   
                    
                   
                       
                   
                    
                   k 
                 
                 = 
                 0 
               
             
             , 
             1 
             , 
             2 
             , 
             … 
              
             
                 
             
             , 
             15 
           
         
       
       
         
           
             
               y 
               16 
             
             = 
             
               
                 ( 
                 
                   
                     ∑ 
                     
                       k 
                       = 
                       0 
                     
                     3 
                   
                    
                   
                     x 
                     
                       ue 
                       , 
                       
                           
                       
                        
                       k 
                     
                   
                 
                 ) 
               
                
               
                   
               
                
               mod 
                
               
                   
               
                
               2 
             
           
         
       
       
         
           
             
               y 
               17 
             
             = 
             
               
                 ( 
                 
                   
                     ∑ 
                     
                       k 
                       = 
                       14 
                     
                     7 
                   
                    
                   
                     x 
                     
                       ue 
                       , 
                       
                           
                       
                        
                       k 
                     
                   
                 
                 ) 
               
                
               
                   
               
                
               mod 
                
               
                   
               
                
               2 
             
           
         
       
       
         
           
             
               y 
               18 
             
             = 
             
               
                 ( 
                 
                   
                     ∑ 
                     
                       k 
                       = 
                       8 
                     
                     L 
                   
                    
                   
                     x 
                     
                       ue 
                       , 
                       
                           
                       
                        
                       k 
                     
                   
                 
                 ) 
               
                
               
                   
               
                
               mod 
                
               
                   
               
                
               2 
             
           
         
       
       
         
           
             
               y 
               19 
             
             = 
             
               
                 ( 
                 
                   
                     ∑ 
                     
                       k 
                       = 
                       12 
                     
                     L 
                   
                    
                   
                     x 
                     
                       ue 
                       , 
                       
                           
                       
                        
                       k 
                     
                   
                 
                 ) 
               
                
               
                   
               
                
               mod 
                
               
                   
               
                
               2 
             
           
         
       
     
         [0096]    So, by the UE ID x ue.0 , x ue.1 , . . . , x ue.15 =1000110000101111, the encoded sequence y 0 , y 1 , y 2 , y 3 , . . . , y 19 =10001100001011111010 is obtained. The scrambling operation is performed on the CRC bit sequence with sequence y 0 , y 1 , y 2 , y 3 , . . . , y 19  to obtain sequence c 0 , c 1 , c 2 , c 3 , . . . , c 39 =0001111100101001111000111110111001110110. Then, operations of channel coding and rate matching are performed by BS to sequence c 0 , c 1 , c 2 , c 3 , . . . , c 39 . And the processed information is finally transmitted. 
       A Fourth Embodiment 
       [0097]    This embodiment corresponds to the case of data transmission. For example, in the case that BS transmits data to UE or UE transmits data to BS, if the CRC sequence is 16, 18 or 20 bits long, the CRC generation polynomials proposed in present invention can be applied here. For example: in the case that the CRC sequence is 16 bits long, the generation polynomial D 16 +D 15 +D 14 +D 12 +D 11 +D 9 +D 8 +D 7 +D 6 +D 5 +D 4 +1 can be applied; and in the case that the CRC sequence is 18 bits long, the generation polynomial D 18  +D 16 +D 14 +D 10 +D 9 +D 8 +D 4 D+1 can be applied; and in the case that the CRC sequence is 20 bits long, the generation polynomial D 20 +D 19 +D 18 +D 17 +D 15 D 14 +D 12 +D 11 +D 10 +D 8 +D 7 +D 6 +D 4 +1 can be applied. 
         [0098]    While the invention has been shown and described with reference to certain exemplary embodiments of the present invention thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present invention as defined by the appended claims and their equivalents.