The approximate memory improved proportionate affine projection algorithm has been proposed for sparse system identification. This paper presents a fast recursive implementation of this algorithm. Three ideas used pre...
详细信息
The approximate memory improved proportionate affine projection algorithm has been proposed for sparse system identification. This paper presents a fast recursive implementation of this algorithm. Three ideas used previously for other affine projection variants are used: auxiliary coefficients vectors, periodically update of the proportionate coefficients and recursive filtering of the error vector. Simulation results are made in order to show the performance of the algorithm for network echo cancellation example.
Noncooperative parties (NCPs) can directly capture and use the electromagnetic signals from our bistatic radar to achieve covert detection with low power and forwarding deception. Existing methods increase the difficu...
详细信息
ISBN:
(数字)9798331515669
ISBN:
(纸本)9798331515676
Noncooperative parties (NCPs) can directly capture and use the electromagnetic signals from our bistatic radar to achieve covert detection with low power and forwarding deception. Existing methods increase the difficulty for NCPs to extract, classify, and process signals by transmitting complex modulated waveforms, but still cannot prevent waveforms from being utilized. This paper proposes a multidimensional waveform for countering noncooperative utilization in bistatic radar. First, fully use the degrees of freedom of the area array emitter to synthesize the desired signal in a specific azimuth-elevation direction through waveform modulation in the element, time and coding domains. Then, the alternating projection algorithm is used to solve for the waveform to counter noncooperative utilization, under constraints on signal-to-noise ratio loss and constant modulus. This makes NCPs unable to receive the radar signal or receive pre-designed deceptive signal. Simulations validate that the designed waveform can reduce the efficiency of NCPs while maintaining the performance of cooperative parties.
A proportionate affine projection like (PAPL-I) adaptive filtering algorithm is proposed that incorporates the proportionate feature to affine projection like (APL-I) algorithm. Simulation results show that the propos...
详细信息
A proportionate affine projection like (PAPL-I) adaptive filtering algorithm is proposed that incorporates the proportionate feature to affine projection like (APL-I) algorithm. Simulation results show that the proposed PAPL-I algorithm provides improved steady state performance than the APL-I and affine projection algorithms (APA) in case of an acoustic echo cancellation application with a very sparse echo path. In addition, the PAPL-I algorithm also offers improved performance over the APL-I algorithm for adaptive feedback cancellation for hearing aids systems.
We propose a novel image restoration and super-resolution algorithm based on a convex set theoretic approach. This procedure differs from the currently popular super-resolution algorithms, which typically are derived ...
详细信息
We propose a novel image restoration and super-resolution algorithm based on a convex set theoretic approach. This procedure differs from the currently popular super-resolution algorithms, which typically are derived by employing statistical approaches, in offering a greater flexibility for incorporating scene-related prior information into the restoration processing. Novel methods for modeling and for extrapolation of scene information for efficient use in the restoration process are described. These include a border extraction method that permits a background-foreground separation of the image, a template-based information modeling and a method of extrapolating the image frequency content by a Taylor series expansion. A class of iterative projection algorithms for processing diffraction-limited images by using convex sets modeling various types of a priori information about the object or scene imaged is developed. The restoration and super-resolution performance of these algorithms are established through a variety of simulation experiments.
Summary from only given. In this paper, we propose novel low-complexity adaptive channel estimation techniques for mobile wireless channels in presence of Rayleigh fading, carrier frequency offsets (CFO) and random ch...
详细信息
Summary from only given. In this paper, we propose novel low-complexity adaptive channel estimation techniques for mobile wireless channels in presence of Rayleigh fading, carrier frequency offsets (CFO) and random channel variations. We show that the selective partial update of the estimated channel tap-weight vector offers a better tradeoff between the performance and computational complexity, compared to the full update of the estimated channel tap-weight vector. We demonstrate the usefulness of proposed methods via simulation studies.
We propose an optimization based flow control for the Internet called random early marking (REM). In this paper we propose and evaluate an enhancement that attempts to speed up the convergence of REM in the face of la...
详细信息
We propose an optimization based flow control for the Internet called random early marking (REM). In this paper we propose and evaluate an enhancement that attempts to speed up the convergence of REM in the face of large feedback delays. REM can be regarded as an implementation of an optimization algorithm in a distributed network. The basic idea is to treat the optimization algorithm as a discrete time system and apply linear control techniques to stabilize its transient. We show that the modified algorithm is stable globally and converges exponentially locally. This algorithm translates into an enhanced REM scheme and we illustrate the performance improvement through simulation.
The expansion of computer networks has lead to the increase of online network attacks. Therefore, an efficient method to detect and analyze network attacks is inevitable. As a result much research has been done on net...
详细信息
The expansion of computer networks has lead to the increase of online network attacks. Therefore, an efficient method to detect and analyze network attacks is inevitable. As a result much research has been done on network visualization. This paper proposes a method which efficiently visualizes and analyzes network attacks using parallel coordinates. A brief review on the limitations on previous visualization methods and a structure which can analyze network attacks through visualization will be presented. Moreover, experimental results on visualization of scanning attacks, denial of service attacks and spoofing attacks using multi parallel coordinates will be shown.
We consider the mirror-prox algorithm for solving monotone Variational Inequality (VI) problems. As the mirrorprox algorithm is not practically implementable, except in special instances of VIs (such as affine VIs), w...
详细信息
ISBN:
(数字)9798350316339
ISBN:
(纸本)9798350316346
We consider the mirror-prox algorithm for solving monotone Variational Inequality (VI) problems. As the mirrorprox algorithm is not practically implementable, except in special instances of VIs (such as affine VIs), we consider its implementation with Popov method updates. We provide convergence rate analysis of our proposed method for a monotone VI with a Lipschitz continuous mapping. We establish a convergence rate of $O(1 / t)$, in terms of the number t of iterations, for the dual gap function. Simulations on a two player matrix game corroborate our findings.
The adaptive control of simple linear time-varying systems is treated for the case in which their parameters vary arbitrarily in an unknown compact set. The state variables of these systems are assumed to be available...
详细信息
The adaptive control of simple linear time-varying systems is treated for the case in which their parameters vary arbitrarily in an unknown compact set. The state variables of these systems are assumed to be available for measurement. It is shown that all the signals in the adaptive system are bounded for any bounded reference input. This result requires neither a modification of the standard adaptive law, nor the persistent excitation of the reference input. The extension of the result to general cases, where only the input and output are accessible, is briefly discussed.< >
暂无评论