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

Solving Mesoscale Atmospheric Dynamics Using a Reconfigurable Dataflow Architecture

IEEE MICRO 2017年第4期37卷 40-50页

作者： Gan, Lin Fu, Haohuan Luk, Wayne Yang, Chao Xue, Wei Yang, Guangwen Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China Tsinghua Univ Minist Educ Key Lab Earth Syst Modeling Beijing Peoples R China Tsinghua Univ Dept Earth Syst Sci Beijing Peoples R China Imperial Coll London Comp Engn London England Chinese Acad Sci Lab Parallel Software & Computat Sci Inst Software Beijing Peoples R China

This article presents an efficient dataflow methodology for solving Euler atmospheric dynamic equations. The authors map a complex Euler stencil kernel into a single field-programmable gate array chip and develop a long streaming pipeline that can perform 956 mixed-precision operations per cycle. Their dataflow design outperforms traditional multicore and many-core counterparts in both time to solution and energy to solution.

关键词： algorithm design and analysis Atmospheric modeling Computational modeling Computer architecture dataflow architectures earth and atmospheric sciences Field programmable gate arrays Mathematical model reconfigurable hardware Three-dimensional displays

来源：评论

学校读者我要写书评

暂无评论

Log-Linear-Complexity GLRT-Optimal Noncoherent Sequence Detection for Orthogonal and RFID-Oriented Modulations

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第4期64卷 1600-1612页

作者： Alevizos, Panos N. Fountzoulas, Yannis Karystinos, George N. Bletsas, Aggelos Tech Univ Crete Sch Elect & Comp Engn Khania 73100 Greece

Orthogonal modulation, for example, frequency-shift keying (FSK) or pulse-position modulation (PPM), is primarily used in relatively-low-rate communication systems that operate in the power-limited regime. Optimal noncoherent detection of orthogonally modulated signals takes the form of sequence detection and has exponential (in the sequence length) complexity when implemented through an exhaustive search among all possible sequences. In this work, for the first time in the literature, we present an algorithm that performs generalized-likelihoodratio-test (GLRT) optimal noncoherent sequence detection of orthogonally modulated signals in flat fading with log-linear (in the sequence length) complexity. Moreover, for Rayleigh fading channels, the proposed algorithm is equivalent to the maximum-likelihood (ML) noncoherent sequence detector. Simulation studies indicate that the optimal noncoherent FSK detector attains coherent-detection performance when the sequence length is on the order of 100, offering a 3-5 dB gain over the typical energy (single-symbol) detector. While the conventional exhaustive-search approach becomes infeasible for such sequence lengths, the proposed implementation requires a log-linear only number of operations, opening new avenues for practical deployments. Finally, we show that our algorithm also solves efficiently the optimal noncoherent sequence detection problem in contemporary radio frequency identification (RFID) systems.

关键词： algorithm design and analysis combinatorial mathematics fading channels FM0 coding frequency-shift keying generalized likelihood-ratio test maximum-likelihood detection noncoherent communication pulse-position modulation radio-frequency identification sequence detection wireless communication

来源：评论

学校读者我要写书评

暂无评论

M-ARY SEQUENTIAL HYPOTHESIS TESTS FOR AUTOMATIC TARGET RECOGNITION

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 1992年第2期28卷 473-483页

作者： JOUNY, I GARBER, FD WRIGHT STATE UNIV DEPT ELECT ENGNDAYTONOH 45435

Several forms of sequential hypothesis testing algorithms are described and their performance as classification algorithms for automatic target recognition is evaluated and compared. Several forms of parametric algorithms, as well as sequential form of a useful nonparametric algorithm are considered. The primary focus is the design of algorithms for automatic target recognition that produce maximally reliable decisions while requiring, on the average, a minimum number of backscatter measurements. The tradeoffs between the average number of required measurements and the error performance of the resulting algorithms are compared by means of Monte-Carlo simulation studies.

