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

作者： Khan, Salman University of Victoria

学位级别：master

division is one of the most fundamental arithmetic operations and is used extensively in engineering, scientific, mathematical and cryptographic applications. The implementation of arithmetic operation such as division, is complex and expensive in hardware. Unlike addition and subtraction, division requires several iterative computational steps on given operands to produce the result. division, in the past has often been perceived as an infrequently used operation and received not as much attention but it is one of the most difficult operations in computer arithmetic. The techniques of implementation in hardware of such an iterative computation impacts the speed, the area and power of the digital circuit. For this reason, we consider two division algorithms based on their step size in shift. Algorithm 1 operates on fixed shift step size and has a fixed number of iteration while the algorithms 2 operates on variable shift step size and requires considerably fewer number of iterations. In this thesis, technique is provided to save power and speed up the overall computation. It also looks at different design goal strategies and presents a comparative study to asses how each of the two design perform in terms of area, delay and power consumption. Graduate Advisors/Committee Members: Gebali, Fayez (supervisor), Ibrahim, Atef (supervisor)

关键词： division algorithms

来源：评论

学校读者我要写书评

暂无评论

Polynomial expressions for non-binomial structures

引用

THEORETICAL COMPUTER SCIENCE 2019年 762卷 13-24页

作者： Sabeti, Rostam Great Lakes Assoc Algebra & Computat 4258 Graystone Dr Okemos MI 48864 USA

Following recent paper of the author about polynomial expressions with respect to binomial ideals, the current paper is devoted to the non-binomial case. Beside the established facts in the underlying theory, the correctness and termination of the algorithms are addressed. From the collection of examples, the main large-scale nonbinomial one is of particular importance. Application of the new algorithms for the cases of moderately large binomial like cyclic 16-roots and cyclic 18-roots is discussed. A combinatorial analysis for complexity of the proposed algorithms is shown to be at least O(log(log n)n(2)(log n)(2)). (C) 2018 Elsevier B.V. All rights reserved.

关键词： Algebraic expressions division algorithms Cyclic n-roots

来源：评论

学校读者我要写书评

暂无评论

A Priori Parameter Identifiability in Complex Reaction Networks

引用

IFAC-PapersOnLine 2018年第15期51卷 760-765页

作者： Varghese, Arun Narasimhan, Sridharakumar Bhatt, Nirav Department of Chemical Engineering Indian Institute of Technology Madras Chennai600036 India

A priori parameter identifiability is an important element in building reliable models for complex reaction networks in systems biology and chemical engineering. Differential algebra has been widely used to study a priori structural identifiability of nonlinear systems, and also implemented in several software tools, for example, DAISY (Differential Algebra for Identifiability of SYstems) (Bellu et al., Computer methods and programs in biomedicine, 88(1), 2017). This technique usually fails for complex reaction networks which involve several reactions and species. In this paper, we use the concept of extent of reaction to simplify the procedure for testing identifiability. A linear transformation is used to convert the system from the concentration domain to the extent domain so that the input output map is readily generated without use of Ritt's pseudo–division algorithm. Then, further identifiability can be studied. The proposed approach is illustrated using a complex reaction network. © 2018

关键词： Complex networks Algebra Differential equations Linear transformations Mathematical transformations Complex reactions division algorithms Extent Domain Parameter identifiability Systems biology

来源：评论

学校读者我要写书评

暂无评论

Formal Verification and Debugging of Array Dividers With Auto-Correction Mechanism

Formal Verification and Debugging of Array Dividers With Aut...

引用

27th International Conference on VLSI Design / 13th International Conference on Embedded Systems (VLSID)

作者： Haghbayan, M. H. Alizadeh, B. Behnam, P. Safari, S. Univ Tehran Coll Engn Sch Elect & Comp Engn Tehran Iran

ISBN: (纸本)9781479925124

