Method and device for padding optimization of segmented turbo codes
AssigneeNokia Siemens Networks Oy
InventorsFrank Frederiksen, Bernhard Raaf
Life of this patent
Estimating the term…
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.
Claims15
1-14. (canceled)
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;
- selecting M-N bit positions within said bit sequence including a first bit position;
- re-ordering said bit sequence by relocating at least the bits at said selected positions such that the first bit position is empty and such that at least one of the N bits for turbo coding remains at an original position of the at least one of the N bits;
- and
- filling empty bit positions with bits having a predetermined value.
A 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;
- selecting M-N bit positions within said bit sequence including a first bit position;
- re-ordering said bit sequence by relocating at least the bits at said selected positions such that the first bit position is empty and such that at least one bit of the N bits for turbo coding remains at an original position of the at least one of the N bits;
- and
- filling empty bit positions with bits having a predetermined value.
A device to form 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:
- means for extending said bit sequence by M-N bit positions;
- means for selecting M-N bit positions within said bit sequence including a first bit position;
- means for re-ordering said bit sequence by relocating at least the bits at said selected positions such that the first bit position is empty and such that at least one bit of the N bits for turbo coding remains at an original position of the at least one of the N bits;
- and
- means for filling empty bit positions with bits having a predetermined value.
Dependencies are inferred from the claim text.