中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

35 records (took 0.025 seconds)

    Method and apparatus for encoding and decoding data
    1.
    发明专利
    Method and apparatus for encoding and decoding data 有权
    编码和解码数据的方法和装置

    公开(公告)号：JP2008141756A

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

    申请号：JP2007308343

    申请日：2007-11-29

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

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

    IPC: H03M13/27 ,  H03M13/29

    CPC classification number: H03M13/2789 ,  H03M13/275 ,  H03M13/2903 ,  H03M13/2957 ,  H03M13/2996 ,  H03M13/6566

    Abstract: PROBLEM TO BE SOLVED: To provide a method and apparatus for selecting interleaver sizes for turbo codes.
    SOLUTION: During operation, an information block of size K is received. An interleaver size K' is determined that is related to K", where K" is from a set of sizes; wherein the set of sizes comprise K"=a
    P ×f, p
    min ≤p≤p
    max ; f
    min ≤f≤f
    max , wherein (a) is an integer and (f) is a continuous integer between f
    min and f
    max , and (p) takes integer values between p
    min and p
    max , a>1, p
    max >p
    min , p
    min >1. The information block of size K is padded into an input block of size K using filler bits, if needed. Encoding is performed using the original input block and the interleaved input block to obtain a codeword block using a turbo encoder. The codeword block is transmitted through the channel.
    COPYRIGHT: (C)2008,JPO&INPIT

    Abstract translation: 要解决的问题：提供一种用于选择turbo码的交织器大小的方法和装置。

    解决方案：在操作期间，接收大小为K的信息块。 确定与K“相关的交织器尺寸K'，其中K”来自一组尺寸; 其中所述尺寸集合包括K“= a P ×f，p min ≤p≤p max ; f SB> SB>≤f≤f max ，其中（a）是整数，（f）是f min 和f max 之间的连续整数 ，和（p）在p min 和p max 之间的整数值，a> 1，p max > p SB>，p min > 1，如果需要，使用填充比特将尺寸K的信息块填充到大小为K的输入块中，使用原始输入块和交织输入块 以获得使用turbo编码器的码字块，码字块通过信道传输。版权所有（C）2008，JPO＆INPIT

    Method and apparatus of encoding and decoding data
    2.
    发明专利
    Method and apparatus of encoding and decoding data 审中-公开
    编码和解码数据的方法和装置

    公开(公告)号：JP2008219892A

    公开(公告)日：2008-09-18

    申请号：JP2008047037

    申请日：2008-02-28

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

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

    IPC: H03M13/29 ,  H03M13/27

    CPC classification number: H03M13/2957 ,  H03M13/2739 ,  H03M13/2753 ,  H03M13/2775 ,  H03M13/2789 ,  H03M13/2903 ,  H03M13/6525

    Abstract: PROBLEM TO BE SOLVED: To provide a method and an apparatus for performing turbo encoding with a contention-free interleaver.
    SOLUTION: During operation an input block of size K' is received. The original input block and the interleaved input block are encoded to obtain a codeword block, wherein the original input block is interleaved using an interleaver of size K' and a permutation π(i)=(f
    1 ×i+f
    2 ×i
    2 ) mod K', where O 1 and f
    2 are the factors defining the interleaver. The values of K', 1, 2 are taken from at least one row of a table. The codeword block is transmitted through the channel.
    COPYRIGHT: (C)2008,JPO&INPIT

    Abstract translation: 要解决的问题：提供一种用无竞争交织器执行turbo编码的方法和装置。

    解决方案：在运行期间，接收大小为K'的输入块。 对原始输入块和交错输入块进行编码以获得码字块，其中原始输入块使用大小为K'的交织器和置换π（i）=（f 1 × i + f 2 ×i 2 ）mod K'，其中O <= i = K'-1是交织之后的符号位置的顺序索引，π i）是对应于位置i的交织之前的符号索引，K'是符号中的交织器大小，f 1 和f 2 是定义交织器的因素。 K'，1,2的值取自表的至少一行。 码字块通过信道传输。 版权所有（C）2008，JPO＆INPIT

    Method and apparatus for encoding and decoding data
    3.
    发明专利
    Method and apparatus for encoding and decoding data 有权
    编码和解码数据的方法和装置

    公开(公告)号：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

    Scheduling grant information signaling in wireless communication system
    4.
    发明专利
    Scheduling grant information signaling in wireless communication system 审中-公开
    在无线通信系统中调度授权信息信号

    公开(公告)号：JP2010041718A

    公开(公告)日：2010-02-18

    申请号：JP2009174876

    申请日：2009-07-28

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

    Inventor： LOVE ROBERT T ,  KUCHIBHOTLA RAVI ,  NANGIA VIJAY ,  NIMBALKER AJIT ,  STEWART KENNETH A

    IPC: H04W28/04 ,  H04W28/06

    CPC classification number: H04L1/0029 ,  H04L1/0032 ,  H04L1/0057 ,  H04L5/0053 ,  H04L5/0094

    Abstract: PROBLEM TO BE SOLVED: To provide a wireless communication infrastructure entity executing signaling of scheduling grant or allocation information in a wireless communication system, for instance, redundancy version, transport block size or both of them. SOLUTION: This wireless communication infrastructure entity includes a transceiver, and a controller communicably coupled to the transmitter. The controller is configured to generate parity bits based on scheduling grant information and to encode the parity bits based on additional scheduling grant information not used to generate the parity bits, wherein the encoded parity bits are combined with the scheduling grant information. COPYRIGHT: (C)2010,JPO&INPIT

    Abstract translation: 要解决的问题：提供在无线通信系统中执行调度许可或分配信息的信令的无线通信基础设施实体，例如冗余版本，传输块大小或它们两者。 解决方案：该无线通信基础设施实体包括收发器和可通信地耦合到发射机的控制器。 控制器被配置为基于调度授权信息生成奇偶校验位，并且基于不用于生成奇偶校验位的附加调度许可信息对奇偶校验位进行编码，其中编码奇偶校验位与调度授权信息组合。 版权所有（C）2010，JPO＆INPIT

    Encoding and decoding methods and apparatus of the data
    5.
    发明专利
    Encoding and decoding methods and apparatus of the data 审中-公开
    编码和解码数据的方法和装置

    公开(公告)号：JP2008092571A

    公开(公告)日：2008-04-17

    申请号：JP2007252798

    申请日：2007-09-28

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

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

    IPC: H03M13/27 ,  H03M13/29

    CPC classification number: H03M13/2789 ,  H03M13/275 ,  H03M13/2903 ,  H03M13/2957 ,  H03M13/2996 ,  H03M13/6566

    Abstract: PROBLEM TO BE SOLVED: To provide a method and an apparatus for selecting interleaver sizes for turbo codes. SOLUTION: During operation, an information block of size K is received. An interleaver size K' is determined, that is related to K", where K" from a set of sizes, with the set of sizes includes K"=a p ×f(p min ≤p≤p max , f min ≤f≤f max ), where (a) is an integer, (f) is a continuous integer between f min and f max and (p) takes integer values between p min and p max (a>1, p max >p min , p min >1). The information block of size K is padded to an input block of size K', as needed, using filler bits, and the original input block and the interleaved input block are encoded, to obtain a codeword block using turbo coders. The codeword block is transmitted through the channel. COPYRIGHT: (C)2008,JPO&INPIT

    Abstract translation: 要解决的问题：提供一种用于选择turbo码的交织器大小的方法和装置。

    解决方案：在操作期间，接收大小为K的信息块。 确定交织器尺寸K'，其与K“相关，其中K”来自一组尺寸，其中该组尺寸包括K“= a p ×f（p min ≤p≤p max ，f min ≤f≤f max ），其中（a）是整数，（f ）是f min 和f max 之间的连续整数，（p）是p min 和p max （a> 1，p max > p min ，p min > 1），尺寸K的信息块被填充到 输入块大小为K'，根据需要使用填充比特，并对原始输入块和交织输入块进行编码，以获得使用turbo编码器的码字块，码字块通过通道传输。版权所有： （C）2008，JPO＆INPIT

    Method and apparatus for encoding and decoding data
    6.
    发明专利
    Method and apparatus for encoding and decoding data 有权
    编码和解码数据的方法和装置

    公开(公告)号：JP2008092570A

    公开(公告)日：2008-04-17

    申请号：JP2007252797

    申请日：2007-09-28

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

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

    IPC: H04L1/00 ,  H03M13/29

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

    Abstract: PROBLEM TO BE SOLVED: To provide a method and apparatus for turbo coding and decoding that appropriately matches a CTB to available FEC block sizes.
    SOLUTION: During operation, a concatenated transport block (CTB) of length X is received and a forward error correction (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 , 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 over a channel.
    COPYRIGHT: (C)2008,JPO&INPIT

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

    METHOD AND APPARATUS FOR ENCODING AND DECODING DATA
    9.
    发明申请
    METHOD AND APPARATUS FOR ENCODING AND DECODING DATA 审中-公开
    编码和解码数据的方法和装置

    公开(公告)号：WO2007092672A3

    公开(公告)日：2008-05-22

    申请号：PCT/US2007060896

    申请日：2007-01-23

    Applicant: MOTOROLA INC ,  NIMBALKER AJIT ,  BLANKENSHIP YUFEI W ,  CLASSON BRIAN K

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

    IPC: H03M13/00

    CPC classification number: H03M13/116 ,  H03M13/033 ,  H03M13/1185 ,  H03M13/1188 ,  H03M13/6393

    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 .

    Abstract translation: 提出了一种结构化奇偶校验矩阵H，其中H是基本矩阵H B b的扩展，并且其中H B b包括部分H b1 并且其中H b2包括具有奇数重量大于2的柱h B 1的第一部分，以及 第二部分包括用于行i的矩阵元素，列j对于i = j等于1，对于i = j + 1为1，在其他地方为0。 基本矩阵H B b的扩展在第二部分H'b2“的每列中使用相同的子矩阵1s，并且扩展使用成对的子矩阵用于偶数1s 在h / b>中。

    MULTI-LAYER CYCLIC REDUNDANCY CHECK CODE IN WIRELESS COMMUNICATION SYSTEM
    10.
    发明申请
    MULTI-LAYER CYCLIC REDUNDANCY CHECK CODE IN WIRELESS COMMUNICATION SYSTEM 审中-公开
    无线通信系统中的多层循环冗余校验码

    公开(公告)号：WO2009036004A3

    公开(公告)日：2009-05-22

    申请号：PCT/US2008075775

    申请日：2008-09-10

    Applicant: MOTOROLA INC ,  BUCKLEY MICHAEL E ,  BLANKENSHIP YUFEI W ,  CLASSON BRIAN K ,  NIMBALKER AJIT ,  STEWART KENNETH A

    Inventor： BUCKLEY MICHAEL E ,  BLANKENSHIP YUFEI W ,  CLASSON BRIAN K ,  NIMBALKER AJIT ,  STEWART KENNETH A

    IPC: H03M13/09 ,  H04L1/00

    CPC classification number: H03M13/09 ,  H04L1/0061 ,  H04L1/0065

    Abstract: A wireless communication device (200) including a first CRC coder that generates a first block of CRC parity bits on a transport block and associates the first block of CRC parity bits with the transport block, a segmenting entity that segments the transport blocks into multiple code blocks after associating, and a second coder that generates a second block of CRC parity bits on each code block and associates a second block of CRC parity bits with each code block. The first and second blocks of CRC parity bits are based on first and second generator polynomials. In one embodiment, the first and second generator polynomials are different. In another embodiment, the generator polynomials are the same and the transport block is interleaved before segmenting or the code block are interleaved before encoding with the second block of CRC parity bits.

    Abstract translation: 一种无线通信设备（200），包括第一CRC编码器和第二CRC编码器，第一CRC编码器在传输块上产生第一CRC奇偶校验位并将第一CRC奇偶校验位与传输块关联，分割实体将传输块分割成多个码 以及第二编码器，其在每个代码块上生成第二CRC奇偶校验位块，并将CRC奇偶校验位的第二块与每个代码块相关联。 CRC校验位的第一和第二块基于第一和第二生成多项式。 在一个实施例中，第一和第二生成器多项式不同。 在另一个实施例中，生成多项式相同，并且在分割之前传输块被交织，或者在用CRC奇偶校验位的第二块编码之前交织编码块。

Patent Agency Ranking