关键词： Automatic testing Sequential analysis Target recognition Backscatter algorithm design and analysis Radar measurements Airborne radar Error analysis Probability Object detection

来源：评论

学校读者我要写书评

暂无评论

FIXED-POINT ERROR analysis OF STOCHASTIC GRADIENT ADAPTIVE LATTICE FILTERS

引用

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING 1990年第1期38卷 70-80页

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

A theoretical analysis is presented of the stochastic gradient adaptive lattice filter used as a linear, one-step predictor, when the effects of finite-precision arithmetic are taken into account. Only the fixed-point implementation is considered. Both the unnormalized and normalized adaptation algorithms are analyzed. Expressions of the steady-state mean-squared values of the accumulated numerical errors in the computation of the reflection coefficients and the prediction errors of different orders have been developed. The results show that the dominant term in the expressions for the mean-squared values of the numerical errors is inversely proportional to the convergence parameter. Furthermore, they indicate that the quantization errors associated with the reflection coefficients are more critical than those associated with representing the prediction-error sequences. Signals with high correlation among samples produce larger numerical errors in the adaptive lattice filter. The authors present several simulation examples that show close agreement with the theoretical results. They also show that the gradient adaptive lattice filters have better numerical properties than their transversal counterparts.< >

关键词： Error analysis Stochastic processes Lattices Adaptive filters Reflection Transversal filters Nonlinear filters Arithmetic algorithm design and analysis Steady-state

来源：评论

学校读者我要写书评

暂无评论

ON-LINE analysis OF WIRE SPARK CHAMBER DATA

引用

IEEE TRANSACTIONS ON NUCLEAR SCIENCE 1969年第1期NS16卷 114-&页

作者： BENISTON, MJ IBM Scientific Center Palo Alto CA USA

By attaching a medium-sized computer (IBM 1800) on-line to a wire spark chamber system and using simple algorithms, it is possible to analyze all the events and thus have much improved capability of monitoring the exp... 详细信息

关键词： Wire Sparks Computerized monitoring Spectroscopy Physics Magnetic analysis Computer aided instruction Joining processes algorithm design and analysis Linear accelerators

来源：评论

学校读者我要写书评

暂无评论

Managing data storage in the network

引用

IEEE INTERNET COMPUTING 2001年第5期5卷 50-58页

作者： Plank, JS Bassi, A Beck, M Moore, T Swany, DM Wolski, R University of Tennessee Computer Science Department Knoxville TN United States

The use of Internet backplane protocol (IBP) in enabling applications to treat the Internet as a backplane processor, is discussed. The IBP supports logistical networking to allow applications to control the movement and storage of data between nodes. IBP could be characterized as a mechanism to manage either communication buffers or remote files. It manages the path of data through both time and space. The logical backbone (Lbone) allows access to a collection of IBP depots deployed in the Internet specifically to offer network storage to applications.

关键词： Internet Protocols Application Program Interfaces Resource Allocation Storage Management Client Server Systems Data Storage Management Internet Backplane Protocol Uniform Interface State Management Internet Networking Protocols Logistical Networking Distributed Applications Processor Backplane Remote Storage Standard Internet Resources EBP API Middleware design IBP Alpha Versions Layered Approach Memory Intelligent Networks IP Networks Buffer Storage Internet Backplanes algorithm design and analysis Routing Access Protocols Communication Standards

来源：评论

学校读者我要写书评

暂无评论

Reflecting on algorithmic Bias With design Fiction: The MiniCoDe Workshops

引用

IEEE INTELLIGENT SYSTEMS 2024年第2期39卷 40-50页

作者： Turchi, Tommaso Malizia, Alessio Borsci, Simone Univ Pisa I-56126 Pisa Italy Univ Twente Enschede Netherlands

