Title :
The FFT algorithm for the production of K permutation factor circulant matrices
Author :
Zhao, Wenling ; Song, Daojing
Author_Institution :
Coll. of Sci., Shandong Univ. of Technol., Zibo, China
Abstract :
Permutation factor circulant matrices have wide application, such as in signal processing, numerical computation, coding theory and oil investigation and so on. In this paper, we present a fast algorithm for the K Production of Permutation Factor Circulant Matrices of order n by the fast Fourier transform (FFT), and give a numerical example in order to show the effectiveness of our algorithm at last.
Keywords :
computational complexity; fast Fourier transforms; matrix algebra; FFT algorithm; computational complexity; fast Fourier transform; k production; permutation factor circulant matrix; Codes; Communication system control; Educational institutions; Fast Fourier transforms; Mathematics; Petroleum; Polynomials; Production; Signal processing algorithms; Technology management; complexity; fast Fourier transform(FFT); permutation factor circulant matrices;
Conference_Titel :
Computing, Communication, Control, and Management, 2009. CCCM 2009. ISECS International Colloquium on
Conference_Location :
Sanya
Print_ISBN :
978-1-4244-4247-8
DOI :
10.1109/CCCM.2009.5267911
