Title :
An improved fast algorithm for the k-th root of permutation factor circulant matrices
Author :
Li, Hongkui ; Liu, Xueting ; Wang, Peng
Author_Institution :
Coll. of Sci., Shandong Univ. of Technol., Zibo, China
Abstract :
Permutation factor circulant matrices have been applied widely in numerical computation, signal processing, coding theory and oil investigation in recent years, and so on. In this paper, we present a fast algorithm for the k-th root 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 finally.
Keywords :
fast Fourier transforms; matrix algebra; coding theory; fast Fourier transform; k-th root algorithm; numerical computation; oil investigation; permutation factor circulant matrices; signal processing; Codes; Communication system control; Engineering management; 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.5268067
