DocumentCode
2940146
Title
Polynomial Fourier transforms
Author
Gongli, Z. ; Moraga, Claudlo
Author_Institution
Dept. of Inf. Eng., Northwest Telecommun. Eng. Inst., Xi´´an, China
fYear
1988
fDate
0-0 1988
Firstpage
412
Lastpage
419
Abstract
A discrete polynomial Fourier transform that leads to a family of Chrestenson-related transforms is disclosed. The polynomial spectrum of a p-valued function can be calculated without requiring complex multiplication. Former known expressions for Chrestenson spectra can be obtained from the polynomial spectra by a simple modulo reduction. The coefficients of the spectral polynomials give exact information on the correlation between p-valued and linear functions. It is shown that the coefficients of selected spectral polynomials characterize the p-valued threshold functions uniquely.<>
Keywords
Fourier transforms; many-valued logics; polynomials; Chrestenson-related transforms; discrete polynomial Fourier transform; linear functions; modulo reduction; p-valued function; polynomial spectrum; Application software; Digital signal processing; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Fourier transforms; Polynomials; Power engineering and energy; Power engineering computing; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 1988., Proceedings of the Eighteenth International Symposium on
Conference_Location
Palma de Mallorca, Spain
Print_ISBN
0-8186-0859-5
Type
conf
DOI
10.1109/ISMVL.1988.5203
Filename
5203
Link To Document