CQI coding method for HS-DPCCH

• US 7,319,718 B2
• Filed: 02/13/2003
• Issued: 01/15/2008
• Est. Priority Date: 02/16/2002
• Status: Active Grant

• Current Assignee: 3G Licensing S.A. (Fineur International S.A.)
• Original Assignee: LG Electronics, Inc. (LG Corporation)
• Inventors: Oh, Min Seok, Ahn, Joon Kui, Roh, Dong Wook
• Primary Examiner(s): Fan; Chieh M.
• Assistant Examiner(s): PUENTE, EVA YI ZHENG
• Application Number:
  US10/365,498
• Publication Number:
  US 20030174669A1
• Time in Patent Office: 1,797 Days
• Field of Search: 370/442, 370/491, 370/328, 455/69, 455/452, 455/452.2, 375/224, 375/240, 375/261, 714/769, 714/755
• US Class Current: 375/224
• CPC Class Codes: H04B 7/2628 using code-division multiple access [CDMA] or spread spectrum multiple access [SSMA] H04B7/2618 takes precedence
• CPC Class Codes: H04L 1/0026 Transmission of channel quality indication
• CPC Class Codes: H04L 1/0028 Formatting
• CPC Class Codes: H04L 1/0057 Block codes H04L1/0061, H04L1/0064 take precedence
• CPC Class Codes: H04L 1/007 Unequal error protection for format H04L1/0078; for codes per se H03M13/35
• CPC Class Codes: H04L 1/0073 Special arrangements for feedback channel
• CPC Class Codes: H04L 1/08 by repeating transmission, e.g. Verdan system H04L1/1858 and H04L1/189 take precedence

Abstract

In the channel quality information (CQI) coding method of the present invention, first basis sequences for generating sub-codes of 32 bits are created, and second basis sequences for generating codewords of 20 bits are created using the first basis sequences, the second basis sequence maximizing system throughput such that five information bits are coded into CQI code using the second basis sequences. Also, since HSDPA system has been designed in order to increase the system throughput, the CQI coding method of the present invention, which shows the best system throughput in the simulation, can be the optimum CQI coding scheme for HS-DPCCH.

Claims

1. A method of coding channel quality information (CQI), comprising the steps of:

providing information bits, a₀, a₁, a₂, a₃, and a₄;

providing five basis sequences M_i,n for a (20,5) CQI code;

encoding the information bits by combining the information bits with the basis sequences; and

generating a 20-bit codeword,

wherein the basis sequences M_i,n are defined as;

I M_i,0 M_i,1 M_i,2 M_i,3 M_i,4 0 1 0 0 0 1 1 0 1 0 0 1 2 1 1 0 0 1 3 0 0 1 0 1 4 1 0 1 0 1 5 0 1 1 0 1 6 1 1 1 0 1 7 0 0 0 1 1 8 1 0 0 1 1 9 0 1 0 1 1 10 1 1 0 1 1 11 0 0 1 1 1 12 1 0 1 1 1 13 0 1 1 1 1 14 1 1 1 1 1 15 0 0 0 0 1 16 0 0 0 0 1 17 0 0 0 0 1 18 0 0 0 0 1 19 0 0 0 0 1.

2. The method of claim 1, wherein the (20,5) CQI code is obtained from a (16,5) TFCI code comprising five 16-bit basis sequences, by extending each 16-bit basis sequence by repeating a respective last basis sequence bit four times.

3. The method of claim 1, wherein the (20,5) CQI code is obtained from a (32,5) expurgated TFCI code comprising five 32-bit basis sequences, by puncturing each 32-bit basis sequence by 16 bits in a predetermined puncturing pattern and repeating a respective last basis sequence bit four times.

4. The method of claim 1, wherein the combination is a linear combination.

5. The method of claim 1, wherein the codeword bits, b_i, are given by:

$b_i=\underset{n=0}{\overset{4}{\sum <br><br>}}<br><br><br><br>\left(a_n\times <br><br>M_{i,n}\right)<br><br>\mathrm{mod}<br><br><br><br>2,<br><br>\mathrm{where}<br><br><br><br>i=0,\mathrm{\dots <br><br>}<br><br>,19.$

6. A method of coding channel quality information (CQI), comprising the steps of:

