BIT-STUFFING METHOD FOR CROSSTALK AVOIDANCE IN HIGH-SPEED BUSES
    1.
    发明申请
    BIT-STUFFING METHOD FOR CROSSTALK AVOIDANCE IN HIGH-SPEED BUSES 有权
    用于高速公车中的摇摆者避险的双打快速方法

    公开(公告)号:US20110222622A1

    公开(公告)日:2011-09-15

    申请号:US12853444

    申请日:2010-08-10

    IPC分类号: H04B15/00 H04L25/49

    摘要: This invention discloses a bit-stuffing method for crosstalk avoidance in high-speed buses, which comprises the steps of inputting a plurality of data bit streams in parallel to a data input buffer; the data input buffer sequentially inputting data bits of the data bit streams to a bit-switching unit, and the bit-switching unit switching the data bits to generate bit-switched data; parallelly inputting the bit-switched data to a bit-stuffing encoding unit; the bit-stuffing encoding unit performing bit-stuffing encoding on the bit-switched data to generate encoded data bits and inputting the encoded data bits to an encoded data buffer; and the encoded data buffer outputting the encoded data to a high-speed bus. The encoded data bits passed through the high-speed bus are decoded using a bit-removing method to recover the data bit streams.

    摘要翻译: 本发明公开了一种用于高速总线中的串扰避免的位填充方法,包括以下步骤:将多个数据比特流并行地输入到数据输入缓冲器; 数据输入缓冲器顺序地将数据位流的数据位输入到位切换单元,并且位切换单元切换数据位以产生位切换数据; 将比特交换数据并行输入到填充编码单元; 所述比特填充编码单元对所述比特交换数据执行比特填充编码,以生成编码数据比特,并将编码数据比特输入到编码数据缓冲器; 并且编码数据缓冲器将编码数据输出到高速总线。 通过高速总线传送的编码数据位使用位去除方法进行解码,以恢复数据位流。

    Temporal placement control of video frames in B-ISDN networks
    3.
    发明授权
    Temporal placement control of video frames in B-ISDN networks 失效
    B-ISDN网络视频帧的时域放置控制

    公开(公告)号:US5499245A

    公开(公告)日:1996-03-12

    申请号:US332978

    申请日:1994-11-01

    摘要: Methods of traffic smoothing for frames of different video sources where each video source transmits frames at fixed intervals and the network is free to decide the relative temporal spacing of video frames from different sources provide significant performance advantages. The time at which a given source begins to transmit its first frame is under the control of the network; however, thereafter, all frames from the source are transmitted at fixed intervals. Two heuristic and one optimization method control the temporal placement of the video frames from different sources in order to reduce the loss rate of the high priority cells and to minimize the smoothness index of the traffic.

    摘要翻译: 每个视频源以固定间隔传输帧的网络的不同视频源的帧的流量平滑方法和网络可以自由地决定来自不同源的视频帧的相对时间间隔提供了显着的性能优点。 给定源开始传输其第一帧的时间在网络的控制之下; 然而,此后,来自源的所有帧以固定间隔发送。 两种启发式和一种优化方法控制来自不同来源的视频帧的时间位置,以便降低高优先级单元的损耗率并最大限度地减少流量的平滑度。

    Bit-stuffing method for crosstalk avoidance in high-speed buses
    4.
    发明授权
    Bit-stuffing method for crosstalk avoidance in high-speed buses 有权
    高速总线串扰避免的位填充方法

    公开(公告)号:US08514895B2

    公开(公告)日:2013-08-20

    申请号:US12853444

    申请日:2010-08-10

    IPC分类号: H04J3/07

    摘要: This invention discloses a bit-stuffing method for crosstalk avoidance in high-speed buses, which comprises the steps of inputting a plurality of data bit streams in parallel to a data input buffer; the data input buffer sequentially inputting data bits of the data bit streams to a bit-switching unit, and the bit-switching unit switching the data bits to generate bit-switched data; parallelly inputting the bit-switched data to a bit-stuffing encoding unit; the bit-stuffing encoding unit performing bit-stuffing encoding on the bit-switched data to generate encoded data bits and inputting the encoded data bits to an encoded data buffer; and the encoded data buffer outputting the encoded data to a high-speed bus. The encoded data bits passed through the high-speed bus are decoded using a bit-removing method to recover the data bit streams.

    摘要翻译: 本发明公开了一种用于高速总线中的串扰避免的位填充方法,包括以下步骤:将多个数据比特流并行地输入到数据输入缓冲器; 数据输入缓冲器顺序地将数据位流的数据位输入到位切换单元,并且位切换单元切换数据位以产生位切换数据; 将比特交换数据并行输入到填充编码单元; 所述比特填充编码单元对所述比特交换数据执行比特填充编码,以生成编码数据比特,并将编码数据比特输入到编码数据缓冲器; 并且编码数据缓冲器将编码数据输出到高速总线。 通过高速总线传送的编码数据位使用位去除方法进行解码,以恢复数据位流。

    Satellite communication system
    5.
    发明授权
    Satellite communication system 失效
    卫星通信系统

    公开(公告)号:US5430732A

    公开(公告)日:1995-07-04

    申请号:US213379

    申请日:1994-03-14

    IPC分类号: H04B7/212 H04B7/185 H04B7/14

    CPC分类号: H04B7/18528

    摘要: A satellite communication system increases its efficiency by using adaptive pipeline polling as the control protocol. In this protocol, the earth stations are separated into active and inactive sets and a first number of slots (salary) is assigned to each active station. Additionally, periodically active stations are queried as to the length of their queues and assigned salary slots not needed by any active station are reallofted to stations with queues that exceed their assigned salary in proportion to the size of such excess. A contention period is included outside of the normal salary and bonus periods during which stations in the inactive are allowed to contend to be included in the active set.

    摘要翻译: 卫星通信系统通过使用自适应流水线轮询作为控制协议来提高其效率。 在该协议中,地球站被分为主动和非活动组,并且将第一数量的时隙(工资)分配给每个活动站。 另外,查询其队列长度的周期性活动站,并且任何活动站不需要的分配的工资插槽将被重新排列到具有超过其分配的工资的队列与具有这种超出的大小成比例的队列。 竞争期间包括在正常工资和奖励期限之外,在该期间,不活动的电台被允许竞争包括在活动集中。

    Weighted longest queue first adaptive scheduling discipline for ATM
