IP Library Granted Patent US 8,583,997
Granted Patent B2
US 8,583,997 · App. 13/729,754 · Granted Nov 12, 2013

Method and device for padding optimization of segmented turbo codes

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 8,583,997
App. No.
13/729,754
Granted
Nov 12, 2013
Kind
B2
Abstract

A method for forming a bit sequence having a number of M bits from a bit sequence having a number of N bits, wherein M/2<N<M, involves extending said bit sequence by M-N bit positions, segmenting said extended bit sequence into at least two blocks with different numbers of bit positions such that the number of bit positions in the first block is less than the number of bit positions in the last block, and filling empty bit positions with bits having a pre-determined value.

Claims (58)

1. A method for forming a bit sequence having a number of M bits from a bit sequence having a number of N bits for turbo coding, wherein

M

2

<

N

<

M

,

the method comprising:

extending said bit sequence by M-N bit positions to produce an extended bit sequence;

segmenting said extended bit sequence into at least two blocks with different numbers of bit positions such that the number of bit positions in a first block is less than the number of bit positions in a last block; and

filling empty bit positions with bits having a pre-determined value.

2. The method according to claim 1 , wherein said extending and/or said segmenting is performed such that at least one empty bit position is created in said first block.

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

re-ordering said extended bit sequence such that at least one empty bit position is created in said first block.

4. A non-transitory computer-readable medium causing a computer or network device to execute operations to carry out a method of forming a bit sequence having a number of M bits from a bit sequence having a number of N bits for turbo coding, in which

M

2

<

N

<

M

,

the method comprising:

extending said bit sequence by M-N bit positions to produce an extended bit sequence;

segmenting said extended bit sequence into at least two blocks with different numbers of bit positions such that the number of bit positions in a first block is less than the number of bit positions in a last block; and

filling empty bit positions with bits having a pre-determined value.

5. A device for forming a bit sequence having a number of M bits from a bit sequence having a number of N bits for turbo coding, in which

M

2

<

N

<

M

,

the device comprising:

means for extending said bit sequence by M-N bit positions to produce an extended bit sequence;

means for segmenting said extended bit sequence into at least two blocks with different numbers of bit positions such that the number of bit positions in a first block is less than the number of bit positions in a last block; and

means for filling empty bit positions with bits having a pre-determined value.

6. The device according to claim 5 , wherein

the means for extending and/or the means for segmenting create at least one empty bit position in said first block.

7. The device according to claim 5 , further comprising:

means for re-ordering said extended bit sequence such that at least one empty bit position is created in said first block.

8. A communications apparatus, comprising:

a channel coder requiring input bit sequences comprising data blocks having numbers of bits that are an integer multiple of a minimal block size; and

a bit sequence forming device for forming said input bit sequences, each bit sequence being formed to have a number of M bits, each bit sequence being formed from a bit sequence having a number of N bits for turbo coding, in which

M

2

<

N

<

M

,

,

the device comprising:

means for extending said bit sequence by M-N bit positions to produce an extended bit sequence;

means for segmenting said extended bit sequence into at least two blocks with different numbers of bit positions such that the number of bit positions in a first block is less than the number of bit positions in a last block; and

means for filling empty bit positions with bits having a pre-determined value.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 5, 2020
From: CELLULAR COMMUNICATIONS EQUIPMENT LLC
To: NOKIA TECHNOLOGIES OY
Reel/Frame 051728/0349 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 15, 2015
From: NOKIA SOLUTIONS AND NETWORKS GMBH & CO. KG
To: CELLULAR COMMUNICATIONS EQUIPMENT LLC
Reel/Frame 035414/0117 →
CHANGE OF NAME Recorded Nov 19, 2014
From: NOKIA SIEMENS NETWORKS GMBH & CO. KG
To: NOKIA SOLUTIONS AND NETWORKS GMBH & CO. KG
Reel/Frame 034294/0675 →