Abstract
AbstractIn this work, we present an approach to alleviate the potential benefit of adder graph algorithms by solving the transposed form of the problem and then transposing the solution. The key contribution is a systematic way to obtain the transposed realization with a minimum number of cascaded adders subject to the input realization. In this way, wide and low constant matrix multiplication problems, with sum of products as a special case, which are normally exceptionally time consuming to solve using adder graph algorithms, can be solved by first transposing the matrix and then transposing the solution. Examples show that while the relation between the adder depth of the solution to the transposed problem and the original problem is not straightforward, there are many cases where the reduction in adder cost will more than compensate for the potential increase in adder depth and result in implementations with reduced power consumption compared to using sub-expression sharing algorithms, which can both solve the original problem directly in reasonable time and guarantee a minimum adder depth.
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Modeling and Simulation,Information Systems,Signal Processing,Theoretical Computer Science,Control and Systems Engineering
Reference28 articles.
1. Gustafsson, O. (2007). Lower bounds for constant multiplication problems. IEEE Transactions on Circuits and Systems II, 54(11), 974–978.
2. Meher, P.K., Chang, C.H., Gustafsson, O., Vinod, A.P., & Faust, M. (2017). Shift-add circuits for constant multiplications. In Meher, P.K., & Stouraitis, T. (Eds.) Arithmetic circuits for DSP applications (pp. 33–76). Wiley.
3. Dempster, A.G., Gustafsson, O., & Coleman, J.O. (2003). Towards an algorithm for matrix multiplier blocks. In Proceedings of european conference circuit theory design (pp. 1–4).
4. Macleod, M., & Dempster, A. (2004). Common subexpression elimination algorithm for low-cost multiplierless implementation of matrix multipliers. Electronics Letters, 40(11), 651–652.
5. Boullis, N., & Tisserand, A. (2005). Some optimizations of hardware multiplication by constant matrices. IEEE Transactions on Computers, 54(10), 1271–1282.