排序方式: 共有13条查询结果,搜索用时 31 毫秒
1.
用VB实现大数据块CRC校验码算法 总被引:2,自引:0,他引:2
针对通信系统的差错控制问题,根据CRC校验理论,提出了一种大数据块CRC校验码的 VB程序算法,实现了通信过程中大数据块 CRC校验码的计算问题. 相似文献
2.
差错控制编码技术应用研究 总被引:2,自引:0,他引:2
在某型号数据链传输过程中,应用适当的差错控制编译技术在编译软件算法中显得尤为重要。文章首先简要论述了差错控制编码技术的概念,并结合在数据链传输中的应用,介绍了一种比较经典的编码方法——汉明码的编码原理,讨论了目前该算法存在的不足,提出一种改进意见。 相似文献
3.
采用扩展汉明码,实现了对汉明码纠、检错功能的扩展,使其功能扩展至一位纠错、两位检错。并且利用Verilog硬件语言对该编、解码方法进行了程序设计及仿真,最后下载至FPGA实现。结果证明,这种扩展汉明码的编、解码方法在不显著增加硬件资源的基础上,提高了传输数据的可靠性,具有非常现实的意义。 相似文献
4.
l.INTRODUCTIONAhybridsprcad-spectrummodeofdirectseque11ce(DS)andslowlYequencyhopping(SFH)isattractivebecauseitcombinesadvantages0fdirectsequeIlceandtYcquc11cyhopl1edspreadspectrumsystem,lnea11``hileav0idillgsomeol'theirdisadvantagcs.I:orexamplc,h\)bridsystemsc()lnbi11ea11ti-Inultipathetltctlvel1css()fDSsystemwiththegoodanti-partialbdlldJdlmningalldthegoodanti-near/farproble1nsofFHs},stem.M0reover,hybridsystemsn1ayalsouseshoftersigllaturesequencesandhoppingpattem,thusreducingtheovcral… 相似文献
5.
Turbo码中交织器误比特率的分布分析方法 总被引:1,自引:0,他引:1
由于误比特率分布更能深刻细致地描述纠错码的纠错能力,因此,采用误比特率分布的方法,对Turbo码中3GPP交织器、分组交织器和随机交织器在不同码率下的性能进行了比较和分析.仿真结果显示,分组交织器的误比特率分布具有明显的周期特征;随机交织器的误比特率分布的随机特性更为明显,误码率分布比分组交织器分布的更为广泛;而对于3gpp交织器,它的误比特率分布具有较为平坦的分布曲线和较低的平均误比特率. 相似文献
6.
J.J. Stiffler 《Journal of Electronic Testing》1998,12(1-2):21-27
Sequoia's fault-tolerant computers were designed subject to some rather rigid constraints: No single hardware malfunction can generate an undetected error; an integrated circuit is a black box that can fail in arbitrary ways, affecting an arbitrary subset of input and output signals; faults can be transient or intermittent with arbitrary durations and repetition intervals. Moreover, the incremental hardware to be used to achieve these goals was to be kept to a minimum. The resulting computers do, to a very large extent, satisfy these constraints. To achieve this, a combination of fault-monitoring techniques was used, including: Bit and nibble error-correcting and error-detecting codes; byte parity codes with orthogonal partitioning; cyclic-residue codes on I/O data transfers; codes designed to protect against address counter overruns on I/O transfers; lossless control-signal compactors. The nature and rationale for these various fault monitors is described as well as the analytical and testing techniques used to estimate the resulting coverage. 相似文献
7.
8.
信用是光纤通道节点在注册过程中配置的重要服务参数,其大小直接决定两节点的通信性能.详细分析了光纤通道基于信用的两种流控机制与实现算法,建立了流量控制与差错控制技术的分析模型,基于有差错、无差错带确认这两种情况,分别导出了链路吞吐量与信用值、带宽、单帧出错概率、通信距离等的关系.最后给出了光纤通道网络在航空航天近距离应用场景下的最优信用的取值及序列划分的建议.Abstract: As an importance service parameter of login between two communication nodes, credit will have a great influence on the communication performance. Particularly analyzed is two flow-control mechanisms of fiber channel and its implementation algorithm and models of flow-control and error-control. The relationships between link throughput and credit, bandwidth, single frame error probability, communication distance are derived and formally proved. Finally, for near scenes of aerospace vehicle, proposals of best credit and sequence length are put forward. 相似文献
9.
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial applications andd one of the most challenging issues remaining in global illumination research. In order to control the error, we need to estimate the accuracy of the calculation while computing the energy exchanged between two objects. Having this information for each radiosity interaction allows to allocate more resources to refine interactions with greater potential error, and to avoid spending more time to refine interactions already represented with sufficient accuracy. Until now, the accuracy of the computed energy exchange could only be approximated using heuristic algorithms. This paper presents the first exhaustive algorithm to compute fully reliable upper and lower bounds on the energy being exchanged in each interaction. This is accomplished by computing first and second derivatives of the radiosity function where appropriate, and making use of two concavity conjectures. These bounds are then used in a refinement criterion for hierarchical radiosity, resulting in a global illumination algorithm with complete control of the error incurred. Results are presented, demonstrating the possibility to create radiosity solutions with guaranteed precision. We then extend our algorithm to consider linear bounding functions instead of constant functions, thus creating simpler meshes in regions where the function is concave, without loss of precision. Our experiments show that the computation of radiosity derivatives along with the radiosity values only requires a modest extra cost, with the advantage of a much greater precision. 相似文献
10.