Ferdinand Peper
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ferdinand Peper has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Kenji Leibnitz
Center for Information and Neural Networks, National Institute of Information and Communications Technology, Osaka, Japan
8 shared publications - Mikio Hasegawa
Department of Electrical Engineering, Tokyo University of Science, Tokyo, Japan
8 shared publications - Naoki Wakamiya
The University of Osaka
8 shared publications Jia Lee
7 shared publications- Teijiro Isokawa
Graduate School of Engineering, University of Hyogo, Himeji, Hyogo, Japan
7 shared publications - Nobuyuki Matsui
University of Hyogo
6 shared publications
Latest Publications
- Open Access
Energy-Efficient Pseudo-Ratchet for Brownian Computers through One-Dimensional Quantum Brownian Motion
Brownian computers utilize thermal fluctuations as a resource for computation and hold promise for achieving ultra-low-energy computations. However, the lack of a statistical direction in Brownian motion necessitates the incorporation of ratchets that facilitate the speeding up and completion of computations in Brownian computers. To make the ratchet mechanism work effectively, an external field is required to overcome thermal fluctuations, which has the drawback of increasing energy consumption. As a remedy for this drawback, we introduce a new approach based on one-dimensional (1D) quantum Brownian motion, which exhibits intrinsic unidirectional transport even in the absence of external forces or asymmetric potential gradients, thereby functioning as an effective pseudo-ratchet. Specifically, we exploit that quantum resonance effects in 1D systems divide the momentum space of particles into subspaces. These subspaces have no momentum inversion symmetry, resulting in the natural emergence of unidirectional flow. We analyze this pseudo-ratchet mechanism without energy dissipation from an entropic perspective and show that it remains consistent with the second law of thermodynamics.
Open AccessEnergy-Efficient Pseudo-Ratchet for Brownian Computers through One-Dimensional Quantum Brownian Motion
Brownian computers utilize thermal fluctuations as a resource for computation and hold promise for achieving ultra-low-energy computations. However, the lack of a statistical direction in Brownian motion necessitates the incorporation of ratchets that facilitate the speeding up and completion of computations in Brownian computers. To make the ratchet mechanism work effectively, an external field is required to overcome thermal fluctuations, which has the drawback of increasing energy consumption. As a remedy for this drawback, we introduce a new approach based on one-dimensional (1D) quantum Brownian motion, which exhibits intrinsic unidirectional transport even in the absence of external forces or asymmetric potential gradients, thereby functioning as an effective pseudo-ratchet. Specifically, we exploit that quantum resonance effects in 1D systems divide the momentum space of particles into subspaces. These subspaces have no momentum inversion symmetry, resulting in the natural emergence of unidirectional flow. We analyze this pseudo-ratchet mechanism without energy dissipation from an entropic perspective and show that it remains consistent with the second law of thermodynamics.
- Open Access
- 18 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 100515-100528
Performance Evaluation of Asynchronous Pulse Code Multiple Access in Massive IoT Networks
The Internet of Things (IoT) has revolutionized the way we interact with everyday objects by connecting sensors/actuators to the Internet to monitor and control various aspects of our environment. As the number of IoT devices continues to grow, efficient medium access control protocols are needed to ensure that communication takes place in a reliable and scalable manner. In this paper, we investigate the performance of the Asynchronous Pulse Code Multiple Access (APCMA) protocol in massive IoT scenarios through simulations and analysis. We show that APCMA is able to outperform CSMA/CA in terms of the number of successfully transmitted messages in scenarios with up to 30,000 transmitting sensor nodes while also being able to utilize the channel more efficiently. We also examine the sensitivity of APCMA’s performance with respect to its parameters.
- 18 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 100515-100528
Open AccessPerformance Evaluation of Asynchronous Pulse Code Multiple Access in Massive IoT Networks
The Internet of Things (IoT) has revolutionized the way we interact with everyday objects by connecting sensors/actuators to the Internet to monitor and control various aspects of our environment. As the number of IoT devices continues to grow, efficient medium access control protocols are needed to ensure that communication takes place in a reliable and scalable manner. In this paper, we investigate the performance of the Asynchronous Pulse Code Multiple Access (APCMA) protocol in massive IoT scenarios through simulations and analysis. We show that APCMA is able to outperform CSMA/CA in terms of the number of successfully transmitted messages in scenarios with up to 30,000 transmitting sensor nodes while also being able to utilize the channel more efficiently. We also examine the sensitivity of APCMA’s performance with respect to its parameters.
- 2 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 103-108
Enhancing Data Rate of Asynchronous Pulse Code Multiple Access for Massive IoT
Asynchronous Pulse Code Multiple Access (APCMA) has been proposed as a wireless communication system suitable for Massive IoT, which is resilient against high-volume packet transmissions from numerous devices. Previous studies have demonstrated its effectiveness compared to other Low Power Wide Area (LPWA) protocols by experimentally evaluating it in the 920 MHz band. Chirp Spread Spectrum-based (CSS)-APCMA has also been proposed to enhance the reception sensitivity of APCMA, enabling long-range communication similar to other LPWA systems. In this paper, we evaluate the throughput performance of optimized CSS-APCMA with enhanced time resolution and broader bandwidth. We have implemented the proposed CSS-APCMA using USRP and GNU Radio and conducted experiments to explore the maximum achievable throughput and evaluate its performance in high-density wireless environments. Our experimental results demonstrate a significantly higher throughput compared to conventional APCMA.
- 2 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 103-108
Enhancing Data Rate of Asynchronous Pulse Code Multiple Access for Massive IoT
Asynchronous Pulse Code Multiple Access (APCMA) has been proposed as a wireless communication system suitable for Massive IoT, which is resilient against high-volume packet transmissions from numerous devices. Previous studies have demonstrated its effectiveness compared to other Low Power Wide Area (LPWA) protocols by experimentally evaluating it in the 920 MHz band. Chirp Spread Spectrum-based (CSS)-APCMA has also been proposed to enhance the reception sensitivity of APCMA, enabling long-range communication similar to other LPWA systems. In this paper, we evaluate the throughput performance of optimized CSS-APCMA with enhanced time resolution and broader bandwidth. We have implemented the proposed CSS-APCMA using USRP and GNU Radio and conducted experiments to explore the maximum achievable throughput and evaluate its performance in high-density wireless environments. Our experimental results demonstrate a significantly higher throughput compared to conventional APCMA.
- 1 September 2023
- Published by Springer Nature in The European Physical Journal Special Topics
- Vol. 232 (20-22) , 3259-3265
Thermodynamic cost of Brownian computers in the stochastic thermodynamics of resetting
- 1 September 2023
- Published by Springer Nature in The European Physical Journal Special Topics
- Vol. 232 (20-22) , 3259-3265
Thermodynamic cost of Brownian computers in the stochastic thermodynamics of resetting
- Open Access
Thermodynamic cost of Brownian computers in the stochastic thermodynamics of resetting
We analyze the thermodynamic cost of a logically reversible Brownian Turing machine operating in the first-passage time protocol based on the stochastic thermodynamics of resetting. In this framework, the thermodynamic cost of computation is the reset entropy production, which is interpreted as the information reduction by a resetter external to the computer. At the level of a single trajectory, the reset entropy production is associated with unidirectional transitions and is a function of the time-dependent distribution probability. We analyze an approximation that replaces the distribution probability with the empirical sojourn time, which can be obtained at the single-trajectory level. The approximation is suitable for the numerical analysis by the Gillespie algorithm and provides a reasonable average value for the reset entropy.
Open AccessThermodynamic cost of Brownian computers in the stochastic thermodynamics of resetting
We analyze the thermodynamic cost of a logically reversible Brownian Turing machine operating in the first-passage time protocol based on the stochastic thermodynamics of resetting. In this framework, the thermodynamic cost of computation is the reset entropy production, which is interpreted as the information reduction by a resetter external to the computer. At the level of a single trajectory, the reset entropy production is associated with unidirectional transitions and is a function of the time-dependent distribution probability. We analyze an approximation that replaces the distribution probability with the empirical sojourn time, which can be obtained at the single-trajectory level. The approximation is suitable for the numerical analysis by the Gillespie algorithm and provides a reasonable average value for the reset entropy.
- 14 May 2023
- Published by Springer Nature
- p. 23-33
Brownian Circuits: From Computation to Neural Networks
- 14 May 2023
- Published by Springer Nature
- p. 23-33
Brownian Circuits: From Computation to Neural Networks
- 1 January 2022
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 13 (2) , 318-323
Evaluation and optimization of asynchronous pulse code multiple access
To realize massive IoT environments, we proposed Asynchronous Pulse Code Multiple Access (APCMA). APCMA encodes information as intervals between pulses. The sparse signal of APCMA allows a large number of devices to share the limited radio resources. In this paper, we evaluate APCMA with a variety of setting and find that code division of two and duty cycle of 0.01 % can provide 10000 devices with the per-device throughput of about 3.46 bps with 99 % precision. It also is shown that APCMA outperfoms LoRaWAN and CDMA.
- 1 January 2022
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 13 (2) , 318-323
Evaluation and optimization of asynchronous pulse code multiple access
To realize massive IoT environments, we proposed Asynchronous Pulse Code Multiple Access (APCMA). APCMA encodes information as intervals between pulses. The sparse signal of APCMA allows a large number of devices to share the limited radio resources. In this paper, we evaluate APCMA with a variety of setting and find that code division of two and duty cycle of 0.01 % can provide 10000 devices with the per-device throughput of about 3.46 bps with 99 % precision. It also is shown that APCMA outperfoms LoRaWAN and CDMA.
- 1 January 2022
- Published by Springer Nature
- p. 693-706
Evaluating Multiple-Access Protocols: Asynchronous Pulse Coding vs. Carrier-Sense with Collision Avoidance
- 1 January 2022
- Published by Springer Nature
- p. 693-706
Evaluating Multiple-Access Protocols: Asynchronous Pulse Coding vs. Carrier-Sense with Collision Avoidance
- 1 December 2021
- Published by Elsevier in Physica D: Nonlinear Phenomena
- Vol. 428
Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata
- 1 December 2021
- Published by Elsevier in Physica D: Nonlinear Phenomena
- Vol. 428
Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata