Conference paper
Performance test case generation for microprocessors
Pradip Bose
VTS 1998
The multiplicative complexity of discrete cosine transforms (DCT’s) of arbitrary dimensions on inputs sizes, which are powers of two, are obtained. New upper bounds on the multiplicative complexity of scaled DCT’s on input sizes, which are powers of two, are also obtained. © 1992 IEEE
Pradip Bose
VTS 1998
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
David A. Selby
IBM J. Res. Dev