System and method for processing control information

Abstract

A system and method for allocating network resources are disclosed herein. In one embodiment, the system and method are configured to perform: determining a redundancy version and a new data indicator indicated by control information; determining a base graph of a low density parity check code based on which of a plurality of predefined conditions the redundancy version, and/or the new data indicator satisfy; and sending a signal comprising information bits that are encoded based on the determined base graph of the low density parity check code.

What is claimed is: 
     
       1. A method for encoding data, the method comprising:
 receiving control information by a transceiver; 
 determining by at least one processor a redundancy version and a new data indicator indicated by the control information; 
 determining by the at least one processor a base graph of a low density parity check code based on which of a plurality of predefined conditions the redundancy version, and the new data indicator satisfy, wherein a first one of the plurality of predefined conditions comprises: the redundancy version being equal to a redundancy version 0, the new data indicator being equal to a first logic state, and the new data indicator being toggled, which indicates a first transmission of the encoded data, and wherein a second one of the plurality of predefined conditions comprises: the new data indicator being equal to a second logic state different from the first logic state, the new data indicator being not toggled, which indicates a retransmission of the encoded data, and the redundancy version being equal to one of a redundancy version 1, a redundancy version 2, or a redundancy version 3; 
 encoding by the at least one processor a signal comprising information bits based on the determined base graph of the low density parity check code; and 
 transmitting by the transceiver the encoded signal to a predetermined communication device. 
 
     
     
       2. The method of  claim 1 , wherein according to the first one of the plurality of predefined conditions being satisfied, the method further comprises:
 determining a modulation order and a code rate based on a modulation and coding scheme index that is indicated by the control information; 
 determining a transport block size based on at least the modulation order and the code rate; 
 based on the code rate and the transport block size, determining the base graph as either a first or a second predefined base graph of the low density parity check code. 
 
     
     
       3. The method of  claim 1 , wherein according to the second one of the plurality of predefined conditions being satisfied, the method further comprises:
 determining the base graph as either a first or a second predefined base graph of the low density parity check code directly according to a modulation and coding scheme index that is indicated by the control information. 
 
     
     
       4. The method of  claim 3 , further comprises:
 determining the base graph as the first predefined base graph of the low density parity check code when the modulation and coding scheme index belongs to a first subset of a plurality of predefined modulation and coding scheme indexes; and 
 determining the base graph as the second predefined base graph of the low density parity check code when the modulation and coding scheme index belongs to a second subset of the plurality of predefined modulation and coding scheme indexes. 
 
     
     
       5. The method of  claim 4 , wherein each predefined modulation and coding scheme index in the first subset is an even integer and each predefined modulation and coding scheme index in the second subset is an odd integer, or each predefined modulation and coding scheme index in the first subset is an odd integer and each predefined modulation and coding scheme index in the second subset is an even integer. 
     
     
       6. The method of  claim 4 , wherein in the first subset, a number of a further subset of predefined modulation and coding scheme indexes is at least b 0 % of a total number of the predefined modulation and coding scheme indexes in the first subset and a remainder after a division of each of the further subset of the first subset of predefined modulation and coding scheme indexes by an even integer is less than a half of the even integer, and in the second subset, a number of a further subset of predefined modulation and coding scheme indexes is at least b 1 % of a total number of the predefined modulation and coding scheme indexes in the second subset and a remainder after a division of each of further subset of the second subset of predefined modulation and coding scheme indexes by the even integer is equal to or greater than the half of the even integer, and wherein b 0  is a first real number greater than 75 and less than 100 and b 1  is a second real number greater than 75 and less than 100. 
     
     
       7. The method of  claim 4 , wherein in the first subset, a number of a further subset of predefined modulation and coding scheme indexes is at least 60% of a total number of the predefined modulation and coding scheme indexes in the first subset and each of the further subset of the first subset of predefined modulation and coding scheme indexes is greater than N′, and in the second subset, a number of a further subset of predefined modulation and coding scheme indexes is at least 60% of a total number of the predefined modulation and coding scheme indexes in the second subset and each of the further subset of the second subset of predefined modulation and coding scheme indexes is less than N′, and wherein N′ is equal to a sum of the total number of the predefined modulation and coding scheme indexes in the first subset and the total number of the predefined modulation and coding scheme indexes in the second subset. 
     
     
       8. The method of  claim 5 , wherein according to the second one of the plurality of predefined conditions being satisfied, the method further comprises:
 determining the base graph as either a first or a second predefined base graph of the low density parity check code directly according to a modulation and coding scheme table that indicates a relationship between a modulation and coding scheme index, indicated by the control information, and a base graph index. 
 
     
     
       9. The method of  claim 1 , wherein according to the second one of the plurality of predefined conditions being satisfied, the method further comprises:
 determining the base graph as either a first or a second predefined base graph of the low density parity check code directly based on a modulation and coding scheme index, indicated by the control information, and a code rate corresponding to the modulation and coding scheme index. 
 
     
     
       10. The method of  claim 9 , further comprising:
 according to the code rate being greater than a first threshold, determining the base graph as the first predefined base graph; and 
 according to the code rate being less than or equal to a second threshold, determining the base graph as the second predefined base graph, 
 wherein the first and second thresholds are each a real number less than 1. 
 
     
     
       11. The method of  claim 10 , wherein the first threshold is greater than the second threshold. 
     
     
       12. The method of  claim 1 , wherein according to the second one of the plurality of predefined conditions being satisfied, the method further comprises:
 determining the base graph as either a first or a second predefined base graph of the low density parity check code directly based on a modulation and coding scheme index and a number of physical resource blocks that are both indicated by the control information. 
 
     
     
       13. The method of  claim 12 , further comprising:
 according to a remainder after division of the modulation and coding scheme index by 2 being equal to a remainder after division of the number of physical resource blocks by 2, determining the base graph as the first predefined base graph; and 
 according to the remainder after division of the modulation and coding scheme index by 2 being not equal to the remainder after division of the number of physical resource blocks by 2, determining the base graph as the second predefined base graph. 
 
     
     
       14. The method of  claim 12 , further comprising:
 according to a remainder after division of the modulation and coding scheme index by 2 being not equal to a remainder after division of the number of physical resource blocks by 2, determining the base graph as the first predefined base graph; and 
 according to the remainder after division of the modulation and coding scheme index by 2 being equal to the remainder after division of the number of physical resource blocks by 2, determining the base graph as the second predefined base graph. 
 
     
     
       15. The method of  claim 1 , wherein according to either the first or second one of the plurality of predefined conditions being satisfied, the method further comprises:
 determining the base graph as either a first or a second predefined base graph of the low density parity check code based on a relationship between a first efficiency value derived from a modulation and coding scheme table and a second efficiency value indicated in a channel quality indicator table, 
 wherein the first efficiency value is derived as a product of a modulation order being multiplied by a code rate, and wherein in the modulation and coding scheme table, the modulation order and code rate correspond to a respective modulation and coding scheme index. 
 
     
     
       16. The method of  claim 15 , wherein the modulation and coding scheme table comprises a plurality of modulation and coding scheme indexes that are grouped into at least three subsets and the channel quality indicator table comprises a plurality of second efficiency values, and wherein a corresponding first efficiency value of each modulation and coding scheme index in a first subset is equal to any of the plurality of second efficiency values in the channel quality indicator table, a corresponding first efficiency value of each modulation and coding scheme index in a second subset is equal to an average of any two adjacent ones of the plurality of second efficiency values in the channel quality indicator table, a corresponding first efficiency value of each modulation and coding scheme index in a third subset is not equal to any first efficiency value associated with the first and second subsets. 
     
     
       17. The method of  claim 15 , wherein a maximum code rate in the modulation and coding scheme table is equal to 0.95+Δx wherein Δx is a real number between −0.01 and +0.01. 
     
     
       18. The method of  claim 17 , wherein the modulation and coding scheme table and the channel quality indicator table are each used by a downlink transmission with a maximum modulation order being equal to 8.