Multiplication by a constant (C.X) is a fundamental operation in the linear time invariant (LTI) Systems. The design optimization of C.X leads to the design optimization of the whole system (from a circuit point of view speed/power/area). We proved in a previous work that for an N-bit constant, the upper-bound is equal to (N+1)/r+2^(r-2)-2, where r=2.W[((N+1).log(2))^0.5]/log(2) and W is the Lambert function. I am looking in the literature for a lower bound. This could be available in pure or applied mathematics journals rather than in circuit journals.
Pavel Osinenko
Can you share the link to this work? It seems to be an interesting applied problem.
0 votes
0 thanks
Abdelkrim Kamel Oudjida
The work is described in my two recent papers. You can download them from my researchgate page.
0 votes
0 thanks
- Badges
- Science topic
- Similar topics
- Mathematics
- Applied Mathematics
More Abdelkrim Kamel Oudjida's questions See All
Similar questions and discussions