On the computation of the length-2m discrete cosine and sine transforms via the permuted difference coefficient

An intrinsic property, wherein the set of numbers formed using the magnitudes of a basis vector´s elements is the same for all basis vectors in a length-2^m type-III discrete sine transform (DST) and discrete cosine transform (DCT), is proved. We also show that the set of numbers formed using the magnitudes of any basis vector´s elements in a length-2^m type-III DST is the same as that in a length-2^m type-III DCT. The same characteristics exist for the length-2^m type-IV DST and DCT. A new combinational VLSI architecture that is only composed of adders for implementing the length-2^m type-III DST or DCT (DST-III/DCT-III) using the intrinsic property and the permuted difference coefficient (PDC) algorithm is developed. The advantages of this new architecture are high structural regularity, very high speed, and suitability for VLSI realization. The other advanced sequential structure, which is composed of registers, multiplexers, and an accumulator, is also proposed to give a much lower complexity than the combinational structure. This new sequential structure is very suitable for chip-level, microprocessor-based, or VLSI realization. The quantization error that exhibits the effect of the internal finite word-length representations of the input and the coefficient is also analyzed. It is shown that if the length of data sequence is quadrupled, then to maintain the same signal to noise ratio, one additional bit must be added to represent both the input and the coefficient. It is also shown that the roundoff error of the coefficients is less sensitive than that of the inputs