Expediting factor-type fast finite field transform algorithms

Schemes are developed whereby the number of arithmetic operations needed in a fast finite field transform employing factor-type algorithms are decreased by using a chord property of the intermediate variables. Noticeable improvements in both the Good and the Cooley-Tukey forms of fast algorithms are possible. A proof of the limited chord properties of the intermediate variable is included, and several numerical examples for comparison purposes are given.