“…This implies that the transient provided by a DCT filter lasts just half a cycle. This is an important improvement over the most widely used algorithms, such as discrete Fourier transform (DFT), fast Fourier transform (FFT), and recursive DFT (RDFT) [10], [14], [15], which need a full fundamental cycle [10], and reference generation techniques based on p-q theory, which may require more than two cycles even for low-order filters [15]. Furthermore, the recursive formulation of the RDFT may yield larger numerical errors [16], so its advantage of implementation simplicity is not always decisive.…”