throbber
3GPP TSG-RAN Working Group 1 #53
`Kansas City, U.S.A, May 5-9, 2008
`
`R1-081732
`
`Source:
`
`Samsung, LGE, Texas Instruments, Panasonic
`
`Title:
`
`Multiplexing of Rank and CQI/PMI in PUSCH Channel
`
`Agenda Item:
`
`7.1.2
`
`Document for: Discussion
`
`1.
`
`Introduction
`
`In the 3GPP RAN1#52 meeting in February 2008, the following was agreed for uplink control/data
`multiplexing according to [3]:
` Multiplexing of control and data on PUSCH
`o ACK/NACK mapping consecutive to RS, CQI time-first mapping
`
` A/N resources punctured into data starting from the bottom of the figure below
`
` Max number of resources for A/N: 4 SC-FDMA symbols
`
`
`
`CQI resources placed at the beginning of the data resources
`
`Meanwhile, in the same meeting, the following is agreed for rank, CQI and PMI feedback carried on
`PUSCH channel [4]
` Aperiodic PUSCH report:
`
`o Aperiodic reporting of rank information (RI) and CQI/PMI on PUSCH, where RI and
`CQI/PMI are always reported in the same subframe. The CQI/PMI is calculated assuming
`the simultaneously reported rank.
`
` Periodic PUSCH report
`
`Optis Cellular Ex 2024-p. 1
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`o Periodic reporting of RI and CQI/PMI on PUSCH, where RI and CQI/PMI are always
`reported in the same subframe, and hence reported with the same periodicity. The
`CQI/PMI is calculated assuming the simultaneously reported rank.
`
`In this contribution, we propose the following for the data, rank, A/N and CQI/PMI multiplexing in
`PUSCH: Rank should be separately coded from CQI/PMI, and placed next to the A/N bits in PUSCH.
`Meanwhile, in the case of 2 rank bits, (3,2) simplex code is used to capture the 1dB coding gain.
`
`
`2. Multiplexing of Rank, CQI/PMI and A/N bits
`
`Two options exist in how to multiplex rank bits together with CQI/PMI and A/N bits
`1. Rank bits are jointly coded with CQI/PMI bits;
`2. Rank bits are separately coded and on a fixed location in PUSCH. Note (3,2) code mentioned
`above is applicable to the case of 2 rank bits as well. In the case of 1 rank bit, simple repetition
`code is sufficient.
`
`
`
`Our preference is option 2, since is we use Option 1, the BER performance of the rank bits will be likely
`similar to the performance of the CQI/PMI bits, which is not desirable since we typically would like to
`have better protection on the rank bits than the CQI/PMI bits. Furthermore, we think a good location for the
`rank bits is the REs right next to those assigned to the A/N bits, as shown in Figure 1. We note that
`results in [5] have shown that by placing the bits 2 OFDM symbols away from the RS, the BER
`performance of the bits is very similar to the case where it is placed only 1 OFDM symbol away from the
`RS, even in high speed cases.
`
`
`
`Figure 1: Location of the Rank and A/N bits in PUSCH.
`
`
`
`
`
`
`
`
`
`
`
`
`Rank
`
`Optis Cellular Ex 2024-p. 2
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`3. (3,2) Simplex coding for 2 rank bits
`
`
`
`Table 1: Simplex (3,2) code used for 2 bits bits.
`
`
`During the study for PCFICH coding, it was well understood that (3,2) simplex codes provides around 1dB
`performance gain in most fading channel situations. The situation of 2 bit rank coding is very similar to
`that of the PCFICH coding, and therefore we suggest to apply the simplex (3,2) code in the case of 2 rank
`bits to be transmitted in the PUSCH.
`
`
`The following are proposed for the channel coding of the rank bits, assuming the number of coded bits
`
`is
`
`.
`
`Step 1: Map the two rank bits
`
` to a 3-bit codeword according to the Simplex (3,2) code
`
`shown in table 1.
`
`Step 2: In this step, the codeword
`
` is repeated
`
`times, and the resulting sequence is
`
`concatenated with the first
`
`bits in the codeword
`
`. This concatenated bit
`
`sequence is the final coded bit sequence to be modulated and mapped into channel symbol.
`
`
`
`We show an example of the final codewords given by the above two steps, for the case of
`
` in.
`
`table 2.
`
`Table 2: 2bit rank coding for the case of
`
`.
`
`
`
`4. Summary
`
`
`In summary, we propose the following for the data, rank, A/N and CQI/PMI multiplexing in PUSCH:
`1. Rank should be separately coded from CQI/PMI, and placed next to the A/N bits in PUSCH.
`Meanwhile, in the case of 2 rank bits, (3,2) simplex code is used to capture the 1dB coding gain.
`
`
`
` Two information bits
`(Either A/N bits or Rank bits)
`
`Component codeword
`
`
`
`(Simplex (3,2) codebook )
`
`00
`
`01
`
`10
`
`11
`
`000
`
`011
`
`101
`
`110
`
`
`
`c c c
`1 2 3
`
`Q
`
`RI
`
`RI
`o
`[
`1
`
`RI
`o
`
`0
`
`]
`
`c c c
`1 2 3
`
`Q
`
`
`/ 3RI
`
`
`
`
`Q
`
`RI
`
`
`
`3 
`
`
`Q
`
`RI
`
`/ 3
`
`
`
`
`c c c
`1 2 3
`
`Q 
`RI
`
`8
`
`Q 
`RI
`
`8
`
` Two Rank bits
`
`Example of Final codeword with
`
`00
`
`01
`
`10
`
`11
`
`
`
`=8
`
`000 000 00
`
`011 011 01
`
`101 101 10
`
`110 110 11
`
`RIQ
`
`Optis Cellular Ex 2024-p. 3
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`Reference
`
`[1] R1-081155, “CR to 3GPP spec 36.211 Version 8.1.0”, RAN1#52, Feb 2008, Sorrento, Italy
`[2] R1-081157, “CR to 3GPP spec 36.212 Version 8.1.0”, RAN1#52, Feb 2008, Sorrento, Italy
`[3] “Chairman’s note”, 3GPP RAN1#52 meeting, Feb 2008, Sorrento, Italy
`[4] R1-081137, “Summary of AH on AI 6.3.4 “UE Procedures for downlink shared channel”
`[5] R1-081005, “Multiplexing of Control and Data in PUSCH”, LGE, Feb 2008, Sorrento, Italy
`[6] R1-081225, “Multiplexing of Rank, CQI and Data in PUSCH”, March 2008, Shenzhen, China
`[7] R1-081370, “Coding for control information on PUSCH”, March 2008, Shenzhen, China
`[8] R1-081616, “Multiplexing of rank and CQI/PMI in PUSCH channel, March 2008, Shenzhen, China
`
`
`
`
`Optis Cellular Ex 2024-p. 4
`Apple v Optis Cellular
`IPR2020-00465
`
`

This document is available on Docket Alarm but you must sign up to view it.


Or .

Accessing this document will incur an additional charge of $.

After purchase, you can access this document again without charge.

Accept $ Charge
throbber

Still Working On It

This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.

Give it another minute or two to complete, and then try the refresh button.

throbber

A few More Minutes ... Still Working

It can take up to 5 minutes for us to download a document if the court servers are running slowly.

Thank you for your continued patience.

This document could not be displayed.

We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.

Your account does not support viewing this document.

You need a Paid Account to view this document. Click here to change your account type.

Your account does not support viewing this document.

Set your membership status to view this document.

With a Docket Alarm membership, you'll get a whole lot more, including:

  • Up-to-date information for this case.
  • Email alerts whenever there is an update.
  • Full text search for other cases.
  • Get email alerts whenever a new case matches your search.

Become a Member

One Moment Please

The filing “” is large (MB) and is being downloaded.

Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.

Your document is on its way!

If you do not receive the document in five minutes, contact support at support@docketalarm.com.

Sealed Document

We are unable to display this document, it may be under a court ordered seal.

If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.


Access Government Site

We are redirecting you
to a mobile optimized page.





Document Unreadable or Corrupt

Refresh this Document
Go to the Docket

We are unable to display this document.

Refresh this Document
Go to the Docket