-
公开(公告)号：US10169512B2
公开(公告)日：2019-01-01
申请号：US16033856
申请日：2018-07-12
发明人： Aiman Helmi El-Maleh
摘要： A method and system for optimizing state assignments for a finite state machine. The method generates a random initial state assignment for each of a plurality of states of the finite state machine, determines an initial cost associated with the random initial state assignments, identifies a code swap to explore as a function of a code swap probability. Further, the method calculates a cost for the code swap when one or more criteria is satisfied, updates the code swap probability as a function of the cost of the code swap and a best cost, performs the code swap when the cost of the swap is smaller than the best cost and/or a current cost to optimize the state assignments, and outputs optimized state assignments.
-
公开(公告)号：US08640063B1
公开(公告)日：2014-01-28
申请号：US13732241
申请日：2012-12-31
IPC分类号： G06F17/50
CPC分类号： G06F17/505 , G06F2217/70
摘要： The method for synthesizing soft error tolerant combinational circuits includes the step of inputting a combinational circuit to a combinational circuit analyzer for analysis. The analyzer then extracts smaller sub-circuits from said combinational circuit, computes probabilities of input vectors to occur for each of the smaller sub-circuits, produces new multi-level sub-circuits from the extracted sub-circuit, and maximizes logical fault masking against the occurrence of a single fault applied to the new multi-level sub-circuits, the maximizing being based on probabilities of sub-circuit input vectors to occur. Finally, the analyzer merges the new multi-level sub-circuits back to the original inputted combinational circuit.
摘要翻译： 用于合成软错误容错组合电路的方法包括将组合电路输入到组合电路分析器进行分析的步骤。 分析仪然后从所述组合电路中提取较小的子电路，计算出每个较小子电路的输入向量的概率，从提取的子电路产生新的多电平子电路，并使逻辑故障屏蔽最大化 发生单个故障应用于新的多电平子电路，最大化是基于发生的子电路输入向量的概率。 最后，分析仪将新的多电平子电路合并回原始输入的组合电路。
-
公开(公告)号：US10162923B2
公开(公告)日：2018-12-25
申请号：US16033824
申请日：2018-07-12
发明人： Aiman Helmi El-Maleh
摘要： A method and system for optimizing state assignments for a finite state machine. The method generates a random initial state assignment for each of a plurality of states of the finite state machine, determines an initial cost associated with the random initial state assignments, identifies a code swap to explore as a function of a code swap probability. Further, the method calculates a cost for the code swap when one or more criteria is satisfied, updates the code swap probability as a function of the cost of the code swap and a best cost, performs the code swap when the cost of the swap is smaller than the best cost and/or a current cost to optimize the state assignments, and outputs optimized state assignments.
-
公开(公告)号：US20180336294A1
公开(公告)日：2018-11-22
申请号：US16033824
申请日：2018-07-12
发明人： Aiman Helmi El-Maleh
IPC分类号： G06F17/50
CPC分类号： G06F17/505 , G06F17/5045 , G06F2217/78 , G06F2217/84
摘要： A method and system for optimizing state assignments for a finite state machine. The method generates a random initial state assignment for each of a plurality of states of the finite state machine, determines an initial cost associated with the random initial state assignments, identifies a code swap to explore as a function of a code swap probability. Further, the method calculates a cost for the code swap when one or more criteria is satisfied, updates the code swap probability as a function of the cost of the code swap and a best cost, performs the code swap when the cost of the swap is smaller than the best cost and/or a current cost to optimize the state assignments, and outputs optimized state assignments.
-
公开(公告)号：US10042965B2
公开(公告)日：2018-08-07
申请号：US15216302
申请日：2016-07-21
发明人： Aiman Helmi El-Maleh
摘要： A method and system for optimizing state assignments for a finite state machine. The method generates a random initial state assignment for each of a plurality of states of the finite state machine, determines an initial cost associated with the random initial state assignments, identifies a code swap to explore as a function of a code swap probability. Further, the method calculates a cost for the code swap when one or more criteria is satisfied, updates the code swap probability as a function of the cost of the code swap and a best cost, performs the code swap when the cost of the swap is smaller than the best cost and/or a current cost to optimize the state assignments, and outputs optimized state assignments.
-
公开(公告)号：US10013296B2
公开(公告)日：2018-07-03
申请号：US15015654
申请日：2016-02-04
IPC分类号： G06F11/07 , G01R31/3177 , G01R31/3181 , G01R31/3183 , G06F17/50
CPC分类号： G06F11/076 , G01R31/3177 , G01R31/31816 , G01R31/318321 , G06F11/079 , G06F11/0793 , G06F11/16 , G06F17/5045 , G06F17/5068
摘要： Described herein is a method implemented by circuitry for providing fault tolerance in a combinational circuit. The circuitry identifies sensitive gates of the circuit that require protection from at least one of a first type of fault and a second type of fault. Further, circuitry computes for each first type of transistor included in the sensitive gate, a first failure probability, and for each second type of transistor included in the sensitive gate, a second failure probability. The circuitry calculates a first parameter corresponding to a number of the first type of transistors for which the computed first failure probabilities exceed a first predetermined threshold and a second parameter corresponding to a number of second type of transistors for which the computed second failure probabilities exceed a second predetermined threshold to determine a protection type based on an area overhead constraint.
-
公开(公告)号：US20180336295A1
公开(公告)日：2018-11-22
申请号：US16033856
申请日：2018-07-12
发明人： Aiman Helmi El-Maleh
IPC分类号： G06F17/50
CPC分类号： G06F17/505 , G06F17/5045 , G06F2217/78 , G06F2217/84
摘要： A method and system for optimizing state assignments for a finite state machine. The method generates a random initial state assignment for each of a plurality of states of the finite state machine, determines an initial cost associated with the random initial state assignments, identifies a code swap to explore as a function of a code swap probability. Further, the method calculates a cost for the code swap when one or more criteria is satisfied, updates the code swap probability as a function of the cost of the code swap and a best cost, performs the code swap when the cost of the swap is smaller than the best cost and/or a current cost to optimize the state assignments, and outputs optimized state assignments.
-
8.发明授权Generalized modular redundancy fault tolerance method for combinational circuits 有权用于组合电路的广义模块化冗余容错方法公开(公告)号：US09075111B2
公开(公告)日：2015-07-07
申请号：US14047869
申请日：2013-10-07
IPC分类号： G01R31/28 , G01R31/3177 , G01R31/3183
CPC分类号： G01R31/3177 , G01R31/31835 , H03K19/00392 , H03K19/23
摘要： A fault tolerance method for combinational circuits is provided. In order to increase reliability of combinational circuits, extra redundant modules are added to the circuit logic. The method further utilizes redundancy techniques to improve soft error reliability, and is based on probability of occurrence for combinations at the outputs of circuits, thus enhancing the reliability of the combinational circuits.
摘要翻译： 提供了组合电路的容错方法。 为了提高组合电路的可靠性，额外的冗余模块被添加到电路逻辑中。 该方法进一步利用冗余技术来提高软错误可靠性，并且基于电路输出处的组合出现概率，从而提高组合电路的可靠性。
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.02 秒)
