scholarly journals Minimum Phase Property of Chebyshev-Sharpened Cosine Filters

2015 ◽  
Vol 2015 ◽  
pp. 1-14
Author(s):  
Miriam Guadalupe Cruz Jiménez ◽  
David Ernesto Troncoso Romero ◽  
Gordana Jovanovic Dolecek
Keyword(s):  
Computational Complexity ◽  
Group Delay ◽  
Minimum Phase ◽  
Similar Magnitude ◽  
Low Delay ◽  
Phase Property ◽  
Decimation Filter ◽  
The Cost ◽  
Lower Group

We prove that the Chebyshev sharpening technique, recently introduced in literature, provides filters with a Minimum Phase (MP) characteristic when it is applied to cosine filters. Additionally, we demonstrate that cascaded expanded Chebyshev-Sharpened Cosine Filters (CSCFs) are also MP filters, and we show that they achieve a lower group delay for similar magnitude characteristics in comparison with traditional cascaded expanded cosine filters. The importance of the characteristics of cascaded expanded CSCFs is also elaborated. The developed examples show improvements in the group delay ranged from 23% to 47% at the cost of a slight increase of usage of hardware resources. For an application of a low-delay decimation filter, the proposed scheme exhibits a 24% lower group delay, with 35% less computational complexity (estimated in Additions per Output Sample) and slightly less usage of hardware elements.

scholarly journals Fast 10-Point DFT Algorithm for Power System Harmonic Analysis

2021 ◽  
Vol 11 (15) ◽  
pp. 7007
Author(s):  
Janusz P. Paplinski ◽  
Aleksandr Cariow
Keyword(s):  
Computational Complexity ◽  
Power System ◽  
Harmonic Analysis ◽  
Efficient Algorithm ◽  
System Analysis ◽  
Spectral Leakage ◽  
Power System Analysis ◽  
Improve Accuracy ◽  
The Cost ◽  
Harmonic Power

This article presents an efficient algorithm for computing a 10-point DFT. The proposed algorithm reduces the number of multiplications at the cost of a slight increase in the number of additions in comparison with the known algorithms. Using a 10-point DFT for harmonic power system analysis can improve accuracy and reduce errors caused by spectral leakage. This paper compares the computational complexity for an L×10M-point DFT with a 2M-point DFT.

A Determinant Elimination Method for Bottleneck Assignment and Generalized Assignment Problems

2012 ◽  
Vol 239-240 ◽  
pp. 1522-1527
Author(s):  
Wen Bo Wu ◽  
Yu Fu Jia ◽  
Hong Xing Sun
Keyword(s):  
Computational Complexity ◽  
Optimization Algorithm ◽  
Assignment Problem ◽  
Numerical Experiments ◽  
High Efficiency ◽  
Synthesis Method ◽  
Assignment Problems ◽  
Generalized Assignment ◽  
The Cost ◽  
Time And Space Complexity

The bottleneck assignment (BA) and the generalized assignment (GA) problems and their exact solutions are explored in this paper. Firstly, a determinant elimination (DE) method is proposed based on the discussion of the time and space complexity of the enumeration method for both BA and GA problems. The optimization algorithm to the pre-assignment problem is then discussed and the adjusting and transformation to the cost matrix is adopted to reduce the computational complexity of the DE method. Finally, a synthesis method for both BA and GA problems is presented. The numerical experiments are carried out and the results indicate that the proposed method is feasible and of high efficiency.

scholarly journals Proportional Fair Power Allocation for Secondary Transmitters in the TV White Space

2013 ◽  
Vol 2013 ◽  
pp. 1-8
Author(s):  
Konstantinos Koufos ◽  
Riku Jäntti
Keyword(s):  
Computational Complexity ◽  
Power Allocation ◽  
Spectrum Allocation ◽  
Primary System ◽  
White Space ◽  
Tv White Space ◽  
Performance Loss ◽  
The Cost ◽  
Allocation Algorithms ◽  
Modified Algorithm

The key bottleneck for secondary spectrum usage is the aggregate interference to the primary system receivers due to simultaneous secondary transmissions. Existing power allocation algorithms for multiple secondary transmitters in the TV white space either fail to protect the TV service in all cases or they allocate extremely low power levels to some of the transmitters. In this paper, we propose a power allocation algorithm that favors equally the secondary transmitters and it is able to protect the TV service in all cases. When the number of secondary transmitters is high, the computational complexity of the proposed algorithm becomes high too. We show how the algorithm could be modified to reduce its computational complexity at the cost of negligible performance loss. The modified algorithm could permit a spectrum allocation database to allocate near optimal transmit power levels to tens of thousands of secondary transmitters in real time. In addition, we describe how the modified algorithm could be applied to allow decentralized power allocation for mobile secondary transmitters. In that case, the proposed algorithm outperforms the existing algorithms because it allows reducing the communication signalling overhead between mobile secondary transmitters and the spectrum allocation database.

scholarly journals Analysis of Computational Complexity and Processing Time Evaluation of the Protocol Stack in 5G New Radio

