EXHIBIT 17

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 1 of 17
(12) United States Patent 

ROh et al. 

USOO7319718B2 

US 7,319,718 B2 

Jan. 15, 2008 

(10) Patent No.: 

(45) Date of Patent: 

(54) CQI CODING METHOD FOR HS-DPCCH 

(75) Inventors: Dong Wook Roh, Seoul (KR); Min 

Seok Oh, Seoul (KR); Joon Kui Ahn, 

Seoul (KR) 

(73) Assignee: LG Electronics Inc., Seoul (KR) 

(*) Notice: Subject to any disclaimer, the term of this 

patent is extended or adjusted under 35 

U.S.C. 154(b) by 1086 days. 

(21) Appl. No.: 10/365,498 

(22) Filed: Feb. 13, 2003 

(65) Prior Publication Data 

US 2003/O174669 A1 Sep. 18, 2003 

(30) Foreign Application Priority Data 

Feb. 16, 2002 (KR) ...................... 10-2002-OOO835O 

(51) Int. Cl. 

H04B 700 (2006.01) 

(52) U.S. Cl. ...................... 375/224; 375/240; 375/261; 

370/442; 370/491; 370/328; 455/69; 455/452.2: 

714/769; 714/755 

(58) Field of Classification Search ................ 370/442, 

370/491, 328; 455/69, 452,452.2; 375/224, 

375/240,261; 714/769, 755 

See application file for complete search history. 

(56) References Cited 

U.S. PATENT DOCUMENTS 

2002/0141436 A1 * 10/2002 Toskala ...................... 370/442 

2003/O157900 A1* 8, 2003 Gaal et al. .................... 455/69 

2003/0185242 A1* 10, 2003 Lee et al. ................... 370,491 

2004/0058687 A1 3f2004 Kim et al. ............... 455,452.2 

FOREIGN PATENT DOCUMENTS 

EP 1248 485 A1 

EP 1289 167 A1 

10, 2002 

3, 2003 

(32, 5) 

expurgated TFCl 

Code 

5 bits 

KR 1020020039121 5, 2002 

KR 1020020062471 T 2002 

KR 102003OO35293 5, 2003 

KR 102003.0035605 5, 2003 

OTHER PUBLICATIONS 

3GPP TS 25.222; Version 5.3.0 Release 5: Dec. 2002. 

3GPP TS 25.212; Version 5.0.0 Release 5: Mar. 2002. 

3GPP TS 25.212; Version 2.3.0; Oct. 1999. 

Ericsson, "Coding for Channel-Quality-Related Information.” 

3GPP TSG-RAN #22, Nov. 19-23, 2001, Cheju, Korea, R1-01 

1144. 

LG Electronics Inc., “Uplink QI Signaling with Error-Detection 

Capability.” TSG-RAN Working Group 1 #22, Nov. 19-23, 2001, 

Jeju, Korea, Todoc R1-01-1135. 

Samsung, "Coding Scheme for Quality Indicator (rev. 1),” 3GPP 

TSG-RAN 1 #22, Nov. 22-23, 2001, Jeju, Korea, R1-01-1324. 

Philips, “Performance Requirements for Channel Quality Signal 

ling.” TSG RAN WG1 #22, Nov. 19-23, 2001, Jeju, South Korea, 

TSGR1(O1) 1204. 

Philips, “Coding of Channel Quality Information.”3GPP TSG RAN 

WG1 #23, Jan. 8-11, 2002, Espoo, Finland, Tcloc R1-02-0046. 

Japanese Office Action dated Sep. 5, 2006. 

* cited by examiner 

Primary Examiner Chieh M. Fan 

Assistant Examiner—Eva Zheng 

(74) Attorney, Agent, or Firm—KED & Associates, LLP 

(57) 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 COI code using the second basis sequences. Also, since 

HSDPA system has been designed in order to increase the 

system throughput, the COI 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. 

28 Claims, 6 Drawing Sheets 

13 COded bit 

puncturing & 

1 COded bit 

repetition 

20 COded 

 

 

 

 

 

 

 

 

 

 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 2 of 17
U.S. Patent Jan. 15, 2008 Sheet 1 of 6 US 7,319,718 B2 

FIG.1 

PRIOR ART 

120 

150 

 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 3 of 17
U.S. Patent Jan. 15, 2008 Sheet 2 of 6 US 7,319,718 B2 

FIG.2 

PRIOR ART 

T = 2560 chips 2x T = 5120 chips 

HARQ-ACK 

One HS-DPCCH subframe (2 ms) 

Subframe#0 Subframethi SubframeH4 

One radio frame T = 10 ms 

FIG.3a 

PRIOR ART 

TFC TFC o (16,5) (5 bits) TFC COde Codeword 

ao...as bo.b.15 

Prior Art 

TFC TFC (32, 10) (10 bits) TFC Code codeword 

ao...as bo...b3 

 

 

 

 

 

 

 

 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 4 of 17
U.S. Patent Jan. 15, 2008 Sheet 3 of 6 US 7,319,718 B2 

FIG4 

PRIOR ART 

16 COded 

(16,5) in bits TFC COde 

20 coded 

bits 

first 4 bits 

FIG.Sa 

PRIOR ART 

20 COded (32, 5) 5 bits expurgated TFC 12 COded bit 

Code puncturing turi 

FIG.Sb 

PRIOR ART 

2, 4, 5, 6, 8, 9.10, 11, 12, 13, 14, 30 Mo, M. M. M. M. 

 

 

 

 

 

 

 

 

 

 

 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 5 of 17
U.S. Patent Jan. 15, 2008 Sheet 4 of 6 US 7,319,718 B2 

PRIOR ART 

(20.5) CQ code 20 ed 

5 bits extending 

(16,5) TFCI code 

FIG.7a 

13 COded bit 

puncturing & 

1 COded bit 

repetition 

20 COded (32, 5) bits expurgated TFCl 

COde 

5 bits 

FIG.7b 

Puncturing pattern Repetition pattern 

0, 2, 4, 5, 6, 8, 

9, 10, 11, 12, 13, 14, 30 Mor M 1, M M M. 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 6 of 17
U.S. Patent Jan. 15, 2008 Sheet 5 of 6 US 7,319,718 B2 

FIG.8a. 

14 coded bit 

2O coded (32, 5) puncturing & 

5 bits expurgated TFC 1 coded bit 

code two times 

repetition 

FG.8b. 

Puncturing pattern Repetition pattern 

O, 1, 2, 4, 5, 6, 8, 

9, 10, 11, 12, 13, 14, 30 31, 31 Mo, M M Mat M 

 

 

 

 

 

 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 7 of 17
U.S. Patent Jan. 15, 2008 Sheet 6 of 6 US 7,319,718 B2 

FIG.9a 

16 coded bit 

2O Codec (32, 5) puncturing & 

5 bits expurgated TFCl 1 coded bit 

COce four times 

repetition 

FIG.9b 

Puncturing pattern Repetition pattern 

0, 1, 2, 3, 4, 5, 6, 7, 8, 

9, 10, 11, 12, 13, 14, 3D 31, 31, 31, 31 Mo M. M. M. M. 

 

 

 

 

 

 

 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 8 of 17
US 7,319,718 B2 

1. 

CQI CODING METHOD FOR HS-DPCCH 

BACKGROUND OF THE INVENTION 

1. Field of the Invention 

The present invention relates to a wireless communication 

system and, more particularly, to a reliable uplink channel 

quality information (CQI) coding method for HS-DPCCH in 

HSDPA system for 3GPP. 

2. Description of the Background Art 

The UMTS (Universal Mobile Telecommunications Sys tem) is the third generation mobile communication system 

evolved from a GSM (Global System for Mobile Commu 

nications) and a European style mobile communication 

standard. It is intended to provide improved mobile com 

munication services on the basis of a GSM core network 

(CN) and a Wideband Code Division Multiple Access 

(WCDMA) access technology. 

For the purpose of making a standard for third generation 

mobile communication systems (IMT-2000 systems) based on evolved GSM core network and WCDMA radio access 

technology, a group of Standard developing organizations 

including ETSI of Europe, ARIB/TTC of Japan, T1 of U.S., 

and TTA of Korea established the Third Generation Part 

nership Project (3GPP). 

For the purpose of efficient management and technologi 

cal development, five Technical Specification Groups 

(TSGs) are organized under 3GPP in consideration of net 

work construction factors and their operations. 

Each TSG is in charge of approving, developing and 

managing specifications related to a pertinent area. Among 

them, RAN (Radio Access Network) group has developed functions, requirements and interface specifications related 

to UE (User Equipment) and UMTS terrestrial radio access 

network (UTRAN) in order to set a new radio access 

network specification to the third generation mobile com 

munication system. 

The TSG-RAN group consists of one plenary group and 

four working groups. 

WG1 (Working Group 1) has been developing specifica 

tions for a physical layer (Layer 1), and WG2 has been 

specifying functions of a data link layer (Layer 2) between 

UE and UTRAN. In addition, WG3 has been developing specifications for interfaces among Node Bs (the Node B is 

a kind of base station in the wireless communications), 

Radio Network Controllers (RNCs) and the core network. 

Lastly, WG4 has been discussing requirements for radio link 

performance and radio resource management. 

FIG. 1 illustrates a structure of the UTRAN defined in 

3GPP 

As depicted in FIG. 1, the UTRAN 110 includes at least 

one or more radio network sub-systems (RNSs) 120 and 

130, and each RNS includes one RNC and at least one or 

more Node Bs. For example, Node B 122 is managed by 

RNC 121, and receives information transmitted from the 

physical layer of the UE 150 through an uplink channel and 

transmits a data to the UE 150 through a downlink channel. 

Accordingly, the Node B is considered to work as an 

access point of the UTRAN from the UE point of view. 

The RNCs 121 and 131 perform functions of allocation 

and management of radio resources of the UMTS and are 

connected to a Suitable core network element depending on 

types of services provided to users. 

For example, the RNCs 121 and 131 are connected to a 

mobile switching center (MSC) 141 for a circuit-switched 

communication Such as a voice call service, and are con 

10 

15 

25 

30 

35 

40 

45 

50 

55 

60 

65 

2 

nected to a SGSN (Serving GPRS Support Node) 142 for a 

packet Switched communication Such as a radio Internet 

service. 

The RNC in charge of a direct management of the Node 

B is called a Control RNC (CRNC) and the CRNC manages common radio resources. 

On the other hand, the RNC that manages dedicated radio 

resources for a specific UE is called a Serving RNC (SRNC). 

Basically, the CRNC and the SRNC can be co-located in the 

same physical node. However, if the UE has been moved to 

an area of a new RNC that is different from SRNC, the 

