检索结果-内蒙古大学图书馆

The Use of Harmonic analysis in Suboptimal Estimator design

IEEE Transactions on Automatic Control 1978年第5期23卷 911-916页

作者： Marcus, Steven I. Hsu, Kai Department of Electrical Engineering University of Texas at Austin Austin TX 78712 United States Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge MA 02139 United States

The state estimation problem for bilinear stochastic systems evolving on the spheres S'n, the special orthogonal groups SO(n), and certain other compact Lie groups and homogeneous spaces is considered. The problem is motivated by some applications involving rotational processes in three dimensions. The theory of harmonic analysis on compact Lie groups is used to define assumed density approximations which result in implententable suboptimal estimators for the state of the bilinear system. The results of Monte Carlo simulations are reported;these indicate that simple filters designed by these techniques perform well as compared to other filters. Copyright © 1978 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： Harmonic analysis Riccati equations Filters Fourier series State estimation Nonlinear systems Phase estimation algorithm design and analysis Numerical stability Tin

来源：评论

学校读者我要写书评

暂无评论

Discrete-time Event-triggered Control for Wireless Networks: design and Network Calculus analysis 1

Discrete-time Event-triggered Control for Wireless Networks:...

引用

Proceedings First Int Conf Event Based Control Commu Signal Processing

作者： Roohi, M. Hossein Ghaisari, Jafar Izadi, Iman Saidi, Hossein Isfahan Univ Technol Dept Elect & Comp Engn Esfahan Iran

ISBN: (纸本)9781467378888

In the past few years, as an alternative for time-triggered control, event-triggered control (ETC) has been investigated for networked control systems (NCS). ETC is a control strategy where the control algorithm is executed only when a special condition is satisfied. In this paper, a solution to find an appropriate bandwidth for event-based control systems over wireless networks is proposed. Moreover, it is shown how the delay bound of network can be affected by control system. These two results are achieved by applying network calculus theorem to a control system. For efficient use of network resources, a new triggering algorithm is proposed. An advantage of proposed algorithm is that the minimum time between two consecutive events is considered as a designable control parameter and it can guarantee a lower bound on input traffic to the network. An illustrative case study of a NCS based on IEEE 802.15.4 protocol is presented to show the effectiveness of the proposed event-triggered algorithm and investigate the effect of bandwidth allocation on NCS.

关键词： algorithm design and analysis Bandwidth Calculus Control systems Delays Detectors IEEE 802.15 Standard

来源：评论

学校读者我要写书评

暂无评论

design and analysis of Effective Price for Congestion Control

Design and Analysis of Effective Price for Congestion Contro...

引用

36th Annual IEEE Conference on Local Computer Networks (LCN)

作者： Wang, Hao Wang, Bo Chen, Jiezhi Tian, Zuohua Chinese Univ Hong Kong Dept Informat Engn Shatin Hong Kong Peoples R China Telecom ParisTech INFRES F-75013 Paris France Univ Florence I-50134 Florence Italy Shanghai Jiao Tong Univ Dept Automat Shanghai 200030 Peoples R China

ISBN: (纸本)9781612849287

Congestion control can be regarded a distributed system, which consists of source algorithm like TCP, and link algorithm, such as active queue management (AQM). Shadow price has been derived from optimization theory to be implemented in routers as the AQM algorithm. In this paper, a control theoretic approach to analysis and design of the price is presented to enhance the AQM performance. We analyze the dynamics of random exponential marking (REM) and propose an efficient price-based AQM algorithm. The proposed method uses an effective price with proportional-integral-derivative (PID) property to detect and control congestion proactively. Online learning rules are introduced to adjust the parameters of the effective price for improving adaptability and robustness in nonlinear and time-varying networks. The stability of the system is also analyzed via the Lyapunov stability theory. By extensive simulations, the results verify that our proposed method outperforms many competitive AQM schemes in terms of stability, response and robustness under various network scenarios. The proposed method is able to maintain stable queue size, small jitter, low packet loss and improves the trade-off between queuing delay and link utilization.

关键词： algorithm design and analysis Delay Heuristic algorithms Jitter Neurons Robustness Stability analysis

来源：评论

学校读者我要写书评

暂无评论

analysis and design of output consensus algorithms for agents with linear dynamics

Analysis and design of output consensus algorithms for agent...

引用

European Control Conference (ECC)

作者： Contzen, Miguel Parada Tech Univ Berlin Control Syst Grp D-10587 Berlin Germany

ISBN: (纸本)9783952426937

This paper deals with the consensus problem of linear systems from an integral perspective considering the dynamics of the agents and graph theoretical descriptions of the network. A consensus algorithm is defined as the interaction of two properties inherent to a network: hierarchical organization and information exchange. From this definition the problem is tackled as the stability of some coordination variables by means of Lyapunov functions and LMI methodology. This approach allows to define precision and speed indicators to evaluate the performance of different algorithms related to the agents' dynamics. The main characteristics of this approach are discussed with the help of the consensus canonical example of double integrator systems and complemented with an analysis and design example.

关键词： Lyapunov methods graph theory linear matrix inequalities linear systems LMI methodology Lyapunov functions agent dynamics consensus canonical example double integrator systems graph theoretical descriptions hierarchical organization information exchange linear dynamics output consensus algorithms algorithm design and analysis Heuristic algorithms Laplace equations Linear matrix inequalities Organizations Symmetric matrices Synchronization

来源：评论

学校读者我要写书评

暂无评论

design principles for public key cryptography system protected with power analysis

Design principles for public key cryptography system protect...

引用

International Conference on Computational Intelligence and Security

作者： Xu Rui Jiang Huiping Bao Sheng Beijing Inst Technol Sch Aerosp Sci & Engn Beijing Peoples R China Beijing Inst Technol Sch Comp Sci & Technol Beijing Peoples R China Tsinghua Univ Dept Precis Instruments & Mechanol Beijing Peoples R China

ISBN: (纸本)9780769530734

Side channel information could be used to analysis the key information according to leakage information depending on the operation of cryptography algorithm and its hardware. And power analysis is the chief method In this paper, an improved architecture for RSA system against power analysis was proposed based on its basic theory. A DPA attack for RSA specially, is discussed in details, and the shadow technology was proposed based on it. In order to maximize the capability/cost, Shadow technique and removing intermediate value technique are introduced into RSA system, which only cost more than 30% timing to realizing secure RSA algorithm. Contemporary the effectiveness of advanced RSA cryptography system was illuminate briefly.

关键词： Public key cryptography Power system protection algorithm design and analysis Hardware Data security Information analysis Costs Information security Data mining Authentication

来源：评论

学校读者我要写书评

暂无评论

design tradeoff analysis of floating-point adders in FPGAs

引用

Canadian Journal of Electrical and Computer Engineering 2008年第3/4期33卷 169-175页

作者： Ali Malik Dongdong Chen Younhee Choi Moon Ho Lee Seok-Bum Ko Department of Electrical and Computer Engineering University of Saskatchewan Saskatoon SAS Canada Department of Electronics and Information Engineering Chonbuk National University of Korea Jeonju Jeonbuk South Korea

With gate counts of ten million, field-programmable gate arrays (FPGAs) are becoming suitable for floating-point computations. Addition is the most complex operation in a floating-point unit and can cause major delay while requiring a significant area. Over the years, the VLSI community has developed many floating-point adder algorithms aimed primarily at reducing the overall latency. An efficient design of the floating-point adder offers major area and performance improvements for FPGAs. Given recent advances in FPGA architecture and area density, latency has become the main focus in attempts to improve performance. This paper studies the implementation of standard; leading-one predictor (LOP); and far and close datapath (2-path) floating-point addition algorithms in FPGAs. Each algorithm has complex sub-operations which contribute significantly to the overall latency of the design. Each of the sub-operations is researched for different implementations and is then synthesized onto a Xilinx Virtex-II Pro FPGA device. Standard and LOP algorithms are also pipelined into five stages and compared with the Xilinx IP. According to the results, the standard algorithm is the best implementation with respect to area, but has a large overall latency of 27.059 ns while occupying 541 slices. The LOP algorithm reduces latency by 6.5% at the cost of a 38% increase in area compared to the standard algorithm. The 2-path implementation shows a 19% reduction in latency with an added expense of 88% in area compared to the standard algorithm. The five-stage standard pipeline implementation shows a 6.4% improvement in clock speed compared to the Xilinx IP with a 23% smaller area requirement. The five-stage pipelined LOP implementation shows a 22% improvement in clock speed compared to the Xilinx IP at a cost of 15% more area.

