Dear editor,Chaotic maps have good characteristics, which include randomness, sensitivity to the initial value,and unpredictability. Hence, there have been many attempts to discuss the dynamic behavior of chaotic maps...
详细信息
Dear editor,Chaotic maps have good characteristics, which include randomness, sensitivity to the initial value,and unpredictability. Hence, there have been many attempts to discuss the dynamic behavior of chaotic maps in the field of chaotic ***, the limited computation, finite memory,
In this paper, we investigate the physical-layer secrecy outage performance of underlay spectrum sharing systems over Rayleigh and log-normal fading channels in the presence of one eavesdropper. In particular, the sec...
详细信息
In this paper, we investigate the physical-layer secrecy outage performance of underlay spectrum sharing systems over Rayleigh and log-normal fading channels in the presence of one eavesdropper. In particular, the secondary transmitter sends data to the legitimate receiver under the constraints of the interference temperature at the primary receiver, while suffering the wiretap from the eavesdropper. Closed-form and approximated expressions are derived for the secrecy outage probability over Rayleigh and log-normal fading channels,respectively. The accuracy of our performance analysis is verified by simulation results.
Dear editor,Adaptive filtering algorithms have been widely applied in system identification, channel equalization, and echo cancellation over the past decades [1–3]. Generally, adaptive filtering algorithms can be ge...
详细信息
Dear editor,Adaptive filtering algorithms have been widely applied in system identification, channel equalization, and echo cancellation over the past decades [1–3]. Generally, adaptive filtering algorithms can be generalized by the least mean square(LMS)-based algorithms. According to the shape
Restoring blurred images to clear images is a challenging problem. Most previous methods only analyzed the single image. However, for motion blurring, this method missed the key trajectory description process. Based o...
详细信息
Dear editor,Signal processing algorithms are generally used to identify an unknown system, and can be classified as batch algorithms and online learning algorithms(OLAs). Batch algorithms are applied to offline scenar...
详细信息
Dear editor,Signal processing algorithms are generally used to identify an unknown system, and can be classified as batch algorithms and online learning algorithms(OLAs). Batch algorithms are applied to offline scenarios that require all data being available. In real-time applications, because information is pro-
The Huber adaptive filter is robust both in the Gaussian and non-Gaussian noise *** correntropy induced metric(CIM) is an excellent approximator of the l-norm and can be used as a sparsity penalty ***,a novel sparse...
详细信息
ISBN:
(纸本)9781509009107
The Huber adaptive filter is robust both in the Gaussian and non-Gaussian noise *** correntropy induced metric(CIM) is an excellent approximator of the l-norm and can be used as a sparsity penalty ***,a novel sparse method based on the Huber cost with CIM constraint(CIM-Huber) is developed for sparse system identification in this *** comparison,the Huber cost functions with zero-attracting penalty(ZA-Huber) and reweighted zero-attracting penalty(RZA-Huber) algorithm are discussed *** results show that the proposed CIM-Huber has a better performance in the identification of sparse systems than the ZA-Huber and the RZA-Huber,and can also be applied to system identification under the cases of various noise environments.
Based on the Gaussian process(GP) regression,the relationship between the input-output pair can be modeled by the sum of the Gaussian noise and an unknown latent function evaluated on an input(LFEI).The acquisition of...
详细信息
ISBN:
(纸本)9781538629185
Based on the Gaussian process(GP) regression,the relationship between the input-output pair can be modeled by the sum of the Gaussian noise and an unknown latent function evaluated on an input(LFEI).The acquisition of LFEI is thus essentially *** this paper,a novel algorithm called kernel least mean square with tracking(KLMS-T) is proposed to estimate *** on the existing kernel least mean square(KLMS) that is a simple and efficient kernel adaptive filtering algorithm,the proposed KLMS-T utilizes the framework of Bayesian inference to estimate LFEI from the function-space *** show that compared with LMS and KLMS,KLMS-T achieves better filtering performance in terms of the convergence rate and the steady state mean square error.
This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensu...
详细信息
This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensus algorithm(DPCA) is developed. To avoid continuous communication between neighboring agents, a kind of intermittent communication strategy depending on an event-triggered function is established in our DPCA. Based on our algorithm, we carry out the detailed analysis including its convergence, its accuracy, its privacy and the trade-off between the accuracy and the privacy level, respectively. It is found that our algorithm preserves the privacy of initial states of all agents in the whole process of consensus computation. The trade-off motivates us to find the best achievable accuracy of our algorithm under the free parameters and the fixed privacy level. Finally, numerical experiment results testify the validity of our theoretical analysis.
In this paper, time slot technology is designed based on the single forgetting memristor synapse with single voltage source to read and write the forgetting memristor crossbar array. The amplitude of the voltage sourc...
详细信息
The Nesterov accelerated dynamical approach serves as an essential tool for addressing convex optimization problems with accelerated convergence *** previous studies in this field have primarily concentrated on uncons...
详细信息
The Nesterov accelerated dynamical approach serves as an essential tool for addressing convex optimization problems with accelerated convergence *** previous studies in this field have primarily concentrated on unconstrained smooth con-vex optimization *** this paper,on the basis of primal-dual dynamical approach,Nesterov accelerated dynamical approach,projection operator and directional gradient,we present two accelerated primal-dual projection neurodynamic approaches with time scaling to address convex optimization problems with smooth and nonsmooth objective functions subject to linear and set constraints,which consist of a second-order ODE(ordinary differential equation)or differential conclusion system for the primal variables and a first-order ODE for the dual *** satisfying specific conditions for time scaling,we demonstrate that the proposed approaches have a faster conver-gence *** only requires assuming convexity of the objective *** validate the effectiveness of our proposed two accel-erated primal-dual projection neurodynamic approaches through numerical experiments.
暂无评论