锯齿解码在分布式存储及无线通信中的研究

发布时间：2018-06-09 11:54

本文选题：锯齿解码 + 分布式存储　；参考：《深圳大学》2017年硕士论文

【摘要】：锯齿解码(Zigzag Decoding,ZD)是通过重复的回代过程来进行解码的一种解码方式。由于其解码过程在二元域中操作,解码复杂度低而广泛用于分布式存储(Distributed Storage,DS)及无线通信领域。在存储方面,组合性质(Combination Property,CP)是将k个原始数据包编码成n个数据包,其中n?k,在这个n个数据包中,利用任意k个数据包都可以完全恢复所有n个数据包信息。最大距离可分(Maximum Distance Separable,MDS)码满足这种性质,被广泛用于DS中以有效的方式来提供数据可靠性,但是它的解码复杂度十分高。因此,一系列同时具有CP和ZD(CP-ZD)性质的存储编码被设计出,称为CP-ZD码。CP-ZD码具有以下几种特性:在二元域操作,解码复杂度低且有一定的存储开销。构造具有该特性的编码,首先需要将编码包中每个数据包移一定的位数,再将它们逐位二进制相加。在该编码中,用一个移位矩阵来表示每个编码包中数据包移位的位数。设计这样的编码,需要精心构造这个矩阵。本文构造编码的移位矩阵是从一个特殊的三角阵中取出。相关分析表明,在大多情况下,本文设计的编码的存储空间开销小于现有编码。在无线通信方面,传统随机接入(Random Access,RA)协议防碰撞能力较弱,随机线性网络编码(Random linear Network Coding,RLNC)技术可以解决碰撞问题,但计算复杂度较高。由此,本文提出了一种新的RA方案,称为锯齿分散多址接入(Zigzag Division Multiple Access,ZDMA)方案。该方案可使碰撞问题得到很好的改善且可以显著提高系统吞吐量。其核心技术为:允许发送端的多路数据同时传输并且可以在接收端使用ZD解码。基于ZD技术,本文提出了三种RA发送方案。前两种是将ZDMA分别用于时隙ALOHA(Slotted ALOHA,SA)和二叉树分割(Tree Splitting,TS)中,相比传统SA和TS方案的吞吐量有了很大的提升。此外,第三种称为贪心调度锯齿分散多址接入(Greedy Scheduling Zigzag Division Multiple Access,GS-ZDMA)方案,GS-ZDMA方案是这三种方案中系统吞吐量最高的。
[Abstract]:Zigzag Decodinging ZD (Zigzag Decodinging ZD) is a decoding method which is decoded by repeated backgeneration process. Because of its low decoding complexity, it is widely used in distributed storage DSs and wireless communication fields. In the storage aspect, the combinational property (CPB) is to encode k raw data packets into n packets, in which n packets can be completely recovered by using any k data packets. The maximum distance separable MDS (MDS) code is widely used in DS to provide data reliability in an efficient way, but its decoding complexity is very high. Therefore, a series of storage codes with the properties of CP and ZDX CP-ZD are designed, which are called CP-ZD codes. CP-ZD codes have the following characteristics: in binary domain, the decoding complexity is low and there is a certain amount of storage overhead. In order to construct the encoding with this property, we first need to shift the number of bits to each packet in the encoding packet, and then add them bit by bit to binary. In this coding, a shift matrix is used to represent the number of bits of packet shift in each packet. Designing such codes requires careful construction of the matrix. In this paper, the coded shift matrix is extracted from a special triangular matrix. Correlation analysis shows that, in most cases, the storage space overhead of the proposed coding is lower than that of the existing codes. In the aspect of wireless communication, the traditional Random access RAA (Random access RAA) protocol has a weak anti-collision capability. Random linear Network coding (RLNCC) technology can solve the collision problem, but the computational complexity is high. Therefore, a new RA scheme called Zigzag Division multiple access Scheme (ZDMA) is proposed in this paper. This scheme can improve the collision problem and improve the system throughput significantly. The core technology is to allow multiple channels of data to be transmitted at the same time and to use ZD decoding at the receiving end. Based on ZD technology, three RA transmission schemes are proposed in this paper. The former two are used in slotted ALOHAA (slotted ALOHAA) and binary tree partitioning tree (TS) respectively. The throughput of the former two schemes is much higher than that of the traditional SA and TS schemes. In addition, the third scheme, called greedy scheduling Zigzag Division multiple access GS-ZDMA-GS-ZDMA, is the highest throughput of the three schemes.
【学位授予单位】：深圳大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN92

【相似文献】