public class LongTableFNT extends LongModMath
All access to this class must be externally synchronized.
Constructor and Description |
---|
LongTableFNT()
Default constructor.
|
Modifier and Type | Method and Description |
---|---|
void |
inverseTableFNT(ArrayAccess arrayAccess,
long[] wTable,
int[] permutationTable)
Inverse (Cooley-Tukey) fast Number Theoretic Transform.
|
void |
tableFNT(ArrayAccess arrayAccess,
long[] wTable,
int[] permutationTable)
Forward (Sande-Tukey) fast Number Theoretic Transform.
|
createWTable, getForwardNthRoot, getInverseNthRoot, modDivide, modInverse, modPow, negate
getModulus, modAdd, modMultiply, modSubtract, setModulus
public void tableFNT(ArrayAccess arrayAccess, long[] wTable, int[] permutationTable) throws ApfloatRuntimeException
arrayAccess
- The data array to transform.wTable
- Table of powers of n:th root of unity w
modulo the current modulus.permutationTable
- Table of permutation indexes, or null
if the data should not be permuted.ApfloatRuntimeException
public void inverseTableFNT(ArrayAccess arrayAccess, long[] wTable, int[] permutationTable) throws ApfloatRuntimeException
arrayAccess
- The data array to transform.wTable
- Table of powers of n:th root of unity w
modulo the current modulus.permutationTable
- Table of permutation indexes, or null
if the data should not be permuted.ApfloatRuntimeException
Copyright © 2017. All rights reserved.