Assertion: algorithm | /r/HasProperty | pfa
Facets:
Source sentences:
text: For N = N 1 N 2 with coprime N 1 and N 2 , one can use the prime-factor (Good–Thomas) algorithm (PFA), based on the Chinese remainder theorem, to factorize the DFT similarly to Cooley–Tukey but without the twiddle factors.