针对机载设备的BIT系统,提出了一种改进的LMS(Least Mean Squares)算法,该算法主要应用于故障检测和定位方面。通过引入自适应学习率控制、加速收敛和稳定性优化技术手段,该算法能够显著提升BIT系统中的信号处理性能,加快故障检测和定...针对机载设备的BIT系统,提出了一种改进的LMS(Least Mean Squares)算法,该算法主要应用于故障检测和定位方面。通过引入自适应学习率控制、加速收敛和稳定性优化技术手段,该算法能够显著提升BIT系统中的信号处理性能,加快故障检测和定位速度,并提高系统的准确性和稳定性。在故障检测方面,改进的LMS算法可以有效地识别故障信号并进行分类和定位。通过对输入信号进行预处理和模型参数的优化,改进LMS算法能够更准确地捕捉异常信号特征,从而实现对故障的快速检测和定位,提高BIT系统的可靠性和故障诊断能力。同时,改进的LMS算法还应用于BIT系统中的自适应滤波模块,用于消除噪声和滤除干扰信号。通过采用自适应学习率控制和加速收敛技术,改进算法能够智能地调整滤波参数,有效抑制噪声和干扰信号,提高BIT系统对故障信号的识别和定位能力。通过实验验证,改进的LMS算法在机载设备的BIT系统中表现出较好的应用潜力。该算法相比传统LMS算法,在故障检测和定位准确性、故障诊断速度以及系统稳定性方面均取得了显著的改善。展开更多
当前美国国家标准与技术研究院(National Institute of Standards and Technology,NIST)对后量子密码(Post-Quantum Cryptography,PQC)标准化方案的评估已进入第四轮,位翻转密钥封装(Bit Flipping Key Encapsulation,BIKE)协议是目前被...当前美国国家标准与技术研究院(National Institute of Standards and Technology,NIST)对后量子密码(Post-Quantum Cryptography,PQC)标准化方案的评估已进入第四轮,位翻转密钥封装(Bit Flipping Key Encapsulation,BIKE)协议是目前被评估的四个候选方案之一.在BIKE的密钥生成算法中,多项式乘法作为众多密码系统中特别耗时的操作之一,耗费了大量的时间和面积资源.针对此问题,本文设计了一种基于Karatsuba算法(Karatsuba Algorithm,KA)的无交叠多项式乘法器,可高效实现万级比特位宽的多项式乘法,具有低时延、高性能和面积小的特点.同时,本文将该优化乘法器应用于BIKE密钥生成算法中,并基于现场可编程门阵列(Field Programmable Gate Array,FPGA)对其进行硬件架构实现,改进了原有的紧凑多项式乘法和多项式求逆算法.本文提出的乘法器通过采用不同的操作数位宽,可适应对面积和延时的不同需求.与BIKE原本的设计相比,改进的设计使密钥生成模块的延时减小了36.54%,面积延迟积(Area Delay Production,ADP)减小了10.4%.展开更多
In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated wit...In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.展开更多
In order to minimize the transmitted power in the multi-user orthogonal frequency division multiplexing（OFDM） system, a scheme combining the improved particle swarm optimization（POS） algorithm with genetic algori...In order to minimize the transmitted power in the multi-user orthogonal frequency division multiplexing（OFDM） system, a scheme combining the improved particle swarm optimization（POS） algorithm with genetic algorithm（GA） is proposed to optimize the sub-carriers and bits allocation. In the algorithm, a random velocity between the maximum and minimum particle velocity is used as the updating velocity instead of maximum or minimum velocity when the updated particle velocity is higher than the maximum particle velocity or lower than the minimum particle velocity. Then, the convergence population is used as the initial population of the genetic algorithm to optimize the subcarriers and bits allocation further. Simulation results show that the transmitted power of the proposed algorithm is about 2 d B to 10 d B lower than that of the genetic algorithm, particle swarm optimization algorithm, and Zhang＇s algorithm.展开更多
It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） re...It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） relatively small and to reduce the decoding complexity. While there are also other adaptive techniques, where the decoder＇s LRBs adapt to the external parameter of the decoder like SNR （Signal Noise Ratio） level, a novel adaptive algorithm for BTC based on the statistics of an internal variable of the decoder itself is proposed in this paper. Different from the previous reported results, it collects the statistics of the multiplicity of the candidate sequences, i.e., the number of the same candidate sequences with the same minimum squared Euclidean distance resulted from the decoding of test sequences. It is shown by Monte Carlo simulations that the proposed adaptive algorithm has only about 0.02dB coding loss but the average complexity of the proposed algorithm is about 42% less compared with Pyndiah＇s iterative decoding algorithm using the fixed LRBs parameter.展开更多
In this article, we consider the faster than Nyquist(FTN) technology in aspects of the application of the Viterbi algorithm(VA). Finite in time optimal FTN signals are used to provide a symbol rate higher than the &qu...In this article, we consider the faster than Nyquist(FTN) technology in aspects of the application of the Viterbi algorithm(VA). Finite in time optimal FTN signals are used to provide a symbol rate higher than the "Nyquist barrier" without any encoding. These signals are obtained as the solutions of the corresponding optimization problem. Optimal signals are characterized by intersymbol interference(ISI). This fact leads to significant bit error rate(BER) performance degradation for "classical" forms of signals. However, ISI can be controlled by the restriction of the optimization problem. So we can use optimal signals in conditions of increased duration and an increased symbol rate without significant energy losses. The additional symbol rate increase leads to the increase of the reception algorithm complexity. We consider the application of VA for optimal FTN signals reception. The application of VA for receiving optimal FTN signals with increased duration provides close to the potential performance of BER,while the symbol rate is twice above the Nyquist limit.展开更多
文摘针对机载设备的BIT系统,提出了一种改进的LMS(Least Mean Squares)算法,该算法主要应用于故障检测和定位方面。通过引入自适应学习率控制、加速收敛和稳定性优化技术手段,该算法能够显著提升BIT系统中的信号处理性能,加快故障检测和定位速度,并提高系统的准确性和稳定性。在故障检测方面,改进的LMS算法可以有效地识别故障信号并进行分类和定位。通过对输入信号进行预处理和模型参数的优化,改进LMS算法能够更准确地捕捉异常信号特征,从而实现对故障的快速检测和定位,提高BIT系统的可靠性和故障诊断能力。同时,改进的LMS算法还应用于BIT系统中的自适应滤波模块,用于消除噪声和滤除干扰信号。通过采用自适应学习率控制和加速收敛技术,改进算法能够智能地调整滤波参数,有效抑制噪声和干扰信号,提高BIT系统对故障信号的识别和定位能力。通过实验验证,改进的LMS算法在机载设备的BIT系统中表现出较好的应用潜力。该算法相比传统LMS算法,在故障检测和定位准确性、故障诊断速度以及系统稳定性方面均取得了显著的改善。
基金supported by Zhejiang Provincial Key Laboratory of Communication Networks and Applications and National Natural Science Foundation of China under Grant No.60872020
文摘In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.
基金supported by the National Natural Science Foundation of China under Grant No.61371112
文摘In order to minimize the transmitted power in the multi-user orthogonal frequency division multiplexing（OFDM） system, a scheme combining the improved particle swarm optimization（POS） algorithm with genetic algorithm（GA） is proposed to optimize the sub-carriers and bits allocation. In the algorithm, a random velocity between the maximum and minimum particle velocity is used as the updating velocity instead of maximum or minimum velocity when the updated particle velocity is higher than the maximum particle velocity or lower than the minimum particle velocity. Then, the convergence population is used as the initial population of the genetic algorithm to optimize the subcarriers and bits allocation further. Simulation results show that the transmitted power of the proposed algorithm is about 2 d B to 10 d B lower than that of the genetic algorithm, particle swarm optimization algorithm, and Zhang＇s algorithm.
基金the National Natural Science Foundation of China under grants，NUAA research funding
文摘It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） relatively small and to reduce the decoding complexity. While there are also other adaptive techniques, where the decoder＇s LRBs adapt to the external parameter of the decoder like SNR （Signal Noise Ratio） level, a novel adaptive algorithm for BTC based on the statistics of an internal variable of the decoder itself is proposed in this paper. Different from the previous reported results, it collects the statistics of the multiplicity of the candidate sequences, i.e., the number of the same candidate sequences with the same minimum squared Euclidean distance resulted from the decoding of test sequences. It is shown by Monte Carlo simulations that the proposed adaptive algorithm has only about 0.02dB coding loss but the average complexity of the proposed algorithm is about 42% less compared with Pyndiah＇s iterative decoding algorithm using the fixed LRBs parameter.
基金supported by the Grant of the President of the Russian Federation for state support of young Russian scientists(agreementМК-1571.2019.8 No.075-15-2019-1155)。
文摘In this article, we consider the faster than Nyquist(FTN) technology in aspects of the application of the Viterbi algorithm(VA). Finite in time optimal FTN signals are used to provide a symbol rate higher than the "Nyquist barrier" without any encoding. These signals are obtained as the solutions of the corresponding optimization problem. Optimal signals are characterized by intersymbol interference(ISI). This fact leads to significant bit error rate(BER) performance degradation for "classical" forms of signals. However, ISI can be controlled by the restriction of the optimization problem. So we can use optimal signals in conditions of increased duration and an increased symbol rate without significant energy losses. The additional symbol rate increase leads to the increase of the reception algorithm complexity. We consider the application of VA for optimal FTN signals reception. The application of VA for receiving optimal FTN signals with increased duration provides close to the potential performance of BER,while the symbol rate is twice above the Nyquist limit.
