Evaluation of Fast Sample Entropy Algorithms on FPGAs: From Performance to Energy Efficiency

Chao Chen1,2, Bruno da Silva2, Ruiqi Chen3

  • 1School of Instrument Science and Engineering, Southeast University, Nanjing 210096, China.

Entropy (Basel, Switzerland)
|September 23, 2022
PubMed
Summary

Hardware acceleration for sample entropy (SampEn) using FPGAs offers significant energy savings for time-series complexity analysis. Optimized algorithms on FPGAs provide a power-efficient alternative to traditional CPU-based methods for large datasets.

Related Concept Videos

Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
438
Entropy Change in Reversible Processes01:10

Entropy Change in Reversible Processes

In the Carnot engine, which achieves the maximum efficiency between two reservoirs of fixed temperatures, the total change in entropy is zero. The observation can be generalized by considering any reversible cyclic process consisting of many Carnot cycles. Thus, it can be stated that the total entropy change of any ideal reversible cycle is zero.
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
2.7K
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
272
Efficiency of The Carnot Cycle01:16

Efficiency of The Carnot Cycle

The hypothetical Carnot cycle consists of an ideal gas subjected to two isothermal and two adiabatic processes. Since the internal energy of an ideal gas depends only on its temperature, which is the same before and after the completion of the Carnot cycle, there is no change in its internal energy. Hence, using the first law of thermodynamics, the total heat exchanged by the ideal gas equals the total work done. Thus, we can quantify the efficiency of the Carnot cycle via the heat exchanged...
2.8K
Sampling Methods: Overview01:06

Sampling Methods: Overview

A sample refers to a smaller subset representative of a larger population. In analytical chemistry, studying or analyzing an entire population is often impractical or impossible. Therefore, samples are used to draw inferences and generalize the whole population. The sampling method selects individuals or items from a population to create a sample. Standard sampling methods include random, judgemental, systematic, stratified, and cluster sampling. 
In analytical chemistry, the choice of...
479