基于近似逻辑的不完全指定FPRM函数的功耗优化
PDF下载 (284)尹浩凯,马雪娇,夏银水*.基于近似逻辑的不完全指定FPRM函数的功耗优化[J].宁波大学学报(理工版),2019,32(3):28-34.DOI:
Yin Hao-kai,Ma Xue-jiao,Xia Yin-shui*.Power optimization of incompletely specified FPRM function based on approximate logic[J].Journal of Ningbo University(Natural Science & Engineering Edition),2019,32(3):28-34.DOI:
| Title: | Power optimization of incompletely specified FPRM function based on approximate logic |
| 作者: | 尹浩凯, 马雪娇, 夏银水* |
| Author(s): | Yin Hao-kai, Ma Xue-jiao, Xia Yin-shui* |
| 关键词: | 近似逻辑; 极性搜索 |
| Keywords: | ISFPRM; GA; approximate logic; polarity search |
| 分类号: | TN47; TP391 |
| 文献标识码: | A |
| 摘要: | 基于精确逻辑的逻辑综合和优化方法已有广泛的研究. 但有时并非需要精确逻辑, 从而可利用这种特性进行关键指标的综合和优化. 本文提出了基于近似逻辑的不完全指定固定极性Reed-Muller (Incompletely Specified Fixed Polarity RM, ISFPRM)逻辑函数的逻辑优化方法. 首先建立基于二级逻辑的功耗估算模型和近似电路的设计效能评估模型, 然后提出基于近似逻辑的ISFPRM函数的优化算法, 并用遗传算法加以实现. 所提算法应用于MCNC标准电路进行测试, 结果表明在一定的面积约束下, 电路每增加1%的误差率获得12%~18%的功耗优化 |
| Abstract: | The logic synthesis and optimization methods based on accurate logic have been extensively studied. However, sometimes accurate logic may not be technically needed. As a result, this undesired requirement can be taken advantage of to synthesize and optimize other key issues. In this paper, an optimization method based on approximate logic for the Incompletely Specified Fixed Polarity Reed-Muller (ISFPRM) function is proposed. Firstly, the evaluation model of power consumption based on the two-level logic and the estimation model of design efficiency aiming at the approximate circuit are established. Then an optimized algorithm based on the approximate logic ISFPRM function is proposed and implemented in genetic algorithm. The proposed algorithm is tested under MCNC benchmarks. The experimental results show that under area constraints, every 1% increase in the error rate of the circuit can achieve power saving by 12% to 18% |
| 参考文献 /References: | [1].Han J, Orshansky M. Approximate computing: An emerging paradigm for energy-efficient design[C]. 18th IEEE European Test Symposium, 2013:1-6. [2].Shin D, Gupta S K. Approximate logic synthesis for error tolerant applications[C]. Design, Automation & Test in Europe Conference & Exhibition, 2010:957-960. [3].Shin D, Gupta S K. A new circuit simplification method for error tolerant applications[C]. Design, Automation & Test in Europe Conference & Exhibition, 2011:1-6. [4].Wu Y, Hen C, Jia Y, et al. Approximate logic synthesis for FPGA by wire removal and local function change[C]. IEEE Design Automation Conference. 2017:163-169. [5].Jiang H, Han J, Qiao F, et al. Approximate radix-8 booth multipliers for low-power and high-performance operation [J]. IEEE Transactions on Computers, 2016, 65(8):2638- 2644. [6].Zou C, Qian W, Han J. DPALS: A dynamic programming- based algorithm for two-level approximate logic synthesis [C]. IEEE 11th International Conference on Asic, 2015:1-4. [7].Wu Y, Qian W. An efficient method for multi-level approximate logic synthesis under error rate constraint [C]. Proceedings of the 53rd Annual Design Automation Conference, 2016:128. [8].Rafiev A, Mokhov A, Burns F P, et al. Mixed radix Reed-Muller expansions[J]. IEEE Transactions on Computers, 2012, 61(8):1189-1202. [9].Das A, Pradhan S N. Shared Reed-Muller decision diagram based thermal-aware AND-XOR decomposition of logic circuits[J/OL]. VLSI Design, 2016, 2016:3191286 [2018-03-17]. http://dx.doi.org/10.1155/2016/3191286. [10].Wang X, Li M, He Z, et al. PAOA: A power and area optimization approach of reed-muller logic circuits[C]. IEEE 60th International Midwest Symposium on Circuits and Systems, 2017:1394-1397. [11].Debnath D. Exact minimization of FPRMs for incompletely specified functions by using MTBDDs[J]. Ieice Transactions on Fundamentals of Electronics, Communications & Computer Sciences, 2005, 88(12): 3332-3341. [12].汪鹏君, 汪迪生, 蒋志迪, 等. 基于PSGA算法的ISFPRM电路面积与功耗优化[J]. 电子学报, 2013, 41 (8):1542-1548. [13].Tan E C, Yang H. Fast tabular technique for fixed-polarity Reed-Muller logic with inherent parallel processes[J]. International Journal of Electronics, 1998, 85(4):511-520. [14].王玉花, 王伦耀, 夏银水. 基于不相交项并行列表技术的FPRM实现[J]. 电子与信息学报, 2014, 36(9):2258- 2264. [15].李新文, 夏银水, 王伦耀. 一种改进的混合极性列表技术[J]. 宁波大学学报(理工版), 2015, 28(1):42-46. |
| 备注/Memo: | 收稿日期: 2018?07?31. 宁波大学学报（理工版）网址: http://journallg.nbu.edu.cn/ 基金项目: 国家自然科学基金（U1709218）. 第一作者: 尹浩凯（1994－）, 男, 浙江衢州人, 在读硕士研究生, 主要研究方向: 数字集成电路逻辑综合和优化. E-mail: 448502171@qq.com *通信作者: 夏银水（1963－）http://journallg.nbu.edu.cn/ |
