New characterizations of 2D discrete cosine transform

We introduce a function to specify the transform coefficients. We state, prove, and apply useful rules. Our combination of two algorithms is unique. We describe an implementation for an 8×8 DCT that performs a total of 1,424 operations at a rate of 178 operations per clock cycle, which is approximately twice as fast as a unified algorithm on a serial-parallel architecture.