知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

11 records (took 0.012 seconds)

    Methods and apparatus for unidirectional timing message transport over packet networks
    3.
    发明授权
    Methods and apparatus for unidirectional timing message transport over packet networks 有权
    通过分组网络进行单向定时消息传输的方法和装置

    公开(公告)号：US07839897B2

    公开(公告)日：2010-11-23

    申请号：US11536989

    申请日：2006-09-29

    Applicant: Codrut Radu Radulescu

    Inventor： Codrut Radu Radulescu

    IPC: H04J3/06

    CPC classification number: H04J3/0664 ,  H04L43/0864 ,  H04L43/106

    Abstract: Methods and apparatus for synchronizing a first clock of a transmit node and a second clock of receive node in a packet network are provided. Consecutive intervals of time-stamped packets transferred from the transmit node to the receive node are selected. The consecutive intervals have a difference in delay noise within a defined acceptance window. A correction factor is determined for the second clock in accordance with transmit and receive time stamps of transferred time-stamped packets bounding the consecutive intervals. The correction factor is applied to the second clock to synchronize the second clock of the receive node with the first clock of the transmit node.

    Abstract translation: 提供了用于在分组网络中同步发送节点的第一时钟和接收节点的第二时钟的方法和装置。 选择从发送节点传送到接收节点的时间戳分组的连续间隔。 连续的间隔在定义的接受窗口内具有延迟噪声的差异。 根据传输的连续间隔的时间戳分组的发送和接收时间戳，确定第二时钟的校正因子。 校正因子被应用于第二时钟以使接收节点的第二时钟与发送节点的第一时钟同步。

    PHY BANDWIDTH ESTIMATION FROM BACKPRESSURE PATTERNS
    4.
    发明申请
    PHY BANDWIDTH ESTIMATION FROM BACKPRESSURE PATTERNS 审中-公开
    背景图案的PHY带宽估计

    公开(公告)号：US20090073889A1

    公开(公告)日：2009-03-19

    申请号：US11857850

    申请日：2007-09-19

    Applicant: Codrut Radu Radulescu

    Inventor： Codrut Radu Radulescu

    IPC: G06F11/00 ,  H04L12/403

    CPC classification number: H04L43/0805 ,  H04L12/403

    Abstract: The present invention provides a system and method of determining available bandwidth at a physical layer (PHY) device at a server on a broadband network. A link layer controller of a master administrator adaptively polls a PHY device over a set of time intervals. During polling, the controller places a PHY device's address on a line of a bus and awaits a response from the PHY device. Based upon the response from the PHY device, the administrator can determine whether the PHY device has available bandwidth. The link layer controller uses this information to recalculate its polling scheme to better make use of the available bandwidth over the shared transmission medium to which each PHY device in the network is attached.

    Abstract translation: 本发明提供了一种在宽带网络上的服务器处确定物理层（PHY）设备处的可用带宽的系统和方法。 主管理员的链路层控制器通过一组时间间隔自适应地轮询PHY设备。 在轮询期间，控制器将PHY设备的地址放置在总线的一行上，并等待来自PHY设备的响应。 基于PHY设备的响应，管理员可以确定PHY设备是否具有可用带宽。 链路层控制器使用该信息重新计算其轮询方案，以更好地利用网络中每个PHY设备所连接的共享传输介质上的可用带宽。

    ERGODIC TIME TO DIGITAL CONVERTER
    5.
    发明申请
    ERGODIC TIME TO DIGITAL CONVERTER 有权

    公开(公告)号：US20250164938A1

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

    申请号：US18840465

    申请日：2023-02-22

    Applicant: CODRUT Radu RADULESCU

    Inventor： CODRUT Radu RADULESCU

    IPC: G04F10/00 ,  H03M1/10

    Abstract: A time to digital converter (TDC) comprising a tapped delay line (TDL) having two or more sectors, each sector of the two or more sectors having a dedicated or a shared latching clock, or two or more TDLs each having at least one sector, wherein each TDL of the two or more TDLs includes a dedicated latching clock for each sector, and a snapshot register (TDLSecS) configured to latch the sector on its respective latching clock to generate a thermometer reading.

    Methods and apparatus for minimizing sequence identifier difference of simultaneously transmitted cells
    6.
    发明授权
    Methods and apparatus for minimizing sequence identifier difference of simultaneously transmitted cells 失效
    用于最小化同时传输的小区的序列标识符差异的方法和装置

    公开(公告)号：US07633962B2

    公开(公告)日：2009-12-15

    申请号：US11193799

    申请日：2005-07-29

    Applicant: Deepak Kataria ,  Codrut Radu Radulescu

    Inventor： Deepak Kataria ,  Codrut Radu Radulescu

    IPC: H04L12/54

    CPC classification number: H04L47/30 ,  H04L45/245 ,  H04L47/34 ,  H04L49/90

    Abstract: A method of minimizing SID difference of simultaneously transmitted cells in two or more data communication lines is provided. A data transmission speed of each of the two or more data communication lines is identified. A fullness threshold of at least one buffer of two or more buffers in a transmit node is configured in relation to a size of a data cell for transmission. The two or more buffers correspond to respective ones of the two or more data communication lines. The at least one buffer communicates with a given one of the two or more data communication lines having a data transmission speed slower than another of the two or more data communication lines. One or more data cells for transmission are assigned to the two or more buffers of the two or more data communication lines at the transmit node. The one or more data cells are transmitted from the transmit node to a receive node in accordance with the data transmission speeds of the two or more data communication lines. The fullness threshold of the at least one buffer controls assignment of data cells to the at least one buffer during data cell transmission on the given data communication line and minimizes SID difference of simultaneously transmitted cells in the two or more data communication lines.

    Abstract translation: 提供了一种使两个或多个数据通信线路中的同时发送的小区的SID差异最小化的方法。 识别两条或多条数据通信线路中的每一条的数据传输速度。 发送节点中的两个或更多个缓冲器的至少一个缓冲器的饱和度阈值被配置为用于传输的数据单元的大小。 两个或更多个缓冲器对应于两个或更多个数据通信线路中的相应的缓冲器。 所述至少一个缓冲器与所述两条或更多条数据通信线路中的给定的一条数据传输速度比所述两条或更多条数据通信线路中的另一条数据传输速度慢。 用于发送的一个或多个数据单元被分配给发送节点处的两个或更多个数据通信线路的两个或更多个缓冲器。 根据两条或多条数据通信线路的数据传输速度，一个或多个数据信元从发送节点发送到接收节点。 所述至少一个缓冲器的饱和度阈值在所述给定数据通信线路上的数据单元传输期间控制数据单元向所述至少一个缓冲器的分配，并且最小化两个或更多个数据通信线路中同时发送的小区的SID差异。

    Methods and Apparatus for Unidirectional Timing Message Transport Over Packet Networks
    7.
    发明申请
    Methods and Apparatus for Unidirectional Timing Message Transport Over Packet Networks 有权
    用于单向定时消息传输的方法和装置

    公开(公告)号：US20080080567A1

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

    申请号：US11536989

    申请日：2006-09-29

    Applicant: Codrut Radu Radulescu

    Inventor： Codrut Radu Radulescu

    IPC: H04J3/06

    CPC classification number: H04J3/0664 ,  H04L43/0864 ,  H04L43/106

    Abstract: Methods and apparatus for synchronizing a first clock of a transmit node and a second clock of receive node in a packet network are provided. Consecutive intervals of time-stamped packets transferred from the transmit node to the receive node are selected. The consecutive intervals have a difference in delay noise within a defined acceptance window. A correction factor is determined for the second clock in accordance with transmit and receive time stamps of transferred time-stamped packets bounding the consecutive intervals. The correction factor is applied to the second clock to synchronize the second clock of the receive node with the first clock of the transmit node.

    Abstract translation: 提供了用于在分组网络中同步发送节点的第一时钟和接收节点的第二时钟的方法和装置。 选择从发送节点传送到接收节点的时间戳分组的连续间隔。 连续的间隔在定义的接受窗口内具有延迟噪声的差异。 根据传输的连续间隔的时间戳分组的发送和接收时间戳，确定第二时钟的校正因子。 校正因子被应用于第二时钟以使接收节点的第二时钟与发送节点的第一时钟同步。

    Network timing synchronization systems
    8.
    发明授权
    Network timing synchronization systems 有权
    网络定时同步系统

    公开(公告)号：US08416812B2

    公开(公告)日：2013-04-09

    申请号：US12586321

    申请日：2009-09-21

    Applicant: Codrut Radu Radulescu

    Inventor： Codrut Radu Radulescu

    IPC: H04J3/06 ,  H04L7/00

    CPC classification number: H04J3/0667 ,  G04G7/00

    Abstract: A method and means synchronize timing of a follower system to a reference system. A Hierarchical CFF function (“HCFF”) is applied to a set of Correction Factor Functions types (“CFFs”) or a set of other HCFF. Each CFF type uses the same input data set specific to that type and generates at least one Correction Factor Solution (“CFS”) for each of the CFF, wherein the CFS consists of only CF or the CFS consists of both i) CF and ii) a SACF. The HCFF takes as input a set of CFS and generates at least one CFS, wherein the CFS consist of only the CF, or the CFS consists of both the i) CF and ii) a SACF.

    Abstract translation: 方法和装置将跟随系统的定时与参考系统进行同步。 分层CFF功能（HCFF）应用于一组校正因子函数类型（CFFs）或一组其他HCFF。 每个CFF类型使用与该类型特定的相同的输入数据集，并为每个CFF生成至少一个校正因子解决方案（CFS），其中CFS仅由CF组成，或CFS由i）CF和ii）组成 SACF。 HCFF作为一组CFS输入，并生成至少一个CFS，其中CFS仅由CF组成，或CFS由i）CF和ii）SACF组成。

    Methods and apparatus for reorganizing cells buffered after transmission
    10.
    发明授权
    Methods and apparatus for reorganizing cells buffered after transmission 有权
    传播后缓冲细胞重组细胞的方法和装置

    公开(公告)号：US07924857B2

    公开(公告)日：2011-04-12

    申请号：US11326047

    申请日：2006-01-05

    Applicant: Deepak Kataria ,  Codrut Radu Radulescu

    Inventor： Deepak Kataria ,  Codrut Radu Radulescu

    IPC: H04L12/56

    CPC classification number: H04L49/9094 ,  H04L49/90

    Abstract: A method and apparatus of reorganizing cells received over data communication lines at a receive node is provided. The cells have an initial order identified by monotonically increasing sequence identifiers. The receive node has buffers associated with respective ones of the communication lines. Each of the buffers has an output position. A cell having a smallest sequence identifier is detected from one or more cells at the output positions of the buffers. It is determined if the smallest sequence identifier is sequentially consecutive to a specified sequence identifier. If the smallest sequence identifier is sequentially consecutive to the specified sequence identifier, the cell having the smallest sequence identifier is dequeued from an output position of one of the buffers and the specified sequence identifier is redefined as the smallest sequence identifier.

    Abstract translation: 提供了一种在接收节点上通过数据通信线路重新组合接收的小区的方法和装置。 单元具有通过单调增加序列标识符来识别的初始顺序。 接收节点具有与相应通信线路相关联的缓冲器。 每个缓冲器都有一个输出位置。 从缓冲器的输出位置的一个或多个单元检测具有最小序列标识符的单元。 确定最小序列标识符是否与指定的序列标识符顺序连续。 如果最小的序列标识符与指定的序列标识符顺序连续，则具有最小序列标识符的小区从一个缓冲区的输出位置出出，并且将指定的序列标识符重新定义为最小的序列标识符。

Patent Agency Ranking