Real transform algorithm for computing discrete circular deconvolution

Fast computation of the discrete deconvolution is very important in image/video signal processing. We develop a real transform algorithm for calculating the discrete circular deconvolution by substituting the fast Fourier transform (FFT) defined in the complex domain. It is shown that the computational cost of the algorithm is about half of the traditional FFT. Furthermore, the algorithm has a weak numerical stability.