Arithmetic circuits require a verification process to prove that the gate level circuit is functionally equivalent to a high level specification or not. Furthermore, if two models are not equivalent, we need to automatically localize bugs and correct them with minimum user intervention. This paper presents a formal technique to verify and debug arithmetic systems including dividers. The proposed technique is based on a reverse-engineering mechanism of obtaining a high level model of the gate level implementation and also presenting the specification at a lower level of abstraction which makes the equivalence checking between two models possible. During this process, if two high level models are not equivalent, possible bugs can be localized and then corrected automatically if possible. We have applied our technique to a wide range of arithmetic circuits including dividers, multipliers and their combinations. Preliminary experimental results show robustness of the proposed technique in comparison with other contemporary methods in terms of the run time. In average, two orders of magnitude average speedup is obtained.

关键词： Formal verification debugging arithmetic circuits division algorithms

来源：评论

学校读者我要写书评

暂无评论

On digit-recurrence division algorithms for self-timed circuits

On digit-recurrence division algorithms for self-timed circu...

引用

Conference on Advanced Signal Processing algorithms, Architectures, and Implementations XI

作者： Boullis, N Tisserand, A Ecole Normale Super Lyon LIP F-69364 Lyon France

ISBN: (纸本)0819441880

The optimization of algorithms for self-timed or asynchronous circuits requires specific solutions. Due to the variable-time capabilities of asynchronous circuits, the average computation time should be optimized and not only the worst case of the signal propagation. If efficient algorithms and implementations are known for asynchronous addition arid multiplication. only straightforward algorithms have been studied for division. This paper compares several digit-recurrence division algorithms (speed. area and circuit activity for estimating the power consumption). Tile comparison is based on simulations of the different operators described at the gate level. This work shows that the best solutions for asynchronous circuits are quite different from those used in synchronous circuits.

关键词： computer arithmetic division algorithms SRT tables asynchronous circuits self-timed circuits

来源：评论

学校读者我要写书评

暂无评论

A protected division algorithm 5

A protected division algorithm

引用

5th Smart Card Research and Advanced Application Conference

作者： Joye, M Villegas, K Gemplus Card International Card Security Group France

ISBN: (纸本)1931971048

Side-channel analysis is a powerful tool for retrieving secrets embedded in cryptographic devices such as smart cards. Although several practical solutions have been proposed to prevent the leakage of sensitive data, mainly the protection of the basic cryptographic operation itself has been thoroughly investigated. For example, for exponentiation-based cryptosystems (including RSA, DH or DSA), various exponentiation algorithms protected against side-channel analysis are known. However, the exponentiation algorithm itself or the underlying cryptoalgorithm often involve division operations (for computing a quotient or a remainder). The first case appears in the normalization (resp. denormalization) process in fast exponentiation algorithms and the second case appears in the data processing before (resp. after) the call to the exponentiation operation. This paper proposes an efficient division algorithm protected against simple side-channel analysis. The proposed algorithm applies equally well to software and hardware implementations. Furthermore, it does not impact the running time nor the memory requirements.

关键词： division algorithms smart cards side-channel analysis SPA protected implementations

来源：评论

学校读者我要写书评

暂无评论

FAST division TECHNIQUE FOR CONSTANT DIVISORS

引用

COMMUNICATIONS OF THE ACM 1976年第2期19卷 98-101页

作者： ARTZY, E HINDS, JA SAAL, HJ SUNY Buffalo BUFFALO NY 14214 USA

A fast algorithm for division by constant divisors is presented. The method has proved very useful implemented as microcode on a binary machine, and can be adapted directly into hardware. The mathematical foundations ... 详细信息

关键词： bit addressable memory constant divisors division algorithms microprogram

来源：评论

学校读者我要写书评

暂无评论

RIGHT SHIFT FOR LOW-COST MULTIPLY AND DIVIDE

引用

IEEE TRANSACTIONS ON COMPUTERS 1971年第12期C 20卷 1586-&页

作者： SHEPHERD, BJ IEEE Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions

Although integrated-circuit technology promises to reduce the cost of logic, there are still situations where low-cost multiplication and/or division algorithms must be implemented in today"s technology. This can be accomplished by the algorithms presented here: repetitive addition (subtraction) algorithms for multiplication (division), employing a right shift. The result of the operation is truncated, which limits the accurqcy but reduces significantly the amount of intermediate storage required. The degree of accuracy is quite adequate for selected applications.

关键词： division algorithms inexpensive hardware operations multiplication algorithms operations employing right shift recursive algorithms.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：