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

Novel algorithms and VLSI design for division over GF(2^m)

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2002年第5期E85A卷 1129-1139页

作者： Wu, CH Wu, CM Shieh, MD Hwang, YT Faculty of Electronic Engineering Department National Yun-Lin University of Science and Technology Taiwan Graduate School of Engineering Science and Technology National Yun-Lin University of Science and Technology Taiwan

In this paper, we present the division algorithm (DA) for the computation of b = c/a over GF(2(m)) in two aspects. First, we derive a new formulation for the discrete-tine Wiener-Hopf equation (DTWHE) Ab = c in GF(2) over any basis. Symmetry of the matrix A is observed on some special bases and a three-step procedure is developed to solve the symmetric DTWHE. Secondly;we extend a variant of Stein's binary algorithm and propose a novel iterative division algorithm EB*. Owing to its structural simplicity;this algorithm can be mapped onto a systolic array with high speed and low area complexity.

关键词： division algorithm basis matrix Stein's algorithm high speed finite field

来源：评论

学校读者我要写书评

暂无评论

Polynomial asymptotes

引用

INTERNATIONAL JOURNAL OF MATHEMATICAL EDUCATION IN SCIENCE AND TECHNOLOGY 2010年第7期41卷 943-950页

作者： Dobbs, David E. Univ Tennessee Dept Math Knoxville TN 37996 USA

This note develops and implements the theory of polynomial asymptotes to (graphs of) rational functions, as a generalization of the classical topics of horizontal asymptotes and oblique/slant asymptotes. Applications are given to hyperbolic asymptotes. Prerequisites include the division algorithm for polynomials with coefficients in the field of real numbers and the elementary limit theorems from calculus. This note could be used as enrichment material in courses ranging from Calculus to Real Analysis to Abstract Algebra.

关键词： rational function asymptote limit polynomial degree division algorithm quotient hyperbola

来源：评论

学校读者我要写书评

暂无评论

Kharitonov-like rectangle for the sectorial area stability

Kharitonov-like rectangle for the sectorial area stability

引用

SICE 2003 Annual Conference

作者： Okuyama, Y Tokushima Bunri Univ Dept Life Informat Technol Yamashiro Tokushima 7708514 Japan

ISBN: (纸本)0780383524

The physical parameters of control systems are uncertain and are accompanied by nonlinearity. The state space equation and the characteristic polynomial of the control system should, therefore, be expressed by an interval set of parameters. This paper examines the robust stability of that type of control system based on the characteristic roots which exist in a sectorial area on the left half s-plane. A sufficient condition for the robust stability is given by applying a division algorithm (Sturm's theorem) to the four corner polynomials, that is, a Kharitonov-like rectangle which covers all extreme points of the polytopic polynomial.

关键词： robust stability interval polynomials characterisitic roots Kharitonov theorem division algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Petri nets parallelization the functional divided conditions

Research on Petri nets parallelization the functional divide...

引用

12th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)

作者： Li, Wenjing Li, Shuang Lin, Zhong-ming Liao, Weizhi Guangxi Teachers Educ Univ Coll Comp & Informat Engn Nanning Peoples R China Jiaxing Univ Coll Math Phys & Inf Eng Jiaxing Peoples R China

ISBN: (纸本)9780769550602

In order to solve the parallel algorithm for Petri nets system with concurrent function, to realize the parallel control and execution of the Petri nets, the Petri nets parallel subnets conditions were proposed, that provides the theory basis for judging P- invariant whether was the parallel subnet. Firstly, we according to the concurrent character of Petri net model, to analyze the parallelism of Petri net system, P-invariants the solving process and it's subnet division were given;Secondly, the Petri nets parallel subnets conditions were proposed, gives P- invariant constituted of Petri net parallel subnets decision theorem, and the theoretical proof and example verification;Finally, A Petri net parallel subnet division algorithm based on P- invariants were given. Theoretical validate and experimental result shows that Petri nets parallel subnets conditions set and divided algorithm were correct and effective.

关键词： Petri nets P-invariant parallel subnet divided condition division algorithm

来源：评论

学校读者我要写书评

暂无评论

Knowledge communications for the solution of algebraic equations from an educational point of view

Knowledge communications for the solution of algebraic equat...

引用

10th World Multi-Conference on Systemics, Cybernetics and Informatics/12th International Conference on Information Systems Analysis and Synthesis

作者： Okuyama, Yoshifumi Nagahama, Taizou Tokushima Bunri Univ Dept Media Design Nishihamaboji 180 Yamashiro Tokushima 7708514 Japan

ISBN: (纸本)9789806560727

Theoretical problems in physical, biological and economical fields may require the solving of algebraic equations. However, the meaning of the solution of an algebraic equation has changed with the rapid improvement in computer performance. Usually, the roots of an algebraic equation will be calculated numerically (even for a quadratic equation?). Of course, any problem in science and engineering that involves algebraic equations can be solved numerically. However, knowledge on the analytical properties of an algebraic equation is also important. In this paper, we reconsider the analytical properties of quadratic, cubic and general algebraic equa tions based on the classic Sturm concept because of its educational value and its usefulness for analyzing and designing a real system with some uncertainty. The set of roots (infinite set) of algebraic equations with uncertain (interval set) coefficients cannot be determined numerically by finite calculations. We. will present a discussion dealing with these problems from an educational point of view, and we will communicate the classic Sturm concept to the students and the audience at the conference.

关键词： algebraic equations complex roots Sturm theorem division algorithm interval polynomials Kharitonov theorem

来源：评论

学校读者我要写书评

暂无评论

Iteration, not induction

引用

INTERNATIONAL JOURNAL OF MATHEMATICAL EDUCATION IN SCIENCE AND TECHNOLOGY 2009年第4期40卷 517-523页

