The Discrete Cosine Transform over prime Finite Fields

被引：0
|
作者：
de Souza, MMC [1 ]
de Oliveira, HM [1 ]
de Souza, RMC [1 ]
Vasconcelos, MM [1 ]
机构：
[1] Univ Fed Pernambuco, BR-50711970 Recife, PE, Brazil
来源：
TELECOMMUNICATIONS AND NETWORKING - ICT 2004 | 2004年 / 3124卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper examines finite field trigonometry as a tool to construct trigonometric digital transforms. In particular, by using properties of the k-cosine function over GF(p), the Finite Field Discrete Cosine Transform (FFDCT) is introduced. The FFDCT pair in GF(p) is defined, having blocklengths that are divisors of (p+1)/2. A special case is the Mersenne FFDCT, defined when p is a Mersenne prime. In this instance blocklengths that are powers of two are possible and radix-2 fast algorithms can be used to compute the transform.
引用
收藏
页码：482 / 487
页数：6
相关论文
共 50 条
12345