关键词： Field programmable gate arrays Delay Pipelines Costs Very large scale integration Clocks Adders Moon algorithm design and analysis Gold

来源：评论

学校读者我要写书评

暂无评论

analysis and design of Optimal Admission Control Policies in Multiservice Cellular Networks

引用

IEEE Latin America Transactions 2004年第1期2卷 10-18页

作者： V.P. Bosca V.C. Giner Departmento de Communicaciones Universidad Politécnica de Valencia Valencia Spain

Forthcoming cellular networks will provide multimedia services along with QoS guarantees. In this context admission control is a key aspect in the design and operation of such systems. In this paper we consider several admission control policies together with appropriate algorithms for their analysis and design. We conclude that the family of randomized stationary policies provide the required versatility to adapt to several goals for both network planning and operation. Appropriate algorithms stem from the fact that randomized stationary policies can be suitably analyzed and adjusted by means of Markov decision processes theory and linear programming techniques.

关键词： Admission control Intelligent networks Land mobile radio cellular systems algorithm design and analysis Linear programming Programmable logic arrays Land mobile radio Markov processes Multimedia systems Optimal control

来源：评论

学校读者我要写书评

暂无评论

Comments on "An analysis of design conditions for a phase-inverter speaker system with a drone cone"

引用

IEEE Transactions on Acoustics, Speech, and Signal Processing 1974年第5期22卷 389-391页

作者： H. Olson RCA Laboratories Princeton N.J.

The last sentence on p. 405 in the above paper states: "This paper ... shows that the low-frequency response of the drone-cone system is a little inferior to that of the bass-reflex system, ... ." The exposition of this correspondence shows that a properly designed drone cone for a phase-inverter loudspeaker will provide performance superior to that of the same loudspeaker with a port.

关键词： Loudspeakers Frequency measurement Phase measurement algorithm design and analysis Frequency response Fourier transforms Signal processing algorithms Speech processing Acoustic signal processing Circuits

来源：评论

学校读者我要写书评

暂无评论

Fast and scalable routing protocols for data center networks

引用

Digital Communications and Networks 2023年第6期9卷 1340-1350页

作者： Mihailo Vesovic Aleksandra Smiljanic Dusan Kostic School of Electrical Engineering University of Belgrade11120BelgradeSerbia Amazon Web Services(AWS) ZurichSwitzerland

Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link *** are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize *** such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive *** routing protocols were proposed to overcome this problem by focusing on network utilization rather than ***,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing ***,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data *** aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose *** propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.

关键词： Routing protocols Data center networks Parallel algorithms Distributed algorithms algorithm design and analysis Shortest-path problem Scalability

来源：评论

学校读者我要写书评

暂无评论

A Novel Iterative Velocity Control algorithm and Its FPGA Implementation Based on Trigonometric Function

引用

Chinese Journal of Electronics 2019年第2期28卷 237-245页

作者： WEN Quangang LIANG Yanchun Adriano Tavares Ricardo Teixeira WU Chunguo Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Department of Industrial Electronics University of Minho Campus de Azurm

The servo motor’s flexible acceleration/deceleration(acc/dec) control is an emerging research topic in the automation field. A velocity control algorithm based on trigonometric function is proposed in this *** required parameters, it transforms trigonometric calculations into elementary mathematical operations and calculates the velocity controlling values iteratively, which could avoid trigonometric calculation and reduce the computation time. Experimental results show that the proposed algorithm is suitable for implementation on field programmable gate arrays and achieves a flexible controlling, enhancing both the equipment’s stability and reliability. It is promising to significantly improve the high-speed computerized numerical control equipment’s controlling accuracy, without a huge hardware resource consumption.

关键词： Acceleration Velocity control algorithm design and analysis Field programmable gate arrays Servomotors

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：