摘要
针对二进制范德蒙码的编码存储与译码重构过程,提出了一种降低相关编译码过程计算量的优化方法。该方法根据二进制编译码矩阵行向量中"1"的分布以及各向量之间"1"的相互位置关系,最终确定出二进制编译码矩阵所对应的各个校验块的计算次序,从而实现降低整个编码过程或译码过程计算量的目的。实验表明,该方法可以降低30%左右的相关计算量,同时,该优化方法可以推广应用到其他二进制编码存储系统中。
An optimization method was described to reduce the exclusive-or operations of the binary Vandermonde code. The encoding and decoding operation of the binary Vandermonde code was the bitwise exclusive-or. According to the distribution of the ones in the binary matrix and the relationship between the vectors,the calculation sequence of the parity chunk was determined ultimately. The test showed that the method can reduce the exclusive-or operations significantly by about 30%. Meanwhile,the method can be extended to other exclusive-or based storage systems.
出处
《四川大学学报（工程科学版）》
EI
CAS
CSCD
北大核心
2015年第4期142-149,共8页
Journal of Sichuan University (Engineering Science Edition)
基金
国家自然科学基金资助项目(61103206)
国家重点基础研究发展规划基金资助项目(2011CB302400)
中国科学院西部之光人才项目资助(Y5C2021100)
关键词
二进制
数据存储
范德蒙码
异或运算
binary
data storage
Vandermonde code
exclusive-or operations
