共查询到17条相似文献,搜索用时 46 毫秒
1.
2.
针对水声通信特点,研究随机线性喷泉码及最大似然译码,在分块数较小的包传输中纠正删除错误。传统的最大似然译码为整包统一处理,译码延迟大。该文提出一种逐行累增的高斯消去方法,将译码过程划分到各块到达时隙中执行,利用二进制分布求和的概率公式对单块到达所需计算量进行分析。在实际水声通信处理平台上进行了验证,满足实时计算需求,可用于水下图像、传感器数据等的传输。 相似文献
3.
4.
5.
基于TCP协议的大部分网络通信都将接收到的数据包当作一个有序序列进行处理.TCP协议的这种有序序列模式限制了其在大量数据传输或将数据分布到大量用户的应用.基于数字喷泉码的数据传输模式不需要有序的数据序列,从而简化了网络中数据的传输方式,使得数字喷泉码成为一类适用于可靠通信的有效编码技术,而具有广阔的应用前景.本文综述了几类典型数字喷泉码的原理及其优缺点;探讨了这几类数字喷泉码的具体应用;指出了数字喷泉码研究中需要解决的一些关键问题.最后,对数字喷泉码的发展前景及研究方向进行展望. 相似文献
6.
Turbo码具有逼近Shannon容量限的优异性能,介绍了应用于深空通信的Turbo码编码方案和相应的译码算法,并给出了采用修正Max-Log-Map译码算法的深空CCSDS标准Turbo码的软件仿真性能和硬件系统实测性能。通过计算机仿真和硬件实测结果表明,采用该修正Max-Log-Map译码算法的Turbo码译码器易于硬件实现,同时Turbo码仿真性能和实际性能一致,适用于实际工程应用。 相似文献
7.
8.
9.
10.
Licklider传输协议(LTP)是深空通信中一个重要协议,但其自动重传(ARQ)机制无法满足传输时延的要求。为了利用喷泉码无需反馈的特点,降低LTP协议传输时延,同时满足LTP协议中红色数据和绿色数据不同可靠性的要求,将具有不等差错保护(UEP)特性的喷泉码引入LTP协议,得到具有不等差错保护特性的LTP(UEP-LTP)。对喷泉码不同的度分配不同的选窗概率,构造一个指数型的选窗概率函数并对该函数进行优化,由此获得性能更优的UEP-LTP(AUEP-LTP)。仿真结果表明,AUEP-LTP的红、绿色数据误码率可分别达到10-10.473 2和10-3.687 8,满足红、绿色数据不同可靠性要求,同时可减少LTP重传,提高协议性能,更适用于深空通信。 相似文献
11.
12.
Binary fountain codes such as Luby transform codes are a class of erasure codes which have demonstrated an asymptotic performance close to the Shannon limit when decoded with the belief propagation algorithm. When these codes are generalized to GF(q) for q > 2, their performance approaches the Shannon limit much faster than the usual binary fountain codes. In this paper, we extend binary fountain codes to GF(q). In particular, we generalize binary Luby transform codes to GF(q) to develop a low complexity maximum likelihood decoder. The proposed codes have numerous advantages, including low coding overhead, low encoding and decoding complexity, and good performance over various message block lengths, making them practical for real‐time applications. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
13.
14.
15.
16.
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. 相似文献