Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity

Date

2012-03-01

Author

AKLEYLEK, SEDAT
Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

142
views

0
downloads

We give a modified redundant representation for designing arithmetic circuits with small complexity. Using our modified redundant representation, we improve many of the complexity values significantly. Our method works for any finite field. We also give some applications in cryptography.

Subject Keywords

Theoretical Computer Science, Hardware and Architecture, Computational Theory and Mathematics, Software

URI

https://hdl.handle.net/11511/40398

Journal

IEEE TRANSACTIONS ON COMPUTERS

DOI

https://doi.org/10.1109/tc.2011.29

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

Analysis of Second Order Time Filtered Backward Euler Method for MHD Equations Cibik, Aytekin; EROĞLU, FATMA GÜLER; Kaya Merdan, Songül (Springer Science and Business Media LLC, 2020-02-01) he present work is devoted to introduce the backward Euler based modular time filter method for MHD flow. The proposed method improves the accuracy of the solution without a significant change in the complexity of the system. Since time filters for fluid variables are added as separate post processing steps, the method can be easily incorporated into an existing backward Euler code. We show that the time filtered backward Euler method delivers better correct energy and cross-helicity balance in comparison w...
Learning customized and optimized lists of rules with mathematical programming Rudin, Cynthia; Ertekin Bolelli, Şeyda (Springer Science and Business Media LLC, 2018-12-01) We introduce a mathematical programming approach to building rule lists, which are a type of interpretable, nonlinear, and logical machine learning classifier involving IF-THEN rules. Unlike traditional decision tree algorithms like CART and C5.0, this method does not use greedy splitting and pruning. Instead, it aims to fully optimize a combination of accuracy and sparsity, obeying user-defined constraints. This method is useful for producing non-black-box predictive models, and has the benefit of a clear ...
Generalized nonbinary sequences with perfect autocorrelation, flexible alphabets and new periods BOZTAŞ, Serdar; Özbudak, Ferruh; TEKİN, Eda (Springer Science and Business Media LLC, 2018-05-01) We extend the parameters and generalize existing constructions of perfect autocorrelation sequences over complex alphabets. In particular, we address the PSK+ constellation (Boztas and Udaya 2010) and present an extended number theoretic criterion which is sufficient for the existence of the new sequences with perfect autocorrelation. These sequences are shown to exist for nonprime alphabets and more general lengths in comparison to existing designs. The new perfect autocorrelation sequences provide novel a...
Strongly regular graphs arising from non-weakly regular bent functions Özbudak, Ferruh (Springer Science and Business Media LLC, 2019-11-01) In this paper, we study two special subsets of a finite field of odd characteristics associated with non-weakly regular bent functions. We show that those subsets associated to non-weakly regular even bent functions in the GMMF class (see cesmelioglu et al. Finite Fields Appl. 24, 105-117 2013) are never partial difference sets (PDSs), and are PDSs if and only if they are trivial subsets. Moreover, we analyze the two known sporadic examples of non-weakly regular ternary bent functions given in Helleseth and...
A Favorable Weight-Based Evolutionary Algorithm for Multiple Criteria Problems SOYLU, Banu; Köksalan, Mustafa Murat (Institute of Electrical and Electronics Engineers (IEEE), 2010-04-01) In this paper, we present a favorable weight-based evolutionary algorithm for multiple criteria problems. The algorithm tries to both approximate the Pareto frontier and evenly distribute the solutions over the frontier. These two goals are common for many multiobjective evolutionary algorithms. To achieve these goals in our algorithm, each member selects its own weights for a weighted Tchebycheff distance function to define its fitness score. The fitness scores favor solutions that are closer to the Pareto...

Citation Formats

S. AKLEYLEK and F. Özbudak, “Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity,” IEEE TRANSACTIONS ON COMPUTERS, pp. 427–432, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40398.