2020 ◽  
Vol 23 (3) ◽  
pp. 31-37
Author(s):  
Ya. V. Kryukov ◽  
◽  
D. A. Pokamestov ◽  
E. V. Rogozhnikov ◽  
S. A. Novichkov ◽  
...  
Keyword(s):  
Computational Complexity ◽  
Personal Computer ◽  
Communication Systems ◽  
Network Architectures ◽  
Protocol Stack ◽  
Computing Power ◽  
Radio Access ◽  
New Radio ◽  
The Cost ◽  
Time Evaluation

Currently, an active deployment of radio access networks for mobile communication systems 5G New Radio is being observed. The architecture of networks is developing rapidly, where significant part of the functions is performed in a virtual cloud space of a personal computer. The computing power of a personal computer must be sufficient to execute network protocols in real time. To reduce the cost of deploying 5G NR networks, the configuration of each remote computer must be optimally matched to the scale of a particular network. Therefore, an urgent direction of research is the assessment of the execution time of the 5G NR protocol stack on various configurations of computers and the development of a mathematical model for data analysis, approximation of dependencies and making recommendations. In this paper, the authors provide an overview of the main 5G NR network architectures, as well as a description of the methods and tools that can be used to estimate the computational complexity of the 5G NR protocol stack. The final section provides an analysis of the computational complexity of the protocol stack, obtained during the experiments by colleagues in partner institutions.

MINIMIZING THE COMPLETE INFLUENCE TIME IN A SOCIAL NETWORK WITH STOCHASTIC COSTS FOR INFLUENCING NODES

2013 ◽  
Vol 21 (supp01) ◽  
pp. 63-74 ◽  
Author(s):  
YAODONG NI ◽  
QIAONI SHI
Keyword(s):  
Social Network ◽  
Computational Complexity ◽  
Stochastic Programming ◽  
Greedy Algorithm ◽  
Random Graphs ◽  
Minimum Time ◽  
Programming Models ◽  
Decision Criteria ◽  
Trade Off ◽  
The Cost

In this paper, we study the problem of targeting a set of individuals to trigger a cascade of influence in a social network such that the influence diffuses to all individuals with the minimum time, given that the cost of initially influencing each individual is with randomness and that the budget available is limited. We adopt the incremental chance model to characterize the diffusion of influence, and propose three stochastic programming models that correspond to three different decision criteria respectively. A modified greedy algorithm is presented to solve the proposed models, which can flexibly trade off between solution performance and computational complexity. Experiments are performed on random graphs, by which we show that the algorithm we present is effective.

scholarly journals A Reverse Model Predictive Control Strategy for a Modular Multilevel Converter

Energies ◽  
2019 ◽  
Vol 12 (2) ◽  
pp. 297 ◽  
Author(s):  
Weide Guan ◽  
Shoudao Huang ◽  
Derong Luo ◽  
Fei Rong
Keyword(s):  
Computational Complexity ◽  
Model Predictive Control ◽  
Predictive Control ◽  
Control Performance ◽  
Multilevel Converter ◽  
Multilevel Converters ◽  
Computational Burden ◽  
Modular Multilevel Converters ◽  
The Cost ◽  
Fast Dynamic

In recent years, modular multilevel converters (MMCs) have developed rapidly, and are widely used in medium and high voltage applications. Model predictive control (MPC) has attracted wide attention recently, and its advantages include straightforward implementation, fast dynamic response, simple system design, and easy handling of multiple objectives. The main technical challenge of the conventional MPC for MMC is the reduction of computational complexity of the cost function without the reduction of control performance of the system. Some modified MPC scan decrease the computational complexity by evaluating the number of on-state sub-modules (SMs) rather than the number of switching states. However, the computational complexity is still too high for an MMC with a huge number of SMs. A reverse MPC (R-MPC) strategy for MMC was proposed in this paper to further reduce the computational burden by calculating the number of inserted SMs directly, based on the reverse prediction of arm voltages. Thus, the computational burden was independent of the number of SMs in the arm. The control performance of the proposed R-MPC strategy was validated by Matlab/Simulink software and a down-scaled experimental prototype.

scholarly journals Mixed-Degree Spherical Simplex-Radial Cubature Kalman Filter

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Shiyuan Wang ◽  
Yali Feng ◽  
Shukai Duan ◽  
Lidan Wang
Keyword(s):  
Kalman Filter ◽  
Computational Complexity ◽  
Kalman Filters ◽  
Order Moment ◽  
Low Degree ◽  
Cubature Kalman Filter ◽  
Highly Nonlinear ◽  
Spherical Simplex ◽  
The Cost ◽  
High Degree

Conventional low degree spherical simplex-radial cubature Kalman filters often generate low filtering accuracy or even diverge for handling highly nonlinear systems. The high-degree Kalman filters can improve filtering accuracy at the cost of increasing computational complexity; nevertheless their stability will be influenced by the negative weights existing in the high-dimensional systems. To efficiently improve filtering accuracy and stability, a novel mixed-degree spherical simplex-radial cubature Kalman filter (MSSRCKF) is proposed in this paper. The accuracy analysis shows that the true posterior mean and covariance calculated by the proposed MSSRCKF can agree accurately with the third-order moment and the second-order moment, respectively. Simulation results show that, in comparison with the conventional spherical simplex-radial cubature Kalman filters that are based on the same degrees, the proposed MSSRCKF can perform superior results from the aspects of filtering accuracy and computational complexity.

Sign in / Sign up

Export Citation Format

Share Document