a) providing information bits, a₀, a₁, a₂, a₃, and a₄;

b) providing five basis sequences Mi,n for a TFCI code;

c) encoding the information bits by combining the information bits with the basis sequences;

d) generating an intermediate codeword; and

e) adding a further bit repeated four times to generate a 20-bit codeword.

7. The method of claim 6, wherein the TFCI code is a (16,5) TFCI code and the intermediate codeword comprises 16 bits.

8. The method of claim 6, wherein the TFCI code is a (32,5) expurgated TFCI code and the intermediate codeword comprises 32 bits, the method further comprising the step of puncturing the 32-bit intermediate codeword by 16 bits in a predetermined puncturing pattern prior to sep (e).

9. The method of claim 6, wherein the further bit repeated four times is one of the information bits.

10. The method of claim 9, wherein the further bit is the most significant bit (MOB).

11. The method of claim 6, wherein the further bit repeated four times is a bit from the intermediate codeword.

12. The method of claim 11, wherein the further bit is a last bit of the intermediate codeword.

13. The method of claim 6, wherein the 20-bit codeword is the same as a codeword generated using basis sequences M_i,n, defined as:

I M_i,0 M_i,1 M_i,2 M_i,3 M_i,4 0 1 0 0 0 1 1 0 1 0 0 1 2 1 1 0 0 1 3 0 0 1 0 1 4 1 0 1 0 1 5 0 1 1 0 1 6 1 1 1 0 1 7 0 0 0 1 1 8 1 0 0 1 1 9 0 1 0 1 1 10 1 1 0 1 1 11 0 0 1 1 1 12 1 0 1 1 1 13 0 1 1 1 1 14 1 1 1 1 1 15 0 0 0 0 1 16 0 0 0 0 1 17 0 0 0 0 1 18 0 0 0 0 1 19 0 0 0 0 1.

14. A wireless communications system, comprising:

a user apparatus; and

a wireless communications network, comprising a base station interface between the user apparatus and the communications network, the user apparatus comprising an encoder arranged to provide channel quality information (CQI) to the base station in the form of a 20-bit codeword, the encoder being arranged to generate the codeword by receiving information bits, a₀, a₁, a₂, a₃, and a₄, and using five basis sequences, M_i,n, to encode the information bits by combining the information bits with the basis sequences, wherein the basis sequences M_i,n are defined as;

I M_i,0 M_i,1 M_i,2 M_i,3 M_i,4 0 1 0 0 0 1 1 0 1 0 0 1 2 1 1 0 0 1 3 0 0 1 0 1 4 1 0 1 0 1 5 0 1 1 0 1 6 1 1 1 0 1 7 0 0 0 1 1 8 1 0 0 1 1 9 0 1 0 1 1 10 1 1 0 1 1 11 0 0 1 1 1 12 1 0 1 1 1 13 0 1 1 1 1 14 1 1 1 1 1 15 1 0 0 0 1 16 0 1 0 0 1 17 1 1 0 0 1 18 0 0 1 0 1 19 1 0 1 0 1 20 0 1 1 0 1 21 1 1 1 0 1 22 0 0 0 1 1 23 1 0 0 1 1 24 0 1 0 1 1 25 1 1 0 1 1 26 0 0 1 1 1 27 1 0 1 1 1 28 0 1 1 1 1 29 1 1 1 1 1 30 0 0 0 0 0 31 0 0 0 0 1.

15. A method of coding information regarding a channel, comprising:

providing information bits of a₀, a₁, a₂, a₃, and a₄;

encoding the information bits using a (20,

     5) code; and

providing output code words of 20 bits as a result of the encoding step, wherein the (20,

     5) code is a prescribed combination of 5 basis sequences M_i,n as defined as follows;

I M_i,0 M_i,1 M_i,2 M_i,3 M_i,4 0 1 0 0 0 1 1 0 1 0 0 1 2 1 1 0 0 1 3 0 0 1 0 1 4 1 0 1 0 1 5 0 1 1 0 1 6 1 1 1 0 1 7 0 0 0 1 1 8 1 0 0 1 1 9 0 1 0 1 1 10 1 1 0 1 1 11 0 0 1 1 1 12 1 0 1 1 1 13 0 1 1 1 1 14 1 1 1 1 1 15 0 0 0 0 1 16 0 0 0 0 1 17 0 0 0 0 1 18 0 0 0 0 1 19 0 0 0 0 1.

