IP Library › Granted Patent US 9,154,162
Granted Patent B2
US 9,154,162 · App. 13/488,332 · Granted Oct 6, 2015

Method and apparatus for transmitting uplink data in a wireless access system

Inventors: Ki Hwan Kim (Anyang-si, KR); Young Seob Lee (Anyang-si, KR); Seung Hyun Kang (Anyang-si, KR); Jae Hoon Chung (Anyang-si, KR)
Assignee: LG ELECTRONICS INC.
H03M13/091H04L1/0061H04L1/0065H04L1/0083
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,154,162
App. No.
13/488,332
Granted
Oct 6, 2015
Kind
B2
Abstract

A method of transmitting data in a wireless access system includes: calculating a number C of code blocks using a size B of an input bit sequence, a maximum size Z of the code blocks, and a size L of a cyclic redundancy check (CRC) which is to be attached to each of the code blocks; calculating a size B′ of a modified input bit sequence using the number C, the size L, and the size B; obtaining a size K of each of the code blocks using the size B′ and the number C; segmenting the input bit sequence to have the number C of the code blocks and the obtained size K of each of the code blocks; generating the code blocks by attaching the CRC to each of the segmented input bit sequences; and channel-coding the code blocks.

Claims (56)

1. A method of transmitting data in a wireless access system, the method comprising:

calculating a number C of code blocks using a size B of an input bit sequence, a maximum size Z of the code blocks, and a size L of a cyclic redundancy check (CRC) which is to be attached to each of the code blocks;

calculating a size B′ of a modified input bit sequence using the number C of the code blocks, the size L of the CRC, and the size B of the input bit sequence;

obtaining a size K of each of the code blocks using the size B′ of the modified input bit sequence and the number C of the code blocks;

segmenting the input bit sequence to have the number C of the code blocks and the obtained size K of each of the code blocks;

generating the code blocks by attaching the CRC to each of the segmented input bit sequences; and

channel-coding the code blocks,

wherein the number C of the code blocks is calculated as an integer by rounding up a value obtained by dividing the size B of the input bit sequence by a result of subtracting the size L of the CRC from the maximum size Z of the code blocks such that C=┌B/(Z−L)┐.

2. The method according to claim 1 , wherein the size L of the CRC is 24 bits.

3. The method according to claim 1 ,

wherein the CRC is attached to each of the code blocks to detect whether each of the code blocks contains errors.

4. The method according to claim 1 ,

wherein the number C of the code blocks is set to 1 if the size B of the input bit sequence is less than the maximum size Z of the code blocks.

5. The method according to claim 1 ,

wherein the size B′ of the modified input bit sequence is set to a value obtained by adding the size B of the input bit sequence to a result of multiplying the number C of the code blocks by the size L of the CRC attached to each of the code blocks.

6. The method according to claim 5 ,

wherein the size K of each of the code blocks satisfies a condition that a value obtained by multiplying the number C of the code blocks by the size K of the code block is larger than or equal to the size B′ of the modified input bit sequence.

7. The method according to claim 1 ,

wherein the size K of each of the code blocks satisfies a condition that a value obtained by multiplying the number C of the code blocks by the size K of the code block is larger than or equal to the size B′ of the modified input bit sequence.

8. The method according to claim 1 , further comprising:

allocating data to areas in a first code block of the code blocks except for a size of filler bits and the size L of the CRC; and

allocating the data to areas in the code blocks starting with a second code block except for the size L of the CRC.

9. The method according to claim 8 , wherein:

allocating data to the areas in the first code block comprises attaching the CRC to the first code block, and

allocating data to the areas in the code blocks starting with the second code block comprises attaching the CRC to the code blocks starting with the second code block.

10. The method according to claim 1 , wherein the maximum size Z of the code blocks is 6144 bits.

11. An apparatus for transmitting data in a wireless access system, the apparatus comprising:

a transmission unit configured to transmit the data;

a code block segmentation and cyclic redundancy check (CRC) attachment unit configured to support the transmission of the data; and

a channel coding unit,

wherein the code block segmentation and CRC attachment unit is further configured to:

calculate a number C of code blocks using a size B of an input bit sequence, a maximum size Z of the code blocks, and a size L of a cyclic redundancy check (CRC) which is to be attached to each of the code blocks;

calculate a size B′ of a modified input bit sequence using the number C of the code blocks, the size L of the CRC, and the size B of the input bit sequence;

obtain a size K of each of the code blocks using the size B′ of the modified input bit sequence and the number C of the code blocks;

segment the input bit sequence to have the number C of the code blocks and the obtained size K of each of the code blocks; and

generate the code blocks by attaching the CRC to each of the segmented input bit sequences,

wherein the channel coding unit is configured to perform channel-coding of the code blocks, and

wherein the number C of the code blocks is calculated as an integer by rounding up a value obtained by dividing the size B of the input bit sequence by a result of subtracting the size L of the CRC from the maximum size Z of the code blocks such that C=┌B/(Z−L)┐.

12. The apparatus according to claim 11 , wherein the size L of the CRC is 24 bits.

13. The apparatus according to claim 11 ,

wherein the CRC is attached to each of the code blocks to detect whether each of the code blocks contains errors.

14. The apparatus according to claim 11 ,

wherein the number C of the code blocks is set to 1 if the size B of the input bit sequence is less than the maximum size Z of the code blocks.

15. The apparatus according to claim 11 ,

wherein the size B′ of the modified input bit sequence is set to a value obtained by adding the size B of the input bit sequence to a result of multiplying the number C of the code blocks by the size L of the CRC attached to each of the code blocks.

16. The apparatus according to claim 15 ,

wherein the size K of each of the code blocks satisfies a condition that a value obtained by multiplying the number C of the code blocks by the size K of the code block is larger than or equal to the size B′ of the modified input bit sequence.

17. The apparatus according to claim 11 ,

wherein the size K of each of the code blocks satisfies a condition that a value obtained by multiplying the number C of the code blocks by the size K of the code block is larger than or equal to the size B′ of the modified input bit sequence.

18. The apparatus according to claim 11 , wherein the code block segmentation and CRC attachment unit is further configured to:

allocate data to areas in a first code block of the code blocks except for a size of filler bits and the size L of the CRC; and

allocate the data to areas in the code blocks starting with a second code block except for the size L of the CRC.

19. The apparatus according to claim 18 , wherein the code block segmentation and CRC attachment unit is further configured to:

attach the CRC to the first code block; and

attach the CRC to the code blocks starting with the second code block.

20. The apparatus according to claim 11 , wherein the maximum size Z of the code blocks is 6144 bits.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 4, 2012
From: KIM, KI HWAN; LEE, YOUNG SEOB; KANG, SEUNG HYUN; CHUNG, JAE HOON
To: LG ELECTRONICS INC.
Reel/Frame 028314/0240 →
Priority Claims (5)
KR 10-2007-0082032 · Aug 14, 2007 · national
KR 10-2007-0082236 · Aug 16, 2007 · national
KR 10-2007-0120389 · Nov 23, 2007 · national
KR 10-2007-0120390 · Nov 23, 2007 · national
KR 10-2007-0120391 · Nov 23, 2007 · national
Continuity (7)
Continuation 12191939 · Aug 14, 2008
Provisional Application 61028478 · Feb 13, 2008
Provisional Application 60957454 · Aug 23, 2007
Provisional Application 60957369 · Aug 22, 2007
Provisional Application 60957334 · Aug 22, 2007
Provisional Application 60957063 · Aug 21, 2007
Related Publication 20120240009A1 · Sep 20, 2012