检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学计算机科学与工程学院,南京210096
出 处:《计算机研究与发展》2009年第2期321-328,共8页Journal of Computer Research and Development
基 金:国家自然科学基金项目(60572071);江苏省自然科学基金项目(BK2007104);东南大学优秀博士论文基金项目(YBJJ0820)~~
摘 要:确保可逆电路的正确性与可靠性,错误检测必不可少,错误定位难度更高.通过分析发现当可逆电路中规模为k的可逆门发生控制点失效时仅对2n-k个输入向量的输出产生影响,据此给出了一种把当前错误集分成若干个子集的方法生成控制点失效错误定位树.传统的错误定位方法都是通过生成真值表和错误表来产生错误定位树;该方法不需要生成和存储真值表以及错误表就能够有效定位电路中控制点失效错误.与Rfault算法相比,空间复杂度和时间复杂度更小,算法效率更高,能应用于更大规模的电路.Reversible circuit is the basis of quantum computation, low-power COMS, and nanotechnology. To ensure the validity and liability of the reversible circuits, fault detection and fault localization are necessary. And fault localization is more difficult than fault detection. Discussed in this paper is broken control faults (BCFs) localization in reversible circuits. By analyzing the influence of BCFs on the outputs of reversible circuit, it is found that the broken control fault of a gate with size k just changes the outputs of 2n-k inputs of the reversible circuit. According to this, the authors presents a method to construct fault localization tree to locate BCFs, which divides the current fault set into several subsets and constructs the sub fault localization tree for each subset recurrently. The method doesn't need any truth table and fault table when constructing the fault localization tree which are necessary for the traditional fault localization method. The height of the fault location tree (FLT) is short and can be used to locate BCFs efficiently. It has less time and space complexity than the BCFs localization methods called Rfault, so it can be applied to larger circuits. This method can also be applied to locate other kinds of fault models, such as missing gate fault.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.40