In this paper, we propose a novel and effective Peak-to-Average Power Ratio (PAPR) reduction algorithm for Orthogonal Frequency Division Multiplexing (OFDM) signals that uses a group of appropriate weights in both amp...
详细信息
ISBN:
(纸本)9781424413119
In this paper, we propose a novel and effective Peak-to-Average Power Ratio (PAPR) reduction algorithm for Orthogonal Frequency Division Multiplexing (OFDM) signals that uses a group of appropriate weights in both amplitude and phases fixed on subcarriers in the frequency domain. Also we deduce a iterative formula to compute the weights. Compared with Partial Transmit Sequence (PTS) and Selected Mapping (SLM) algorithms, the proposed algorithm shows its better performance on PAPR reduction. Bit error rate (BER) analysis indicates that the amplitude of the weights has a great impact on the BER performance of the system. Appropriate restriction on the amplitude can get good performance in both PAPR and BER. Simulation results show that the proposed algorithm is better than PTS and SLM algorithm in PAPR reduction performance, while satisfying BER performance, for example, PAPR reduction can be up to 2.5dB decrease when dividing the subcarriers into 4 subgroups.
In this paper,an improved stochastic algebraic Riccati(SAR) iterative algorithm based on numerical iterative is adopted to solve the stochastic linear quadratic optimal tracking(SLQT) control problem for stochastic di...
详细信息
ISBN:
(数字)9789887581536
ISBN:
(纸本)9781665482561
In this paper,an improved stochastic algebraic Riccati(SAR) iterative algorithm based on numerical iterative is adopted to solve the stochastic linear quadratic optimal tracking(SLQT) control problem for stochastic discrete-time ***,an augmented system composed of the stochastic discrete-time system and command generator is ***,the augmented stochastic algebraic Riccati equation(SARE) is derived based on the augmented system and the corresponding SAR iterative algorithm is obtained according to the idea of value iteration(VI) ***,an improved SAR iterative algorithm is raised based on the given SAR iterative algorithm and combined with the numerical iterative ***,simulation results verify the effectiveness of the proposed algorithm.
The time-delay delay phenomenon is a kind of widespread physical and biological phenomenon. The existence of time-delay not only give the stability of system analysis and controller design brings great difficulties bu...
详细信息
ISBN:
(纸本)9783037859537
The time-delay delay phenomenon is a kind of widespread physical and biological phenomenon. The existence of time-delay not only give the stability of system analysis and controller design brings great difficulties but also usually make the systems unstable and even cause the system performance deteriorated. We use the adaptive dynamic iterative algorithm to solve this equation. By using the neural network to achieve the iterative algorithm, get the optimal control law of the systems with time delay. The simulation results show that the adaptive dynamic programming method to solve the optimal control of the nonlinear system is effective.
Springback is an inevitable process of sheet metal forming phenomenon. Numerical simulation is an effective way to solve the springback problem, and more and more attention to industry and academia. This paper describ...
详细信息
ISBN:
(纸本)087849278X
Springback is an inevitable process of sheet metal forming phenomenon. Numerical simulation is an effective way to solve the springback problem, and more and more attention to industry and academia. This paper describes the implicit springback analysis of the BFGS equilibrium iteration method, and proposes a strategy for optimizing the calculation, reducing the computation and avoiding the potential problem of instability in the calculation. At last, the use of self-developed software gives numerical examples.
A version of the geometrical shortest path problem is to compute a shortest path connecting two points and passing a finite set of line segments in three dimensions. This problem arises in the pursuit path problem and...
详细信息
ISBN:
(纸本)9783319700045;9783319700038
A version of the geometrical shortest path problem is to compute a shortest path connecting two points and passing a finite set of line segments in three dimensions. This problem arises in the pursuit path problem and also be used as a tool to finding shortest paths on polyhedral surface. This paper presents an iterative algorithm for dealing with the problem, particularly with large data. The idea is to simultaneously determines on each segment a point such that the length of the path successively connecting the points is decreased. We show that after a finite number of iterations, the algorithm converges to give an approximate solution. The algorithm is implemented in C++ and tested for large datasets. The numerical results are shown and discussed.
The range-based localization problem often arises in TOA or RSSI based position estimation schemes. It is well-known that such a localization problem can be formulated as a nonlinear least-squares (NLS) estimation pro...
详细信息
ISBN:
(纸本)9781424423538
The range-based localization problem often arises in TOA or RSSI based position estimation schemes. It is well-known that such a localization problem can be formulated as a nonlinear least-squares (NLS) estimation problem. In this paper, we formulate the problem as a constrained optimization problem, which is equivalent to the general NLS problem. By using a greedy optimization strategy, we derive a simple iterative algorithm with closed-form expressions for the NLS localization, which can be implemented in a distributed way. Simulation results show that the localization performance of the proposed localization algorithm is very close to the Cramer-Rao lower bound.
Since web born-digital images have low resolution and dense text atoms, text region over-merging and miss detection are still two open issues to be addressed. In this paper a novel iterative algorithm is proposed to l...
详细信息
ISBN:
(纸本)9781628418293
Since web born-digital images have low resolution and dense text atoms, text region over-merging and miss detection are still two open issues to be addressed. In this paper a novel iterative algorithm is proposed to locate and segment text regions. In each iteration, the candidate text regions are generated by detecting Maximally Stable Extremal Region (MSER) with diminishing thresholds, and categorized into different groups based on a new similarity graph, and the texted region groups are identified by applying several features and rules. With our proposed overlap checking method the final well-segmented text regions are selected from these groups in all iterations. Experiments have been carried out on the web born-digital image datasets used for robust reading competition in ICDAR 2011 and 2013, and the results demonstrate that our proposed scheme can significantly reduce both the number of over-merge regions and the lost rate of target atoms, and the overall performance outperforms the best compared with the methods shown in the two competitions in term of recall rate and f-score at the cost of slightly higher computational complexity.
In this paper, we introduce a data driven iterative low pass filtering technique, the Empirical iterative algorithm (EIA) for Galvanic Skin Response (GSR) signal preprocessing. This algorithm is inspired on Empirical ...
详细信息
ISBN:
(纸本)9789082797015
In this paper, we introduce a data driven iterative low pass filtering technique, the Empirical iterative algorithm (EIA) for Galvanic Skin Response (GSR) signal preprocessing. This algorithm is inspired on Empirical Mode Decomposition (EMD), with performance enhancements provided by applying Midpoint-based Empirical Decomposition (MED), and removing the sifting process in order to make it computational inexpensive while maintaining effectiveness towards removal of high frequency artefacts. Based on GSR signals recorded at the wrist we present an algorithm benchmark, with results from EIA being compared with a smoothing technique based on moving average filter commonly used to pre-process GSR signals. The comparison is established on data from 20 subjects, collected while performing 33 different randomized activities with right hand, left hand and both hands, respectively. In average, the proposed algorithm enhances the signal quality by 51%, while the traditional moving average filter reaches 16% enhancement. Also, it performs 136 times faster than the EMD in terms of average computational time. As a show case, using the GSR signal from one subject, we inspect the impact of applying our algorithm on GSR features with psychophysiological relevance. Comparison with no preprocessing and moving average filtering shows the ability of our algorithm to retain relevant low frequency information.
This paper proposes a new iterative algorithm for detection of outage of two- and three-terminal lines in a wide area power network. The proposed methodology uses the combination of pre- and post-event information cap...
详细信息
ISBN:
(纸本)9781479919710
This paper proposes a new iterative algorithm for detection of outage of two- and three-terminal lines in a wide area power network. The proposed methodology uses the combination of pre- and post-event information captured by phasor measurement units (PMUs) dispersed over the network. First, to limit the event search space and reduce the execution time of the proposed iterative algorithm, a set of suspicious lines are determined through the comparison of variations of voltage phase angle of buses equipped with PMUs. Then, each suspicious line is assumed to be on outage the current phasor of its' one (or both) end(s) is estimated. If the estimated current is approximately zero, the associated transmission line is on outage in reality and the screening process terminates;otherwise, the process continues by examining the next suspicious line. In a power system with the minimum number of PMUs ensuring network complete observability, the proposed iterative algorithm can identify outage of all transmission lines. The reliability of the proposed algorithm is verified by simulations on IEEE 14-bus test system. The effects of system stressed conditions (generator outage, power swing, and load encroachment) on the performance of the proposed method are evaluated as well.
This paper proposes a novel iterative algorithm for optimal design of non-frequency-selective Finite Impulse Response(FIR) digital filters based on the windowing *** from the traditional optimization concept of adjust...
详细信息
This paper proposes a novel iterative algorithm for optimal design of non-frequency-selective Finite Impulse Response(FIR) digital filters based on the windowing *** from the traditional optimization concept of adjusting the window or the filter order in the windowing design of an FIR digital filter,the key idea of the algorithm is minimizing the approximation error by succes-sively modifying the design result through an iterative procedure under the condition of a fixed window *** the iterative procedure,the known deviation of the designed frequency response in each iteration from the ideal frequency response is used as a reference for the next *** the approximation error can be specified variably,the algorithm is applicable for the design of FIR digital filters with different technical requirements in the frequency domain.A design example is employed to illustrate the efficiency of the algorithm.
暂无评论