Performance test case generation for microprocessors
Pradip Bose
VTS 1998
In this paper we study the arithmetic complexity of computing the pth Kronecker power of an n × n matrix. We first analyze a straightforward inductive computation which requires an asymptotic average of p multiplications and p - 1 additions per computed output. We then apply efficient methods for matrix multiplication to obtain an algorithm that achieves the optimal rate of one multiplication per output at the expense of increasing the number of additions, and an algorithm that requires O(log p) multiplications and O(log2p) additions per output. © 1983.
Pradip Bose
VTS 1998
Nanda Kambhatla
ACL 2004
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering