-
公开(公告)号:AU2003238053A1
公开(公告)日:2004-01-23
申请号:AU2003238053
申请日:2003-06-25
Applicant: MOTOROLA INC
Inventor: DESPERBEN LYDIE , VILLION MATHIEU
-
公开(公告)号:AU2003219674A1
公开(公告)日:2003-09-04
申请号:AU2003219674
申请日:2003-01-21
Applicant: MOTOROLA INC
Inventor: BUCKLEY MICHAEL E , BACHU RAJA S , GHOSH AMITAVA , RATASUK RAPEEPAT , STEWART KENNETH A , VILLION MATHIEU
Abstract: An improved turbo code based incremental redundancy includes a first step of puncturing a data stream for a first transmission to provide a set of first unpunctured trellis sections. A next step includes puncturing a data stream for a second transmission to provide a set of second unpunctured trellis sections. A next step includes incremental redundancy combining the first and second transmissions of the trellises to provide non-adjacent first and second unpunctured trellis sections. The above arrangement results in a uniform distribution of punctured and unpunctured bits to provide lower errors.
-
公开(公告)号:BR0307204A
公开(公告)日:2004-11-03
申请号:BR0307204
申请日:2003-01-21
Applicant: MOTOROLA INC
Inventor: BUCKLEY MICHAEL E , BACHU RAJA S , GHOSH AMITAVA , RATASUK RAPEEPAT , STEWART KENNETH A , VILLION MATHIEU
Abstract: An improved turbo code based incremental redundancy includes a first step of puncturing a data stream for a first transmission to provide a set of first unpunctured trellis sections. A next step includes puncturing a data stream for a second transmission to provide a set of second unpunctured trellis sections. A next step includes incremental redundancy combining the first and second transmissions of the trellises to provide non-adjacent first and second unpunctured trellis sections. The above arrangement results in a uniform distribution of punctured and unpunctured bits to provide lower errors.
-
公开(公告)号:BRPI0307204B1
公开(公告)日:2015-12-01
申请号:BR0307204
申请日:2003-01-21
Applicant: MOTOROLA MOBILITY INC , MOTOROLA SOLUTIONS INC , MOTOROLA INC
Inventor: GHOSH AMITAVA , STEWART KENNETH A , VILLION MATHIEU , BUCKLEY MICHAEL E , BACHU RAJA S , RATASUK RAPEEPAT
Abstract: "redundância incremental com base em código turbo aprimorado". uma redundância incremental aprimorada com base em código turbo inclui uma primeira etapa (102) de perfurar um fluxo de dados para uma primeira transmissão e fornecer um conjunto de primeira seção de treliça não perfurada. uma etapa seguinte (104) inclui perfurar um fluxo de dados para uma segunda transmissão para fornecer um conjunto de segundas seções de treliça não perfuradas. a etapa seguinte (106) inclui a redundância incremental combinando a primeira e a segunda transmissões das treliças para fornecer a primeira e segunda seções de treliça não perfuradas e não adjacentes. a disposição acima resulta em uma distribuição uniforme de bits perfurados e não perfurados para fornecer erros mais baixos.
-
公开(公告)号:DE60330753D1
公开(公告)日:2010-02-11
申请号:DE60330753
申请日:2003-01-21
Applicant: MOTOROLA INC
Inventor: BUCKLEY MICHAEL E , BACHU RAJA S , GHOSH AMITAVA , RATASUK RAPEEPAT , STEWART KENNETH A , VILLION MATHIEU
Abstract: An improved turbo code based incremental redundancy includes a first step of puncturing a data stream for a first transmission to provide a set of first unpunctured trellis sections. A next step includes puncturing a data stream for a second transmission to provide a set of second unpunctured trellis sections. A next step includes incremental redundancy combining the first and second transmissions of the trellises to provide non-adjacent first and second unpunctured trellis sections. The above arrangement results in a uniform distribution of punctured and unpunctured bits to provide lower errors.
-
公开(公告)号:EP1476946A4
公开(公告)日:2007-09-19
申请号:EP03715943
申请日:2003-01-21
Applicant: MOTOROLA INC
Inventor: BUCKLEY MICHAEL E , BACHU RAJA S , GHOSH AMITAVA , RATASUK RAPEEPAT , STEWART KENNETH A , VILLION MATHIEU
CPC classification number: H04L1/1816 , H03M13/258 , H03M13/2957 , H03M13/6306 , H03M13/6381 , H04L1/0041 , H04L1/0066 , H04L1/0068 , H04L1/0071 , H04L1/1819 , H04L1/1845 , H04L1/1874 , H04L1/1887
Abstract: An improved turbo code based incremental redundancy includes a first step (102) of puncturing a data stream for a first transmission to provide a set of first unpunctured trellis sections. A next step (104) includes puncturing a data stream for a second transmission to provide a set of second unpunctured trellis sections. A next step (106) includes incremental redundancy combining the first and second transmissions of the trellises to provide non-adjacent first and second unpunctured trellis sections. The above arrangement results in a uniform distribution of punctured and unpunctured bits to provide lower errors.
-
-
-
-
-