SOS AGAIAN, HAKOB SARUKHANYAN and JAAKKO ASTOLA

Fast computational algorithms for Hadamard transforms are constructed in this paper. As a special case, fast algorithms of two groups of transforms based on skew Williamson-Hadamard matrices are designed using the block structures of these matrices.