Starting from an index mapping for one to multi-dimensions, a general in-placeand in-order prime factor FFT algorithm is proposed in this paper. In comparing with existingprime factor FFT algorithms, this algorithm sa...Starting from an index mapping for one to multi-dimensions, a general in-placeand in-order prime factor FFT algorithm is proposed in this paper. In comparing with existingprime factor FFT algorithms, this algorithm saves about half of the required storage capacityand possesses a higher efficiency. In addition, this algorithm can easily implement the DFT andIDFT in a single subroutine,展开更多
In this paper is demonstrated a method for reduction of integer factorization problem to an analysis of a sequence of modular elliptic equations. As a result, the paper provides a non-deterministic algorithm that comp...In this paper is demonstrated a method for reduction of integer factorization problem to an analysis of a sequence of modular elliptic equations. As a result, the paper provides a non-deterministic algorithm that computes a factor of a semi-prime integer n=pq, where prime factors p and q are unknown. The proposed algorithm is based on counting points on a sequence of at least four elliptic curves y2=x(x2+b2)(modn) , where b is a control parameter. Although in the worst case, for some n the number of required values of parameter b that must be considered (the number of basic steps of the algorithm) substantially exceeds four, hundreds of computer experiments indicate that the average number of the basic steps does not exceed six. These experiments also confirm all important facts discussed in this paper.展开更多
结合世界性数字广播(Digital Radio Mondiale,DRM)系统具有多种鲁棒性模式和带宽占用模式的特点,设计了适用于DRM系统的快速傅里叶变换算法。与其他快速傅里叶变换算法相比较,这种通用长度N的同址、顺序素因子算法点数选取灵活,运算精度...结合世界性数字广播(Digital Radio Mondiale,DRM)系统具有多种鲁棒性模式和带宽占用模式的特点,设计了适用于DRM系统的快速傅里叶变换算法。与其他快速傅里叶变换算法相比较,这种通用长度N的同址、顺序素因子算法点数选取灵活,运算精度高,可以实现同址、顺序运算,因此其存储量和数据传递次数少,运算量小,运算速度快,且程序结构规整,利于软、硬件实现。该算法也可用于其他采用正交频分复用调制技术的系统。展开更多
基金Supported by the National Natural Science Foundation of China
文摘Starting from an index mapping for one to multi-dimensions, a general in-placeand in-order prime factor FFT algorithm is proposed in this paper. In comparing with existingprime factor FFT algorithms, this algorithm saves about half of the required storage capacityand possesses a higher efficiency. In addition, this algorithm can easily implement the DFT andIDFT in a single subroutine,
文摘In this paper is demonstrated a method for reduction of integer factorization problem to an analysis of a sequence of modular elliptic equations. As a result, the paper provides a non-deterministic algorithm that computes a factor of a semi-prime integer n=pq, where prime factors p and q are unknown. The proposed algorithm is based on counting points on a sequence of at least four elliptic curves y2=x(x2+b2)(modn) , where b is a control parameter. Although in the worst case, for some n the number of required values of parameter b that must be considered (the number of basic steps of the algorithm) substantially exceeds four, hundreds of computer experiments indicate that the average number of the basic steps does not exceed six. These experiments also confirm all important facts discussed in this paper.
文摘结合世界性数字广播(Digital Radio Mondiale,DRM)系统具有多种鲁棒性模式和带宽占用模式的特点,设计了适用于DRM系统的快速傅里叶变换算法。与其他快速傅里叶变换算法相比较,这种通用长度N的同址、顺序素因子算法点数选取灵活,运算精度高,可以实现同址、顺序运算,因此其存储量和数据传递次数少,运算量小,运算速度快,且程序结构规整,利于软、硬件实现。该算法也可用于其他采用正交频分复用调制技术的系统。
