会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • CONTINUOUS NETWORK CODING IN WIRELESS RELAY NETWORKS
    • 无线中继网连续网络编码
    • US20090252146A1
    • 2009-10-08
    • US12061661
    • 2008-04-03
    • Chong LuoWei PuFeng WuShipeng LiChang Wen Chen
    • Chong LuoWei PuFeng WuShipeng LiChang Wen Chen
    • H04L12/28
    • H04B7/15521H03M13/1102H03M13/2906H03M13/3761H04L1/0057H04L1/0077H04L2001/0097
    • Described is continuous network coding, in which a relay sends probability data comprising a continuous number for use as parity data. The node receives streams of bits sent from sources towards a destination, and computes the probability data based on current noise data and/or fading data. A selected set of the bits (all or some subset thereof) are combined, e.g., XOR-ed or concatenated, and send to the destination. Phase modulation is performed to convey probability information based on the probability data. The destination demodulates the signal to obtain the probability information, and combines the probability information with the data directly received from sources to perform joint decoding. The number of bits in the set of selected bits may be adaptively chosen based on current channel conditions, e.g., increased when the channel conditions from the sources directly to a destination are poor relative to the channel conditions via the relay.
    • 描述了连续网络编码,其中中继发送包括用作奇偶校验数据的连续数字的概率数据。 节点接收从源向目的地发送的比特流,并且基于当前噪声数据和/或衰落数据计算概率数据。 选择的一组位(其全部或某些子集)被组合,例如XOR编辑或级联,并发送到目的地。 执行相位调制以基于概率数据传送概率信息。 目的地解调信号以获得概率信息,并且将概率信息与从源直接接收的数据组合以执行联合解码。 可以基于当前信道条件来自适应地选择所选位组中的比特数,例如,当从源直接到目的地的信道条件相对于经由中继的信道条件差时,增加。
    • 6. 发明授权
    • Encoding visual data with computation scheduling and allocation
    • 用计算调度和分配编码视觉数据
    • US08358693B2
    • 2013-01-22
    • US11457705
    • 2006-07-14
    • Yan LuFeng WuWei PuShipeng Li
    • Yan LuFeng WuWei PuShipeng Li
    • H04N7/12H04N11/02
    • H04N19/567H04N19/127H04N19/156H04N19/172H04N19/19H04N19/196H04N19/43H04N19/533H04N19/557
    • Computation scheduling and allocation for visual communication is described. In one aspect, multiple frames of video data are encoded by allocating for at least a subset of inter-coded frames, on frame-by-frame basis, computational resources to encode the inter-coded frame. To this end, a computational budget to encode a current inter-coded frame is estimated. The estimate is based on the actual computational costs to encode a previous inter-coded frame of video data. Next, sets of operations associated with encoding the current inter-coded frame are analyzed to determine computational resources to implement the operations. If the computational resources exceed the computational budget, complexity of the operations is reduced until the associated computational resources are less than or equal to the computational budget. At this point, the current inter-coded frame is encoded using the operations and the computational budget. This process is repeated for the remaining inter-coded frames of video data.
    • 描述视觉通信的计算调度和分配。 在一个方面,通过在逐帧的基础上为帧间编码帧的至少一个子集分配计算资源来编码帧间编码帧来编码多个视频数据帧。 为此,估计用于编码当前帧间编码帧的计算预算。 该估计是基于对先前的视频数据的帧间编码帧进行编码的实际计算成本。 接下来,分析与当前帧间编码帧的编码相关联的操作集合,以确定用于实现操作的计算资源。 如果计算资源超过计算预算,则减少操作的复杂度,直到相关的计算资源小于或等于计算预算。 此时,使用操作和计算预算对当前帧间编码帧进行编码。 对于视频数据的剩余帧间编码帧重复该过程。
    • 7. 发明申请
    • Computation Scheduling and Allocation for Visual Communication
    • 视觉通信的计算调度和分配
    • US20080013628A1
    • 2008-01-17
    • US11457705
    • 2006-07-14
    • Yan LuFeng WuWei PuShipeng Li
    • Yan LuFeng WuWei PuShipeng Li
    • H04N7/12
    • H04N19/567H04N19/127H04N19/156H04N19/172H04N19/19H04N19/196H04N19/43H04N19/533H04N19/557
    • Computation scheduling and allocation for visual communication is described. In one aspect, multiple frames of video data are encoded by allocating for at least a subset of inter-coded frames, on frame-by-frame basis, computational resources to encode the inter-coded frame. To this end, a computational budget to encode a current inter-coded frame is estimated. The estimate is based on the actual computational costs to encode a previous inter-coded frame of video data. Next, sets of operations associated with encoding the current inter-coded frame are analyzed to determine computational resources to implement the operations. If the computational resources exceed the computational budget, complexity of the operations is reduced until the associated computational resources are less than or equal to the computational budget. At this point, the current inter-coded frame is encoded using the operations and the computational budget. This process is repeated for the remaining inter-coded frames of video data.
    • 描述视觉通信的计算调度和分配。 在一个方面,通过在逐帧的基础上为帧间编码帧的至少一个子集分配计算资源来编码帧间编码帧来编码多个视频数据帧。 为此,估计用于编码当前帧间编码帧的计算预算。 该估计是基于对先前的视频数据的帧间编码帧进行编码的实际计算成本。 接下来,分析与当前帧间编码帧的编码相关联的操作集合,以确定用于实现操作的计算资源。 如果计算资源超过计算预算,则减少操作的复杂度,直到相关的计算资源小于或等于计算预算。 此时,使用操作和计算预算对当前帧间编码帧进行编码。 对于视频数据的剩余帧间编码帧重复该过程。