中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

207 records (took 0.028 seconds)

    Method and apparatus of encoding and decoding data
    1.
    发明专利
    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

    SOFT DECISION OUTPUT DECODER FOR CONVOLUTION CODING
    2.
    发明专利
    SOFT DECISION OUTPUT DECODER FOR CONVOLUTION CODING 失效

    公开(公告)号：JP2001267937A

    公开(公告)日：2001-09-28

    申请号：JP2001033291

    申请日：2001-02-09

    Applicant: MOTOROLA INC

    Inventor： CLASSON BRIAN K ,  TERRY M SCHAFFNER ,  VIPURU A DESAI ,  JAMES C BAKER ,  DANIEL M FRIEND

    IPC: G06F11/10 ,  H03M13/23 ,  H03M13/41 ,  H03M13/45

    Abstract: PROBLEM TO BE SOLVED: To provide a soft decision output decoder for convolution coding that decodes a signal expressed in a grating with a block length N divided into windows with a length of L. SOLUTION: The decoding of a signal expressed in a grating with a block length N divided into windows having a length of L includes a step (206) where reverse recursions from a point P after the last window to the last window are reversely decoded and a point is selected for the point P at a distance sufficiently apart from the last window so that the reverse recursions decides a known state metric at the last window. The decoding also includes a step (208) where the signal is expressed in the window from the known state in the last window until the start point of the window reversely by using the reverse recursions to decide a reverse recursion state metric set to be stored, a step where a known state in the first window is decoded until the last point of the window forwardly by using the forward recursions, and a step (212) where a soft output in each stage of the forward recursions is calculated by using the reverse recursion state metric to be stored and a branch metric in each stage to provide the soft output of each stage.

    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

    Method and device for reducing round-trip latency and overhead in communication system
    4.
    发明专利
    Method and device for reducing round-trip latency and overhead in communication system 有权
    用于减少通信系统中的循环延迟和覆盖的方法和设备

    公开(公告)号：JP2011045111A

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

    申请号：JP2010222156

    申请日：2010-09-30

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

    Inventor： CLASSON BRIAN K ,  BAUM KEVIN L ,  GHOSH AMITAVA ,  LOVE ROBERT T ,  VIJAY NANGIA ,  STEWART KENNETH A

    IPC: H04W72/04 ,  H04J11/00

    CPC classification number: H04B7/2656 ,  H04L1/1822

    Abstract: PROBLEM TO BE SOLVED: To provide a data transmission method for reducing both round-trip latency and overhead in a communication system.
    SOLUTION: Data are arranged in one subframe in a wireless frame. The data contains a plurality of OFDM codes or single carrier FDMA codes. The two or more of codes have different code duration. The duration of the wireless frame and subframe are the same. The code contained in the subframe contains a plurality of subcarriers, and the plurality of the codes and subcarriers contained in the subframe are grouped into a resource block so that a carrier band width is divided into the integral number of resource blocks. In the duration of cyclic prefix of the two or more codes contained in the subframe, only one sample duration corresponding to the minimum carrier band width is different.
    COPYRIGHT: (C)2011,JPO&INPIT

    Abstract translation: 要解决的问题：提供用于减少通信系统中的往返延迟和开销的数据传输方法。 解决方案：数据以无线帧中的一个子帧排列。 数据包含多个OFDM码或单载波FDMA码。 两个或多个代码具有不同的代码持续时间。 无线帧和子帧的持续时间是相同的。 包含在子帧中的代码包含多个子载波，并且包含在子帧中的多个代码和子载波被分组为资源块，使得载波带宽被划分为整数个资源块。 在子帧中包含的两个或多个码的循环前缀的持续时间中，对应于最小载波带宽的仅一个采样持续时间是不同的。 版权所有（C）2011，JPO＆INPIT

    Method and apparatus for encoding and decoding data
    6.
    发明专利
    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

    Downlink control channel signaling in wireless communication system
    7.
    发明专利
    Downlink control channel signaling in wireless communication system 有权
    无线通信系统中的下行控制信道信令

    公开(公告)号：JP2008054319A

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

    申请号：JP2007216057

    申请日：2007-08-22

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

    Inventor： KUCHIBHOTLA RAVI ,  CLASSON BRIAN K ,  LOVE ROBERT T ,  NORY RAVIKIRAN ,  SARTORI PHILIPPE J ,  STEWART KENNETH A ,  SUN YAKUN ,  TALUKDAR ANUP K

    IPC: H04J11/00 ,  H04J1/00 ,  H04J3/00 ,  H04J3/16

    CPC classification number: H04W72/0406 ,  H04B7/2615 ,  H04L27/2608

    Abstract: PROBLEM TO BE SOLVED: To solve a problem that a mechanism for a single resource allocation and a mechanism capable of allocating resources based on demands of each of user equipment are required in the case of a frame or a transmission time interval (TTI) constituted of a chain of sub-frames.
    SOLUTION: The present invention relates to a method in a wireless communication terminal (103) including receiving a plurality of sub-frames having time-frequency resource elements and resource allocation fields associated with a corresponding sub-frame, wherein the resource allocation fields indicate a resource assignment. In another embodiment, the terminal receives a radio frame comprising a plurality of sub-frames and a frequency diverse allocation field indicating frequency diverse resource allocations in multiple sub-frames of the radio frame.
    COPYRIGHT: (C)2008,JPO&INPIT

    Abstract translation: 要解决的问题为了解决在帧或传输时间间隔（TTI）的情况下，需要基于用户设备的需求的单个资源分配机制和能够分配资源的机制的问题 ）由一个子帧链构成。 解决方案：本发明涉及一种无线通信终端（103）中的方法，包括接收具有时间 - 频率资源元素和与对应子帧相关联的资源分配字段的多个子帧，其中所述资源分配 字段表示资​​源分配。 在另一个实施例中，终端接收包括多个子帧的无线电帧和指示无线电帧的多个子帧中的频率不同资源分配的频率分散分配字段。 版权所有（C）2008，JPO＆INPIT

    Resource allocation in cellular communications system
    8.
    发明专利
    Resource allocation in cellular communications system 审中-公开
    细胞通信系统资源分配

    公开(公告)号：JP2007060642A

    公开(公告)日：2007-03-08

    申请号：JP2006201454

    申请日：2006-07-25

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

    Inventor： SARTORI PHILIPPE JEAN-MAR ,  BAUM KEVIN L ,  CLASSON BRIAN K ,  LOVE ROBERT T ,  NANGIA VIJAY ,  CUDAK MARK CONRAD

    IPC: H04J11/00 ,  H04W72/04

    CPC classification number: H04L5/0044 ,  H04B1/7143 ,  H04J11/0023 ,  H04L5/0007 ,  H04L5/0039 ,  H04L5/0041 ,  H04W72/0453

    Abstract: PROBLEM TO BE SOLVED: To provide a resource assignment scheme and a signaling method which can suit for both an FS user and an FNS user in a wireless communications system.
    SOLUTION: In an OFDM wireless communication system, a method of assigning resources for the FS (frequency selectivity) user and the FNS (frequency non-selectivity) user includes a step to assign first frequency resources including at least two approaching subcarriers to at least one FS user to a certain time interval and to assign second frequency resources to at least one FNS user, including at least two discontinuous subcarriers with respect to each FNS user to the inside of the same time interval. The first frequency resources and the second frequency resources are a part of common frequency channels.
    COPYRIGHT: (C)2007,JPO&INPIT

    Abstract translation: 要解决的问题：提供一种能够适用于无线通信系统中的FS用户和FNS用户的资源分配方案和信令方法。 解决方案：在OFDM无线通信系统中，为FS（频率选择性）用户和FNS（频率非选择性）用户分配资源的方法包括将包括至少两个接近的子载波的第一频率资源分配给 至少一个FS用户到达一定时间间隔，并且向至少一个FNS用户分配第二频率资源，所述至少一个FNS用户包括相对于每个FNS用户至少两个不连续的子载波到相同时间间隔的内部。 第一频率资源和第二频率资源是常用频道的一部分。 版权所有（C）2007，JPO＆INPIT

    Encoding and decoding methods and apparatus of the data
    10.
    发明专利
    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

Patent Agency Ranking