CRNC and the SRNC may be located at physically different 

places. 

There is an interface that can operate as a communication 

path between various network elements. The interface 

between a Node B and a RNC is called a lub interface, and an interface between RNCs is called an lur interface. And an 

interface between the RNC and the core network is called an 

lu. 

High Speed Data Packet Access (HSDPA) is standardiza 

tion work within the 3GPP for realizing high speed, high 

quality wireless data packet services. To support HSDPA, 

various advanced technologies Such as Adaptive Modulation 

and Coding (AMC), Hybrid Automatic Repeat Request 

(HARQ), Fast Cell Selection (FCS), Multiple Input Multiple 

Out (MIMO), and etc. are introduced. 

Well known are the benefits of adapting the transmission 

parameters in a wireless system to the changing channel 

conditions. The process of modifying the transmission 

parameters to compensate for the variations in channel 

condition is known as link adaptation (LA) and AMC is one 

of the link adaptation techniques. The principle of AMC is 

to change the modulation and coding scheme according to 

variations in the channel conditions, Subject to system 

restrictions. That channel conditions can be estimated based 

on feedback from the UE. In a system with AMC, the UEs 

in favorable positions, i.e., close to the cell site, are typically assigned higher order modulation with higher code rate (e.g. 

64 QAM with R=34 Turbo Code), while UEs in unfavorable 

positions, i.e., close to the cell boundary, are assigned lower 

order modulation with lower code rate (e.g. QPSK with 

R=/2 Turbo Code). The main benefits of AMC are the higher 

data rate available for UEs in favorable positions which in 

turn increases the average throughput of the cell and the 

reduced interference variation due to link adaptation based 

on variations in the modulation/coding scheme instead of 

variations in transmit power. 

In conventional ARQ, ARQ process should be performed 

along up to the upper layer of the UE and the node B, while 

in the HSDPA, ARQ process is conducted within the physi 

cal layer. The key characteristic of the HARQ is to transmit 

the un-transmitted portion of the encoded block when the 

NACK (No Acknowledgement) is received from the 

receiver, which enables the receiver to combine each portion 

of received codewords into the new codewords with the 

lower coding rate so as to obtain much coding gain. Another 

feature of the n-channel HARQ is that a plurality of packets can be transmitted on n channels even when an ACK/NACK 

(Acknowledgement/No acknowledgement) is not received 

unlike in the typically Stop and Wait ARQ which allows the 

node B to transmit the next packet only when the ACK 

signal is received from the receiver or to retransmit the 

previous packet when the NACK signal is received. In other 

words, the node B of HSDPA can transmit a plurality of next 

packets successively even if it does not receive the ACK/ 

NACK for the previous transmitted packet, thereby increas 

ing channel usage efficiency. Combining AMC and HARQ 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 9 of 17
US 7,319,718 B2 

3 

leads to maximize transmission efficiency-AMC provides 

the coarse data rate selection, while HARQ provides fine 

data rate adjustment based on channel conditions. 

FCS is conceptually similar to Site Selection Diversity 

Transmission (SSDT). Using FCS, the UE indicates the best 

cell which should serve it on the downlink, through uplink 

signaling. Thus while multiple cells may be members of the 

active set, only one of them transmits at a certain time, potentially decreasing interference and increasing system 

capacity. Determination of the best cell may not only be 

based on radio propagation conditions but also available 

resources Such as power and code space for the cells in the 

active set. 

MIMO is one of the diversity techniques based on the use 

of multiple downlink transmit/receiver antennas. MIMO 

processing employs multiple antennas at both the base 

station transmitter and terminal receiver, providing several 

advantages over transmit diversity techniques with multiple 

antennas only at the transmitter and over conventional single 

antenna systems. 

Due to the introductions of these new schemes, new 

control signals are configured between the UE and the node 

B in HSDPA, HS-DPCCH is a modification to UL, DPCCH 

for supporting HSDPA. 

FIG. 2 shows a frame structure for uplink HS-DPCCH 

associated with HS-DSCH transmission. The HS-DPCCH 

carries uplink feedback signaling consisted of HARQ-ACK/ 

NACK and channel-quality indicator (CQI). Each subframe 

of length 2 ms (3x2560 chips) consists of 3 slots, each of 

length 2560 chips. The HARQ-ACK/NACK is carried in the 

first slot of the HS-DPCCH subframe and the CQI is carried 

in the Second and third slot of the HS-DPCCH subframe. 

There is at most one HS-DPCCH on each radio link and the 

HS-DPCCH can only exist together with an uplink DPCCH. 

To support fast link adaptation, the UE is to provide node 

B with information about the downlink channel quality, i.e., 

CQI. Regarding the channel coding for HS-DPCCH COI, a 

number of uplink COI coding methods have been proposed 

and most proposals assume that the CQI is to be coded into 

20 channel bits. The CQI coding methods are based on the 

Transmit Format Combination Indicator (TFCI) coding method of 3GPP specification. FIG.3a shows a (16,5) TFCI 

encoder, which is similar to the (32. 10) TFCI encoder in 

FIG. 3b except that five information bits are used so as to 

generate (16, 5) TFCI codeword. The basis sequences for 

(16, 5) TFCI code are shown in table 1a and the basis 

sequences for (32.10) TFCI code are illustrated in table 1b. 

Detailed methods of generating TFCI codeword are revis 

ited below. First, (16.5) TFCI encoding method is described. 

In table 1a, let the TFCI information bits ao, a, a, as a, and 

