Fourier and Zak transforms of multiplicative characters

04/13/2021
by   Andrzej K. Brodzik, et al.
0

In this paper we derive formulas for the N-point discrete Fourier transform and the R1 x R2 finite Zak transform of multiplicative characters on Z/N, where N is an odd integer, and R1 and R2 are co-prime factors of N. In one special case this permits computation of the discrete Fourier transform and the finite Zak transform of the Jacobi symbol, the modified Jacobi sequence, and the Golomb sequence. In other cases, not addressed here, this permits computation of the discrete Fourier transform and the finite Zak transform of certain complex-valued sequences. These results constitute, to our knowledge, the first unified treatment of key Fourier and Zak space properties of multiplicative characters. These results also provide a convenient framework for the design of new character-based sequences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/15/2018

The inverse cyclotomic Discrete Fourier Transform algorithm

The proof of the theorem concerning to the inverse cyclotomic Discrete F...
research
11/08/2012

A Comparative study of Arabic handwritten characters invariant feature

This paper is practically interested in the unchangeable feature of Arab...
research
11/15/2018

A Schur transform for spatial stochastic processes

The variance, higher order moments, covariance, and joint moments or cum...
research
02/24/2020

Markov Logic Networks with Complex Weights: Expressivity, Liftability and Fourier Transforms

We study expressivity of Markov logic networks (MLNs). We introduce comp...
research
06/27/2018

Deriving the Variance of the Discrete Fourier Transform Test Using Parseval's Theorem

The discrete Fourier transform test is a randomness test included in NIS...
research
07/05/2020

An Integer Approximation Method for Discrete Sinusoidal Transforms

Approximate methods have been considered as a means to the evaluation of...
research
08/26/2021

A promotion for odd symmetric discrete Fourier transform

DFT is the numerical implementation of Fourier transform (FT), and it ha...

Please sign up or login with your details

Forgot password? Click here to reset