Idioma:

The Discrete Cosine Transform over Prime Finite Fields

de Souza, M. M. C. ; de Oliveira, H. M. ; de Souza, R. M. C. ; Vasconcelos, M. M.

Lecture notes in computer science, 2004, p.482-487 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
The Discrete Cosine Transform over Prime Finite Fields
Autor: de Souza, M. M. C. ; de Oliveira, H. M. ; de Souza, R. M. C. ; Vasconcelos, M. M.
Assuntos: Applied sciences ; Discrete Cosine Transform ; Discrete Cosine Transform Coefficient ; Discrete Fourier Transform ; Exact sciences and technology ; Finite Field ; Information, signal and communications theory ; Inversion Formula ; Mathematical methods ; Telecommunications and information theory
É parte de: Lecture notes in computer science, 2004, p.482-487
Descrição: 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.
Títulos relacionados: Lecture Notes in Computer Science
Editor: Berlin, Heidelberg: Springer Berlin Heidelberg
Idioma: Inglês

Links

Voltar para lista de resultados