M., a basis sequence for n-th TFCI information bit. Then 

output codeword bits b, are given by 

4. 

b; = X(a, XM...) mod 2 where i = 0, 1, 2, ... 15 =0 

The output bits are denoted by b, i=0, 1, 2, ... 15. 

In a similar manner, the generation of (32. 10) TFCI 

codeword can be defined. In table 1b, let the TFCI infor 

mation bits ao, a, a2, as aa, as as a 7, as, as and M, a basis 

sequence for n-th TFCI information bit. Then output code 

word bits b, are given by 

10 

15 

25 

30 

35 

40 

45 

50 

55 

60 

65 

9 

b = X(a, XM) mod 2 where i = 0, 1, 2, ... 31 =0 

The output bits are denoted by b, i=0, 1, 2, ... 31. 

The basis sequences for (16, 5) TFCI in Table 1a are 

included in the basis sequences for (32, 10) TFCI in Table 

1b if the information bits are limited to the first 5 bits and the 

some 16 output bits are selected from 32 output bits. The 

common part between two basis sequences is highlighted by 

shadow in table 1b. The CQI coding method is based on the 

conventional TFCI coding method. The CQI requires 5 

information bits and 20 coded bits, i.e. (20, 5) COI code. 

Therefore, the (16, 5) TFCI code and (32, 10) TFCI coding 

method should be modified to fit the required number of bits 

for CQI coding. The (16, 5) TFCI code should be extended 

to (20, 5) CQI code by adding each basis sequence by 4 bits. 

The (32, 10) TFCI code can be used to generate (20, 5) CQI 

code through two steps. First, the (32.10) TFCI code should 

be expurgated to the (32, 5) modified TFCI code by deleting 

last 5 basis sequences. Hereinafter the (32, 5) modified TFCI 

code by deleting last 5 basis sequences is referred to (32, 5) 

expurgated TFCI code. Secondly, the (32, 5) expurgated 

TFCI code should be punctured and repeated to meet the 

(20, 5) COI code. The basis sequences for the (32, 5) 

expurgated TFCI code are as follows in table 1c. The 

common part of basis sequences between (16, 5) TFCI code 

and (32, 5) expurgated TFCI code is shadowed. The table 1c 

also include the basis sequences for (16, 5) TFCI code, i.e. 

table 1a. It means that the generating method based on the 

(32, 10) TFCI code can be represented by another form of 

generating method based on the (16, 5) TFCI code, vice WSa. 

TABLE 1 a 

Mio M M2 M M;4 

O O O O 

1 O O O 

2 O O 

3 O O 1 O 

4 O 1 O 

5 O 1 O 

6 1 O 

7 O O O 1 

8 O O 1 

9 O O 1 

10 O 1 

11 O O 1 1 

12 O 1 1 

13 O 1 1 

14 1 1 

15 O O O O 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 10 of 17
US 7,319,718 B2 

5 

TABLE 1b. 

Mio M1 M2 M3 M4 Ms M6 M7 Miss 

O O O O O O O O 

1 O O O O O O 

2 O O O O O O 

3 O O O O O 

4 O O O O O O 

5 O O O O O 

6 O O O O 

7 O O O 1 O O 

8 O O 1 O 

9 O O 1 O O 

10 O 1 O O O 

11 O O 1 O O 

12 O 1 O O O 

13 O 1 O O O 

14 1 O 

15 O O O O 

16 O O O O 

17 O O O 

18 O O O O 

19 O O O O 

2O O O O O 

21 O O 

22 O O O 1 O O 

23 O O 1 1 O 

24 O O 1 1 O 

25 O 1 1 O O 

26 O O 1 O O 

27 O 1 1 O 

28 O 1 1 

29 1 1 

30 O O O O O O O O 

31 O O O O 1 O O 

TABLE 1c 

35 

Mio M. M2 M3 M4 

O O O O O 

1 O O O O 

2 O O O 

3 O O 1 O O 40 

4 O 1 O O 

5 O 1 O O 

6 1 O O 

7 O O O 1 O 

8 O O 1 O 

9 O O 1 O 45 

10 O 1 O 

11 O O 1 1 O 

12 O 1 1 O 

13 O 1 1 O 

14 1 1 O 

15 O O O 16 O O O 50 

17 O O 

18 O O 1 O 

19 O 1 O 

2O O 1 O 

21 1 O 

22 O O O 1 55 

23 O O 1 

24 O O 1 

25 O 1 

26 O O 1 1 

27 O 1 1 

28 O 1 1 60 

29 1 1 

30 O O O O O 

31 O O O O 

FIG. 4 illustrates an encoder for generating an extended 

(16, 5) TFCI code. In FIG. 4, (16, 5) TFCI code, is reused 

with each codeword extended with the four least reliable 

65 

information bits for (20, 5) COI code. This COI coding 

scheme is designed so as to have the optimal minimum 

distance. 

FIG. 5a illustrates an encoder for generating punctured 

(32, 5) expurgated TFCI code. In this COI coding scheme, 

(32, 5) expurgated TFCI code with puncturing 12 symbols is 

proposed. The puncturing pattern and used basis sequences are as in FIG. 5b. 

However, (20, 5) CQI coding schemes using the extended 

(16, 5) TFCI code in FIG. 4 and the punctured (32, 5) 

expurgated TFCI code in FIG. 5 are equivalent to each other. 

That is because the resultant basis sequences based on the 

