1997 | OriginalPaper | Chapter
Rationality
Authors : Richard Tolimieri, Chao Lu, Myoung An
Published in: Algorithms for Discrete Fourier Transform and Convolution
Publisher: Springer New York
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Multiplicative character theory provides a natural setting for developing the complexity results of Auslander, Feig and Winograd [1]. The first reason for this is the simplicity of the formulas describing the action of FT on multiplicative characters. We will now discuss a second important property of multiplicative characters. In a sense defined below, the spaces spanned by certain subsets of multiplicative characters are rational subspaces. As a consequence, we will be able to rationally manipulate the FT matrix F(pm) into block diagonal matrices where each block action corresponds to some polynomial multiplication modulo a rational polynomial of a special kind. This is the main result in the work of Auslander, Feig and Winograd. Details from the point of view of multiplicative character theory can be found in [2].