networks
    6.
    发明授权
    Weighted longest queue first adaptive scheduling discipline for ATM networks 失效
    ATM网络加权最长队列自适应调度规则

    公开(公告)号:US6072800A

    公开(公告)日:2000-06-06

    申请号:US912372

    申请日:1997-08-18

    申请人: Duan-Shin Lee

    发明人: Duan-Shin Lee

    IPC分类号: H04L12/56 H04Q11/04 H04L12/28

    摘要: Disclosed is a weighted longest queue first (WLQF) service discipline for ATM networks. The sources are classified so that sources in one class have the same cell loss probability requirement. For N classes of traffic the WLQF system has N buffers to store the traffic, wherein buffer i is assigned a positive number w.sub.i for the weight of buffer i. The scheduler transmits a cell from that buffer whose index maximizes w.sub.i Q.sub.i for i=1, 2, . . . ,N, where Q.sub.i is the queue length of buffer i at the moment when the scheduler makes a decision about which buffer to serve. Accordingly, the inventive system always serves the most congested buffer relative to the weighted queue lengths, and can adapt to temporary overload quickly. This feature ensures that in temporary overloads of one of the buffers, the overloaded buffer, receives almost all the service and therefore, losses due to buffer overflows and cell delay variation (CDV) are much small. Additionally, when a call is received, the system determines whether it can provide the requested QoS, and rejects the call if not.

    摘要翻译: 公开了ATM网络的加权最长队列第一(WLQF)服务规则。 来源被分类,使得一类中的源具有相同的信元丢失概率要求。 对于N类业务,WLQF系统具有N个缓冲器来存储流量,其中缓冲器i被分配用于缓冲器i的权重的正数wi。 调度器从该缓冲器发送一个单元,该单元的索引最大化为i = 1,2的wiQi。 。 。 ,N,其中Qi是调度程序作出关于要服务的缓冲区的决定时缓冲器i的队列长度。 因此,本发明的系统总是服务于相对于加权队列长度的最拥挤的缓冲器,并且可以快速适应临时过载。 该功能可确保在缓冲区之一的暂时过载中,重载缓冲区几乎接收所有服务,因此由于缓冲区溢出和单元延迟变化(CDV)造成的损失非常小。 此外,当接收到呼叫时,系统确定它是否可以提供所请求的QoS,如果不能,则拒绝该呼叫。