![]() | ||
In mathematics, trigonometry analogies are supported by the theory of quadratic extensions of finite fields, also known as Galois fields. The main motivation to deal with a finite field trigonometry is the power of the discrete transforms, which play an important role in engineering and mathematics. Significant examples are the well-known discrete trigonometric transforms (DTT), namely the discrete cosine transform and discrete sine transform, which have found many applications in the fields of digital signal and image processing. In the real DTTs, inevitably, rounding is necessary, because the elements of its transformation matrices are derived from the calculation of sines and cosines. This is the main motivation to define the cosine transform over prime finite fields. In this case, all the calculation is done using integer arithmetic.
Contents
- Trigonometry over a Galois field
- Examples
- Unimodular groups
- Example
- Polar form
- The Z plane in a Galois field
- Back to the GFp trigonometry
- Trajectories over the Galois Z plane in GFp
- References
In order to construct a finite field transform that holds some resemblance with a DTT or with a discrete transform that uses trigonometric functions as its kernel, like the discrete Hartley transform, it is firstly necessary to establish the equivalent of the cosine and sine functions over a finite structure.
Trigonometry over a Galois field
The set GI(q) of Gaussian integers over the finite field GF(q) plays an important role in the trigonometry over finite fields. If q = pr is a prime power such that −1 is a quadratic non-residue in GF(q), then GI(q) is defined as
GI(q) = {a + jb; a, b ∈ GF(q)},where j is a symbolic square root of −1 (that is j is defined by j2 = −1). Thus GI(q) is a field isomorphic to GF(q2).
Trigonometric functions over the elements of a Galois field can be defined as follows:
Let
for i, k = 0, 1,...,N − 1. We write cosk(
Examples
Unimodular groups
The unimodular set of GI(p), denoted by G1, is the set of elements ζ = (a + jb) ∈ GI(p), such that a2 + b2
To determine the elements of the unimodular group it helps to observe that if ζ = a + jb is one such element, then so is every element in the set ζ = {b + ja, (p − a) + jb, b + j(p − a), a +j(p − b), (p − b) + ja, (p − a) + j(p − b), (p − b) + j(p − a)}.
Example
Unimodular groups of GF(72) and GF(112). In each case, table III lists the elements of the subgroups G1 of order 8 and 12, and their orders.
Figure 1 illustrates the 12 roots of unity in GF(112). Clearly, G1 is isomorphic to C12, the group of proper rotations of a regular dodecagon.
Polar form
Let Gr and Gθ be subgroups of the multiplicative group of the nonzero elements of GI(p), of orders (p − 1)/2 and 2(p + 1), respectively. Then all nonzero elements of GI(p) can be written in the form ζ = α·β, where α ∈ Gr and β ∈ Gθ.
Considering that any element of a cyclic group can be written as an integral power of a group generator, it is possible to set r = α and εθ = β, where ε is a generator of
The standard modulus operation (absolute value) in
By analogy, the modulus operation in GF(p) is such that it always results in a quadratic residue of p.
The modulus of an element
The modulus of an element of GF(p) is a quadratic residue of p.
The modulus of an element a + jb ∈ GI(p), where p = 4k + 3, is
In the continuum, such expression reduces to the usual norm of a complex number, since both, a2 + b2 and the square root operation, produce only nonnegative numbers.
An expression for the phase
The similarity with the trigonometry over the field of real numbers is now evident: the modulus belongs to GF(p) (the modulus is a real number) and is a quadratic residue (a positive number), and the exponential component
The Z plane in a Galois field
The complex Z plane (Argand diagram) in GF(p) can be constructed from the supra-unimodular set of GI(p):
The elements ζ = a + jb of the supra-unimodular group Gs satisfy (a2 + b2)2
Examples
A generator ε of the supra-unimodular group is used to construct the Z plane over GF(p). The Z plane over GF(7) is depicted in figure 2. There are 2(p + 1) = 16 elements in each circle. The nonzero elements, namely ±1, ±2, ±3, are located on the horizontal axis, in the right or left side, according if they are, respectively, quadratic residues (QR) or quadratic non-residues (NQR) of p = 7. There are three circles, of radius 1, 2 and 4, corresponding to the (p − 1)/2 = 3 elements of the group of modules Gr. A similar situation occurs for the elements of GI(7) of the form jb. The 16 elements on the unit circle correspond to the elements of Gs and are obtained as powers of ε. The even powers correspond to the elements of G1 (a2 + b2
The number of elements of a given order as elements of GI(7) in the z plane over GF(7) is given in the inset of figure 2.
Back to the GF(p)-trigonometry
In the above, if the choice of
for i = 0, 1, ..., p. The k subscript in the earlier definition gives an unexpected two-dimensional character to the cos(.) and sin(.) functions. As a matter of fact, it means only that to compute the entries in tables I and II, a different value of
Now, to play with a trigonometry over GF(7) on the unit circle, it seems much more natural to use, for instance,
Further, if
Example
With
Trajectories over the Galois Z plane in GF(p)
When calculating the order of a given element, the intermediate results generate a trajectory on the Galois Z plane, called the order trajectory. In particular, If