(16, 5) TFCI code are the same as the resultant punctured 

basis sequences based on the (32, 5) expurgated TFCI code 

after puncturing. The only difference is the order of code 

word bits. However, since the difference of bit position 

doesn’t have any effect on the coding performances and 

properties, both coding schemes of FIG. 4 and FIG. 5 are 

equivalent each other. 

Since the (20, 5) COI coding scheme based on the (16, 5) 

TFCI code can be expressed as that based on the (32, 5) 

expurgated TFCI code, vice versa, the extended (16.5) TFCI 

code and the punctured (32, 5) expurgated TFCI code are 

commonly expressed as the basis sequences in table 2. It 

means that the (20, 5) CQI coding scheme based on both the 

(16, 5) TFCI and (32, 5) expurgated TFCI code is to decide 

what the basis sequence pattern is in the blank in table 2. 

Hereinafter, the basis sequence part which is the same as 

3GPP technical specifications will be omitted for conve 

nience. 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 11 of 17
US 7,319,718 B2 

TABLE 2 

Mio M. M2 M3 M4 

O 1 O O O 1 

14 1 1 1 1 1 

15 O O O O 1 

16 To be filled with the extended patterns in the embodiments 17 

18 

19 

2O 

FIG. 6 illustrates another encoder for generating extended 

(16, 5) TFCI code. In order to extend from (16, 5) to (20, 5), 

the basis sequence is extended and the extended parts are 

filled as in table 3. 

TABLE 3 

Mio M M2 Ms M4 

O 1 O O O 1 

15 O O O O 1 

16 O O O O 1 

17 O O O O 1 

18 O O O O 1 

19 O O O 1 O 

Here M is the most significant bit (MOB). This arrange ment gives significant extra protection to the MOB, and a 

little more robustness to the next most significant bit. 

The conventional CQI coding schemes and their perfor 

mances are varied according to the extended parts of basis 

sequence table. In this approach, to select optimum CQI 

coding scheme means just to find optimum extended part of 

the basis sequence table. 

The above CQI coding schemes are developed in consid 

eration of BER performance and unequal error protection 

(RMS error reduction) but system throughput. However, the 

coding schemes have tradeoffs between BER and unequal 

error protection. In other words, in view of the BER per 

formance the first and second COI coding schemes are 

superior to that of the third one. On the other hand, in view 

of the unequal error protection the third CQI coding scheme 

is Superior to those of the first and second ones. 

However, since HSDPA system has been designed in 

order to increase the system throughput, it is desirable to use 

the system throughput as one of the criteria in order to select 

optimum CQI coding scheme. 

SUMMARY OF THE INVENTION 

The present invention has been made in an effort to solve 

the above problem. 

It is an object of the present invention to provide a method 

for generating basis sequences for CQI coding capable of 

maximizing a system throughput. 

To achieve the object, in one aspect of the present 

invention the channel quality information (CQI) coding method comprises (a) creating first basis sequences for 

generating (32, 5) expurgated TFCI code from (32.10) TFCI 

code, (b) puncturing each of the (32, 5) expurgated TFCI 

codes in a predetermined bit pattern in order to maximize 

10 

15 

25 

30 

35 

40 

45 

50 

55 

60 

65 

8 

system throughput, (c) repeating a predetermined bit of each 

(32, 5) expurgated TFCI code for predetermined times in 

order to maximize system throughput, and (d) encoding 5 

information bits into COI codes using a second basis 

sequences generated through (b) and (c). 

Each (32, 5) expurgated TFCI code is punctured as many 

as 16 bits in order of 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 

13, 14, and 30" bits, and a 31' bit of the (32, 5) expurgated 

TFCI code is repeated 4 times. 

The first basis sequences are already shown in table 1c. 

The second basis sequences are as in following table: 

Mio M. M2 M3 M4 

O 1 O O O 

1 O 1 O O 

2 1 1 O O 

3 O O 1 O 

4 1 O 1 O 

5 O 1 1 O 

6 1 1 1 O 

7 O O O 1 

8 1 O O 1 

9 O 1 O 1 

10 1 1 O 1 

11 O O 1 1 

12 1 O 1 1 

13 O 1 1 1 

14 1 1 1 1 

15 O O O O 

16 O O O O 

17 O O O O 

18 O O O O 

19 O O O O 

where i=0,..., 19. 

In other aspect of the present invention the channel 

quality information (CQI) coding method comprises input 

ting 5 information bits, generating 32 bit sub-codes with the 

information bits using a basis sequences, generating 20 bit 

codewords by puncturing 16 bits from each of the sub-codes 

in a predetermined bit pattern and repeating a predetermined 

bit of the sub-code. 

The sub-codes are punctured 16 bits in order of 0, 1, 2, 3, 

4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, and 30" bits and 31 bit 

is repeated 4 times. 

The resultant basis sequences 

Mo-10101010101010100000, 

M=01100110011001100000, M-000111100001111 

00000, M=00000001111111100000, and 

M-11111111111111111111, where i=0,..., 19. 

In other aspect of the present invention the channel 

quality information (CQI) coding method comprises (a) 

obtaining first basis sequences from (16, 5) TFCI code, (b) 

extending basis sequences to (20, 5) COI code in a prede 

termined pattern in order to maximize system throughput, 

(c) encoding 5 information bits into COI codes using a 

second basis sequences generated through (a) and (b). The 

second extended basis sequences are the same as the upper 

table. 

