@McTag,
thanks for helping and I hope that you can also help me with the following sentences:
1- This means that the power plays a major role in the amount of energy consumed by the circuit , thus minimizing the number of positive power values only does not guarantee true minimum energy.
2- It can be seen from the results that power is reduced when using C-K concept when compared to the other approaches even for Y-M based ordering. For example, columns NM and HU both approaches have the same number of power (3), however, HU approach have lower power (2 for HU compared to 3 for NM approach).
3- In this work, we employed the C-K algorithm to reduce power by assigning Y bits suitable value of -1 or 1. Each Y in a vector is considered a node. Based on the initial random assignment value, all nodes associated with Y bits are placed in two partitions: 1-partition and -1-partition based on their initial fill value.
4- Algorithm HU is our implementation of filling algorithm that minimizes energy.
5- Then the newly selected vector becomes x, y is deleted from the unfilled list, and the process is repeated again.
6- In our framework, we initially randomly fill these Y bits then and reorder the input set, then we analyze these assignments for energy improvement and modify their assignments, when needed, to reduce energy.
7- Y Bits that were filled with -1 are placed in partition ‘-1’ whereas those filled with ‘1’ are placed in partition ‘1’
thanks again and I hope that you can help me with the above sentences