Computing m DFTs over GF(q) with one DFT over GF(q/sup m/)

J. Hong, Martin Vetterli

IEEE Transactions on Information Theory · 1993 · 12 citations · 2 references

DOIFull text

Open access

Concepts

Abstract

Over the field of complex numbers, it is well-known that if the input is real then it is possible to compute two real DFTs with one complex DFT. The authors extend the result to finite fields and show how to compute m DFTs over GF(q) with one DFT over GF(q/sup m/).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

References

2