Journal of the ACM (JACM)
An Adaptation of the Fast Fourier Transform for Parallel Processing
Journal of the ACM (JACM)
Addition in signed digit number systems
MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
The Relationship Between Two Fast Fourier Transforms
IEEE Transactions on Computers
Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
IEEE Transactions on Computers
Structured Design of Substitution-Permutation Encryption Networks
IEEE Transactions on Computers
Modelling Grid5000 point availability with SAN
Electronic Notes in Theoretical Computer Science (ENTCS)
A framework to decompose GSPN models
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Two-dimensional fast cosine transform for Vector-STA architectures
SAMOS'05 Proceedings of the 5th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
Efficient vector-descriptor product exploiting time-memory trade-offs
ACM SIGMETRICS Performance Evaluation Review
Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors
Journal of Parallel and Distributed Computing
| Hi-index | 14.98 |
The paper relates three classical concepts, viz. mixed radix number system, Kronecker product of matrices, and perfect shuffle. It presents an algebra which describes the hardware organization of the computation of a product Mv, where M is a matrix in Kronecker product form and v is a vector. The algebraic formalism describes both the blockwise structure of the computation and the various possible connection patterns.