16. The method of claim 15, wherein output code word bits b_i are based on

$b_i=\underset{n=0}{\overset{4}{\sum \; <li></li>}}<br><br><br><br>\left(a_n\times <br><br>M_{i,n}\right)<br><br>\mathrm{mod}<br><br><br><br>2$ $\mathrm{where}<br><br><br><br>i=0,\mathrm{\dots <br><br>}<br><br>,19.$

17. The method of claim 16, wherein the prescribed combination is a linear combination.

18. The method of claim 15, wherein the information is channel quality information.

19. A method of coding information regarding a channel, comprising:

providing information bits of a₀, a₁, a₂, a₃, and a₄;

providing five basis sequences Mi,n for a (20,

     5) code

encoding the information bits by Linear combination of the information bits with the basis sequences; and

providing output code words of 20 bits as a result of the encoding step, wherein the (20,

     5) code is obtained from a (16,

     5) TFCI code comprising five 16-bit basis sequences, by extending each 16-bit basis sequence by repeating a further respective basis sequence bit four times.

20. The method of claim 19, wherein the (20, 5) code is as follows:

I M_i,0 M_i,1 M_i,2 M_i,3 M_i,4 0 1 0 0 0 1 1 0 1 0 0 1 2 1 1 0 0 1 3 0 0 1 0 1 4 1 0 1 0 1 5 0 1 1 0 1 6 1 1 1 0 1 7 0 0 0 1 1 8 1 0 0 1 1 9 0 1 0 1 1 10 1 1 0 1 1 11 0 0 1 1 1 12 1 0 1 1 1 13 0 1 1 1 1 14 1 1 1 1 1 15 0 0 0 0 1 16 0 0 0 0 1 17 0 0 0 0 1 18 0 0 0 0 1 19 0 0 0 0 1.

21. The method of claim 19, wherein the further respective basis sequence bit is a respective last basis sequence bit.

22. The method of claim 19, wherein the further respective basis sequence bit is a respective most significant basis sequence bit.

23. The method of claim 19, wherein output code word bits b_i are based on

$b_i=\sum _{}^{}$

n = 0 4 ⁢

⁢

( a n ×

M i , n ) ⁢

mod ⁢

⁢

2 $\mathrm{where}<br><br><br><br>i=0,\mathrm{\dots <br><br>}<br><br>,19.$

24. A method of coding information regarding a channel, comprising:

providing information bits of a₀, a₁, a₂, a₃, and a₄;

providing five basis sequences Mi,n for a (20,

     5) code; and

encoding the information bits by linear combination of the information bits with the basis sequences;

wherein the (20,

     5) code is obtained from a (32,

     5) expurgated TFCI code comprising five 32-bit basis sequences, by puncturing each 32-bit basis sequence by 16 bits in a predetermined puncturing pattern and repeating a further respective basis sequence bit four times.

25. The method of claim 24, wherein the (20, 5) code is as follows:

i M_i,0 M_i,1 M_i,2 M_i,3 M_i,4 0 1 0 0 0 1 1 0 1 0 0 1 2 1 1 0 0 1 3 0 0 1 0 1 4 1 0 1 0 1 5 0 1 1 0 1 6 1 1 1 0 1 7 0 0 0 1 1 8 1 0 0 1 1 9 0 1 0 1 1 10 1 1 0 1 1 11 0 0 1 1 1 12 1 0 1 1 1 13 0 1 1 1 1 14 1 1 1 1 1 15 0 0 0 0 1 16 0 0 0 0 1 17 0 0 0 0 1 18 0 0 0 0 1 19 0 0 0 0 1.

26. The method of claim 24, wherein the further respective basis sequence bit is a respective last basis sequence bit.

27. The method of claim 24, wherein the further respective basis sequence bit is a respective most significant basis sequence bit.

28. The method of claim 24, wherein output code word bits b_i are based on

$b_i=\sum _{}^{}$

n = 0 4 ⁢

⁢

( a n ×

M i , n ) ⁢

mod ⁢

⁢

2 $\mathrm{where}<br><br><br><br>i=0,\mathrm{\dots <br><br>}<br><br>,19.$