作者： Dobbs, David E. Univ Tennessee Dept Math Knoxville TN 37996 USA

The main purpose of this note is to present and justify proof via iteration as an intuitive, creative and empowering method that is often available and preferable as an alternative to proofs via either mathematical induction or the well-ordering principle. The method of iteration depends only on the fact that any strictly decreasing sequence of positive integers must terminate in finitely many steps. Four examples are presented using the method of iteration. These examples concern the factorization of integers or polynomials into products of primes, the calculation of quotients and remainders via the division algorithm (and, hence, of greatest common divisors via the Euclidean algorithm) and the rank of matrices via elementary row and column operations. We also justify the method of proof by iteration by showing that its validity is a logical consequence of the method of mathematical induction. Various parts of this material would be suitable for courses on Precalculus, Discrete Mathematics, Abstract Algebra or Matrix Theory/Linear Algebra.

关键词： iteration mathematical induction well-ordering principle unique factorization into primes division algorithm rank of matrices via elementary operations

来源：评论

学校读者我要写书评

暂无评论

Low complexity encoder for generalized quasi-cyclic codes coming from finite geometries

Low complexity encoder for generalized quasi-cyclic codes co...

引用

IEEE International Conference on Communications (ICC 2009)

作者： Vo Tam Van Matsui, Hajime Mita, Seiichi Toyota Technol Inst Dept Elect & Informat Sci Tenpa Ku Nagoya Aichi 4688511 Japan

ISBN: (纸本)9781424434343

We define generalized quasi-cyclic (GQC) codes as linear codes with nontrivial automorphism groups. Therefore, GQC codes, unlike quasi-cyclic codes, can include many important codes such as Hermitian and projective geometry (PG) codes;this capability is important in practical applications. Further, we propose the echelon canonical form algorithm for computing Grobner bases from their parity check matrices. Consequently, by applying Grobner base theory, GQC codes can be systematically encoded and implemented with simple feedback shift registers. Our algorithm is based on Gaussian elimination and requires a sufficiently small number of finite-field operations, which is related to the third power of code-length. In order to demonstrate our encoder's efficiency, we prove that the number of circuit elements in the encoder architecture is proportional to the code-length for finite geometry (FG) LDPC codes (a class of GQC codes). We show that the hardware complexity of a serial-in-serial-out encoder architecture for FG-LDPC codes is related to the linear order of the code-length;less than 2n adder and 2n memory elements are required to encode a binary codeword of length n.

关键词： automorphism group Buchberger's algorithm division algorithm circulant matrix finite geometry low density parity check (LDPC) codes

来源：评论

学校读者我要写书评

暂无评论

A Time Efficient Secret Image Sharing Scheme for Group Authentication System Without Pixel Expansions 2nd

A Time Efficient Secret Image Sharing Scheme for Group Authe...

引用

2nd International Conference on Computer and Communication Technologies

作者： Biswas, Samarpita Dillen, Nicole Belinda Kole, Dipak Kumar Chakraborty, Aruna St Thomas Coll Engn & Technol 4 Diamond Harbour Rd Kolkata 700023 India Jalpaiguri Govt Engn Coll Jalpaiguri 735102 W Bengal India

ISBN: (纸本)9788132225263;9788132225256

Information security is of vital importance in today's internet world. Classified data such as military and government information are constantly transmitted over the internet. Among this, top secret data are images such as maps and surveillance footage. It is thus necessary to secure such visual data against unauthorized access. Visual secret sharing is the process of distributing "shares" of a secret image among a group of individuals. Only when all the shares have been combined, can the original secret image be obtained. In this paper, we have proposed a visual secret sharing scheme, using a simple division algorithm, for group authentication systems. This method has the advantage of being both time efficient and devoid of any pixel expansion. It can be applied to both grayscale as well as colour images and, as illustrated further ahead, ensures complete secrecy and regeneration of the original image from all the shares.

关键词： Visual cryptography Secret share scheme division algorithm Group authentication

来源：评论

学校读者我要写书评

暂无评论

Polynomial asymptotes of the second kind

引用

INTERNATIONAL JOURNAL OF MATHEMATICAL EDUCATION IN SCIENCE AND TECHNOLOGY 2011年第2期42卷 276-282页

作者： Dobbs, David E. Univ Tennessee Dept Math Knoxville TN 37996 USA

This note uses the analytic notion of asymptotic functions to study when a function is asymptotic to a polynomial function. Along with associated existence and uniqueness results, this kind of asymptotic behaviour is related to the type of asymptote that was recently defined in a more geometric way. Applications are given to rational functions and conics. Prerequisites include the division algorithm for polynomials with coefficients in the field of real numbers and elementary facts about limits from calculus. This note could be used as enrichment material in courses ranging from Calculus to Real Analysis to Abstract Algebra.

关键词： asymptotic functions limit polynomial rational function degree division algorithm hyperbola

来源：评论

学校读者我要写书评

暂无评论

On Complement division

引用

Communications of the ACM 1971年第4期14卷 260-264页

作者： Stein, Marvin L. Munro, William D. University of Minnesota Minneapolis United States

The division algorithm theorem is expressed in a form that permits it to serve as the basis for devising division operations that produce both quotient and remainder in complement form. algorithms for division yielding complement results are derived for numbers represented in any base greater than one. Both radix and radix-less-one complementation schemes are considered. The binary form of the algorithms thus includes both two's and one's complement implementation. The problem of quotient overflow for complement results is dealt with as is that of selecting an appropriate form of the remainder condition for complement division. © 1971, ACM. All rights reserved.

关键词： complement arithmetic complement division division algorithm one's complement arithmetic two's complement arithmetic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：