# US 8,543,885 B2 · Methods of joint coding in mobile communication system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 8,543,885 B2
- Document ID: US8543885B2
- Status: Granted
- Kind: B2
- Application number: 12/670,100
- Filed: 2008-11-13
- Published: 2010-10-28
- Granted: 2013-09-24
- Earliest claimed: 2007-11-18
- Assignees: LG Electronics Inc.
- Applicants: Dae Won Lee; Dong Wook Roh; Bong Hoe Kim; Nam Yul Yu; Ki Jun Kim
- Inventors: Dae Won Lee; Dong Wook Roh; Bong Hoe Kim; Nam Yul Yu; Ki Jun Kim
- Web page: https://patentgrep.com/patent/US8543885B2

## CPC

- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H03M 13/136: {Reed-Muller [RM] codes}
- H03M 13/356: {Unequal error protection [UEP]}
- H03M 13/6516: {Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields}
- H03M 13/6525: {3GPP LTE including E-UTRA}
- H04L 1/007: {Unequal error protection (for format H04L1/0078; for codes per se H03M13/35)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

A joint coding method in a mobile communication system is disclosed. To block-code kχ-bit first data requiring a received signal quality and k2˜bit second data requiring a different received signal quality, the present invention includes configuring a first block code generation matrix meeting a first minimum hamming distance, configuring a second block code generation matrix meeting a second minimum hamming distance, and configuring a third block code generation matrix including the first block code generation matrix, the second block code generation matrix and a zero matrix of a specific size. Accordingly, the present invention encodes and transmits two data requiring different received signal qualities by one coding scheme, thereby enabling each data to have the required received signal quality in decoding.

## Claims

### Claim 1

In performing block coding on k1-bit first data requiring a received signal quality and k2-bit second data requiring a different received signal quality, a method of joint coding, the method comprising:
configuring a first block code generation matrix meeting a first minimum hamming distance;
configuring a second block code generation matrix meeting a second minimum hamming distance;
configuring a third block code generation matrix including the first block code generation matrix, the second block code generation matrix and a zero matrix having a predetermined size; and
coding a serial combination of the first and second data to have an n-bit length using the third block code generation matrix,
wherein the first block code generation matrix is divided into a first partial matrix having a third minimum hamming distance equal to or greater than the first minimum hamming distance and a second partial matrix having a fourth minimum hamming distance equal to or greater than the first minimum hamming distance,
wherein the third block code generation matrix includes the zero matrix located at a right side of the first partial matrix, and the second block code generation matrix located at a right side of the second partial matrix.

### Claim 2 (depends on 1)

The method of claim 1, wherein a last n2 column of the third block code generation matrix is column-permutated with columns of the third block code generation matrix other than the n2 column, and wherein n2 indicates a column size of the second block code generation matrix.

### Claim 3 (depends on 1)

The method of claim 1, wherein:
the first data comprises a channel quality indicator (CQI); and
the second data comprises an ACK/NACK indicator for acknowledgement of a HARQ process indicator.

### Claim 4 (depends on 1)

The method of claim 1, wherein the received signal quality required for the second data is higher than the received signal quality required for the first data.

### Claim 5 (depends on 4)

The method of claim 4, wherein in a class corresponding to an exclusive-OR operation set between at least one portion of a first sub-codeword generated from the first data and a first sub-code generation matrix corresponding to a k1 row of the third block code generation matrix and at least one portion of a second sub-codeword generated from the second data and a second sub-code generation matrix corresponding to rows of the third block code generation matrix other than the k1 row, an intra-class minimum hamming distance is smaller than an inter-class minimum hamming distance.

### Claim 6 (depends on 4)

The method of claim 4, wherein:
the first data comprises a channel quality indicator (CQI); and
the second data comprises an ACK/NACK indicator for acknowledgement of a HARQ process indicator.
