To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. ...To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.展开更多
To overcome the difficulty of realizing large-scale quantum Fourier transform(QFT) within existing technology, this paper implements a resource-saving method(named t-bit semiclassical QFT over Z_(2~n)), which could re...To overcome the difficulty of realizing large-scale quantum Fourier transform(QFT) within existing technology, this paper implements a resource-saving method(named t-bit semiclassical QFT over Z_(2~n)), which could realize large-scale QFT using an arbitrary-scale quantum register. By developing a feasible method to realize the control quantum gate Rk, we experimentally realize the 2-bit semiclassical QFT over Z_(2~3) on IBM's quantum cloud computer, which shows the feasibility of the method. Then, we compare the actual performance of 2-bit semiclassical QFT with standard QFT in the experiments.The squared statistical overlap experimental data shows that the fidelity of 2-bit semiclassical QFT is higher than that of standard QFT, which is mainly due to fewer two-qubit gates in the semiclassical QFT. Furthermore, based on the proposed method, N = 15 is successfully factorized by implementing Shor's algorithm.展开更多
Since the difficulty in preparing the equal superposition state of amplitude is 1/√N, we construct a quantile transform of quantum Fourier transform （QFT） over ZN based on the elementary transforms, such as Hadamar...Since the difficulty in preparing the equal superposition state of amplitude is 1/√N, we construct a quantile transform of quantum Fourier transform （QFT） over ZN based on the elementary transforms, such as Hadamard transform and Pauli transform. The QFT over Z_N can then be realized by the quantile transform, and used to further design its quantum circuit and analyze the requirements for the quantum register and quantum gates. However, the transform needs considerable quantum computational resources and it is difficult to construct a high-dimensional quantum register. Hence, we investigate the design of t-bit quantile transform, and introduce the definition of t-bit semiclassical QFT over Z_N. According to probability amplitude, we prove that the transform can be used to realize QFT over ZN and further design its quantum circuit. For this transform, the requirements for the quantum register, the one-qubit gate, and two-qubit gate reduce obviously when compared with those for the QFT over Z_N.展开更多
Traditional short-time fractional Fourier transform(STFrFT)has a single and fixed window function,which can not be adjusted adaptively according to the characteristics of fre-quency and frequency change rate.In order ...Traditional short-time fractional Fourier transform(STFrFT)has a single and fixed window function,which can not be adjusted adaptively according to the characteristics of fre-quency and frequency change rate.In order to overcome the shortcomings,the STFrFT method with adaptive window function is proposed.In this method,the window function of STFrFT is ad-aptively adjusted by establishing a library containing multiple window functions and taking the minimum information entropy as the criterion,so as to obtain a time-frequency distribution that better matches the desired signal.This method takes into account the time-frequency resolution characteristics of STFrFT and the excellent characteristics of adaptive adjustment to window func-tion,improves the time-frequency aggregation on the basis of eliminating cross term interference,and provides a new tool for improving the time-frequency analysis ability of complex modulated sig-nals.展开更多
To address the low-resolution imaging problem in relation to traditional Range Doppler(RD)algorithm,this paper intends to propose a new algorithm based on Fractional Fourier Transform(FrFT),which proves highly advanta...To address the low-resolution imaging problem in relation to traditional Range Doppler(RD)algorithm,this paper intends to propose a new algorithm based on Fractional Fourier Transform(FrFT),which proves highly advantageous in the acquisition of high-resolution Synthetic Aperture Radar(SAR)images.The expression of the optimal order of SAR range signals using FrFT is deduced in detail,and the corresponding expression of the azimuth signal is also given.Theoretical analysis shows that,the optimal order in range(azimuth)direction,which turns out to be very unique,depends on the known imaging parameters of SAR,therefore the engineering practicability of FrFT-RD algorithm can be greatly improved without the need of order iteration.The FrFT-RD algorithm is established after an analysis of the optimal time-frequency transform.Experimental results demonstrate that,compared with traditional RD algorithm,the main-lobe width of the peak-point target of FrFT-RD algorithm is narrow in both range and azimuth directions.While the peak amplitude of the first side-lobe is reduced significantly,those of other side-lobes also drop in various degrees.In this way,the imaging resolution of range and azimuth can be increased considerably.展开更多
A scheme for implementing discrete quantum Fourier transform is proposed via quantum dots embedded in a microcavity, and then some of its applications are investigated, i.e., Deutsch 3ozsa. algorithm and Shor＇s quant...A scheme for implementing discrete quantum Fourier transform is proposed via quantum dots embedded in a microcavity, and then some of its applications are investigated, i.e., Deutsch 3ozsa. algorithm and Shor＇s quantum factoring. In particular, the detailed process of implementing one^qubit Deutsch Jozsa algorithm and the factorization of N = 15 are given. The microcavity mode is only virtually excited in the whole interaction, so the effective decoherent has slight effect on the current scheme. These schemes would be an important step to fabricate a solid quantum computer.展开更多
We propose a novel, lossless compression algorithm, based on the 2D Discrete Fast Fourier Transform, to approximate the Algorithmic (Kolmogorov) Complexity of Elementary Cellular Automata. Fast Fourier transforms are ...We propose a novel, lossless compression algorithm, based on the 2D Discrete Fast Fourier Transform, to approximate the Algorithmic (Kolmogorov) Complexity of Elementary Cellular Automata. Fast Fourier transforms are widely used in image compression but their lossy nature exclude them as viable candidates for Kolmogorov Complexity approximations. For the first time, we present a way to adapt fourier transforms for lossless image compression. The proposed method has a very strong Pearsons correlation to existing complexity metrics and we further establish its consistency as a complexity metric by confirming its measurements never exceed the complexity of nothingness and randomness (representing the lower and upper limits of complexity). Surprisingly, many of the other methods tested fail this simple sanity check. A final symmetry-based test also demonstrates our method’s superiority over existing lossless compression metrics. All complexity metrics tested, as well as the code used to generate and augment the original dataset, can be found in our github repository: ECA complexity metrics<sup>1</sup>.展开更多
To address the problem of identifying multiple types of additives in lubricating oil,a method based on midinfrared spectral band selection using the eXtreme Gradient Boosting(XGBoost)algorithm combined with the ant co...To address the problem of identifying multiple types of additives in lubricating oil,a method based on midinfrared spectral band selection using the eXtreme Gradient Boosting(XGBoost)algorithm combined with the ant colony optimization(ACO)algorithm is proposed.The XGBoost algorithm was used to train and test three additives,T534(alkyl diphenylamine),T308(isooctyl acid thiophospholipid octadecylamine),and T306(trimethylphenol phosphate),separately,in order to screen for the optimal combination of spectral bands for each additive.The ACO algorithm was used to optimize the parameters of the XGBoost algorithm to improve the identification accuracy.During this process,the support vector machine(SVM)and hybrid bat algorithms(HBA)were included as a comparison,generating four models:ACO-XGBoost,ACO-SVM,HBA-XGboost,and HBA-SVM.The results showed that all four models could identify the three additives efficiently,with the ACO-XGBoost model achieving 100%recognition of all three additives.In addition,the generalizability of the ACO-XGBoost model was further demonstrated by predicting a lubricating oil containing the three additives prepared in our laboratory and a collected sample of commercial oil currently in use。展开更多
基金the National Natural Science Foundation of China (90407007 60372001).
文摘To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.
基金Project supported by the National Basic Research Program of China(Grant No.2013CB338002)the National Natural Science Foundation of China(Grant No.61502526)
文摘To overcome the difficulty of realizing large-scale quantum Fourier transform(QFT) within existing technology, this paper implements a resource-saving method(named t-bit semiclassical QFT over Z_(2~n)), which could realize large-scale QFT using an arbitrary-scale quantum register. By developing a feasible method to realize the control quantum gate Rk, we experimentally realize the 2-bit semiclassical QFT over Z_(2~3) on IBM's quantum cloud computer, which shows the feasibility of the method. Then, we compare the actual performance of 2-bit semiclassical QFT with standard QFT in the experiments.The squared statistical overlap experimental data shows that the fidelity of 2-bit semiclassical QFT is higher than that of standard QFT, which is mainly due to fewer two-qubit gates in the semiclassical QFT. Furthermore, based on the proposed method, N = 15 is successfully factorized by implementing Shor's algorithm.
基金Project supported by the National Basic Research Program of China (Grant No.2013CB338002)
文摘Since the difficulty in preparing the equal superposition state of amplitude is 1/√N, we construct a quantile transform of quantum Fourier transform （QFT） over ZN based on the elementary transforms, such as Hadamard transform and Pauli transform. The QFT over Z_N can then be realized by the quantile transform, and used to further design its quantum circuit and analyze the requirements for the quantum register and quantum gates. However, the transform needs considerable quantum computational resources and it is difficult to construct a high-dimensional quantum register. Hence, we investigate the design of t-bit quantile transform, and introduce the definition of t-bit semiclassical QFT over Z_N. According to probability amplitude, we prove that the transform can be used to realize QFT over ZN and further design its quantum circuit. For this transform, the requirements for the quantum register, the one-qubit gate, and two-qubit gate reduce obviously when compared with those for the QFT over Z_N.
基金supported by the National Natural Science Found-ation of China(No.61571454)Special Fund for Taishan Scholar Project(No.201712072)。
文摘Traditional short-time fractional Fourier transform(STFrFT)has a single and fixed window function,which can not be adjusted adaptively according to the characteristics of fre-quency and frequency change rate.In order to overcome the shortcomings,the STFrFT method with adaptive window function is proposed.In this method,the window function of STFrFT is ad-aptively adjusted by establishing a library containing multiple window functions and taking the minimum information entropy as the criterion,so as to obtain a time-frequency distribution that better matches the desired signal.This method takes into account the time-frequency resolution characteristics of STFrFT and the excellent characteristics of adaptive adjustment to window func-tion,improves the time-frequency aggregation on the basis of eliminating cross term interference,and provides a new tool for improving the time-frequency analysis ability of complex modulated sig-nals.
基金supported by the 13th Five-Year Plan for Jiangsu Education Science(D/2020/01/22)JSPIGKZ(JSPI19GKZL405)Natural Science Research Projects of Colleges and Universities in Jiangsu Province(19KJB510022).
文摘To address the low-resolution imaging problem in relation to traditional Range Doppler(RD)algorithm,this paper intends to propose a new algorithm based on Fractional Fourier Transform(FrFT),which proves highly advantageous in the acquisition of high-resolution Synthetic Aperture Radar(SAR)images.The expression of the optimal order of SAR range signals using FrFT is deduced in detail,and the corresponding expression of the azimuth signal is also given.Theoretical analysis shows that,the optimal order in range(azimuth)direction,which turns out to be very unique,depends on the known imaging parameters of SAR,therefore the engineering practicability of FrFT-RD algorithm can be greatly improved without the need of order iteration.The FrFT-RD algorithm is established after an analysis of the optimal time-frequency transform.Experimental results demonstrate that,compared with traditional RD algorithm,the main-lobe width of the peak-point target of FrFT-RD algorithm is narrow in both range and azimuth directions.While the peak amplitude of the first side-lobe is reduced significantly,those of other side-lobes also drop in various degrees.In this way,the imaging resolution of range and azimuth can be increased considerably.
基金Supported by National Natural Science Foundation of China (NSFC) under Grant Nos.60678022 and 10704001the Specialized Research Fund for the Doctoral Program of Higher Education under Grant No.20060357008+1 种基金Anhui Provincial Natural Science Foundation under Grant No.070412060the Program of the Education Department of Anhui Province under Grant Nos.KJ2008A28ZC,KJ2008B83ZC,KJ2008B265,and 2009A048Z
文摘A scheme for implementing discrete quantum Fourier transform is proposed via quantum dots embedded in a microcavity, and then some of its applications are investigated, i.e., Deutsch 3ozsa. algorithm and Shor＇s quantum factoring. In particular, the detailed process of implementing one^qubit Deutsch Jozsa algorithm and the factorization of N = 15 are given. The microcavity mode is only virtually excited in the whole interaction, so the effective decoherent has slight effect on the current scheme. These schemes would be an important step to fabricate a solid quantum computer.
文摘We propose a novel, lossless compression algorithm, based on the 2D Discrete Fast Fourier Transform, to approximate the Algorithmic (Kolmogorov) Complexity of Elementary Cellular Automata. Fast Fourier transforms are widely used in image compression but their lossy nature exclude them as viable candidates for Kolmogorov Complexity approximations. For the first time, we present a way to adapt fourier transforms for lossless image compression. The proposed method has a very strong Pearsons correlation to existing complexity metrics and we further establish its consistency as a complexity metric by confirming its measurements never exceed the complexity of nothingness and randomness (representing the lower and upper limits of complexity). Surprisingly, many of the other methods tested fail this simple sanity check. A final symmetry-based test also demonstrates our method’s superiority over existing lossless compression metrics. All complexity metrics tested, as well as the code used to generate and augment the original dataset, can be found in our github repository: ECA complexity metrics<sup>1</sup>.
基金the Beijing Natural Science Foundation(Grant No.2232066)the Open Project Foundation of State Key Laboratory of Solid Lubrication(Grant LSL-2212).
文摘To address the problem of identifying multiple types of additives in lubricating oil,a method based on midinfrared spectral band selection using the eXtreme Gradient Boosting(XGBoost)algorithm combined with the ant colony optimization(ACO)algorithm is proposed.The XGBoost algorithm was used to train and test three additives,T534(alkyl diphenylamine),T308(isooctyl acid thiophospholipid octadecylamine),and T306(trimethylphenol phosphate),separately,in order to screen for the optimal combination of spectral bands for each additive.The ACO algorithm was used to optimize the parameters of the XGBoost algorithm to improve the identification accuracy.During this process,the support vector machine(SVM)and hybrid bat algorithms(HBA)were included as a comparison,generating four models:ACO-XGBoost,ACO-SVM,HBA-XGboost,and HBA-SVM.The results showed that all four models could identify the three additives efficiently,with the ACO-XGBoost model achieving 100%recognition of all three additives.In addition,the generalizability of the ACO-XGBoost model was further demonstrated by predicting a lubricating oil containing the three additives prepared in our laboratory and a collected sample of commercial oil currently in use。
