Fibonacci sequence weighted SAR ADC algorithm and its DAC topology

Arafune, Takuya; Kobayashi, Yutaro; Shibuya, Shohei; Kobayashi, Haruo

doi:10.1109/asicon.2015.7517012

Cited by 6 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We came up with also Fibonacci sequence weighted DAC using R-R resistor networks (Fig. 22) [55]; their termination resistors are important. This can be used inside the Fibonacci sequence weighted SAR ADC.…”

Section: Fibonacci Sequence Weighted Dacmentioning

confidence: 99%

How the Author's Group Came Up with Ideas in Analog/Mixed-Signal Circuit and System Area

KOBAYASHI

2024

IEICE Trans. Fundamentals

Self Cite

View full text Add to dashboard Cite

This article reviews the author's group research achievements in analog/mixed-signal circuit and system area with introduction of how they came up with the ideas. Analog/mixed-signal circuits and systems have to be designed as well-balanced in many aspects, and coming up ideas needs some experiences and discussions with researchers. It is also heavily dependent on researchers. Here, the author's group own experiences are presented as well as their research motivations.

show abstract

Section: Fibonacci Sequence Weighted Dacmentioning

confidence: 99%

How the Author's Group Came Up with Ideas in Analog/Mixed-Signal Circuit and System Area

KOBAYASHI

2024

IEICE Trans. Fundamentals

Self Cite

View full text Add to dashboard Cite

show abstract

“…Recent literature showed that considering its unique characteristics, Fibonacci sequence is used widespread in the modern era as in the application of lighting system [19], in the prediction of fluid flow and heat transfer [20], automotive [21], as well as cryptography application [22,23]. Fibonacci sequence is a sequence of integer numbers characterized that each element in it is the sum of the two preceding elements, except for the first two elements.…”

Section: Related Workmentioning

confidence: 99%

“…( 1 and n) It also can be proven that the decryption process of i is reversible of the encryption process of i , for to n, through the following equations (18)(19)(20)(21)(22), by substituting i in ( 18) with (7).…”

Section: Decryption Functionmentioning

confidence: 99%

New Key Generation and Encryption Algorithms for Privacy Preservation in Mobile Ad Hoc Networks

Amiruddin

Ratna

Sari

2022

Int. j. commun. netw. inf. secur.

View full text Add to dashboard Cite

Mobile Ad Hoc Networks (MANETs) get widespread applications along with the evolving technologies. However, MANETs are at risk due to the shortage of security mechanisms. In this paper, we propose new algorithms for key generation and encryption for privacy preservation in MANETs. Our key generation algorithm modified Fibonacci sequence by adding scrambling factors to generate random key sequences with required length but incurred low computational overhead, whereas the encryption/decryption algorithm utilizes the One Time Pad (OTP) system by adding scrambling factors for data confidentiality which satisfies the randomness, diffusion, and confusion tests. Simulation of the proposed algorithms was conducted using Matlab and NS-2. Experiment results showed that the proposed algorithms produced random key sequences and random Ciphertexts. Through several tests i.e. speed, correlation and autocorrelation, diffusion, and confusion tests, the simulation result showed the superiority of our algorithms over the other algorithms. For the proof of concept, the proposed algorithms have been simulated in the network simulator, where the result showed that along with the increase of the number of nodes, the throughput of the network increased, while the delay is relatively constant around 6000 ms for 20 up to 70 nodes.

show abstract