View : 37 Download: 0

Analysis on Yu et al.’s dynamic algorithm for canonic DBC

Title
Analysis on Yu et al.’s dynamic algorithm for canonic DBC
Authors
Eom S.Lee H.-S.Lim S.Song K.
Ewha Authors
이향숙임선간엄수경
SCOPUS Author ID
이향숙scopus; 임선간scopusscopus
Issue Date
2021
Journal Title
Discrete Applied Mathematics
ISSN
0166-218XJCR Link
Citation
Discrete Applied Mathematics vol. 294, pp. 31 - 40
Keywords
Double-base chainHamming weightScalar multiplication
Publisher
Elsevier B.V.
Indexed
SCIE; SCOPUS scopus
Document Type
Article
Abstract
Recently, Yu et al. presented an algorithm for a canonic DBC of a positive integer n by solving certain subproblems recursively and it requires O((logn)2loglogn) bit operations and O((logn)2) bits of memory. This is currently the most efficient recoding type algorithm for canonic DBCs when balanced computing power and memory are available. In this paper, we present a memory efficient algorithm to compute a nearly DBC from the idea of Yu et al. We present a simple overview of Yu et al.’s algorithm focusing on canonic DBC and refine Yu et al.’s proof for range of the leading term of canonic DBCs. By using the refined range, we suggest how to improve the efficiency of Yu et al.’s algorithm computationally and present an algorithm for nearly canonic DBC with memory requirement O(logn). We also present experimental comparison on the Hamming weights of Yu et al.’s algorithm, tree based algorithm, the classic greedy DBC algorithm, and our memory efficient algorithm. © 2021 Elsevier B.V.
DOI
10.1016/j.dam.2021.01.023
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE