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

Automated linear regression tools improve RSSI WSN localization in multipath indoor environment

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2011年第1期2011卷 1-27页

作者： Vanheel, Frank Verhaevert, Jo Laermans, Eric Moerman, Ingrid Demeester, Piet Univ Coll Ghent Fac Appl Engn Sci Ghent Belgium Univ Ghent Dept Informat Technol INTEC B-9000 Ghent Belgium

Received signal strength indication (RSSI)-based localization is emerging in wireless sensor networks (WSNs). Localization algorithms need to include the physical and hardware limitations of RSSI measurements in order to give more accurate results in dynamic real-life indoor environments. In this study, we use the Interdisciplinary Institute for Broadband Technology real-life test bed and present an automated method to optimize and calibrate the experimental data before offering them to a positioning engine. In a preprocessing localization step, we introduce a new method to provide bounds for the range, thereby further improving the accuracy of our simple and fast 2D localization algorithm based on corrected distance circles. A maximum likelihood algorithm with a mean square error cost function has a higher position error median than our algorithm. Our experiments further show that the complete proposed algorithm eliminates outliers and avoids any manual calibration procedure.

关键词： algorithm design and analysis correlation and regression analysis wireless sensor networks localization

来源：评论

学校读者我要写书评

暂无评论

A STOCHASTIC GRADIENT ADAPTIVE FILTER WITH GRADIENT ADAPTIVE STEP-SIZE

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1993年第6期41卷 2075-2087页

作者： MATHEWS, VJ XIE, ZH Department of Electrical Engineering University of Utah Salt Lake UT USA

This paper presents an adaptive step-size gradient adaptive filter. The step size of the adaptive filter is changed according to a gradient descent algorithm designed to reduce the squared estimation error during each iteration. An approximate analysis of the performance of the adaptive filter when its inputs are zero mean, white, and Gaussian and the set of optimal coefficients are time varying according to a random-walk model is presented in the paper. The algorithm has very good convergence speed and low steady-state misadjustment. Furthermore, the tracking performance of these algorithms in nonstationary environments is relatively insensitive to the choice of the parameters of the adaptive filter and is very close to the best possible performance of the least mean square (LMS) algorithm for a large range of values of the step size of the step-size adaptation algorithm. Several simulation examples demonstrating the good properties of the adaptive filter as well as verifying the analytical results are also presented in the paper.

关键词： Stochastic processes Adaptive filters Least squares approximation algorithm design and analysis Estimation error Performance analysis Gaussian noise Convergence Steady-state Analytical models

来源：评论

学校读者我要写书评

暂无评论

A NEW algorithm FOR GRAPH MONOMORPHISM BASED ON THE PROJECTIONS OF THE PRODUCT GRAPH

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1986年第5期16卷 740-751页

作者： AKINNIYI, FA WONG, AKC STACEY, DA UNIV WATERLOO DEPT SYST DESIGN ENGNWATERLOO N2L 3G1ONTARIOCANADA

A new algorithm is presented for detecting graph monomorphisms for a pair of graphs. This algorithm entails a tree search based on the projections of the product graph called the net of the two graphs. It uses the minimum number of neighbors of the projected graphs to detect infeasible subtrees. The algorithm, in comparison with that of Deo and coworkers, is more efficient in its storage space utilization and average execution time. It does not suffer from the ambiguity which arises in Deo et al.'s work when cyclic graphs are matched. Applications to attributed graph monomorphisms are included.

关键词： Tree graphs Polynomials algorithm design and analysis Partitioning algorithms Image analysis Chemical analysis Agricultural engineering design engineering Systems engineering and theory Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

Steady-state analysis of soft-switching converters

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2002年第7期49卷 939-954页

作者： Femia, N Spagnuolo, G Vitelli, M Univ Salerno DIIIE I-84084 Fisciano Italy Seconda Univ Napoli I-81031 Aversa Italy

