中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

7 records (took 0.027 seconds)

    A METHOD FOR ASSISTING SCHEDULING OF A USER EQUIPMENT IN A HETEROGENEOUS NETWORK
    2.
    发明公开
    A METHOD FOR ASSISTING SCHEDULING OF A USER EQUIPMENT IN A HETEROGENEOUS NETWORK 有权
    对一个用户设备的时机在异构网络支持

    公开(公告)号：EP3011784A4

    公开(公告)日：2016-06-01

    申请号：EP13887461

    申请日：2013-06-17

    Applicant: ERICSSON TELEFON AB L M

    Inventor： CHEN TSAO-TSEN ,  FRENNE MATTIAS ,  LINDBOM LARS ,  MASINI GINO LUCA ,  CENTONZA ANGELO

    IPC: H04W72/04

    CPC classification number: H04W72/1289 ,  H04W16/32 ,  H04W24/02 ,  H04W28/18 ,  H04W72/0473 ,  H04W84/042

    Abstract: A method in a first base station for assisting a third base station in scheduling a user equipment. The first base station obtains a first parameter associated to a first cell, or an indication of the first parameter, and identifier of the first cell. The first parameter comprises a first protected subframe pattern. The first base station obtains a second parameter associated to a second cell, or indication of the second parameter, and an identifier of the second cell. The second parameter comprises a second protected subframe pattern. The first base station assists the third base station in scheduling of the user equipment in a third cell by sending to the third base station the first parameter, or the indication of the first parameter, and the identifier of the first cell, together with the second parameter, or the indication of the second parameter, and the identifier of the second cell.

    Abstract translation: 用于调度用户设备辅助的第三基站在第一基站中的方法。 所述第一基站获取相关联的第一小区，或者所述第一参数的指示，以及所述第一小区的识别符的第一参数。 第一个参数包括第一保护子帧模式。 所述第一基站获取关联于第二小区，或所述第二参数的指示的第二参数，并且在所述第二小区的标识符。 第二个参数包括第二保护子帧模式。 所述第一基站通过发送给所述第三基站的第一参数，或者所述第一参数的所述指示，并且所述第一小区的标识符有助于在第三小区中的用户设备的调度的第三基站，连同第二 参数或所述第二参数的所述指示，并且所述第二小区的标识。

    OPTIMUM DISTANCE SPECTRUM FEEDFORWARD LOW RATE TAIL-BITING CONVOLUTIONAL CODES
    4.
    发明申请
    OPTIMUM DISTANCE SPECTRUM FEEDFORWARD LOW RATE TAIL-BITING CONVOLUTIONAL CODES 审中-公开
    最佳距离频谱前馈低速尾随位移代码

    公开(公告)号：WO2010062248A3

    公开(公告)日：2011-02-24

    申请号：PCT/SE2009051326

    申请日：2009-11-24

    Applicant: ERICSSON TELEFON AB L M

    Inventor： CHEN TSAO-TSEN ,  SJOEBERG STEN INGEMAR ,  ERNSTROEM PER ,  YU KAI

    IPC: H03M13/03

    CPC classification number: H03M13/235 ,  H03M13/036 ,  H03M13/413 ,  H03M13/635 ,  H03M13/6362 ,  H03M13/6375

    Abstract: Method and apparatus for generating a set of generator polynomials for use as a tail biting convolutional code to operate on data transmitted over a channel comprises: (0) specifying a constraint and a low code rate for a tail biting convolutional code, where the low rate code is lower than 1/n (n being an integer greater than 4); (1) selecting valid combinations of generator polynomials to include in a pool of potential codes, each valid combination being a potential code of the low rate code; (2) determining first lines of a weight spectrum for each potential code in the pool and including potential codes of the pool having best first lines in a candidate set; (3) determining best codes of the candidate set based on the first L number of lines in the weight spectrum; (4) selecting an optimum code(s) from the best codes; and (5) configuring a circuit(s) of a data transceiver (60/90) to implement the optimum code(s).

    Abstract translation: 用于生成一组生成多项式的方法和装置，其用作尾部卷积卷积码以对通过信道发送的数据进行操作包括：（0）为尾部卷积卷积码指定约束和低码率，其中低速率 代码低于1 / n（n是大于4的整数）; （1）选择生成多项式的有效组合以包括在潜在代码池中，每个有效组合是低速率代码的潜在代码; （2）确定所述池中每个潜在代码的权重谱的第一行，并且包括在候选集合中具有最佳第一行的所述池的潜在代码; （3）基于权重谱中的第一L个行数确定候选集合的最佳代码; （4）从最佳代码中选择最佳代码; 以及（5）配置数据收发器（60/90）的电路以实现最佳代码。

    REDUCED-COMPLEXITY DECODING ALGORITHMS FOR TAIL-BITING CONVOLUTIONAL CODES
    5.
    发明申请
    REDUCED-COMPLEXITY DECODING ALGORITHMS FOR TAIL-BITING CONVOLUTIONAL CODES 审中-公开
    尾卷积卷积码的降维 - 复杂度解码算法

    公开(公告)号：WO2009054779A3

    公开(公告)日：2009-07-09

    申请号：PCT/SE2008051176

    申请日：2008-10-20

    Applicant: ERICSSON TELEFON AB L M

    Inventor： CHEN TSAO-TSEN ,  TSAI SHIAU-HE SHAWN

    IPC: H03M13/39

    CPC classification number: H03M13/3938 ,  H03M13/2996 ,  H03M13/413

    Abstract: A decoder (40) is provided which is configured to operate upon an input encoded sequence using a wrap around Viterbi procedure, and a decoding method which employs the decoder (40). The decoder (40)/method is configured to output a selected path as a decode sequence, and to avoid storing, for a current iteration of the wrap-around Viterbi procedure other than a first iteration, a best path up to the current iteration.

    Abstract translation: 提供了一种解码器（40），其被配置为使用绕过维特比过程的输入编码序列来操作，以及使用解码器（40）的解码方法。 解码器（40）/方法被配置为输出选择的路径作为解码序列，并且为了避免除第一次迭代以外的绕回维特比过程的当前迭代，存储直到当前迭代的最佳路径。

    OPTIMUM DISTANCE SPECTRUM FEEDFORWARD LOW RATE TAIL-BITING CONVOLUTIONAL CODES
    7.
    发明专利
    OPTIMUM DISTANCE SPECTRUM FEEDFORWARD LOW RATE TAIL-BITING CONVOLUTIONAL CODES 未知

    公开(公告)号：CA2744492A1

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

    申请号：CA2744492

    申请日：2009-11-24

    Applicant: ERICSSON TELEFON AB L M

    Inventor： CHEN TSAO-TSEN ,  SJOEBERG STEN INGEMAR ,  ERNSTROEM PER ,  YU KAI

    IPC: H03M13/03

    Abstract: Method and apparatus for generating a set of generator polynomials for use as a tail biting convolutional code to operate on data transmitted over a channel comprises: (0) specifying a constraint and a low code rate for a tail biting convolutional code, where the low rate code is lower than 1/n (n being an integer greater than 4); (1) selecting valid combinations of generator polynomials to include in a pool of potential codes, each valid combination being a potential code of the low rate code; (2) determining first lines of a weight spectrum for each potential code in the pool and including potential codes of the pool having best first lines in a candidate set; (3) determining best codes of the candidate set based on the first L number of lines in the weight spectrum; (4) selecting an optimum code(s) from the best codes; and (5) configuring a circuit(s) of a data transceiver (60/90) to implement the optimum code(s).

Patent Agency Ranking