Tramas de comunicación inalámbrica de entrelazado

    公开(公告)号:ES2384484T3

    公开(公告)日:2012-07-05

    申请号:ES08856128

    申请日:2008-11-13

    Abstract: Un método de operar una estación base (910) en una red inalámbrica (900), que comprende:asignar (A1110) recursos radio para un equipo de usuario (920) en tramas de una pluralidad de tipos de tramaque incluye los primer y segundo tipos de trama, en el que una trama de cada tipo de trama incluye unpreámbulo que distingue la trama de las tramas de otros tipos de trama;formar (A1120) una trama entrelazada entrelazando las tramas de la pluralidad de tipos de trama de maneraque en la trama entrelazada,una parte de enlace descendente de una trama de un tipo de trama no se solapa con una parte de enlaceascendente de una trama de cualquier otro tipo de trama, yuna parte de enlace ascendente de la trama del un tipo de trama no se solapa con una parte de enlacedescendente de la trama del cualquier otro tipo de trama; ycomunicar (A1130) con el equipo de usuario (920) de acuerdo con la trama entrelazada,caracterizado porquela trama entrelazada formada en el paso de formación (A1120) comprende una pluralidad de secuencias queincluye las primera y segunda secuencias, cada secuencia que comprende una parte de enlace descendenteseguida por una parte de enlace ascendente,en la primera secuencia, la parte de enlace descendente incluye un punto de sincronización y los recursos deenlace descendente correspondientes al primer tipo de trama y la parte de enlace ascendente incluyerecursos de enlace ascendente correspondientes a un tipo de trama diferente del primer tipo de trama, yen la segunda secuencia inmediatamente posterior a la primera secuencia, la parte de enlace descendenteincluye un punto de sincronización y los recursos de enlace descendente correspondientes al segundo tipo detrama y la parte de enlace ascendente incluye recursos de enlace ascendente correspondientes a un tipo detrama diferente del segundo tipo de trama.

    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

    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)的电路以实现最佳代码。

    SECURE NEGOTIATION OF AUTHENTICATION CAPABILITIES

    公开(公告)号:CA2736172A1

    公开(公告)日:2010-03-11

    申请号:CA2736172

    申请日:2009-05-18

    Abstract: A network (20) comprises an authenticator node (22) and a server (24) such as an authentication, authorization, and accounting (AAA) server. A method comprises a terminal (30) sending authentication capabilities information (AC) across a network access interface (32) to the network (the authentication capabilities information provides an indication of authentication capabilities of the terminal). The network (20) then uses the authentication capabilities information to determine a first cryptographic value. The terminal (30) then uses the authentication capabilities information to determine a second cryptographic value. The network (20) compares the first cryptographic value and the second cryptographic value to authenticate the terminal.

    SECURE NEGOTIATION OF AUTHENTICATION CAPABILITIES

    公开(公告)号:CA2736172C

    公开(公告)日:2017-01-17

    申请号:CA2736172

    申请日:2009-05-18

    Abstract: A network (20) compris-es an authenticator node (22) and a serv-er (24) such as an authentication, autho-rization, and accounting (AAA) server. A method comprises a terminal (30) sending authentication capabilities in-formation (AC) across a network access interface (32) to the network (the au-thentication capabilities information provides an indication of authentication capabilities of the terminal). The net-work (20) then uses the authentication capabilities information to determine a first cryptographic value. The terminal (30) then uses the authentication capa-bilities information to determine a sec-ond cryptographic value. The network (20) compares the first cryptographic value and the second cryptographic val-ue to authenticate the terminal.

    OPTIMUM DISTANCE SPECTRUM FEEDFORWARD LOW RATE TAIL-BITING CONVOLUTIONAL CODES

    公开(公告)号:CA2744492A1

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

    申请号:CA2744492

    申请日:2009-11-24

    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).

    INTERLACING WIRELESS COMMUNICATION FRAMES

    公开(公告)号:CA2706968A1

    公开(公告)日:2009-06-11

    申请号:CA2706968

    申请日:2008-11-13

    Abstract: Mechanisms to interlace multiple legacy frames to enhance radio resource utilization are described. Also described are mechanisms to modify a low- latency frame structure to appear as legacy frames. In one aspect, partially blanked-out legacy frames are interlaced with time offsets so that they complement each other to leave no idle system time. To a legacy user equipment (920), the interlaced frame appears as normal legacy frames used by multiple legacy cells. In another aspect, the low-latency frame is modified to appear as an interlaced frame. Again to the legacy user equipment (920), the low-latency frame appears as legacy frames from multiple legacy cells. To the low-latency user equipment, the modified low-latency frame still appear as normal low-latency frame. In this manner, radio resources of the legacy base stations are optimally utilized. Also, low-latency base stations (910) are enabled to provide serves to the legacy user equipments (920) without wasting radio resources.

Patent Agency Ranking