Steady-state analysis of soft-switching converters is discussed in this paper. Finding the steady-state solution of soft-switching converters by means of start-up transient simulation may involve onerous computations and convergence failure, because of the mix of fast and slow natural frequencies determined respectively by the presence of soft-switching Lr-Cr cells elements and bulky L-C filter elements. The numerical method proposed in this paper shows high reliability and fast convergence, thanks to the adoption of an interval analysis based technique for the detection of commutations and of a compensation theorem based technique for the analysis of commutations. Some examples of steady-state analysis of two dc-dc converters, an inverter and a power factor corrector are presented to highlight the good performances of the simulation algorithm.

关键词： Steady-state Computational modeling Frequency conversion Filters Reliability theory Convergence of numerical methods Performance analysis algorithm design and analysis DC-DC power converters Inverters

来源：评论

学校读者我要写书评

暂无评论

GENERALIZED TLM algorithmS WITH CONTROLLED STABILITY MARGIN AND THEIR EQUIVALENCE WITH FINITE-DIFFERENCE FORMULATIONS FOR MODIFIED GRIDS

引用

IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES 1995年第9期43卷 2081-2089页

作者： CELUCHMARCYSIAK, M GWAREK, WK Institute of Radioelectronics Warsaw University of Technology Warsaw Poland Politechnika Warszawska Warszawa PL Inst. of Radioelectron. Warsaw Univ. of Technol. Poland

Generalized TLM formulations based on modified grids of 2-D shunt nodes or 3-D expanded nodes are proposed. Generalization consists of permitting flexible control of the numerical stability margin (and thus a time-step for a particular discretization), and of introducing enhanced models for curved boundaries. Formal equivalence between generalized TLM and FDTD algorithms based on the same grids is proved. Simple rules for transforming circuit models (from TLM to FDTD and vice versa) and for their equivalent excitation are given. It is demonstrated that the application of the generalized algorithm reduces computer resources required for the TLM analysis of a circular waveguide by an order of magnitude.

关键词： Finite difference methods Time domain analysis Circuit stability Application software algorithm design and analysis Microwave theory and techniques Microwave propagation Transmission lines Microwave circuits

来源：评论

学校读者我要写书评

暂无评论

design Methods for Parallel Hardware Implementation of Multimedia Iterative algorithms

IEEE DESIGN & TEST

引用

IEEE design & TEST 2013年第4期30卷 71-80页

作者： Rana, Vincenzo Beretta, Ivan Atienza, David Nacci, Alessandro A. Santambrogio, Marco D. Sciuto, Donatella Politecn Milan Dipartimento Elettron & Informaz I-20133 Milan Italy Ecole Polytech Fed Lausanne Embedded Syst Lab CH-1015 Lausanne Switzerland Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland Politecn Milan I-20133 Milan Italy

The methodology from this paper exploits fine and coarse-grained parallelism for the automated design of digital architectures for multimedia applications. Specific focus is placed on iterative algorithms, as demonstr... 详细信息

关键词： algorithm design and analysis Memory Management Iterative Methods design Methodology Multimedia Communication Parallel Processing

来源：评论

学校读者我要写书评

暂无评论

Efficient training of neural gas vector quantizers with analog circuit implementation

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING 1999年第6期46卷 688-698页

作者： Rovetta, S Zunino, R Univ Genoa Dept Biophys & Elect Engn I-16145 Genoa Italy

This paper presents an algorithm for training vector quantizers with an improved version of the Neural Gas model, and its implementation in analog circuitry. Theoretical properties of the algorithm are proven that clarify the performance of the method in terms of quantization quality, and motivate design aspects of the hardware implementation. The architecture for vector quantization training includes two chips, one for Euclidean distance computation, the other for programmable sorting of codevectors. Experimental results obtained in a real application (image coding) support both the algorithm's effectiveness and the hardware performance, which can speed up the training process by up to two orders of magnitude.

关键词： Analog circuits Signal processing algorithms Hardware Computer architecture Sorting algorithm design and analysis Very large scale integration Vector quantization Computational efficiency Euclidean distance

来源：评论

学校读者我要写书评

暂无评论

