This paper proposes a novel 3780-point FFT algorithm for the China national broadcasting standard. This new algorithm adopts the pure PFA (prime factor algorithm) and nested Winograd FFT which can realize the identity in the circuit structure. The simulation demonstrates that the new algorithm can achieve the equal accuracy rather than other methods but with the least quantity of multiplication.

This paper investigates a novel structure for the Winograd number theoretic transform algorithm (WNTA) to reduce the computation load. The proposed computing structure exploits the multiple constant multiplication to replace the standard multiplication, then, the multiplication of the WNTA can be realised in a shift-add way, which definitely decreases the complexity of WNTA and maintains the computing accuracy. Typical applications, such as the convolution and the filtering operation, are tested by computer simulations, while the result demonstrates that the proposed scheme is superior to conventional schemes in terms of the trade-off between the complexity.