General Transforms

1
General Transforms

• Let be orthogonal, period N
• Define
• So that

2
Prime Radix Algorithm

• Determine conditions to be satisfied by
• so that
• Let
• Then

3
Prime Radix Algorithm

• Thus
• To support circular convolution
• 1)
• and real

4
Prime Radix Algorithm

• 2)
• 3) Since fundamental period is N
• 4)

5
Number Theoretic Transforms

• Thus in a complex field are the N
  roots of unity and
• In an integer field we can write
• and use Fermat's theorem
• where is prime and is a primitive root
• Euler's totient function can be used to
  generalise as

6
Prime Radix Algorithm

• Fermat's Theorem Consider
• Reduce mod P to produce
• Since we have
• or
• and since there are no other unknown factors

7
Prime Radix Algorithm

• T

8
Prime Radix Algorithm

• T

9
Prime Radix Algorithm

• Alternatively (perhaps simpler)
• For not multiples of P
• expanded in
  bionomial form produces multiples of P
• except for the terms
• Thus

10
Prime Radix Algorithm

• Now, if the total number of bracketed terms is
  for this argument less than P
• say a, then for
  one has
• ie