A Multi-GPU Program for Uncertainty-Aware Drainage Basin Delineation Scalability benchmarking with country-wide data sets

引用

IEEE GEOSCIENCE AND REMOTE SENSING MAGAZINE 2016年第3期4卷 59-68页

作者： Makinen, Ville Sarjakoski, Tapani Oksanen, Juha Westerholm, Jan Univ Jyvaskyla SF-40351 Jyvaskyla Finland Natl Land Survey Finland Finnish Geospatial Res Inst Dept Geoinformat & Cartog Helsinki Finland Aalto Univ FIN-02150 Espoo Finland Univ Helsinki FIN-00014 Helsinki Finland Abo Akad Univ Dept Informat Technol Turku Finland

Processing high-resolution digital elevation models (DEMs) can be tedious due to the large size of the data. In uncertainty-aware drainage basin delineation, we apply a Monte Carlo (MC) simulation that further increases the processing demand by two to three orders of magnitude. Utilizing graphics processing units (GPUs) can speed up the programs, but their on-chip random access memory (RAM) limits the size of the DEMs that can be processed efficiently on one GPU. Here, we present a parallel uncertainty-aware drainage basin delineation algorithm and a multinode GPU compute unified device architecture (CUDA) implementation along with scalability benchmarking. All of the computations are run on the GPUs, and the parallel processes communicate using a message-passing interface (MPI) via the host central processing units (CPUs). The implementation can utilize any number of nodes, with one or many GPUs per node. The performance and scalability of the program have been tested with a 10-m DEM covering 390,905 km2, i.e., the entire area of Finland. Performing the drainage basin delineation for the DEM with different numbers of GPUs shows a nearly linear strong scalability.

关键词： Graphics processing units Big data algorithm design and analysis Random access memory Geospatial analysis Partitioning algorithms Scalability

来源：评论

学校读者我要写书评

暂无评论

REDUCING CORRELATION TO IMPROVE COVERAGE OF DELAY FAULTS IN SCAN-PATH design

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 1994年第5期13卷 638-646页

作者： MAO, WW CILETTI, MD UNIV COLORADO DEPT ELECT & COMP ENGNBOULDERCO 80309 UNIV COLORADO DEPT ELECT & COMP ENGNCOLORADO SPRINGSCO 80933

Simulation data is presented for eleven benchmark circuits to show how test pattern correlation in a scan-path design circuit adversely affects delay fault coverage, and to demonstrate that most undetected delay faults caused by correlation of test patterns are close to the outputs of latches. Topology- based latch correlation measures are introduced and used by a companion latch arrangement algorithm to guide the placement of latches in a scan-path design, with the objective of minimizing the effect of correlation and maximizing the coverage of delay faults. Simulation results with benchmark circuits indicate that the scan-path found by the algorithm clearly achieves better delay fault coverage than a scan-path having no deliberate arrangement. The data also indicates that the algorithm is most effective in covering delay faults that are located nearest the latch outputs of the circuit. The approach has an advantage over other arrangement schemes in that it is simple to implement and does not require significant computational time even for large circuits.

关键词： Circuit faults Circuit testing Latches Sequential analysis Routing algorithm design and analysis Delay effects Circuit simulation Sequential circuits Hardware

来源：评论

学校读者我要写书评

暂无评论

PROPERTIES OF THE DELTA-OPERATOR MODEL OF DYNAMIC PHYSICAL SYSTEMS

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1993年第1期23卷 296-301页

作者： NEUMAN, CP Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA USA

For control system analysis and design, and high-speed real-time computation, we highlight the computational formulation, properties and applications of the delta operator model of dynamic physical systems. Doubling algorithms for reliable computation and illustrate the transfer function matrix of the delta operator model are formulated. In the fast sampling limit, the delta operator model tends to the dynamic system model. This intrinsic property of the delta operator model unifies continuous and discrete time control engineering and paves the way for the design of robust computational algorithms.

关键词： Signal processing algorithms Adaptive control algorithm design and analysis Sampling methods Control engineering Transfer functions Reliability engineering Digital control Adaptive signal processing Riccati equations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：