In this paper, we have proved that the lower bound of the number of real multiplications for computing a length 2(t) real GFT(a,b) (a = +/-1/2, b = 0 or b = +/-1/2, a = 0) is 2(t+1) - 2t - 2 and that for computing a l...In this paper, we have proved that the lower bound of the number of real multiplications for computing a length 2(t) real GFT(a,b) (a = +/-1/2, b = 0 or b = +/-1/2, a = 0) is 2(t+1) - 2t - 2 and that for computing a length 2t real GFT(a,b)(a = +/-1/2, b = +/-1/2) is 2(t+1) - 2. Practical algorithms which meet the lower bounds of multiplications are given.展开更多
Unmanned Aerial Vehicle(UAV)equipped with uniform linear array has been applied to multiple emitters localization.Meanwhile,nested linear array enables to enhance localization resolution and achieve under-determined D...Unmanned Aerial Vehicle(UAV)equipped with uniform linear array has been applied to multiple emitters localization.Meanwhile,nested linear array enables to enhance localization resolution and achieve under-determined Direction of Arrival(DOA)estimation.In this paper,we propose a new system structure for emitters localization that combines the UAV with nested linear array,which is capable of significantly increasing the positioning accuracy of interested targets.Specifically,a localization scheme is designed to obtain the paired two-dimensional DOA(2D-DOA,i.e.azimuth and elevation angles)estimates of emitters by nested linear array with UAV.Furthermore,we propose an improved DOA estimation algorithm for emitters localization that utilizes Discrete Fourier Transform(DFT)method to obtain coarse DOA estimates,subsequently,achieve the fine DOA estimates by sparse representation.The proposed algorithm has lower computational complexity because the coarse DOA estimates enable to shrink the range of over-complete dictionary of sparse representation.In addition,compared to traditional uniform linear array,improved 2D-DOA estimation performance of emitters can be obtained with a nested linear array.Extensive simulation results testify the effectiveness of the proposed method.展开更多
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,展开更多
The Fourier transform is very important to numerous applications in science and engineering. However, its usefulness is hampered by its computational expense. In this paper, in an attempt to develop a faster method fo...The Fourier transform is very important to numerous applications in science and engineering. However, its usefulness is hampered by its computational expense. In this paper, in an attempt to develop a faster method for computing Fourier transforms, the authors present parallel implementations of two new algorithms developed for the type IV Discrete Cosine Transform （DCT-IV） which support the new interleaved fast Fourier transform method. The authors discuss the realizations of their implementations using two paradigms. The first involved commodity equipment and the Message-Passing Interface （MPI） library. The second utilized the RapidMind development platform and the Cell Broadband Engine （BE） processor. These experiments indicate that the authors＇ rotation-based algorithm is preferable to their lifting-based algorithm on the platforms tested, with increased efficiency demonstrated by their MPI implementation for large data sets. Finally, the authors outline future work by discussing an architecture-oriented method for computing DCT-IVs which promises further optimization. The results indicate a promising fresh direction in the search for efficient ways to compute Fourier transforms.展开更多
We experimentally demonstrate a direct-detection orthogonal-frequency-division-multiplexing quadraturephase-shift-keying（OFDM-QPSK） system that is capable of delivering a 32 Gbaud OFDM-QPSK signal over7 km single-mo...We experimentally demonstrate a direct-detection orthogonal-frequency-division-multiplexing quadraturephase-shift-keying（OFDM-QPSK） system that is capable of delivering a 32 Gbaud OFDM-QPSK signal over7 km single-mode fiber-28（SMF-28）. Intra-symbol frequency-domain averaging（ISFA） channel response estimation is applied to suppress in-band noise,while discrete Fourier transform-spread（DFT-spread） is used to reduce the peak-to-average power ratio（PAPR） of the transmitted OFDM signal. With the aid of ISFA-based channel estimation and PAPR reduction enabled by DFT-spread,the bit-error ratio of the system after 7 km SMF-28 transmission can be improved from 2×10^-3 to error-free when the received optical power is -8.5 d Bm.展开更多
A contour shape descriptor based on discrete Fourier transform （DFT） and a K-means al- gorithm modified self-organizing feature map （SOFM） neural network are established for shape clus- tering. The given shape is ...A contour shape descriptor based on discrete Fourier transform （DFT） and a K-means al- gorithm modified self-organizing feature map （SOFM） neural network are established for shape clus- tering. The given shape is first sampled uniformly in the polar coordinate. Then the discrete series is transformed to frequency domain and constructed to a shape characteristics vector. Firstly, sample set is roughly clustered using SOFM neural network to reduce the scale of samples. K-means algo- rithm is then applied to improve the performance of SOFM neural network and process the accurate clustering. K-means algorithm also increases the controllability of the clustering. The K-means algo- rithm modified SOFM neural network is used to cluster the shape characteristics vectors which is previously constructed. With leaf shapes as an example, the simulation results show that this method is effective to cluster the contour shapes.展开更多
By introducing a form of reorder for multidimensional data, we propose a unified fast algo-rithm that jointly employs one-dimensional W transform and multidimensional discrete polynomial trans-form to compute eleven t...By introducing a form of reorder for multidimensional data, we propose a unified fast algo-rithm that jointly employs one-dimensional W transform and multidimensional discrete polynomial trans-form to compute eleven types of multidimensional discrete orthogonal transforms, which contain three types of m-dimensional discrete cosine transforms ( m-D DCTs) ,four types of m-dimensional discrete W transforms ( m-D DWTs) ( m-dimensional Hartley transform as a special case), and four types of generalized discrete Fourier transforms ( m-D GDFTs). For real input, the number of multiplications for all eleven types of the m-D discrete orthogonal transforms needed by the proposed algorithm are only 1/m times that of the commonly used corresponding row-column methods, and for complex input, it is further reduced to 1/(2m) times. The number of additions required is also reduced considerably. Furthermore, the proposed algorithm has a simple computational structure and is also easy to be im-plemented on computer, and the numerical experiments show that the computational efficiency is con-sistent with the theoretic analysis.展开更多
分析了R ife算法的性能,指出当信号频率位于离散傅里叶变换(D iscrete Fourier T ransform,DFT)两个相邻量化频率点的中心区域时,R ife算法精度很高,其均方根误差接近克拉美-罗限(C ram er-R ao Low er Bound,CRLB),但当信号频率位于量...分析了R ife算法的性能,指出当信号频率位于离散傅里叶变换(D iscrete Fourier T ransform,DFT)两个相邻量化频率点的中心区域时,R ife算法精度很高,其均方根误差接近克拉美-罗限(C ram er-R ao Low er Bound,CRLB),但当信号频率位于量化频率点附近时,R ife算法精度降低。本文提出了一种修正R ife(M-R ife)算法,通过对信号进行频移,使新信号的频率位于两个相邻量化频率点的中心区域,然后再利用R ife算法进行频率估计。仿真结果表明本算法性能不随被估计信号的频率分布而产生波动,整体性能优于牛顿迭代法(一次迭代),接近二次迭代,在低信噪比条件下不存在发散问题,性能比牛顿迭代稳定。本算法易于硬件实现。展开更多
文摘In this paper, we have proved that the lower bound of the number of real multiplications for computing a length 2(t) real GFT(a,b) (a = +/-1/2, b = 0 or b = +/-1/2, a = 0) is 2(t+1) - 2t - 2 and that for computing a length 2t real GFT(a,b)(a = +/-1/2, b = +/-1/2) is 2(t+1) - 2. Practical algorithms which meet the lower bounds of multiplications are given.
基金Postgraduate Research&Practice Innovation Program of Jiangsu Province(SJCX18_0103,KYCX18_0293)China NSF Grants(61371169,61601167,61601504)+2 种基金Jiangsu NSF(BK20161489)the open research fund of State Key Laboratory of Millimeter Waves,Southeast University(No.K201826)the Fundamental Research Funds for the Central Universities(NO.NE2017103).
文摘Unmanned Aerial Vehicle(UAV)equipped with uniform linear array has been applied to multiple emitters localization.Meanwhile,nested linear array enables to enhance localization resolution and achieve under-determined Direction of Arrival(DOA)estimation.In this paper,we propose a new system structure for emitters localization that combines the UAV with nested linear array,which is capable of significantly increasing the positioning accuracy of interested targets.Specifically,a localization scheme is designed to obtain the paired two-dimensional DOA(2D-DOA,i.e.azimuth and elevation angles)estimates of emitters by nested linear array with UAV.Furthermore,we propose an improved DOA estimation algorithm for emitters localization that utilizes Discrete Fourier Transform(DFT)method to obtain coarse DOA estimates,subsequently,achieve the fine DOA estimates by sparse representation.The proposed algorithm has lower computational complexity because the coarse DOA estimates enable to shrink the range of over-complete dictionary of sparse representation.In addition,compared to traditional uniform linear array,improved 2D-DOA estimation performance of emitters can be obtained with a nested linear array.Extensive simulation results testify the effectiveness of the proposed method.
基金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,
文摘The Fourier transform is very important to numerous applications in science and engineering. However, its usefulness is hampered by its computational expense. In this paper, in an attempt to develop a faster method for computing Fourier transforms, the authors present parallel implementations of two new algorithms developed for the type IV Discrete Cosine Transform （DCT-IV） which support the new interleaved fast Fourier transform method. The authors discuss the realizations of their implementations using two paradigms. The first involved commodity equipment and the Message-Passing Interface （MPI） library. The second utilized the RapidMind development platform and the Cell Broadband Engine （BE） processor. These experiments indicate that the authors＇ rotation-based algorithm is preferable to their lifting-based algorithm on the platforms tested, with increased efficiency demonstrated by their MPI implementation for large data sets. Finally, the authors outline future work by discussing an architecture-oriented method for computing DCT-IVs which promises further optimization. The results indicate a promising fresh direction in the search for efficient ways to compute Fourier transforms.
文摘We experimentally demonstrate a direct-detection orthogonal-frequency-division-multiplexing quadraturephase-shift-keying（OFDM-QPSK） system that is capable of delivering a 32 Gbaud OFDM-QPSK signal over7 km single-mode fiber-28（SMF-28）. Intra-symbol frequency-domain averaging（ISFA） channel response estimation is applied to suppress in-band noise,while discrete Fourier transform-spread（DFT-spread） is used to reduce the peak-to-average power ratio（PAPR） of the transmitted OFDM signal. With the aid of ISFA-based channel estimation and PAPR reduction enabled by DFT-spread,the bit-error ratio of the system after 7 km SMF-28 transmission can be improved from 2×10^-3 to error-free when the received optical power is -8.5 d Bm.
基金Supported by Guangdong Province Key Science and TechnologyItem(2011A010801005,2010A080402015)the National NaturalScience Foundation of China(61171142)
文摘A contour shape descriptor based on discrete Fourier transform （DFT） and a K-means al- gorithm modified self-organizing feature map （SOFM） neural network are established for shape clus- tering. The given shape is first sampled uniformly in the polar coordinate. Then the discrete series is transformed to frequency domain and constructed to a shape characteristics vector. Firstly, sample set is roughly clustered using SOFM neural network to reduce the scale of samples. K-means algo- rithm is then applied to improve the performance of SOFM neural network and process the accurate clustering. K-means algorithm also increases the controllability of the clustering. The K-means algo- rithm modified SOFM neural network is used to cluster the shape characteristics vectors which is previously constructed. With leaf shapes as an example, the simulation results show that this method is effective to cluster the contour shapes.
基金This work was supported by the National Natural Science Foundation of China (Grant No. 69974041).
文摘By introducing a form of reorder for multidimensional data, we propose a unified fast algo-rithm that jointly employs one-dimensional W transform and multidimensional discrete polynomial trans-form to compute eleven types of multidimensional discrete orthogonal transforms, which contain three types of m-dimensional discrete cosine transforms ( m-D DCTs) ,four types of m-dimensional discrete W transforms ( m-D DWTs) ( m-dimensional Hartley transform as a special case), and four types of generalized discrete Fourier transforms ( m-D GDFTs). For real input, the number of multiplications for all eleven types of the m-D discrete orthogonal transforms needed by the proposed algorithm are only 1/m times that of the commonly used corresponding row-column methods, and for complex input, it is further reduced to 1/(2m) times. The number of additions required is also reduced considerably. Furthermore, the proposed algorithm has a simple computational structure and is also easy to be im-plemented on computer, and the numerical experiments show that the computational efficiency is con-sistent with the theoretic analysis.
