COMPUTING-M DFTS OVER GF(Q) WITH ONE DFT OVER GF(QM)

被引：6

作者：

HONG, J

VETTERLI, M

机构：

[1] Department of Electrical Engineering and Center for Telecommunications Research, Columbia University, New York, NY, 10027-6699, Room 1342 S.W. Mudd Building

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1993年 / 39卷 / 01期

关键词：

FINITE FIELDS; DFT; COMPLEXITY;

D O I：

10.1109/18.179373

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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(q(m)).

引用

页码：271 / 274

页数：4