Multi-Level Sum of Product (SOP) Network Power Optimization Based on Switching Graph

被引:0
|
作者
Kubica, Marcin [1 ]
Kania, Dariusz [1 ]
机构
[1] Silesian Tech Univ, Dept Digital Syst, Ul Akad 2A, PL-44100 Gliwice, Poland
关键词
low-power synthesis; SOP; switching activity; technology mapping; IMPROVING CHARACTERISTICS; LDPC DECODER; ALGORITHM; ARCHITECTURE; ASSIGNMENT; REDUCTION; CIRCUITS; DESIGN;
D O I
10.3390/electronics13204011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The article presents the methodology of optimization of technology mapping of a multi-output function implemented in the form of sum of product (SOP) networks. The optimization is based on the concept of reducing the switching activity of combinational circuits. The aim of reducing network switching is to limit the consumption of dynamic power. Since dynamic power is one of the components of the total power consumed by digital systems, this leads to an optimization focused on the energy efficiency of digital systems. The basis of the proposed method is the technology mapping using a modified output graph describing the result of minimizing the multi-output function. The modified output graph, in terms of parameters associated with dynamic power, is defined as a switching graph. It was assumed that the key parameter associated with dynamic power is the switching activity of individual nodes of the logic network. The article presents elements of switching graph optimization which lead to the improvement of parameters associated with the dynamic power of the circuit. The essence of the proposed optimization methods is the appropriate movement of products and connections occurring in the logic network. Reducing the number of logic network vertices is also extremely important. The effectiveness of the proposed method was confirmed by the results of experiments performed on selected benchmarks. A significant reduction in the total value of switching activity was obtained for the optimized structures.
引用
收藏
页数:15
相关论文
共 50 条
  • [41] Inferring Users' Social Roles with a Multi-Level Graph Neural Network Model
    Zhang, Chunrui
    Wang, Shen
    Zhan, Dechen
    Yin, Mingyong
    Lou, Fang
    ENTROPY, 2021, 23 (11)
  • [42] RTC Based Solar Power Multi-Level Inverter
    Kurian, Geevarghese Mathew
    Jeyanthy, Aruna
    Devaraj, D.
    Anilkumar, P. G.
    2018 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2018, : 1875 - 1880
  • [43] Distributed Pose-Graph Optimization With Multi-Level Partitioning for Multi-Robot SLAM
    Li, Cunhao
    Guo, Guanghui
    Yi, Peng
    Hong, Yiguang
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2024, 9 (06): : 4926 - 4933
  • [44] A multi-level DWDM network using hybrid packet switching and wavelength routing
    Kuo, ST
    Kao, MS
    2005 INTERNATIONAL CONFERENCE ON WIRELESS AND OPTICAL COMMUNICATIONS NETWORKS, 2005, : 217 - 220
  • [45] A hybrid multi-level switching converter for ring-magnet power supplies
    Kumar, MRP
    Kim, JMS
    1995 IEEE NUCLEAR SCIENCE SYMPOSIUM AND MEDICAL IMAGING CONFERENCE RECORD, VOLS 1-3, 1996, : 362 - 366
  • [46] A hybrid multi-level switching converter for ring-magnet power supplies
    Kumar, MRP
    Kim, JMS
    IEEE TRANSACTIONS ON NUCLEAR SCIENCE, 1996, 43 (03) : 1876 - 1883
  • [47] Hybrid multi-level switching converter for ring-magnet power supplies
    Univ of Victoria, Victoria, Canada
    IEEE Trans Nucl Sci, 3 pt 2 (1876-1883):
  • [48] Multi-level model predictive controller with satisfactory optimization for multi-level converters
    Tamim, Touati Mohamed
    Li, Shaoyuan
    Wu, Jing
    SIMULATION MODELLING PRACTICE AND THEORY, 2019, 92 : 1 - 16
  • [49] Application of multi-level adaptive neural network based on optimization algorithm in image style transfer
    Li, Hong-an
    Wang, Lanye
    Liu, Jun
    MULTIMEDIA TOOLS AND APPLICATIONS, 2024, 83 (29) : 73127 - 73149
  • [50] MeMLO: Mobility-Enabled Multi-level Optimization Sensor Network
    Rajalakshmi, M. C.
    Prakash, A. P. Gnana
    WIRELESS PERSONAL COMMUNICATIONS, 2017, 97 (04) : 5675 - 5689