A METHOD AND SYSTEM FOR A LOW-OVERHEAD MOBILITY MANAGEMENT PROTOCOL IN THE INTERNET PROTOCOL LAYER
    1.
    发明申请
    A METHOD AND SYSTEM FOR A LOW-OVERHEAD MOBILITY MANAGEMENT PROTOCOL IN THE INTERNET PROTOCOL LAYER 审中-公开
    互联网协议层中低端移动管理协议的方法与系统

    公开(公告)号:WO02071718A2

    公开(公告)日:2002-09-12

    申请号:PCT/US0204372

    申请日:2002-02-14

    Abstract: A system and method for supporting mobile Internet communication is provided which employs a plurality of Routers and a plurality of Mobile Nodes (MNs). Each Router has a unique communication address. Each MN is associated with a home Retour. Each Router has an associated Mobile Node Location List identifying each MN for which the Router is the home Router and the communication address of a Router corresponding to a current location of each such MN. Each MN is movable from an old location where the MN communicates with the Internet via one Router to a current location where the MN communicates with the Internet via a different Router. Communication at the current location via the different Router is established by communicating to the MN's home Router the communication address of the different Router as the communication address corresponding to the MN's current location. Accordingly, a data communication from a corersponding node (CN) to a selected MN is communicated to the selected MN by accessing the Mobile Node Location List of the selected MN's home Router to determine the communication address corresponding to the selected MN's current location and directing the data communication to that determined communication address.

    Abstract translation: 提供一种用于支持移动因特网通信的系统和方法,其采用多个路由器和多个移动节点(MN)。 每个路由器都有一个独特的通讯地址。 每个MN都与一个家庭路线相关联。 每个路由器具有相关联的移动节点位置列表,其标识路由器是家庭路由器的每个MN,以及对应于每个这样的MN的当前位置的路由器的通信地址。 每个MN可以从MN通过一个路由器与因特网通信的旧位置移动到MN通过不同路由器与因特网通信的当前位置。 通过与MN的归属路由器通信,将不同路由器的通信地址作为与MN当前位置对应的通信地址进行通信,建立通过不同路由器在当前位置的通信。 因此,通过访问所选择的MN的归属路由器的移动节点位置列表来确定与所选择的MN的当前位置相对应的通信地址,并将所指示的MN的当前位置对应的通信地址通过从核心响应节点(CN)到所选择的MN的数据通信传送到所选择的MN 数据通信到确定的通信地址。

    BI-DIRECTIONAL AND REVERSE DIRECTIONAL RESOURCE RESERVATION SETUP PROTOCOL
    3.
    发明公开
    BI-DIRECTIONAL AND REVERSE DIRECTIONAL RESOURCE RESERVATION SETUP PROTOCOL 有权
    联合国开发计划署(UMKEHR-RICHTBETRIEBSMITTEL RESERVIERUNGSEINRICHTPROTOKOLL)

    公开(公告)号:EP1440591A4

    公开(公告)日:2010-02-24

    申请号:EP02802825

    申请日:2002-11-01

    Abstract: A method for reserving resources for a wireless packet-based session, the method comprising a first user sending a first resource reservation protocol message to a second user via a network comprising a plurality of routers for reserving resources for a packet-based session along a path to the second user; and the first user receiving a second resource reservation protocol message from the second user in response to the first resource reservation protocol message, wherein resources for communication in both directions to and from the second user are reserved by routers along the path as the second resource reservation protocol message traverses the network along the path.

    Abstract translation: 一种用于为基于无线分组的会话预留资源的方法,所述方法包括:第一用户经由网络向第二用户发送第一资源预留协议消息,所述网络包括多个路由器,用于沿着路径为基于分组的会话预留资源 到第二个用户; 并且所述第一用户响应于所述第一资源预留协议消息从所述第二用户接收到第二资源预留协议消息,其中用于与来自所述第二用户的两个方向的通信的资源是沿着所述路径的路由器预留的,作为所述第二资源预留 协议消息沿着路径遍历网络。

    OPTIMIZED DISCRETE FOURIER TRANSFORM METHOD AND APPARATUS USING PRIME FACTOR ALGORITHM
    4.
    发明公开
    OPTIMIZED DISCRETE FOURIER TRANSFORM METHOD AND APPARATUS USING PRIME FACTOR ALGORITHM 审中-公开
    方法和设备改进的离散傅立叶变换到PRIMFAKTORALGORITHMUS

    公开(公告)号:EP1493098A4

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

    申请号:EP03736460

    申请日:2003-04-10

    CPC classification number: G06F17/144

    Abstract: An apparatus and method for DFT processing using prime factor algorithm (PFA) on a selected number P of midamble chip values received by a CDMA receiver, where P has a plurality M of relatively prime factors F, and the DFT process is divided into M successive F-point DFT processes. The P data values are retrieved from a single input port memory and selectively permuted by a controller into parallel caches to optimize factoring with associated twiddle factors stored in parallel registers. The permuted inputs are factored in two or more parallel PFA circuits that comprise adders and multipliers arranged to accommodate any size F-point DFT. The outputs of the PFA circuits are processed by consolidation circuitry in preparation for output permutation of the values which are sent to memory for subsequent DFT cycles.

    INTERCALADOR DE MODEM FDD DE TERCERA GENERACION.

    公开(公告)号:MXPA03002200A

    公开(公告)日:2007-10-02

    申请号:MXPA03002200

    申请日:2001-07-19

    Abstract: Se describen un metodo y un aparato para desintercalar o descodificar bloques de datos intercalados expandidos, particularmente para el uso en sistemas de telecomunicaciones inalambricas tales como los que son proporcionados por el estandar de Proyecto de Sociedad de Tercera Generacion (3G). Los datos son procesados en una base de elemento secuencial, donde cada elemento tiene un numero predeterminado de bitios M, cuyos bitios estan contenidos en un bloque de palabra W' de datos secuenciales. Los elementos son extraidos del bloque de palabras W' en orden secuencial, siendo extraido cada elemento ya sea de una palabra simple o de dos palabras intercaladas secuenciales dentro del grupo de palabras W'. Los elementos son almacenados en localizacion selectiva dentro de un grupo de palabras W de una memoria desintercaladora, tal que despues de la terminacion de la extraccion y la escritura de todos los elementos, las palabras W provenientes de l a memoria desintercaladora pueden ser secuencialmente leidas para corresponder a un bloque de bitios de datos originales a partir de los cuales fue creado el bloque de elementos intercalados. El procesamiento convencional adicional da como resultado la contraccion de las palabras expandidas, desintercaladas, para reproducir el bloque de datos de bitios en un receptor como fue originalmente disenado para la transmision en un transmisor.

    OPTIMIZED DISCRETE FOURIER TRANSFORM METHOD AND APPARATUS USING PRIME FACTOR ALGORITHM

    公开(公告)号:AU2003237804A1

    公开(公告)日:2003-12-19

    申请号:AU2003237804

    申请日:2003-04-10

    Abstract: An apparatus and method for DFT processing using prime factor algorithm (PFA) on a selected number P of midamble chip values received by a CDMA receiver, where P has a plurality M of relatively prime factors F, and the DFT process is divided into M successive F-point DFT processes. The P data values are retrieved from a single input port memory and selectively permuted by a controller into parallel caches to optimize factoring with associated twiddle factors stored in parallel registers. The permuted inputs are factored in two or more parallel PFA circuits that comprise adders and multipliers arranged to accommodate any size F-point DFT. The outputs of the PFA circuits are processed by consolidation circuitry in preparation for output permutation of the values which are sent to memory for subsequent DFT cycles.

    THIRD GENERATION FDD MODEM INTERLEAVER

    公开(公告)号:CA2421956A1

    公开(公告)日:2002-03-21

    申请号:CA2421956

    申请日:2001-07-19

    Abstract: A method and apparatus are disclosed for deinterleaving expanded interleaved data blocks, particularly for use in a wireless telecommunications systems such as provided by the Third Generation Partnership Project (3G) standard. The data is processed on a sequential element basis where each element has a pre-determined number of bits M which bits are contained in a block of sequential data world W'. The elements are extracted from the block of words W' in sequential order, each element being extracted form either a single or two sequential interleaved words within the set of words W'. The elements ar e stored in selective location within a set of words W of a deinterleaver memo ry such that upon completion of the extraction and writing of all the elements, the words W from the deinterleaver memory can be sequentially read out to correspond to an original data block of bits from which the block of interleaved elements was created. Additional conventional processing results in the contraction of the deinterleaved expanded words to reproduce the data block of bits in a receiver as originally designated for transmission in a transmitter.

Patent Agency Ranking