DocumentCode
2873673
Title
A Fast Algorithm for the Production of Permutation Factor Circulant Matrices
Author
Liu, Xuetting ; Wei, Peiyu
Author_Institution
Sch. of Electr. & Electron. Eng., Shandong Univ. of Technol., Zibo, China
Volume
2
fYear
2009
fDate
18-19 July 2009
Firstpage
367
Lastpage
370
Abstract
Permutation factor circulant matrices have applied 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 production and the k-th power of permutation factor circulant matrices of order n.
Keywords
algorithm theory; fast Fourier transforms; matrix algebra; coding theory; fast algorithm; numerical computation; oil investigation; permutation factor circulant matrices; signal processing; Codes; Information processing; Mathematics; Petroleum; Polynomials; Power engineering and energy; Power engineering computing; Production; Signal processing; Signal processing algorithms; complexity; fast Fourier transform(FFT); permutation factor circulant matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Processing, 2009. APCIP 2009. Asia-Pacific Conference on
Conference_Location
Shenzhen
Print_ISBN
978-0-7695-3699-6
Type
conf
DOI
10.1109/APCIP.2009.227
Filename
5197213
Link To Document