2020/07/17 by Ricardo M. Campello de Souza, de Souza, R. M. Campello, M. M. Campello de Souza +5
Computer Science · Mathematics · #11F80 #12E20 #40A05 #40G05 #Digital Filter Design and Implementation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #G.2 #Group Theory (math.GR) #Mathematical Analysis and Transform Methods #Number Theory (math.NT) #Numerical Methods and Algorithms #Signal Processing (eess.SP) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2007.10816
openalex publication_date 2020/07/17 · openalex created_date 2020/07/29 · openalex updated_date 2026/07/28
Digital Transforms have important applications on subjects such as channel coding, cryptography and digital signal processing. In this paper, two Fourier Transforms are considered, the discrete time Fourier transform (DTFT) and the finite field Fourier transform (FFFT). A finite field version of the DTFT is introduced and the FFFT is redefined with a complex kernel, which makes it a more appropriate finite field version of the Discrete Fourier Transform. These transforms can handle FIR and IIR filters defined over finite algebraic structures.