将加速度负反馈(negative acceleration feedback,NAF)控制器与最小均方自适应滤波(filtered-x least mean square,FxLMS)算法相结合,提出了一种改进的反馈式次级通道阻尼补偿方法,来提高FxLMS控制器的性能。针对垂尾模型低阶模态抖振...将加速度负反馈(negative acceleration feedback,NAF)控制器与最小均方自适应滤波(filtered-x least mean square,FxLMS)算法相结合,提出了一种改进的反馈式次级通道阻尼补偿方法,来提高FxLMS控制器的性能。针对垂尾模型低阶模态抖振响应的控制问题,设计NAF控制器对次级通道进行反馈式阻尼补偿,建立了多模态的NAF-FxLMS控制器,随后开展垂尾抖振响应主动控制的地面模拟实验。实验结果表明,相比于单独的FxLMS控制器或NAF控制器,NAF-FxLMS控制器对垂尾抖振响应具有更好的控制效果。展开更多
In this paper, based on the implementation of semiclassical quantum Fourier transform, we first propose the concept of generation vector of ternary binary representation, construct the generation function's truth ...In this paper, based on the implementation of semiclassical quantum Fourier transform, we first propose the concept of generation vector of ternary binary representation, construct the generation function's truth table, prove that the generation vector of ternary binary representation is one kind of k 's NAF representation and further find that its number of nonzero is not more than [(「logk」+1) /2]. Then we redesign a quantum circuit for Shor's algorithm, whose computation resource is approximately equal to that of Parker (Their requirements of elementary quantum gate are both O (「logN」3), and our circuit requires 2 qubits more than Parker's). However, our circuit is twice as fast as Parker's.展开更多
文摘将加速度负反馈(negative acceleration feedback,NAF)控制器与最小均方自适应滤波(filtered-x least mean square,FxLMS)算法相结合,提出了一种改进的反馈式次级通道阻尼补偿方法,来提高FxLMS控制器的性能。针对垂尾模型低阶模态抖振响应的控制问题,设计NAF控制器对次级通道进行反馈式阻尼补偿,建立了多模态的NAF-FxLMS控制器,随后开展垂尾抖振响应主动控制的地面模拟实验。实验结果表明,相比于单独的FxLMS控制器或NAF控制器,NAF-FxLMS控制器对垂尾抖振响应具有更好的控制效果。
基金supported by the National Natural Science Foundation of China (10501053)
文摘In this paper, based on the implementation of semiclassical quantum Fourier transform, we first propose the concept of generation vector of ternary binary representation, construct the generation function's truth table, prove that the generation vector of ternary binary representation is one kind of k 's NAF representation and further find that its number of nonzero is not more than [(「logk」+1) /2]. Then we redesign a quantum circuit for Shor's algorithm, whose computation resource is approximately equal to that of Parker (Their requirements of elementary quantum gate are both O (「logN」3), and our circuit requires 2 qubits more than Parker's). However, our circuit is twice as fast as Parker's.