In other aspect of the present invention the channel 

quality information (CQI) coding method comprises (a) 

encoding 5 information bits into (16, 5) TFCI codes using 

(16, 5) TFCI basis sequences (b) repeating the MOB of 

information bits 4 times in order to maximize system throughput. 

are represented by 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 12 of 17
US 7,319,718 B2 

9 

BRIEF DESCRIPTION OF THE DRAWINGS 

The invention will be described in detail with reference to 

the following drawings in which like reference numerals 

refer to like elements wherein: 

FIG. 1 is a conceptual view showing a structure of the 

UMTS radio access network (UTRAN); 

FIG. 2 is a drawing illustrating a frame structure for 

uplink HS-DPCCH associated with HS-DSCH transmission: 

FIG.3a is a schematic block diagram illustrating a (16,5) 

TFCI encoder; 

FIG. 3b is a schematic block diagram illustrating a (32. 

10) TFCI encoder; 

FIG. 4 is a schematic block diagram illustrating an 

encoder for generating a conventional (20, 5) COI code 

based on the (16, 5) TFCI code: 

FIG. 5a is a schematic block diagram illustrating an 

encoder for generating conventional (20, 5) CQI code based 

on the expurgated (32, 5) TFCI code: 

FIG. 5b is a table showing a puncturing pattern and used 

basis adapted to the encoder of FIG. 5a, 

FIG. 6 a schematic block diagram illustrating another 

encoder for generating (20, 5) COI code by extending (16. 

5) TFCI code: 

FIG. 7a is a schematic block diagram illustrating an 

encoder for generating (20, 5) COI code according to a first 

embodiment of the present invention: 

FIG.7b is a table showing a puncturing pattern, repetition 

pattern, and used basis adapted to the encoder of FIG. 7a, 

FIG. 8a is a schematic block diagram illustrating an 

encoder for generating (20, 5) COI code according to a 

second embodiment of the present invention; 

FIG. 8b is a table showing a puncturing pattern, repetition 

pattern, and used basis adapted to the encoder of FIG. 8b, 

FIG. 9a is a schematic block diagram illustrating an 

encoder for generating (20, 5) COI code according to a third 

embodiment of the present invention; and 

FIG.9b is a table showing a puncturing pattern, repetition 

pattern, and used basis adapted to the encoder of FIG. 9a. 

DETAILED DESCRIPTION OF THE 

PREFERRED EMBODIMENTS 

Preferred embodiments of the present invention will be 

described with reference to the accompanying drawings 

hereinafter. 

FIG. 7a is a block diagram illustrating an encoder for 

generating (20, 5) code according to a first embodiment of 

the present invention and FIG. 7b is a table for illustrating 

how the encoder of FIG. 7a generate the (20, 5) code. 

Referring to FIG. 7a and FIG.7b, once 5 information bits 

are inputted, the encoder linearly combines the information 

bits with basis sequences so as to generate a (32, 5) 

expurgated TFCI code. The expurgated TFCI code of 32 bit 

