首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   43篇
  国内免费   3篇
  完全免费   33篇
工业技术   79篇
  2017年   3篇
  2016年   2篇
  2015年   3篇
  2014年   9篇
  2013年   8篇
  2012年   12篇
  2011年   6篇
  2010年   4篇
  2009年   12篇
  2008年   7篇
  2007年   3篇
  2005年   3篇
  2003年   4篇
  2002年   3篇
排序方式: 共有79条查询结果,搜索用时 31 毫秒
1.
慕建君  杨莉  王新梅 《电子学报》2003,31(7):1066-1069
 本文对低密度纠删码的度分布序列进行了研究,提出了低密度纠删码度分布序列可达信道容量的充分必要条件,给出了Heavy-Tail/Poisson和右边正则的两种度分布序列的性质,证明了低密度纠删码达信道容量度分布序列的一个分析性质.这些分析性质对低密纠删码达信道容量度分布序列的设计有着重要的理论指导意义.  相似文献   
2.
低密度纠删码稳定收敛条件的证明   总被引:4,自引:1,他引:3       下载免费PDF全文
 基于数学分析中著名的不动点原理,对于低密度纠删码本文证明了其删除错误译码算法稳定收敛的一充分条件.而且指出此条件优于现有的稳定收敛条件.最后对给定的度分布对证明了此译码算法能成功译码时可接受的最大损失δ的几个上界.  相似文献   
