公开(公告)号：JP2011066932A

公开(公告)日：2011-03-31

申请号：JP2010262461

申请日：2010-11-25

Applicant: Motorola Inc ,  モトローラ・インコーポレイテッドMotorola Incorporated

Inventor： BLANKENSHIP YUFEI W ,  BLANKENSHIP T KEITH ,  CLASSON BRIAN K ,  NIMBALKER AJIT

IPC: H04L1/00 ,  H03M13/29 ,  H04L1/16

CPC classification number: H03M13/2996 ,  H03M13/2903 ,  H03M13/2957

Abstract: PROBLEM TO BE SOLVED: To provide a method and an apparatus for turbo coding and decoding that appropriately matches a concatenated transport block (CTB) to available forward error correction (FEC) block sizes.
SOLUTION: During operation, a CTB of length X is received and an FEC block size K
I is determined from a group of available non-contiguous FEC block sizes between K
min and K
max , wherein K
min ≤K
I max is satisfied and K
I-1 and K
I are additionally based on X. The concatenated transport block of length X is segmented into C segments each of size substantially equal to K
I . An FEC codeword for each of the C segments is determined using FEC block size K
I , and the C FEC codewords are transmitted through a channel.
COPYRIGHT: (C)2011,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于turbo编码和解码的方法和装置，其将级联的传输块（CTB）适当地匹配到可用的前向纠错（FEC）块大小。 解决方案：在操作期间，接收长度为X的CTB，并且从一组可用的非连续FEC块大小确定FEC块大小K I SB>和K max ，其中K ≤K I max ，K I-1 和K I 另外基于X.长度为X的级联传输块被分割成C个段，每个段大小基本上等于K < 。 使用FEC块大小K I 确定每个C段的FEC码字，并且通过信道发送C FEC码字。 版权所有（C）2011，JPO＆INPIT

公开(公告)号：BRPI0717506A2

公开(公告)日：2014-06-24

申请号：BRPI0717506

申请日：2007-09-17

Applicant: MOTOROLA INC

Inventor： BLANKENSHIP YUFEI W ,  BLANKENSHIP T KEITH ,  NIMBALKER AJIT ,  CLASSON BRIAN K

IPC: H03M13/29

Abstract: A method and apparatus for turbo coding and decoding is provided herein. During operation, a concatenated transport block (CTB) of length X is received and a forward error correction (FEC) block size K I

公开(公告)号：CA2689587A1

公开(公告)日：2008-12-24

申请号：CA2689587

申请日：2008-06-17

Applicant: MOTOROLA INC

Inventor： CLASSON BRIAN K ,  NIMBALKER AJIT ,  BLANKENSHIP T KEITH ,  BLANKENSHIP YUFEI W

IPC: H04L1/18

Abstract: During operation of a transmitter a circular buffer is created where only column tops of the circular buffer are defined as a starting position for a redundancy version. Where the circular buffer is in sequence format, all po ssible redundancy versions are positioned as a function of the column index of the starting position of the first redundancy version.

公开(公告)号：BRPI0514179A

公开(公告)日：2008-06-03

申请号：BRPI0514179

申请日：2005-08-03

Applicant: MOTOROLA INC

Inventor： BLANKENSHIP YUFEI W ,  CLASSON BRIAN K ,  BLANKENSHIP T KEITH ,  DESAI VIPUL A

IPC: H03M13/00 ,  G06F11/00

Abstract: A structured parity-check matrix H is proposed, wherein H is an expansion of a base matrix H b and wherein H b comprises a section H b1 and a section H b2 , and wherein H b2 comprises a first part comprising a column h b having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i = j , 1 for i = j+1, and 0 elsewhere. The expansion of the base matrix H b uses identical submatrices for 1s in each column of the second part H ' b2 , and the expansion uses paired submatrices for an even number of 1s in h b .

公开(公告)号：CA2689587C

公开(公告)日：2012-11-13

申请号：CA2689587

申请日：2008-06-17

Applicant: MOTOROLA INC

Inventor： BLANKENSHIP YUFEI W ,  BLANKENSHIP T KEITH ,  CLASSON BRIAN K ,  NIMBALKER AJIT

IPC: H04L1/18

Abstract: During operation of a transmitter a circular buffer is created where only column tops of the circular buffer are defined as a starting position for a redundancy version. Where the circular buffer is in sequence format, all possible redundancy versions are positioned as a function of the column index of the starting position of the first redundancy version.

公开(公告)号：ZA200908521B

公开(公告)日：2010-08-25

申请号：ZA200908521

申请日：2009-12-01

Applicant: MOTOROLA INC

Inventor： BLANKENSHIP YUFEI W ,  BLANKENSHIP T KEITH ,  CLASSON BRIAN K ,  NIMBALKER AJIT

IPC: H04L20060101

Abstract: During operation of a transmitter a circular buffer is created where only column tops of the circular buffer are defined as a starting position for a redundancy version. Where the circular buffer is in sequence format, all possible redundancy versions are positioned as a function of the column index of the starting position of the first redundancy version.

公开(公告)号：AR064591A1

公开(公告)日：2009-04-15

申请号：ARP070104380

申请日：2007-10-03

Applicant: MOTOROLA INC

Inventor： BLANKENSHIP YUFEI W ,  NIMBALKER AJIT ,  BLANKENSHIP T KEITH ,  CLASSON BRIAN K

IPC: H03M13/00

Abstract: Se proveen en la presente un método y un aparato para turbo codificar y decodificar. Durante la operacion se recibe un bloque de transporte concatenado (CTB) de longitud X se determina un tamano de bloque de correccion de errores hacia delante (FEC) kl de un grupo de tamanos de bloques de FEC no contiguos disponibles entre Kmin y Kmax, y en donde Kmin

公开(公告)号：BRPI0813136A2

公开(公告)日：2014-12-23

申请号：BRPI0813136

申请日：2008-06-17

Applicant: MOTOROLA INC

Inventor： BLANKENSHIP YUFEI W ,  BLANKENSHIP T KEITH ,  CLASSON BRIAN K ,  NIMBALKER AJIT

IPC: H04L1/18

Abstract: During operation of a transmitter a circular buffer is created where only column tops of the circular buffer are defined as a starting position for a redundancy version. Where the circular buffer is in sequence format, all possible redundancy versions are positioned as a function of the column index of the starting position of the first redundancy version.

公开(公告)号：BRPI0514245A

公开(公告)日：2008-06-03

申请号：BRPI0514245

申请日：2005-08-03

Applicant: MOTOROLA INC

Inventor： BLANKENSHIP YUFEI W ,  BLANKENSHIP T KEITH

IPC: H03M13/00

Abstract: A base model matrix is defined for the largest code length of each code rate. The set of shifts {p(i,j in the base model matrix are used to determine the shift sizes for all other code lengths of the same code rate. Shift sizes {p(f,i,j for a code size corresponding to expansion factor z f are derived from {p(i,j by scaling p(i,j) proportionally, and a model matrix defined by {p(f,i,j is used to determine the parity-check bits for the f-th code.