length is punctured by 13 bits in a puncturing pattern (0, 2. 

4, 5, 6, 8, 9, 10, 11, 12, 13, 14, and 30' bits) and the 31 bit 

is repeated one time such that the code word of 20 bit length 

is obtained. The basis sequences are Mo. M1, M2, Ms. 

M. The basis sequences generated according to the first 

embodiment are as following in table 4. In other aspect of 

the first embodiment is to construct basis sequences by extending from (16, 5) TFCI code to the basis sequence of 

table 4. 

10 

15 

25 

30 

35 

40 

45 

50 

55 

60 

65 

TABLE 4 

Mio M. M2 M3 M4 

O 1 O O O 1 

15 O O O O 1 

16 O O O O 1 

17 O O O 1 O 

18 O O 1 O O 

19 O 1 O O O 

Each of the basis sequences according to the first embodi 

ment can be expressed as follows: 

M-10101010101010100000 

M=01100110011001100001 

M=00011110000111100010 

M=00000001111111100100 

M-11111111111111111000 

FIG. 8a is a block diagram illustrating an encoder for 

generating (20, 5) code according to a second embodiment 

of the present invention and FIG. 8b is a table for illustrating 

how the encoder of FIG. 8a generate the (20, 5) code. 

Referring to FIG. 8a and FIG. 8b, the encoder linearly combines 5 inputted information bits with basis sequences 

so as to generate a (32, 5) expurgated TFCI code. The 

expurgated TFCI code of 32 bit length is punctured by 14 

bits in a puncturing pattern (0, 1, 2, 4, 5, 6, 8, 9, 10, 11, 12, 

13, 14, and 30' bits) and the 31' bit is repeated two times 

such that the code word of 20 bit length is obtained. The 

basis sequences generated according to the second embodi 

ment of the present invention are as following in table 5. In 

other aspect of the second embodiment is to construct basis 

sequences by extending from (16, 5) TFCI code to the basis 

sequence of table 5. 

TABLE 5 

Mio M. M2 M3 M4 

O 1 O O O 1 

15 O O O O 1 

16 O O O O 1 

17 O O O O 1 

18 O O O 1 O 

19 O O 1 O O 

Each of the basis sequences according to the second 

embodiment can be expressed as follows: 

M-10101010101010100000 

M=01100110011001100000 

M-00011110000111100001 

M=00000001111111100010 

M=11111111111111111100 

FIG. 9a is a block diagram illustrating an encoder for 

generating (20, 5) code according to a third embodiment of 

the present invention and FIG.9b is a table for illustrating 

how the encoder of FIG. 9a generate the (20, 5) code. 

Referring to FIG. 9a and FIG. 9b, the encoder linearly 

combines 5 inputted information bits with basis sequences 

so as to generate a (32, 5) expurgated TFCI code. The 

expurgated TFCI code of 32 bit length is punctured by 16 

bits in a puncturing pattern (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 

12, 13, 14, and 30" bits) in order to maximize the system throughput and the 31 bit is repeated 4 times in order to 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 13 of 17
US 7,319,718 B2 

11 

maximize the system throughput such that the code word of 

20 bit length is obtained. The basis sequences generated 

according to the third embodiment of the present invention 

are as following in table 6. 

TABLE 6 

Mio M M2 Ms M4 

O 1 O O O 1 

15 O O O O 1 

16 O O O O 1 

17 O O O O 1 

18 O O O O 1 

19 O O O O 1 

Each of the basis sequences according to the third 

embodiment can be expressed as follows: 

M-10101010101010100000 

M=01100110011001100000 

M-00011110000111100000 

M-00000001111111100000 

M=11111111111111111111 

In other aspect of the third embodiment, the channel 

quality information (CQI) coding method comprises (a) 

obtaining first basis sequences from (16, 5) TFCI code, (b) 

extending basis sequences to (20, 5) COI code in a prede 

termined pattern in order to maximize system throughput, 

(c) encoding 5 information bits into COI codes using a 

second basis sequences generated through (a) and (b). The 

second extended basis sequences are the same as table 6. 

In other aspect of the third embodiment, the channel 

quality information (CQI) coding method comprises (a) 

encoding 5 information bits into (16, 5) TFCI codes using 

(16, 5) TFCI basis sequences (b) repeating the MOB of 

information bits 4 times. 

To support the superiority of the COI coding schemes of 

the present invention to the conventional ones, the CQI 

coding schemes of the embodiments and the conventional 

ones were simulated and compared with respect to BER, 

RMS error, and system throughput for selecting optimum 

CQI coding scheme. Since there is a trade-off between BER 

and RMS error, the system throughput is considered as a 

criterion. For simplification, the conventional CQI coding 

schemes characterized in table 2 and table 3 are referred as 

C1 and C2. 

In the simulations result, the order of the BER perfor mance as follows. 

C1>embodiment 1 >embodiment 2>C2>embodiment 3 

(C-better , , , worse->) 

The performance gap between the worst and the best is 

approximately 0.5 dB at BER 10. 

In order to measure the unequal error protection capabil 

ity, the root-mean-square (RMS) error as the criterion is 

introduced. The RMS error means the root mean square of 

difference between transmitted codewords and received 

codewords. The order of the RMS error reduction perfor mance is as follows. 

Embodiment 3>C2>embodiment 2>embodiment 1 >C1 

(C-better , , , worse->) 

The performance gap between the worst and the best is 

approximately 1.5 at -3 dB EbNo/Slot. 

The system throughput is calculated using simplified 

system level simulation. And the conventional analytic 

system level simulator and uplink COI coding schemes are 

joined. With combined system level simulation and uplink 

10 

15 

25 

30 

35 

40 

45 

50 

55 

60 

65 

12 

CQI coding, the BER and RMS error are considered at the 

same time. The throughput of BER performance is as 

follows. 

Embodiment 3>C2>embodiment 2>embodiment 1 >C1 

(C-better , , , worse->) 

The performance gap between the worst and the best is 

approximately 79 kbps at 3 dB. 

In the present invention, the COI coding schemes are 

classified with respect to the extended parts of the basis 

sequence tables and the system throughput is introduced as 

a criterion for evaluating the CQI coding schemes because 

there is a trade-off between BER and RMS error. Moreover, 

during the system throughput simulation, both BER and 

RMS error effect are already considered together. Also, since 

HSDPA system has been designed in order to increase the 

system throughput, the third embodiment of the present 

invention, which shows the best system throughput in the 

simulation, can be the optimum CQI coding scheme for 

HS-DPCCH. 

While this invention has been described in connection 

with what is presently considered to be the most practical 

and preferred embodiment, it is to be understood that the 

invention is not limited to the disclosed embodiments, but, 

on the contrary, is intended to cover various modifications 

and equivalent arrangements included within the sprit and 

Scope of the appended claims. 

What is claimed is: 

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

providing information bits, ao, a, a2, as, and a 

providing five basis sequences M., for a (20.5) CQI code: 

encoding the information bits by combining the informa 

tion bits with the basis sequences; and 

generating a 20-bit codeword, 

wherein the basis sequences M., are defined as: 

I Mio M. M2 M3 M4 

O 1 O O O 

1 O 1 O O 

2 1 1 O O 

3 O O 1 O 

4 1 O 1 O 

5 O 1 1 O 

6 1 1 1 O 

7 O O O 1 

8 1 O O 1 

9 O 1 O 1 

10 1 1 O 1 

11 O O 1 1 

12 1 O 1 1 

13 O 1 1 1 

14 1 1 1 1 

15 O O O O 

16 O O O O 

17 O O O O 

18 O O O O 

19 O O O O 

2. The method of claim 1, wherein the (20.5) COI 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) COI 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. 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 14 of 17
US 7,319,718 B2 

13 

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

linear combination. 

5. The method of claim 1, wherein the codeword bits, b, 

are given by: 

4. 

bi = X. (an X Min)mod2, where i = 0, ... , 19. =0 

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

a) providing information bits, ao, a, a2, as, and a 

b) providing five basis sequences Min for a TFCI code: 