3.
结合CDN和P2P两种不同网络结构的优点,改善传统内容分布网络的拓扑结构,给出了一种基于无比率限制纠错编码实现的P2P内容分布网络设计。介绍了该内容分布网络的系统结构及相关关键技术等方面内容,以及这种新内容分布网络的特性。  相似文献   
4.
关于纠删码的研究与进展   总被引:3,自引:1,他引:2       下载免费PDF全文
该文简述了几类纠删码的纠删原理,系统地综合分析了各类纠删码的优缺点及其相互区别与联系。证明了若选取MDS(Maximal Distace Separable)码作为纠删码,只要接收者接收到源数据具数的数据,就能恢复原来的源数据。分析结果表明:复损码以及旋风(Tornado)码不仅能以线性时间可编码和可成功地译码,而且能以任意接近删除信道容量的速率进行传输。最后指出了目前复损码的研究中需要解决的一些问题。这些分析和结论为进一步研究纠删码提供了理论基础和新的思路。  相似文献   
5.
纠错码拜占庭容错Quorum中错误检测机制   总被引:3,自引:0,他引:3       下载免费PDF全文
摘要在大规模存储系统中,拜占庭存储节点的容错显得越来越重要。传统拜占庭Quorum通过复制可以容忍拜占庭失效,但是它们有两个主要缺点:低的存储空间利用率和静态quorum参数。我们提出纠错码拜占庭容错Quorum(Erasure-code Byzantine Fault-tolerance Quorum, E-BFQ),E-BFQ采用纠错码作为冗余策略,可以提供高可靠性,同时比复制占用更少存储空间。通过客户端读/写操作和管理器诊断操作,E-BFQ可以检测拜占庭节点,动态调整系统规模和故障闽值。结果显示本文方法可以达到动态调整的目的。  相似文献   
6.
机上载荷获取的视频图像数据经压缩后在误码率为1×10-5的无线通信链路中传输时极易受到干扰,从而使得地面终端无法正常解码显示。本文通过分析无人机测控下行链路数据传输误码模型,设计了一种高效的纠删编码技术以提高压缩后码流的抗误码性能。该算法首先将编码后的数据按照一定数量的字节数进行分帧,对分帧后的数据按列进行改进后的快速范德蒙纠删编码;然后对编码后的数据再按帧格式进行快速循环冗余校验(CRC)编码;最后将编码后的码流送入信道传输。仿真结果表明,该纠删编码抗误码技术能够将误码率为1×10-5信道降低到1×10-8左右,可以使得经过高压缩比后的视频码流正确解码显示。此外设计时使用的纠删编解码技术运算量低、延迟小、非常易于硬件实现。提出的高效纠删编码技术已成功应用于多项无人机测控系统。  相似文献   
7.
柳 青  冯 丹  李 白 《通信学报》2014,(4):166-173
摘 要:Ustor是一个构建在多个商业云存储服务之上的云存储系统,它旨在保证数据可靠性的同时减少单点失效时占用的修复带宽。不同于将所有数据存储在单个云中,Ustor将数据编码后分布在多个云存储系统中保证可靠性。Ustor的编码模块部署了包括Reed-Solomon码和功能性修复再生码(FRC)在内的多种纠删码,是第一个将功能性修复再生码应用于多个异构的、真实的云存储系统中的应用。与传统的冗余编码比较,FRC显著地减少了单个云存储发生数据丢失时需要从网络上传输的数据量。实验表明:与不编码比较,冗余编码给系统增加了5%~10%的响应时间开销,但可保障节点失效;FRC码编、解码和修复速度与Reed-Solomon码基本相当,256 MB大小文件编码时间差距在0.5 s以内;FRC码修复时与传统的Reed-Solomon码相比减少了25%以上需要下载的数据量。  相似文献   
8.
In this paper, we propose a novel decentralized resource maintenance strategy for peer-to-peer (P2P) distributed storage networks. Our strategy relies on the Wuala overlay network architecture, (The WUALA Project). While the latter is based, for the resource distribution among peers, on the use of erasure codes, e.g., Reed–Solomon codes, here we investigate the system behavior when a simple randomized network coding strategy is applied. We propose to replace the Wuala regular and centralized strategy for resource maintenance with a decentralized strategy, where users regenerate new fragments sporadically, namely every time a resource is retrieved. Both strategies are analyzed, analytically and through simulations, in the presence of either erasure and network coding. It will be shown that the novel sporadic maintenance strategy, when used with randomized network coding, leads to a fully decentralized solution with management complexity much lower than common centralized solutions.  相似文献   
9.
To reduce the time required to complete the regeneration process of erasure codes, we propose a Tree-structured Parallel Regeneration (TPR) scheme for multiple data losses in distributed storage systems. Under the scheme, two algorithms are proposed for the construction of multiple regeneration trees, namely the edge-disjoint algorithm and edge- sharing algorithm. The edge-disjoint algorithm constructs multiple independent trees, and is simple and appropriate for environments where newcomers and their providers are dis-tributed over a large area and have few inter-sections. The edge-sharing algorithm constructs multiple trees that compete to utilize the bandwidth, and make a better utilization of the bandwidth, although it needs to measure the available bandwidth and deal with the bandwidth changes; it is therefore difficult to implement in practical systems. The parallel regeneration for multiple data losses of TPR primarily includes two op-timizations: firstly, transferring the data thr-ough the bandwidth optimized-paths in a pipeline manner; secondly, executing data regeneration over multiple trees in parallel. To evaluate the proposal, we implement an event- based simulator and make a detailed comparison with some popular regeneration methods. The quantitative comparison results show that the use of TPR employing either the edge-disjoint algorithm or edge-sharing algorithm reduces the regeneration time significantly.  相似文献   
10.
Congestion is one of the most important challenges in optical networks. In a Passive Optical Network (PON), the Optical Line Terminal (OLT) is a bottleneck and congestion prone. In this paper, a framework is proposed with Forward Error Correction (FEC) at the IP layer combined with Weighted Round Robin (WRR) at the scheduling level to overcome packet-loss due to congestion in the OLT in order to achieve efficient video multicasting over PON. In the FEC scheme, Reed-Solomon (RS(n,k)) with erasure coding is used, where (nk) erroneous symbols per n symbol blocks can be corrected. In our framework, an Internet Protocol TeleVision (IPTV) service provider uses the mentioned RS coding and generates redundant packets from regular IPTV packets in such a way that an Optical Network Unit (ONU) can recover lost packets from received packets, thus resulting in a better video quality. Simulation results show that using the proposed framework, an ONU can recover many lost packets and achieve better video quality under different traffic loads for its users. For instance, the proposed method can reduce packet loss rate by almost 55% and 10% under traffic load 0.9, respectively, compared with the Round Robin (RR) and WRR methods under symmetric traffic load. When High Receivers Queue (HRQ) traffic (i.e., traffic received by many users) is twice Low Receivers Queue (LRQ) traffic (i.e., traffic received by a small number of users), this reduction is almost 86% and 30% under traffic load 0.9. Finally, when LRQ traffic is twice HRQ traffic, the reduction in packet loss rate is almost 70% and 91% at traffic load 0.5.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号