检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]复旦大学计算机科学技术学院,上海201203 [2]诺基亚西门子通信有限公司,浙江杭州310005
出 处:《通信学报》2012年第6期40-49,共10页Journal on Communications
基 金:上海市重点学科建设项目基金资助项目(B114);AMD大学合作计划基金资助项目~~
摘 要:现有纠删编码由于编解码运算复杂度及编码数据大小的限制,很难适用于面向大容量数据块或数据分组的实时传输中。在奇偶校验码的基础上,结合有限域GF(28)域的特性,提出一种新的面向大容量数据块实时传输的块间4纠删编码方案。该编码方案对一组连续的数据块使用4个冗余数据块,即可容忍任意4个数据块同时差错。编解码运算的复杂度与数据块的大小成线性关系,对数据块的大小没有限制。编码具有MDS性质,在同等冗余条件下达到最佳的纠删能力。理论和实验分析表明:该编码方案最大能够对连续27个数据块进行块间纠删编码。Most of the existing erasure-correcting codes were limited by encoding/decoding complexities and encoded data size.They were not suitable for use in the real-time applications that orient bulk data based on blocks or packages.Therefore,a novel inter-block 4-erasure-correcting coding scheme for real-time bulk data transfer was presented.Based on single parity-check codes incorporated with the features of GF(28) field in finite field,the present coding scheme could tolerate simultaneous failures of four blocks with only four redundancy blocks for a group of continuous data.Meanwhile,its encoding/decoding complexities had linear relationship with respect to the size of data blocks and it supported arbitrary size of data.Furthermore,it was proved to have MDS property,thus achieving optimal erasure-correcting capability with the same redundancy information.Theoretical and experimental analysis showed that the present coding scheme could code with 27 continuous data blocks at most.
关 键 词:纠删编码 大容量数据 奇偶校验码 GF(28)域 MDS
分 类 号:TP333[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28