线性反馈信号寄存器混叠概率的迭代计算方法

[1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers Pub Date : 1988-06-27 DOI:10.1109/FTCS.1988.5299

A. Ivanov, V. Agarwal

{"title":"线性反馈信号寄存器混叠概率的迭代计算方法","authors":"A. Ivanov, V. Agarwal","doi":"10.1109/FTCS.1988.5299","DOIUrl":null,"url":null,"abstract":"An iterative technique for computing the exact probability of aliasing for any linear feedback signature register (i.e. characterized by any feedback polynomial, for any constant probability of error, and for any test length) is proposed. The technique is also applicable to a more general model of the aliasing problem wherein the probability of error may vary with each output bit. The complexity of the technique enables registers of lengths of interest in practice, e.g. 16, to be analyzed readily.<<ETX>>","PeriodicalId":171148,"journal":{"name":"[1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"An iterative technique for calculating aliasing probability of linear feedback signature registers\",\"authors\":\"A. Ivanov, V. Agarwal\",\"doi\":\"10.1109/FTCS.1988.5299\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An iterative technique for computing the exact probability of aliasing for any linear feedback signature register (i.e. characterized by any feedback polynomial, for any constant probability of error, and for any test length) is proposed. The technique is also applicable to a more general model of the aliasing problem wherein the probability of error may vary with each output bit. The complexity of the technique enables registers of lengths of interest in practice, e.g. 16, to be analyzed readily.<<ETX>>\",\"PeriodicalId\":171148,\"journal\":{\"name\":\"[1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTCS.1988.5299\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTCS.1988.5299","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 45

摘要

提出了一种迭代技术，用于计算任何线性反馈签名寄存器的精确混叠概率(即以任何反馈多项式为特征，对于任何恒定的误差概率，以及对于任何测试长度)。该技术也适用于混叠问题的更一般的模型，其中错误的概率可能随每个输出位而变化。该技术的复杂性使得在实践中感兴趣的长度寄存器(例如16)可以很容易地进行分析。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An iterative technique for calculating aliasing probability of linear feedback signature registers

An iterative technique for computing the exact probability of aliasing for any linear feedback signature register (i.e. characterized by any feedback polynomial, for any constant probability of error, and for any test length) is proposed. The technique is also applicable to a more general model of the aliasing problem wherein the probability of error may vary with each output bit. The complexity of the technique enables registers of lengths of interest in practice, e.g. 16, to be analyzed readily.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers

自引率

0.00%

发文量