I will first discuss both the importance of linear transforms in signal and image processing as well as their complexity. Then I will show a simple device, based on the factorization of invertible matrix polynomials, enabling to identify the possibility of fast implementation of linear transforms. Its applicability is demonstrated in the case of Hadamard matrices and their generalization, Hadamard matrix polynomials.