c) encoding the information bits by combining the infor 

mation 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. ... defined as: ia 

I Mio M. M2 M3 M4 

O 1 O O O 

1 O 1 O O 

2 1 1 O O 

3 O O 1 O 

4 1 O 1 O 

5 O 1 1 O 

6 1 1 1 O 

7 O O O 1 

8 1 O O 1 

9 O 1 O 1 

10 1 1 O 1 

11 O O 1 1 

12 1 O 1 1 

13 O 1 1 1 

14 1 1 1 1 

15 O O O O 

16 O O O O 

17 O O O O 

18 O O O O 

19 O O O O 

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 compris ing an encoder arranged to provide channel quality 

information (CQI) to the base station in the form of a 

10 

15 

25 

30 

35 

40 

45 

50 

55 

60 

65 

14 

20-bit codeword, the encoder being arranged to gener 

ate the codeword by receiving information bits, ao, a 

a, as, and aa, and using five basis sequences, M, to 

encode the information bits by combining the informa 

tion bits with the basis sequences, wherein the basis 

sequences M., are defined as: 

I Mio M M2 Ms M;4 

O O O O 

1 O O O 

2 O O 

3 O O 1 O 

4 O 1 O 

5 O 1 O 

6 1 O 

7 O O O 1 

8 O O 1 

9 O O 1 

10 O 1 

11 O O 1 1 

12 O 1 1 

13 O 1 1 

14 1 1 

15 O O O 

16 O O O 

17 O O 

18 O O 1 O 

19 O 1 O 

2O O 1 O 

21 1 O 

22 O O O 1 

23 O O 1 

24 O O 1 

25 O 1 

26 O O 1 1 

27 O 1 1 

28 O 1 1 

29 1 1 

30 O O O O O 

31 O O O O 

15. A method of coding information regarding a channel, 

compr1S1ng: 

providing information bits of ao, a, a2, as 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., as defined as 

follows: 

I Mio M M2 Ms M;4 

O 1 O O O 

1 O 1 O O 

2 1 1 O O 

3 O O 1 O 

4 1 O 1 O 

5 O 1 1 O 

6 1 1 1 O 

7 O O O 1 

8 1 O O 1 

9 O 1 O 1 

10 1 1 O 1 

11 O O 1 1 

12 1 O 1 1 

13 O 1 1 1 

14 1 1 1 1 

15 O O O O 

16 O O O O 

17 O O O O 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 15 of 17
US 7,319,718 B2 

-continued 

I Mio M. M2 M3 M4 

18 O O O O 1 

19 O O O O 1. 

16. The method of claim 15, wherein output code word 

bits b, are based on 

4. 

bi = X. (a XM)mod2 =0 

where i = 0, ... , 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 ao, a, a. a. and a 

providing five basis sequences Min 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 Mio M. M2 M3 M4 

O 1 O O O 

1 O 1 O O 

2 1 1 O O 

3 O O 1 O 

4 1 O 1 O 

5 O 1 1 O 

6 1 1 1 O 

7 O O O 1 

8 1 O O 1 

9 O 1 O 1 

10 1 1 O 1 

11 O O 1 1 

12 1 O 1 1 

13 O 1 1 1 

14 1 1 1 1 

15 O O O O 

16 O O O O 

17 O O O O 

18 O O O O 

19 O O O O 

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

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

sequence bit. 

10 

15 

25 

30 

35 

40 

45 

50 

55 

60 

16 

23. The method of claim 19, wherein output code word 

bits b, are based on 

where i = 0, ... , 19. 

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

providing information bits of ao, a, a2, as and a 

providing five basis sequences Min 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: 

Mio M. M2 M3 M4 

O 1 O O O 

1 O 1 O O 

2 1 1 O O 

3 O O 1 O 

4 1 O 1 O 

5 O 1 1 O 

6 1 1 1 O 

7 O O O 1 

8 1 O O 1 

9 O 1 O 1 

10 1 1 O 1 

11 O O 1 1 

12 1 O 1 1 

13 O 1 1 1 

14 1 1 1 1 

15 O O O O 

16 O O O O 

17 O O O O 

18 O O O O 

19 O O O O 

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

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

sequence bit. 

28. The method of claim 24, wherein output code word 

bits b, are based on 

4. 

bi = X. (an X Min)mod2 =0 

where i = 0, ... , 19. 

Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 16 of 17
UNITED STATES PATENT AND TRADEMARK OFFICE 

CERTIFICATE OF CORRECTION 

PATENT NO. : 7,319,718 B2 Page 1 of 1 

APPLICATIONNO. : 10/365498 

DATED : January 15, 2008 

INVENTOR(S) : Dong-Wook Roh, Min-Seok Oh and Joon Kui Ahn 

It is certified that error appears in the above-identified patent and that said Letters Patent is 

hereby corrected as shown below: 

Correct claim 14, appearing at column 13, line 61 through column 14, line 38 by deleting the following lines from the table. 

Signed and Sealed this 

Twenty-seventh Day of October, 2009 

David J. Kappos 

Director of the United States Patent and Trademark Office 

 Case 1:20-cv-22051-JEM Document 1-20 Entered on FLSD Docket 05/15/2020 Page 17 of 17