Fast Computational Algorithms for Bit Reversal
IEEE Transactions on Computers
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Encrypting by random rotations
Proceedings of the 1982 conference on Cryptography
On long-term social relationships in peer-to-peer systems
Proceedings of the Nineteenth International Workshop on Quality of Service
A fast solver for modeling the evolution of virus populations
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Fast orthogonal transforms and generation of Brownian paths
Journal of Complexity
Scalable Video Coding Using Compressive Sensing
Bell Labs Technical Journal
N point DCT VLSI architecture for emerging HEVC standard
VLSI Design - Special issue on VLSI Circuits, Systems, and Architectures for Advanced Image and Video Compression Standards
IH'12 Proceedings of the 14th international conference on Information Hiding
Second order partial derivatives for NK-landscapes
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Wireless Personal Communications: An International Journal
| Hi-index | 14.98 |
A unified matrix treatment is presented for the various orderings of the Walsh-Hadamard (WH) functions using a general framework. This approach clarifies the different definitions of the WH matrix, the various fast algorithms and the reorderings of the WH functions.