In an increasingly complex everyday life, algorithms-often learned from data, i.e., machine learning (ML)-are used to make or assist with operational decisions. However, developers and designers usually are not entirely aware of how to reflect on social justice while designing ML algorithms and applications. algorithmic social justice-i.e., designing algorithms including fairness, transparency, and accountability-aims at helping expose, counterbalance, and remedy bias and exclusion in future ML-based decision-making applications. How might we entice people to engage in more reflective practices that examine the ethical consequences of ML algorithmic bias in society? We developed and tested a design-fiction-driven methodology to enable multidisciplinary teams to perform intense, workshop-like gatherings to let potential ethical issues emerge and mitigate bias through a series of guided steps. With this contribution, we present an original and innovative use of design fiction as a method to reduce algorithmic bias in co-design activities.

关键词： Ethics Machine learning algorithms Intelligent systems Machine learning Decision making Standards algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

THE USE OF CURVED SEGMENTS FOR NUMERICALLY MODELING THIN WIRE ANTENNAS AND SCATTERERS

引用

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION 1992年第6期40卷 682-689页

作者： CHAMPAGNE, NJ WILLIAMS, JT WILTON, DR Department of Electrical Engineering University of Houston Houston TX USA

Modeling wire structures with a high degree of curvature generally requires a large number of piecewise linear segments to accurately represent rapid geometrical variations. In order to reduce the number of segments required to model curved wire structures, a method of moments formulation using curved wire segments is presented. Specifically, piecewise quadratic wire segments are used to discretize the wire geometry. This algorithm is used to analyze a small wire loop antenna and a multiple-arm Archimedian spiral antenna. For each example, a comparison is made between results obtained using this quadratic segment algorithm and a linear segment algorithm. These examples demonstrate that the memory required is significantly reduced and a reduction in the solution time is achieved when quadratic segments are used.

关键词： Numerical models Wire Scattering Solid modeling Moment methods Spirals Integral equations Piecewise linear techniques algorithm design and analysis Geometry

来源：评论

学校读者我要写书评

暂无评论

Leaky LMS algorithm: MSE analysis for Gaussian data

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1997年第4期45卷 927-934页

作者： Mayyas, K Aboulnasr, T UNIV OTTAWA DEPT ELECT ENGNOTTAWAON K1N 6N5CANADA

Despite the widespread usage of the leaky LMS algorithm, there has been no detailed study of its performance, This paper presents an analytical treatment of the mean-square error (MSE) performance for the leaky LMS adaptive algorithm for Gaussian input data, The common independence assumption regarding W(n) and X(n) is also used. Exact expressions that completely characterize the second moment of the coefficient vector and algorithm steady-state excess MSE are developed, Rigorous conditions for MSE convergence are also established. Analytical results are compared with simulation and are shown to agree well.

关键词： Least squares approximation Data analysis algorithm design and analysis Signal processing algorithms Performance analysis Convergence Adaptive algorithm Steady-state Telephony Interference

来源：评论

学校读者我要写书评

暂无评论

A WEIGHTED LEAST-SQUARES algorithm FOR QUASI-EQUIRIPPLE FIR AND IIR DIGITAL-FILTER design

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1992年第3期40卷 551-558页

作者： LIM, YC LEE, JH CHEN, CK YANG, RH NATL TAIWAN UNIV DEPT ELECT ENGNTAIPEI 10764TAIWAN

It has been demonstrated by several authors that if a suitable frequency response weighting function is used in the design of an FIR filter, the weighted least squares solution is equiripple. The crux of the problem in the design of equiripple filters using the weighted least squares technique lies in the determination of the necessary least squares frequency response weighting function. In this paper, a novel iterative algorithm for deriving the least squares frequency response weighting function which will produce a quasi-equiripple design is presented. The algorithm converges very rapidly. From our experience, it typically produces a design which is only about 1 dB away from the minimax optimum solution in two iterations and converges to within 0.1 dB in six iterations. Convergence speed is independent of the order of the filter. It can be used to design filters with arbitrarily prescribed phase and amplitude response.

关键词： Least squares methods Finite impulse response filter Digital filters algorithm design and analysis Frequency response Minimax techniques Iterative algorithms Fourier series Least squares approximation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：