基于不相交锐积运算的逻辑函数错误率计算
PDF下载 (340)应秋红,王伦耀,储著飞,夏银水.基于不相交锐积运算的逻辑函数错误率计算[J].宁波大学学报(理工版),2020,33(2):35-40.DOI:
YING Qiuhong,WANG Lunyao,CHU Zhufei,XIA Yinshui.Error rate calculation of logic functions using disjoint sharp product operation[J].Journal of Ningbo University(Natural Science & Engineering Edition),2020,33(2):35-40.DOI:
| Title: | Error rate calculation of logic functions using disjoint sharp product operation |
| 作者: | 应秋红, 王伦耀, 储著飞, 夏银水 |
| Author(s): | YING Qiuhong, WANG Lunyao, CHU Zhufei, XIA Yinshui |
| 关键词: | 近似计算; 错误率计算; 逻辑优化 |
| Keywords: | approximate computing; error rate calculating; logic optimization |
| 分类号: | TN79+1 |
| 文献标识码: | A |
| 摘要: | 提出了一种通过比较逻辑覆盖差异的函数错误率计算方法, 该方法主要包括逻辑覆盖不相交锐积运算和双锐积运算, 分别用于实现2个逻辑覆盖之间不相交操作和公共部分删除操作, 进而实现TB逻辑函数之间或RM逻辑函数之间覆盖差异的提取. 通过对所提取覆盖包含的最小项数量统计, 实现函数错误率的计算. 所提出的方法用C语言实现, 并用MCNC测试电路进行测试. 实验结果表明, 该算法可以实现TB函数和RM函数的错误率计算, 且具有运算速度快, 适合处理大逻辑函数的特点. |
| Abstract: | In this paper an error rate calculation algorithm for two logic functions is proposed by comparing the differences between their logical covers. The algorithm mainly includes the disjoint sharp product operation and the double sharp product operation of logical covers, which are employed for the two covers disjointed operation and the common part deletion respectively. Using the proposed algorithm, the difference of the logical covers between two TB logic functions, or RM logic functions, are extracted and the error rate can be obtained by calculating the number of minterms in the extracted cover. The proposed algorithm is implemented in C and tested under MCNC benchmarks. The experimental results show that the proposed algorithm can carry out the error rate calculation for both TB functions and RM functions. Furthermore, it runs faster and is more efficient for large functions. |
| 参考文献 /References: | [1] Venkataramani S, Chakradhar S T, Roy K, et al. Computing approximately, and efficiently[EB/OL]. [2019-01-20]. https://ieeexplore.ieee.org/document/7092486. [2] Han J. Introduction to approximate computing[EB/OL]. [2019-01-20]. https://ieeexplore.ieee.org/document/7477305/metrics#metrics. [3] Jung M, Mathew D M, Weis C, et al. Approximate computing with partially unreliable dynamic random access memory-approximate DRAM[EB/OL]. [2019-01-20]. https:// dl.acm.org/citation.cfm?id=2905002. [4] Wu Y, Shen C, Jia Y, et al. Approximate logic synthesis for FPGA by wire removal and local function change [EB/OL]. [2019-01-20]. https://ieeexplore.ieee.org/document/ 7858314. [5] Sen S, Raghunathan A. Approximate computing for long short term memory (LSTM) neural networks[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2018, 37(11):2266-2276. [6] Nguyen D T, Kim H, Lee H. An approximate memory architecture for a reduction of refresh power consumption in deep learning applications[EB/OL]. [2019-01-20]. https:// www.researchgate.net/publication/324956616_An_Approximate_Memory_Architecture_for_a_Reduction_of_Refresh_Power_Consumption_in_Deep_Learning_Applications. [7] Muhammad S, Rehan H, Semeen R, et al. Cross-layer approximate computing: From logic to architectures[EB/OL]. [2019-01-20]. https://www.researchgate.net/publication/303542746_Invited_Cross-layer_approximate_Com-puting_from_logic_to_architectures. [8] Liang J H, Han J, Lombardi F. New metrics for the reliability of approximate and probabilistic adders[J]. IEEE Transactions on Computers, 2013, 62(9):1760-1771. [9] Han J, Orshansky M. Approximate computing: An emerging paradigm for energy-efficient design[EB/OL]. [2019-01-20]. https://ieeexplore.ieee.org/document/6569370. [10] Miao J, Gerstlauer A, Orshansky M. Approximate logic synthesis under general error magnitude and frequency constraints[EB/OL]. [2019-01-20]. https://ieeexplore.ieee.org/document/6691202. [11] Su S, Zou C, Kong W, et al. A novel heuristic search method for two-level approximate logic synthesis[EB/ OL]. [2019-01-20]. https://ieeexplore.ieee.org/document/8599060. [12] Ichihara H, Inaoka T, Iwagaki T, et al. Logic simplification by minterm complement for error tolerant application[EB/OL]. [2019-01-20]. https://ieeexplore.ieee. org/document/7357089. [13] 薛宏熙, 边计年. 数字系统设计自动化[M]. 北京: 清华大学出版社, 1996:214-216. [14] 王伦耀, 夏银水, 陈偕雄. 基于多数覆盖的二级 MPRM函数逻辑优化[J]. 电子与信息学报, 2012, 34(4): 986-991. [15] Shin D, Gupta S K. Approximate logic synthesis for error tolerant applications[EB/OL]. [2019-01-20]. https:// ieeexplore.ieee.org/document/5456913. |
| 备注/Memo: | 收稿日期: 2019－04－17. 宁波大学学报（理工版）网址: http://journallg.nbu.edu.cn/ 基金项目: 国家自然科学基金（61471211）; 浙江省自然科学基金（LY19F040004）; 宁波市自然科学基金（2019A610077）.? 第一作者: 应秋红（1994－）, 女, 浙江台州人, 在读硕士研究生, 主要研究方向: 逻辑综合与优化. E-mail: mint_ying@foxmail.com 宁波大学学报（理工版）网址：http://journallg.nbu.edu.cn/*通信作者: 王伦耀（1972－）, 男, 浙江宁波人, 教授, 主要研究方向: 逻辑综合与优化. E-mail: wanglunyao@nbu.edu.cn |
