The field of the present invention relates to wireless communication and more specifically, uplink control information in a Long Term Evolution Advanced system.
Wireless cellular communication networks incorporate user equipment (“UE”) and a number of eNodeBs. An eNodeB is generally a fixed station, and may also be called a base transceiver system (“BTS”), an access point (“AP”), a base station (“BS”), or some other equivalent terminology. For efficient communication, UE reports channel state information to an eNodeB. UE, which is also commonly referred to as a terminal or a mobile station, may be a fixed or mobile device and may be a wireless device, a cellular phone, a personal digital assistant (“PDA”), and/or a wireless modem card, among other things. The UE generally reports the channel state information to the base station periodically or aperiodically. Channel state information (“CSI”) may include a channel quality indicator (“CQI”) and a precoding matrix index (“PMI”).
One way the UE can transmit channel state information reports to the base station is through a physical uplink shared channel (“PUSCH”). To improve the reliability of the transmission of the channel state information reports, these reports are coded onto a PUSCH for transmission. Accordingly, an improved method and system for transmitting aperiodic CSI reports through a PUSCH is desired.
The present invention is directed towards systems and methods for transmitting a plurality of aperiodic CSI reports.
In a first aspect of the present invention, each of the plurality of CSI reports are coded separately for transmission on the physical uplink shared channel. Each of the channel state information reports may be coded using tail-biting convolutional coding.
In a second aspect of the present invention, the plurality of CSI reports are jointly coded for transmission on the physical uplink shared channel. The CSI reports may be coded using turbo coding if the payload size of the reports is smaller than a predetermined size. Alternatively, if the payload size of the reports is greater than a predetermined size, the CSI reports may be coded using tail-biting convolution coding.
Additional aspects and advantages of the improvements will appear from the description of the preferred embodiment.
Embodiments of the present invention are illustrated by way of the accompanying drawings, in which:
There are several options for encoding multiple aperiodic CQI/PMI reports on a PUSCH. In one option (“option A”), each aperiodic CQI/PMI report may be coded separately and concatenated with a certain order (e.g., based on a component carrier index of the control channel of which the CQI/PMI report corresponds). In another option (“option B”), the multiple aperiodic CQI/PMI reports may be jointly coded.
The preferred coding scheme for transmitting these reports on the PUSCH is based on the chosen option. For example, if option A is chosen, tail biting convolution coding (“TBCC”), as defined in Release 8 of the 3rd Generation Partnership Project (3GPP), should be reused for coding each aperiodic CQI/PMI report. This choice is made mainly because the maximum payload of an aperiodic CQI/PMI report is approximately 60 bits, which is within the optimal range of TBCC.
In option A, when decoding errors occur in some bits of some of the aperiodic CQI/PMI reports, only the aperiodic CQI/PMI reports where the error bits reside will be affected, while other aperiodic CQI/PMI reports still can be received correctly. An advantage of option B, however, is that an increased coding gain may be realized. For example, as can be seen in Tables 1-6 and
Unlike option A, selecting a code scheme for option B is more involved. For example, because option B entails joint coding for multiple aperiodic CQI/PMI reports, the payload size is increased significantly. Because of this payload size increase, a turbo coding scheme can be advantageous because turbo coding may result in better performance than TBCC when dealing with a larger payload size. On the other hand, there may be a longer decoding delay with turbo coding than with TBCC due to the complexity of turbo coding. Therefore, performance, decoding complexity, and decoding delay should be taken into account when selecting the coding scheme.
If option A is chosen, a resource element number for the CSI can either be: (1) calculated separately from the result of each separate coding output (i.e. the total number of resource elements is the summation of the number of each separate coding output), or (2) calculated jointly from the result of the total coded symbol. In the latter case, the resource element number can be calculated based on the total number of joint coding outputs.
In certain aspects of the present invention, one or more of the elements provided may take the form of computing devices. A “computing device”, as used herein, refers to a general purpose computing device that includes a processor. A processor generally includes a Central Processing Unit (“CPU”), such as a microprocessor. A CPU generally includes an arithmetic logic unit (“ALU”), which performs arithmetic and logical operations, and a control unit, which extracts instructions (e.g., code) from a computer readable medium, such as a memory, and decodes and executes them, calling on the ALU when necessary. “Memory”, as used herein, generally refers to one or more devices or media capable of storing data, such as in the form of chips or drives. Memory may take the form of one or more random-access memory (“RAM”), read-only memory (“ROM”), programmable read-only memory (“PROM”), erasable programmable read-only memory (“EPROM”), or electrically erasable programmable read-only memory (“EEPROM”) chips, by way of further non-limiting example only. Memory may take the form of one or more solid-state, optical or magnetic-based drives, by way of further non-limiting example only. Memory may be internal or external to an integrated unit including the processor. Memory may be internal or external to a computing device. Memory may store a computer program, e.g., code or a sequence of instructions being operable by the processor. In certain aspects of the present invention, one or more of the elements provided may take the form of code being executed using one or more computing devices, such as in the form of computer device executable programs or applications being stored in memory.
While embodiments of this invention have been shown and described, it will be apparent to those skilled in the art that many more modifications are possible without departing from the inventive concepts herein. The invention, therefore, is not to be restricted except in the spirit of the following claims.
Number | Date | Country | |
---|---|---|---|
61445951 | Feb 2011 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14000921 | Sep 2013 | US |
Child | 15138913 | US |