New Algorithm to Convert any Integer in TBNS
نویسندگان
چکیده
Algebraic complexity of different Algorithms in Signal Processing and Cryptography leads to a major problem and Researchers are trying to develop new Algorithms to solve these problems. To enhance the speed of the existing Algorithms, different number system have been found for point multiplication in elliptic curve cryptography and coefficient multiplication in digital signal processing manly for digital filter design. Among the different number system, DBNS, DBC, HBTJSF, w-NAF are efficient. Recently, to increase the speed again, TBNS, SDTBNS have been developed. There are different method to convert any integer or fraction into TBNS and hence SDTBNS. Here a new algorithm will be discussed which increase the conversion efficiency.
منابع مشابه
Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملGeneral Reversible Integer Transform Conversion
In this paper, we introduce an algorithm, which is named the triangular matrix scheme, to convert every reversible discrete linear transform into a reversible integer transform. The integer transform is a special case of the discrete linear transforms whose entries can be expressed as a summation of 2 k. It is much more efficient than the non-integer transform since it can be implemented by a f...
متن کاملA Vibration Damping Optimization Algorithm for Solving the Single-item Capacitated Lot-sizing Problem with Fuzzy Parameters
In this paper, we propose a vibration damping optimization algorithm to solve a fuzzy mathematical model for the single-item capacitated lot-sizing problem. At first, a fuzzy mathematical model for the single-item capacitated lot-sizing problem is presented. The possibility approach is chosen to convert the fuzzy mathematical model to crisp mathematical model. The obtained crisp model is in the...
متن کاملGlobal Supply Chain Management under Carbon Emission Trading Program Using Mixed Integer Programming and Genetic Algorithm
In this paper, the transportation problem under the carbon emission trading program ismodelled by mathematical programming and genetic algorithm. Since green supply chain issuesbecome important and new legislations are taken into account, carbon emissions costs are included inthe total costs of the supply chain. The optimisation model has the ability to minimise the total costsand provides the ...
متن کاملDecidability of the Membership Problem for 2 × 2 integer matrices
The main result of this paper is the decidability of the membership problem for 2 × 2 nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular 2 × 2 integer matrices M1, . . . ,Mn and M decides whether M belongs to the semigroup generated by {M1, . . . ,Mn}. Our algorithm relies on a translation of numerical problems on matrices into combinatorial pro...
متن کامل