Because of FNT's inherent restrictions, it is hard to implement cyclic convolution using FNT.
由于FNT变换本身的局限,不能完成大点数循环卷积。
Since efficient and fast cyclic convolution algorithms are available in the literature, the algorithm has low computational complexity, simple and regular structure.
由于循环卷积和扭循环卷积具有非常高的效率和规则,因此,本算法具有简单、规则的结构和较低的运算复杂性。
Since efficient and fast cyclic convolution algorithms are available in the literature, the algorithm has low computational complexity, simple and regular structure.
由于循环卷积和扭循环卷积具有非常高的效率和规则,因此,本算法具有简单、规则的结构和较低的运算复杂性。
应用推荐