Matrix Decomposition and Calculation of Chrestenson Spectra
Received:August 03, 2000  
Key Words: discrete Fourier transform   Chrestenson spectra   sparse matrix   fast algorithm.  
Fund Project:Supported by the National Natural Science Foundation of China (90104034), the 863 Program (2002AA141020) and the Guangdong Provincial Natural Science Foundation (990336)
Author NameAffiliation
HU Lei State Key Laboratory of Information Security
Graduate School
Academic Sinica
Beijing
China 
Hits: 2313
Download times: 1272
Abstract:
      Calculation of a variation of discrete Fourier transform.Chrestenson spectraof functions of n indeterminates over integer modulo m(composite integer),is con-sidered.Based on sparse matrix decomposition,two fast algorithms with complexity O(mnn∑ri=1pi) are given to calculate the Chrestenson spectra,where p1p2…pr is theprime factor decomposition of m.
Citation:
DOI:10.3770/j.issn:1000-341X.2003.01.004
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.