Related Experiment Video
Updated: Aug 29, 2025

08:22
Author Spotlight: Advancing the Study of Brain-Heart Interplay with a Comprehensive EEGLAB Plugin for Multimodal Signal Analysis
Published on: April 26, 2024
2.1K
Energy-Based DCT Approach for PPG Compression.
Summary
This study introduces a novel photoplethysmography (PPG) compression method using discrete cosine transform (DCT) energy. The technique efficiently compresses PPG signals from wearable devices while preserving crucial data and reducing noise.
Area of Science:
- Biomedical Engineering
- Signal Processing
- Wearable Technology
Background:
- Photoplethysmography (PPG) is vital for remote health monitoring via wearable devices.
- Resource constraints in wearables necessitate efficient PPG signal compression.
- Maintaining the clinical morphology of PPG signals during compression is crucial.
Purpose of the Study:
- To develop an efficient PPG compression technique.
- To integrate noise reduction within the compression algorithm.
- To optimize storage and power consumption for wearable health devices.
Main Methods:
- A novel PPG compression approach utilizing the energy of discrete cosine transform (DCT) was developed.
- The method was evaluated on multiple public databases, including MIMIC-II.
- Performance metrics included compression ratio and percentage root-mean-square difference (PRD).
Main Results:
- An average compression ratio of 37.46 was achieved on the MIMIC-II database.
- A low percentage root-mean-square difference of 0.0688 was recorded.
- The proposed method significantly outperformed existing PPG compression techniques.
Conclusions:
- The DCT energy-based approach offers superior compression and denoising for PPG signals.
- This algorithm optimizes memory usage and preserves clinically relevant PPG fiducial points.
- It supports enhanced ubiquitous health monitoring with faster diagnostics and feedback.
Related Concept Videos
Downsampling
235
When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
235
Discrete-time Fourier transform
448
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
448
Discrete Fourier Transform
385
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
385
Discrete-Time Fourier Series
341
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
341
Continuous -time Fourier Transform
391
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
391
Fast Fourier Transform
440
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
440

