US 2014/0237324 A1Published application

Channel coding method of variable length information using block code

AssigneeLG Electronics Inc.

InventorsDong Wook ROH, Joon Kui AHN, Nam Yul YU, Jung Hyun CHO, Yu Jin NOH, Ki Jun KIM, Dae Won LEE

Life of this patent

Estimating the term…

Loading patent…

Abstract

A method for channel-coding information bits using a code generation matrix including 32 rows and A columns corresponding to length of the information bits includes, channel-coding the information bits having “A” length using basis sequences having 32-bit length corresponding to columns of the code generation matrix, and outputting the channel-coded result as an output sequence. If “A” is higher than 10, the code generation matrix is generated when (A-10) additional basis sequences were added as column-directional sequences to a first or second matrix. The first matrix is a TFCI code generation matrix composed of 32 rows and 10 columns used for TFCI coding. The second matrix is made when at least one of an inter-row location or an inter-column location of the first matrix was changed. The additional basis sequences satisfy a value 10 of a minimum Hamming distance.

Claims10

Dependent claims

A method for channel-coding input bits, the method comprising:

channel-coding the input bits by using a first code when the input bits are corresponding to first type information of which maximum length is 11, wherein the first code includes basis sequences Mi,0 to Mi,10 defined in a following Table 1:
TABLE 1
i
Mi, 0
Mi, 1
Mi, 2
Mi, 3
Mi, 4
Mi, 5
Mi, 6
Mi, 7
Mi, 8
Mi, 9
Mi, 10
0
1
1
0
0
0
0
0
0
0
0
1
1
1
1
1
0
0
0
0
0
0
1
1
2
1
0
0
1
0
0
1
0
1
1
1
3
1
0
1
1
0
0
0
0
1
0
1
4
1
1
1
1
0
0
0
1
0
0
1
5
1
1
0
0
1
0
1
1
1
0
1
6
1
0
1
0
1
0
1
0
1
1
1
7
1
0
0
1
1
0
0
1
1
0
1
8
1
1
0
1
1
0
0
1
0
1
1
9
1
0
1
1
1
0
1
0
0
1
1
10
1
0
1
0
0
1
1
1
0
1
1
11
1
1
1
0
0
1
1
0
1
0
1
12
1
0
0
1
0
1
0
1
1
1
1
13
1
1
0
1
0
1
0
1
0
1
1
14
1
0
0
0
1
1
0
1
0
0
1
15
1
1
0
0
1
1
1
1
0
1
1
16
1
1
1
0
1
1
1
0
0
1
0
17
1
0
0
1
1
1
0
0
1
0
0
18
1
1
0
1
1
1
1
1
0
0
0
19
1
0
0
0
0
1
1
0
0
0
0
20
1
0
1
0
0
0
1
0
0
0
1
21
1
1
0
1
0
0
0
0
0
1
1
22
1
0
0
0
1
0
0
1
1
0
1
23
1
1
1
0
1
0
0
0
1
1
1
24
1
1
1
1
1
0
1
1
1
1
0
25
1
1
0
0
0
1
1
1
0
0
1
26
1
0
1
1
0
1
0
0
1
1
0
27
1
1
1
1
0
1
0
1
1
1
0
28
1
0
1
0
1
1
1
0
1
0
0
29
1
0
1
1
1
1
1
1
1
0
0
30
1
1
1
1
1
1
1
1
1
1
1
31
1
0
0
0
0
0
0
0
0
0
0,
and
channel-coding the input bits by using a first block code when the input bits are corresponding to second type information of which maximum length is 13, wherein the second code includes basis sequences Mi,0 to Mi,12 defined in a following Table 2:
TABLE 2
Mi,
Mi,
Mi,
i
Mi, 0
Mi, 1
Mi, 2
Mi, 3
Mi, 4
Mi, 5
Mi, 6
Mi, 7
Mi, 8
Mi, 9
10
11
12
0
1
1
0
0
0
0
0
0
0
0
1
1
0
1
1
1
1
0
0
0
0
0
0
1
1
1
0
2
1
0
0
1
0
0
1
0
1
1
1
1
1
3
1
0
1
1
0
0
0
0
1
0
1
1
1
4
1
1
1
1
0
0
0
1
0
0
1
1
1
5
1
1
0
0
1
0
1
1
1
0
1
1
1
6
1
0
1
0
1
0
1
0
1
1
1
1
1
7
1
0
0
1
1
0
0
1
1
0
1
1
1
8
1
1
0
1
1
0
0
1
0
1
1
1
1
9
1
0
1
1
1
0
1
0
0
1
1
1
1
10
1
0
1
0
0
1
1
1
0
1
1
1
1
11
1
1
1
0
0
1
1
0
1
0
1
1
1
12
1
0
0
1
0
1
0
1
1
1
1
1
1
13
1
1
0
1
0
1
0
1
0
1
1
1
1
14
1
0
0
0
1
1
0
1
0
0
1
0
1
15
1
1
0
0
1
1
1
1
0
1
1
0
1
16
1
1
1
0
1
1
1
0
0
1
0
1
1
17
1
0
0
1
1
1
0
0
1
0
0
1
1
18
1
1
0
1
1
1
1
1
0
0
0
0
0
19
1
0
0
0
0
1
1
0
0
0
0
0
0.

695 more elements

A device for channel-coding input bits, the device comprising:

