Publication

Computing m DFT's over GF(q) with one DFT over GF(q^m)

Martin Vetterli
1993
Journal Articles

Abstract

Over the field of complex numbers, it is well-known that if the input is real then it is possible to compute 2 real DFT's with one complex DFT. We extend the result to finite fields and show how to compute m DFT's over GF(q) with one DFT over GF(qm)

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Computing m DFT's over GF(q) with one DFT over GF(q^m)

Chat with Graph Search

SplineSplat: 3D Ray Tracing for Higher-Quality Tomography

Microautophagy: definition, classification, and the complexity of the underlying mechanisms

First Order Expansion in the Semiclassical Limit of the Levy–Lieb Functional