In this paper, we present a fast Fourier transform algorithm for the inverse of Rblock circulant matrices of order mn, its arithmetic complexity is o(mn log2 mn).
文摘In this paper, we present a fast Fourier transform algorithm for the inverse of Rblock circulant matrices of order mn, its arithmetic complexity is o(mn log2 mn).