a channel-coder configured to channel-code the input bits by using a first code when the input bits are corresponding to first type information of which maximum length is 11, and configured to channel-code the input bits the input bits by using a second code when the input bits are corresponding to second type information,
wherein the first code includes basis sequences Mi,0 to Mi,10 defined in a following Table 1:
TABLE 1
i
Mi, 0
Mi, 1
Mi, 2
Mi, 3
Mi, 4
Mi, 5
Mi, 6
Mi, 7
Mi, 8
Mi, 9
Mi, 10
0
1
1
0
0
0
0
0
0
0
0
1
1
1
1
1
0
0
0
0
0
0
1
1
2
1
0
0
1
0
0
1
0
1
1
1
3
1
0
1
1
0
0
0
0
1
0
1
4
1
1
1
1
0
0
0
1
0
0
1
5
1
1
0
0
1
0
1
1
1
0
1
6
1
0
1
0
1
0
1
0
1
1
1
7
1
0
0
1
1
0
0
1
1
0
1
8
1
1
0
1
1
0
0
1
0
1
1
9
1
0
1
1
1
0
1
0
0
1
1
10
1
0
1
0
0
1
1
1
0
1
1
11
1
1
1
0
0
1
1
0
1
0
1
12
1
0
0
1
0
1
0
1
1
1
1
13
1
1
0
1
0
1
0
1
0
1
1
14
1
0
0
0
1
1
0
1
0
0
1
15
1
1
0
0
1
1
1
1
0
1
1
16
1
1
1
0
1
1
1
0
0
1
0
17
1
0
0
1
1
1
0
0
1
0
0
18
1
1
0
1
1
1
1
1
0
0
0
19
1
0
0
0
0
1
1
0
0
0
0
20
1
0
1
0
0
0
1
0
0
0
1
21
1
1
0
1
0
0
0
0
0
1
1
22
1
0
0
0
1
0
0
1
1
0
1
23
1
1
1
0
1
0
0
0
1
1
1
24
1
1
1
1
1
0
1
1
1
1
0
25
1
1
0
0
0
1
1
1
0
0
1
26
1
0
1
1
0
1
0
0
1
1
0
27
1
1
1
1
0
1
0
1
1
1
0
28
1
0
1
0
1
1
1
0
1
0
0
29
1
0
1
1
1
1
1
1
1
0
0
30
1
1
1
1
1
1
1
1
1
1
1
31
1
0
0
0
0
0
0
0
0
0
0,
and
channel-coding the input bits by using a first block code when the input bits are corresponding to second type information of which maximum length is 13, wherein the second code includes basis sequences Mi,0 to Mi,12 defined in a following Table 2:
TABLE 2
Mi,
Mi,
Mi,
i
Mi, 0
Mi, 1
Mi, 2
Mi, 3
Mi, 4
Mi, 5
Mi, 6
Mi, 7
Mi, 8
Mi, 9
10
11
12
0
1
1
0
0
0
0
0
0
0
0
1
1
0
1
1
1
1
0
0
0
0
0
0
1
1
1
0
2
1
0
0
1
0
0
1
0
1
1
1
1
1
3
1
0
1
1
0
0
0
0
1
0
1
1
1
4
1
1
1
1
0
0
0
1
0
0
1
1
1
5
1
1
0
0
1
0
1
1
1
0
1
1
1
6
1
0
1
0
1
0
1
0
1
1
1
1
1
7
1
0
0
1
1
0
0
1
1
0
1
1
1
8
1
1
0
1
1
0
0
1
0
1
1
1
1
9
1
0
1
1
1
0
1
0
0
1
1
1
1
10
1
0
1
0
0
1
1
1
0
1
1
1
1
11
1
1
1
0
0
1
1
0
1
0
1
1
1
12
1
0
0
1
0
1
0
1
1
1
1
1
1
13
1
1
0
1
0
1
0
1
0
1
1
1
1
14
1
0
0
0
1
1
0
1
0
0
1
0
1
15
1
1
0
0
1
1
1
1
0
1
1
0
1
16
1
1
1
0
1
1
1
0
0
1
0
1
1
17
1
0
0
1
1
1
0
0
1
0
0
1
1
18
1
1
0
1
1
1
1
1
0
0
0
0
0
19
1
0
0
0
0
1
1
0
0
0
0
0
0.

696 more elements

Dependencies are inferred from the claim text.

Facts

Application: 14/266,615Filed 30 Apr 2014
Priority: KR 10-2008-007468230 Jul 2008
Published: 21 Aug 2014
Term ends: Not estimatedThe source records don’t support an estimate.

Classification20 codes

H04L 1/0041
By using forward error control: arrangements at the transmitter end
G06F 17/16
Complex mathematical operations: matrix or vector computation , e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
H03M 13/05
Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words:…
H03M 13/13
Using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits: linear codes

Family

Application61/016,492Us provisional application · filed 24 Dec 2007
Application61/021,337Us provisional application · filed 16 Jan 2008
Application61/028,016Us provisional application · filed 12 Feb 2008
Application12/343,666Continuation · filed 24 Dec 2008
Application14/266,615Continuation
US 2009/0168904 A1Published application
US 8,745,459 B2Related patent
US 9,009,558 B2Related patent
US 2014/0237324 A1This patent

From the US filing history. Foreign family members aren’t listed.

Timeline

Citations

Open elsewhere

Building an agent or pulling many patents? Use the API or MCP server instead of scraping pages. Get an API key