ProV Logo
0

The Discrete Cosine Transform over Prime...
de Souza, M. M. Camp...
The Discrete Cosine Transform over Prime Finite Fields by de Souza, M. M. Campello ( Author )
N.A
12-03-2015
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.
-
Article
pdf
36.88 KB
English
-
MYR 0.01
-
https://arxiv.org/abs/1503.03763
Share this eBook