Fast algorithms for discrete cosine transforming of short lengths with minimal computational complexity

This paper considers fast algorithms for the discrete cosine transforming (DCT) of short lengths with minimal computational complexity. Decreasing of the computational complexity is achieved due to new approach of synthesis of the short lengths DCT algorithms. This approach is connected with interpretation of DCT calculation as operations within associated algebraic structures. The application of developed algorithms in block coding method is researched.