会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Peaky binning relaying scheme for wideband/low signal-to-noise ratio (SNR) wireless communications
    • 用于宽带/低信噪比(SNR)无线通信的峰值合并中继方案
    • US08891593B1
    • 2014-11-18
    • US13226221
    • 2011-09-06
    • Nadia FawazMuriel Medard
    • Nadia FawazMuriel Medard
    • H04B7/15H04L25/20
    • H04B1/7163H04B7/15592
    • A method, apparatus and computer program product for a peaky binning Relaying Scheme for Wideband/Low Signal-To-Noise Ratio (SNR) Wireless Communications is presented. In a computer system having a source node (S), a relay node (R) and a destination node (D), the method includes transmitting by S a message (m), wherein a first subset of m (m1) is transmitted to R and wherein a second subset of m (m2) is transmitted to D. The method further includes decoding by R a bin index from the m1 and forwarding the bin index to D. Additionally the method includes receiving the bin index at D and decoding the bin index and receiving at D the m2 and decoding the m2. The method also includes determining by D the value of m from decoded values of the bin index and the m2.
    • 提出了一种用于宽带/低信噪比(SNR)无线通信的峰值合并中继方案的方法,装置和计算机程序产品。 在具有源节点(S),中继节点(R)和目的地节点(D)的计算机系统中,该方法包括由S发送消息(m),其中m(m1)的第一子集被发送到 R,并且其中m(m2)的第二子集被发送到D.该方法还包括通过R从m1解码bin索引并将bin索引转发到D.另外该方法包括在D处接收bin索引并对 bin索引并在D处接收m2并解码m2。 该方法还包括根据二进制索引和m2的解码值确定D的值。
    • 9. 发明授权
    • Random linear network coding for time division duplexing
    • 用于时分双工的随机线性网络编码
    • US08279781B2
    • 2012-10-02
    • US12549725
    • 2009-08-28
    • Daniel E. LucaniMilica StojanovicMuriel Medard
    • Daniel E. LucaniMilica StojanovicMuriel Medard
    • H04B1/56H04L5/16H04L12/66
    • H04L1/1671H04L1/0041H04L1/0052H04L2001/0097
    • A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receiver to acknowledge (ACK) the number of degrees of freedom, if any, that are required to decode correctly the information. Provided herein is an analysis of this problem to show that there is an optimal number of coded data packets, in terms of mean completion time, to be sent before stopping to listen. This number depends on the latency, probabilities of packet erasure and ACK erasure, and the number of degrees of freedom that the receiver requires to decode the data. This scheme is optimal in terms of the mean time to complete the transmission of a fixed number of data packets. It is shown that its performance is very close to that of a full-duplex system, while transmitting a different number of coded packets can cause large degradation in performance, especially if latency is high. Also described herein is the throughput performance of the novel system and technique along with a comparison to existing half-duplex Go-back-N and Selective Repeat ARQ schemes. Numerical results, obtained for different latencies, show that the novel system and technique described herein has similar performance to the Selective Repeat in most cases and considerable performance gain when latency and packet error probability is high.
    • 提出了一种用于时分双工通道的可靠通信的新的随机线性网络编码方案。 该设置假定分组擦除信道,并且节点不能同时发送和接收信息。 发送方在停止之前背靠背传送编码数据包,等待接收方确认(ACK)正确解码信息所需的自由度数(ACK)。 这里提供了对该问题的分析,以示出在平均完成时间之前,在停止监听之前发送最佳数量的编码数据分组。 该数量取决于延迟,分组擦除和ACK擦除的概率,以及接收机对数据进行解码所需的自由度的数量。 该方案在完成固定数量数据包的传输的平均时间方面是最佳的。 显示其性能非常接近于全双工系统,而传输不同数量的编码数据包可能会导致性能下降,特别是在延迟较高的情况下。 这里还描述了新颖的系统和技术的吞吐量性能以及与现有的半双工Go-back-N和选择性重复ARQ方案的比较。 对于不同的延迟获得的数值结果表明,在大多数情况下,本文描述的新颖系统和技术具有与选择性重复相似的性能,并且当等待时间和分组错误概率高时具有相当的性能增益。