In most previous studies about transient synchronization stabilities of grid-following converters (GFLC), alternating current control (ACC) dynamics are often neglected. However, the bandwidth of the ACC cannot be sel...
详细信息
In most previous studies about transient synchronization stabilities of grid-following converters (GFLC), alternating current control (ACC) dynamics are often neglected. However, the bandwidth of the ACC cannot be selected too high in some low-switching cases, such as large wind turbines. The adverse effects of ACC must be considered to avoid over-optimistic evaluation of transient stability. There are seldom quantitative and analytic large signal analyses that take the ACC dynamics into account. To fill this gap, an iteration-based accurate transient stability evaluation method is proposed in this article. First, the model of the ACC and line dynamics are deduced. The time-domain analytic solution of current dynamics is obtained. Furthermore, the multivariate implicit function equation set concerning current-frequency-power angle's mapping relation under the critical stable condition is constructed and the transient stability boundary is solved based on the proposed iterative algorithm. The interaction mechanism between the phase-locked-loop (PLL) and ACC is accurately quantified. A simplified transient stability criterion is deduced to preliminarily estimate the adverse effects of ACC on GFLC's transient stability. In addition, a stability-enhanced decoupled PLL strategy is proposed to enable the setting of PLL bandwidth unconstrained by the interaction from ACC, which significantly improves the dynamic response of the GFLC. Simulation and experiments verify the effectiveness and superiority of the proposed stability evaluation method and decoupled PLL strategy.
We present a numerical iterative optimization algorithm for the minimization of a cost function consisting of a linear combination of three convex terms, one of which is differentiable, a second one is prox-simple and...
详细信息
We present a numerical iterative optimization algorithm for the minimization of a cost function consisting of a linear combination of three convex terms, one of which is differentiable, a second one is prox-simple and the third one is the composition of a linear map and a proxsimple function. The algorithm's special feature lies in its ability to approximate, in a single iteration run, the minimizers of the cost function for many different values of the parameters determining the relative weight of the three terms in the cost function. A proof of convergence of the algorithm, based on an inexact variable metric approach, is also provided. As a special case, one recovers a generalization of the primal-dual algorithm of Chambolle and Pock, and also of the proximal-gradient algorithm. Finally, we show how it is related to a primal-dual iterative algorithm based on inexact proximal evaluations of the non-smooth terms of the cost function.
This work presents a deep learning based iterative network for massive-MIMO decoding. The structure of DLNet is based upon a projected gradient descent-based iterative trainable network. This DLNet is a 15-layer deep ...
详细信息
This work presents a deep learning based iterative network for massive-MIMO decoding. The structure of DLNet is based upon a projected gradient descent-based iterative trainable network. This DLNet is a 15-layer deep iterative network structure whose parameters are optimized using DL training for better performance on Rayleigh as well as correlated M-MIMO channels. Due to rigorous training on time-varying channels, DLNet can work for time-varying channels with single-time training. Simulation shows that the proposed DLNet decoder performs better than other MIMO decoding techniques by at least 2 dB in symbol-error-rate (SER), at least 11 times faster than the baseline (OAMPNet), and 9 times less complex. It also converges fast compared to other available M-MIMO decoders.
Passive radar has become very popular in recent years because it is usually undetectable, and countermeasures used to prevent its functioning are complex and, in general, easily identified. Terrestrial digital video b...
详细信息
Passive radar has become very popular in recent years because it is usually undetectable, and countermeasures used to prevent its functioning are complex and, in general, easily identified. Terrestrial digital video broadcasting (DVB-T) is commonly used as an opportunistic illumination signal because of its large range and widespread deployment, both of which make it applicable to almost all scenarios. This paper presents the design of a compact and robust receiver for passive radar that uses a low number of antenna while achieving high accuracy. In order to do this, we use an iterative algorithm to refine the initial estimations based on time-domain channel information to converge to the true estimations. This is especially effective when the signal-to-noise-ratio (SNR) at the receiver is moderate and/or there are several reflections in the environment that may introduce some error into schemes that perform the angle of arrival or time of arrival for the estimation. The algorithm proposed herein is able to accurately estimate the position of a target with a low SNR.
In urban rail transit operations, conventional disruption management measures, such as train rescheduling and bus bridging services, play a crucial role in alleviating passenger evacuation pressures. Despite their uti...
详细信息
In urban rail transit operations, conventional disruption management measures, such as train rescheduling and bus bridging services, play a crucial role in alleviating passenger evacuation pressures. Despite their utility, these measures often fall short during peak hours or in densely populated downtown areas due to delayed responses and capacity limitations. Addressing this gap, this study introduces an approach to efficiently manage large-volume evacuations by guiding passengers to alternative paths comprised of the non-disrupted lines within the urban rail network to complete their trips, alongside adjusting train schedules of these non-disrupted lines to enhance capacity for the influx of rerouted passengers. Essentially, this approach utilizes and optimizes non-disrupted lines to evacuate passengers. To tackle this issue, this study develops four mathematical optimization models aimed at optimizing passenger re-routing and adjusting train schedules. These models cater to different scenarios: whether passengers independently choose their paths or adhere to path guidance, and whether train schedules are adjusted. The inclusion of a Path-Sized Logit model within the optimization framework accurately reflects passenger path-choice behaviours, while an iterative algorithm is introduced to tackle the nonlinear models. Applied to a case study of the Zhengzhou Metro, the implementation of the disruption management schemes obtained from these models and algorithm significantly increases the number of affected passengers completing their trips and minimizes passenger delays during disruptions, thereby enhancing the urban rail transit network's resilience. Moreover, the findings from this study offer valuable insights into line redundancy analysis and enable a targeted measure to manage diverse passenger needs during disruptions. These insights provide a foundation for urban rail transit operators to manage disruptions more reliably and efficiently, ensuring a higher lev
The problem of estimating the frequency of a complex signal is considered. Through analyzing the performance of the Quinn algorithm and Aboutanios iterative algorithm, when the frequency of signal is located in the ce...
详细信息
ISBN:
(纸本)9781509013456
The problem of estimating the frequency of a complex signal is considered. Through analyzing the performance of the Quinn algorithm and Aboutanios iterative algorithm, when the frequency of signal is located in the central region of two neighboring quantized frequency in discrete Fourier transform (DFT), Quinn algorithm's precision is very high and its root-mean-square error (RMSE) is close to Cramer-Rao bound (CRB). Meanwhile, the variance of frequency estimated by the Aboutanios iterative algorithm is big. However, when the frequency is located in the vicinity of quantitative frequency point, the Quinn algorithm's accuracy is poor and Aboutanios iterative algorithm has high precision. In this paper, through combining the advantages of two kinds of algorithms and obtaining the correct interpolation direction by spectral shift in the vicinity of quantitative frequency point, there is a new comprehensive algorithm which has better computational efficiency and its RMSE is close to the CRB in the entire frequency estimation range.
Herein, we set up a novel iterative technique termed as the R-iterative algorithm. We show that the newly constructed scheme is more efficient than some existing iterative algorithms. Further, a general variational in...
详细信息
Herein, we set up a novel iterative technique termed as the R-iterative algorithm. We show that the newly constructed scheme is more efficient than some existing iterative algorithms. Further, a general variational inclusion problem is approximated by utilizing our algorithm and the theoretical claims are exemplified. As an application, we utilize our newly developed scheme to examine a delay differential equation.
The recent global pandemic has served to intensify interest in analyzing microdroplets suspended in the air that can possibly carry pathogens thus demonstrating an airborne transmission mechanism with potentially deva...
详细信息
The envelope constrained (EC) filtering problem is concerned with the design of a time-invariant filter to process a given input pulse such that the output waveform is guaranteed to lie within a prescribed output mask...
详细信息
The envelope constrained (EC) filtering problem is concerned with the design of a time-invariant filter to process a given input pulse such that the output waveform is guaranteed to lie within a prescribed output mask. Using the orthonormal Laguerre functions the EC filtering problem can be posed as a quadratic programming (QP) problem with affine inequality constraints. An iterative algorithm for solving this QP problem is proposed. We also show that for the EC filtering problem, filters based on Laguerre functions offer a more robust and low-order alternative to finite impulse response (FIR) filters. A numerical example, concerned with the design of an equalization filter for a digital transmission channel, is presented to illustrate the effectiveness of the iterative algorithm and the Laguerre filter.
This paper is concerned with iterative solutions to a class of complex matrix equations, which include some previously investigated matrix equations as special cases. By applying the hierarchical identification princi...
详细信息
This paper is concerned with iterative solutions to a class of complex matrix equations, which include some previously investigated matrix equations as special cases. By applying the hierarchical identification principle, an iterative algorithm is constructed to solve this class of matrix equations. A sufficient condition is presented to guarantee that the proposed algorithm is convergent for an arbitrary initial matrix with a real representation of a complex matrix as tools. By using some properties of the real representation, a convergence condition that is easier to compute is also given in terms of original coefficient matrices. A numerical example is employed to illustrate the effectiveness of the proposed methods. (C) 2011 Elsevier Inc. All rights reserved.
暂无评论