To compute the type-II discrete cosine transform in the conventionreflect the inputs evenly to length : and for . If is the negative-exponent discrete Fourier transform, pairing the two reflected terms givesConsequently . The phase rotation and factor one half are consequences of the half-sample reflection and this normalization. One Fast Fourier transform of length plus extra work therefore computes the discrete cosine transform. Other library conventions can include a factor two or mode-dependent normalization.[ref]
https://www.fftw.org/fftw3_doc/Real_002dto_002dReal-Transform-Kinds.html. FFTW manual, REDFT10: DCT-II and logical transform length 2n
Articles by others on the same topic
The Discrete Cosine Transform (DCT) is a mathematical operation that converts a sequence of data points into a sum of cosine functions oscillating at different frequencies. It is widely used in signal processing and image compression techniques because it has properties that are beneficial for representing signals efficiently.