pith. sign in

arxiv: 2605.01086 · v1 · submitted 2026-05-01 · 💻 cs.DC

FPTC: A Fast Parallel Transform-based Codec for Efficient Asymmetric Signal Compression

Ben Mechels , Ryan Billmeyer , Alexander Chen , Shiyang Li , Caiwen Ding This is my paper

Pith reviewed 2026-05-09 18:06 UTC · model grok-4.3

classification 💻 cs.DC
keywords asymmetric signal compressionwindowed DCTGPU parallel decodinghybrid quantizationHuffman codinglossy codecIoT sensor databatch decompression
0
0 comments X

The pith

FPTC pairs a lightweight encoder with a GPU-parallel decoder using windowed DCT and hybrid quantization to achieve higher compression ratios than prior methods across signal domains.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

High-volume signal data from sensors in IoT and HPC settings must be compressed on power-limited devices before fast server-side decompression. FPTC meets this need with an asymmetric design that applies a windowed discrete cosine transform for frequency sparsity, followed by three-zone quantization and a novel Huffman packing scheme. The decoder is built for massive GPU parallelism to maximize batch throughput. If the results hold, this approach would cut storage and transmission costs for biomedical, seismic, power-grid, and meteorological recordings while preserving reconstruction quality.

Core claim

FPTC applies a windowed discrete cosine transform to exploit frequency-domain sparsity, quantizes spectral coefficients with a hybrid three-zone mapping, and entropy-codes the result using Huffman coding with a novel packing scheme. The pipeline is throughput-oriented on the GPU for server-side batch decompression while the encoder remains lightweight and sequential for resource-constrained devices. On ten datasets spanning biomedical, seismic, power, and meteorological domains, it delivers multiplicative compression gains of 3.6x, 3.1x, 1.5x, and 1.2x respectively over existing frameworks at competitive throughput.

What carries the argument

The asymmetric codec architecture that keeps the encoder sequential and lightweight while shifting heavy computation to a massively parallel GPU decoder built around windowed DCT, three-zone quantization, and novel Huffman packing.

If this is right

  • Storage and transmission costs drop for high-volume sensor streams in power-grid and meteorological monitoring.
  • Server farms can decompress large batches of signals at high throughput without quality trade-offs.
  • A single codec generalizes across biomedical diagnostic, seismic, power, and weather signals.
  • Resource-constrained acquisition devices can operate longer on the same battery by sending smaller compressed payloads.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Adoption in edge hardware could cut wireless transmission energy in large IoT deployments.
  • The GPU-centric decoder design suggests similar asymmetric pipelines could be ported to other accelerators for video or image streams.
  • If the packing scheme proves robust, it may reduce reliance on learned compression models that require domain-specific training data.
  • Direct head-to-head tests against recent neural codecs on the same ten datasets would clarify where transform-based methods retain an edge.

Load-bearing premise

The windowed DCT, hybrid three-zone quantization, and novel Huffman packing preserve reconstruction quality across diverse signal domains without domain-specific retuning.

What would settle it

Measuring compression ratio and reconstruction quality on a fresh power-grid or meteorological dataset and finding that the ratio falls below the reported 3x multiplier at the same quality level would falsify the central performance claim.

Figures

Figures reproduced from arXiv: 2605.01086 by Alexander Chen, Ben Mechels, Caiwen Ding, Ryan Billmeyer, Shiyang Li.

Figure 1
Figure 1. Figure 1: Prediction-based HPC Compressors [5] exhibit ma￾jor distortion compressing EEG waveforms at 10x CR. Lossy compression is the predominant strategy for meeting these constraints. By tolerating bounded reconstruction error, lossy codecs achieve compression ratios beyond what is practical with lossless methods, reducing data transmission energy and storage cost. However, existing compressors often optimize onl… view at source ↗
Figure 2
Figure 2. Figure 2: fptc asymmetric system architecture In this work, we introduce fptc, an asymmetric lossy codec designed for signal domains where compression runs on resource￾constrained embedded hardware and decompression runs at scale on GPUs. The pipeline of the codec is tuned through parameters and prebuilt structures. In a given domain, representative datasets are utilized to precompute data structures for the most al… view at source ↗
Figure 3
Figure 3. Figure 3: fptc compression and decompression pipelines 3 Design Overview fptc is structured around an asymmetric model motivated on each end by the constraints of signal acquisition systems and the enor￾mous compute of modern GPUs. In domains such as medical devices, insertable cardiac monitors have very limited computation and en￾ergy budgets. This presents the need for on-board compression to be a low-complexity, … view at source ↗
Figure 4
Figure 4. Figure 4: Codec structures, including quantization table (1.b) view at source ↗
Figure 5
Figure 5. Figure 5: Compression steps on low-complexity encoder in view at source ↗
Figure 6
Figure 6. Figure 6: Kernel level diagram of lossless decompression stage with bit-level view of the Huffman code logic using the SymLen view at source ↗
Figure 7
Figure 7. Figure 7: Visualization of data at each decompression step. view at source ↗
Figure 8
Figure 8. Figure 8: Rate distortion curve performance for all datasets in the PRD range 1–6. view at source ↗
Figure 9
Figure 9. Figure 9: Extraction of Pareto front from a uniform sweep of view at source ↗
Figure 11
Figure 11. Figure 11: Correlation matrix between optimized parameters view at source ↗
Figure 10
Figure 10. Figure 10: Sample Reconstructed Load Power Data Observation II: Load power data has the largest rate-distortion difference, but even at a given PRD not all compressors pre￾serve local features equivalently, as evident by the block arti￾facts in the predictive compressors reconstruction. At a certain point, all compressors will suffer from this but the CR limit is different based on the architecture of the compressor… view at source ↗
Figure 12
Figure 12. Figure 12: Decompression throughput across Datasets at PRD ranges of view at source ↗
Figure 14
Figure 14. Figure 14: Throughput as function of DCT, EC on the MIT view at source ↗
Figure 13
Figure 13. Figure 13: Normalized runtime breakdown of the three view at source ↗
read the original abstract

Modern high-performance computing and Internet-of-Things deployments increasingly generate large volumes of signal data that must be compressed efficiently on resource-constrained acquisition devices and decompressed at scale on centralized servers. Lossy compression is widely adopted to minimize storage and transmission costs on low-power hardware sensors, yet existing methods rarely optimize for both reconstruction quality and decompression throughput simultaneously, nor do they apply methods that generalize across signal domains. In this work, we introduce FPTC, a high-throughput asymmetric signal codec that pairs a lightweight sequential encoder with a massively parallel GPU decoder designed for server-side batch decompression. FPTC applies a windowed discrete cosine transform (DCT) to exploit frequency-domain sparsity, quantizes spectral coefficients with a hybrid three-zone mapping, and entropy codes the result using Huffman coding with a novel packing scheme. The pipeline used in FPTC is designed to be throughput oriented on the GPU, maximizing performance without sacrificing reconstruction quality. We evaluate FPTC on ten datasets spanning four signal domains: biomedical diagnostic, seismic reflections, power-grid production metrics, and meteorological recordings. Our results demonstrate that FPTC outperforms existing frameworks in compression ratio while maintaining competitive throughput, achieving multiplicative compression performance of 3.6x (power), 3.1x (meteorological), 1.5x (biomedical), and 1.2x (seismic) over existing frameworks.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The paper introduces FPTC, an asymmetric signal compression codec pairing a lightweight sequential encoder (windowed DCT for frequency sparsity, hybrid three-zone quantization, novel Huffman packing) with a massively parallel GPU decoder. It is evaluated on ten datasets spanning biomedical, seismic, power-grid, and meteorological domains, claiming superior compression ratios with multiplicative factors of 3.6x (power), 3.1x (meteorological), 1.5x (biomedical), and 1.2x (seismic) over existing frameworks while maintaining competitive throughput.

Significance. If substantiated with matched reconstruction quality, the asymmetric design and GPU-parallel decoder could advance practical compression for resource-constrained IoT/HPC signal acquisition with server-side batch decompression. The cross-domain evaluation and throughput-oriented pipeline address a relevant engineering gap; the emphasis on preserving quality alongside ratio gains is a constructive framing.

major comments (1)
  1. [§5 (Experimental Evaluation)] §5 (Experimental Evaluation): The headline multiplicative compression performance claims (3.6x power, 3.1x meteorological, etc.) are reported without accompanying per-dataset reconstruction quality metrics (PSNR, SNR, or domain-specific error) for FPTC versus each baseline at the exact operating points used. This omission is load-bearing because the pipeline (windowed DCT + hybrid quantization + Huffman packing) can trade quality for ratio; without explicit equalization or side-by-side quality tables, the gains cannot be confirmed as genuine improvements rather than quality shifts.
minor comments (2)
  1. [Abstract] Abstract: the phrase 'multiplicative compression performance' is introduced without a formula or precise definition, which reduces clarity when interpreting the reported factors.
  2. [§5] The manuscript would benefit from a summary table listing all baselines, exact dataset sizes, and the statistical tests or averaging method used for the multiplicative factors.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the constructive feedback on our manuscript. The concern about reconstruction quality metrics is well-taken, and we address it directly below. We will revise the experimental section to provide the requested side-by-side comparisons.

read point-by-point responses

  1. Referee: The headline multiplicative compression performance claims (3.6x power, 3.1x meteorological, etc.) are reported without accompanying per-dataset reconstruction quality metrics (PSNR, SNR, or domain-specific error) for FPTC versus each baseline at the exact operating points used. This omission is load-bearing because the pipeline (windowed DCT + hybrid quantization + Huffman packing) can trade quality for ratio; without explicit equalization or side-by-side quality tables, the gains cannot be confirmed as genuine improvements rather than quality shifts.

    Authors: We agree that explicit per-dataset reconstruction quality metrics are necessary to substantiate the compression-ratio claims at matched quality. In the revised manuscript we will add a dedicated table (new Table 3 in §5) reporting PSNR, SNR, and domain-appropriate error metrics (e.g., RMSE for seismic, MAE for power-grid) for FPTC and every baseline at the exact operating points used for the headline ratios. We will also state the target quality thresholds applied during parameter selection so that readers can verify the comparisons are fair. This addition directly addresses the load-bearing nature of the omission. revision: yes

Circularity Check

0 steps flagged

No circularity: purely empirical codec evaluation with no derivations or self-referential fits

full rationale

The paper presents FPTC as an empirical codec using windowed DCT, hybrid quantization, and Huffman packing, evaluated on ten datasets across four domains. No equations, derivations, or parameter-fitting steps are described that could reduce to self-definition or fitted-input predictions. Claims of multiplicative gains (3.6x power, etc.) rest on direct compression-ratio comparisons against baselines; the text provides no load-bearing self-citations, uniqueness theorems, or ansatzes imported from prior author work. The evaluation is self-contained against external benchmarks and does not rename known results or smuggle assumptions via citation chains. This is the expected non-finding for an applied systems paper whose central results are measured performance numbers rather than a closed mathematical derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no mathematical derivations, fitted constants, background axioms, or new postulated entities are described in sufficient detail to populate the ledger.

pith-pipeline@v0.9.0 · 5559 in / 1262 out tokens · 37660 ms · 2026-05-09T18:06:46.620337+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

46 extracted references · 46 canonical work pages

  1. [1]

    Profiling of lossless-compression algorithms for a novel biomedical-implant architecture

    Christos Strydis and Georgi N Gaydadjiev. Profiling of lossless-compression algorithms for a novel biomedical-implant architecture. InProceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis, pages 109–114, 2008

    work page 2008

  2. [2]

    Zhilin Zhang, Tzyy-Ping Jung, Scott Makeig, and Bhaskar D Rao. Compressed sensing for energy-efficient wireless telemonitoring of noninvasive fetal ecg via block sparse bayesian learning.IEEE Transactions on Biomedical Engineering, 60(2):300–309, 2012

    work page 2012

  3. [3]

    Afc: An adaptive lossless floating-point compression algorithm in time series database.Information Sciences, 654:119847, January 2024

    Haoyuan Chen, Liang Liu, Jingwen Meng, and Wanying Lu. Afc: An adaptive lossless floating-point compression algorithm in time series database.Information Sciences, 654:119847, January 2024

    work page 2024

  4. [4]

    Practical data compression in wireless sensor networks: A survey.Journal of Network and Computer Applications, 35(1):37–59, 2012

    Tossaporn Srisooksai, Kamol Keamarungsi, Poonlap Lamsrichan, and Kiyomichi Araki. Practical data compression in wireless sensor networks: A survey.Journal of Network and Computer Applications, 35(1):37–59, 2012

    work page 2012

  5. [5]

    cuszp2: A gpu lossy compressor with extreme throughput and optimized compression ratio

    Yafan Huang, Sheng Di, Guanpeng Li, and Franck Cappello. cuszp2: A gpu lossy compressor with extreme throughput and optimized compression ratio. InProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis, SC ’24. IEEE Press, 2024

    work page 2024

  6. [6]

    Efficient lossless compression of scientific floating-point data on cpus and gpus

    Noushin Azami, Alex Fallin, and Martin Burtscher. Efficient lossless compression of scientific floating-point data on cpus and gpus. InProceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1, ASPLOS ’25, New York, NY, USA, 2025. Association for Computing Machinery

    work page 2025

  7. [7]

    Recoil: Parallel rans decoding with decoder-adaptive scalability

    Fangzheng Lin, Kasidis Arunruangsirilert, Heming Sun, and Jiro Katto. Recoil: Parallel rans decoding with decoder-adaptive scalability. InProceedings of the 52nd International Conference on Parallel Processing, 2023

    work page 2023

  8. [8]

    Blanco-Velasco, F

    M. Blanco-Velasco, F. Cruz-Roldán, J. I. Godino-Llorente, and K. E. Barner. On the use of prd and cr parameters for ecg compression.Biomedical Signal Processing and Control, 1(1):56–64, 2005

    work page 2005

  9. [9]

    Dasan and M

    E. Dasan and M. Turkan. A novel dimensionality reduction approach for ecg signal compression in iot based healthcare systems.Biomedical Signal Processing and Control, 2021

    work page 2021

  10. [10]

    Zheng et al

    L. Zheng et al. Effective compression and classification of ecg arrhythmia by assembling deep neural networks.Biomedical Signal Processing and Control, 2021

    work page 2021

  11. [11]

    Sadler and Margaret Martonosi

    Christopher M. Sadler and Margaret Martonosi. Data compression algorithms for energy-constrained devices in delay tolerant networks. InProceedings of the 4th International Conference on Embedded Networked Sensor Systems, SenSys ’06, page 265–278, New York, NY, USA, 2006. Association for Computing Machinery

    work page 2006

  12. [12]

    An efficient lossless compression algorithm for tiny nodes of monitoring wireless sensor networks.The Computer Journal, 52(8):969–987, 2009

    Francesco Marcelloni and Massimo Vecchio. An efficient lossless compression algorithm for tiny nodes of monitoring wireless sensor networks.The Computer Journal, 52(8):969–987, 2009

    work page 2009

  13. [13]

    Signal compression in wireless sensor networks.Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 370(1958):118–135, 2012

    Marco F Duarte, Godwin Shen, Antonio Ortega, and Richard G Baraniuk. Signal compression in wireless sensor networks.Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 370(1958):118–135, 2012

    work page 1958

  14. [14]

    M. A. Razzaque, Chris Bleakley, and Simon Dobson. Compression in wireless sensor networks: A survey and comparative evaluation.ACM Trans. Sen. Netw., 10(1), December 2013

    work page 2013

  15. [15]

    Edge computing for smart health: Context-aware approaches, opportunities, and challenges.IEEE Network, 33(3):196–203, 2019

    Alaa Awad Abdellatif, Amr Mohamed, Carla Fabiana Chiasserini, Mounira Tlili, and Aiman Erbad. Edge computing for smart health: Context-aware approaches, opportunities, and challenges.IEEE Network, 33(3):196–203, 2019

    work page 2019

  16. [16]

    The ecg data compression by discrete wavelet transform and huffman encoding

    Rawaa K Hamza, Khalida S Rijab, and Mohammed A Hussien. The ecg data compression by discrete wavelet transform and huffman encoding. In2021 7th In- ternational Conference on Contemporary Information Technology and Mathematics (ICCITM), pages 75–81. IEEE, 2021

    work page 2021

  17. [17]

    A novel ecg compression algorithm using pulse-width modulation integrated quantization for low-power real-time monitoring.Scientific Reports, 14(1):17162, 2024

    Isuri Devindi, Sashini Liyanage, Titus Jayarathna, Janaka Alawatugoda, and Roshan Ragel. A novel ecg compression algorithm using pulse-width modulation integrated quantization for low-power real-time monitoring.Scientific Reports, 14(1):17162, 2024

    work page 2024

  18. [18]

    Performance evaluation of ecg compression techniques

    Goutam Kumar Sahoo, Samit Ari, and Sarat Kumar Patra. Performance evaluation of ecg compression techniques. In2015 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT), pages 1–5. IEEE, 2015

    work page 2015

  19. [19]

    Low power and high-speed ecg compression using dynamic threshold

    L Naga Sai Gayathri Priya, P Swetha, V Venkata Kiran, Nagarjuna Malladhi, and K Narsimha Reddy. Low power and high-speed ecg compression using dynamic threshold. In2024 4th International Conference on Intelligent Technologies (CONIT), pages 1–6. IEEE, 2024

    work page 2024

  20. [20]

    Chunwei Liu, John Paparrizos, and Aaron J. Elmore. Adaedge: A dynamic com- pression selection framework for resource constrained devices. In2024 IEEE 40th International Conference on Data Engineering (ICDE), pages 1506–1519, 2024

    work page 2024

  21. [21]

    An effi- cient electrocardiography data compression.ECTI Transactions on Computer and Information Technology (ECTI-CIT), 17(3):387–397, 2023

    Passakorn Luanloet, Watcharapan Suwansantisuk, and Pinit Kumhom. An effi- cient electrocardiography data compression.ECTI Transactions on Computer and Information Technology (ECTI-CIT), 17(3):387–397, 2023

    work page 2023

  22. [22]

    Barr and Krste Asanović

    Kenneth C. Barr and Krste Asanović. Energy-aware lossless data compression. ACM Trans. Comput. Syst., 24(3):250–291, August 2006

    work page 2006

  23. [23]

    cuszp: An ultra-fast gpu error-bounded lossy compression framework with optimized end-to-end performance

    Yafan Huang, Sheng Di, Xiaodong Yu, Guanpeng Li, and Franck Cappello. cuszp: An ultra-fast gpu error-bounded lossy compression framework with optimized end-to-end performance. InProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC ’23, New York, NY, USA, 2023. Association for Computing Machinery

    work page 2023

  24. [24]

    Fz-gpu: A fast and high-ratio lossy com- pressor for scientific computing applications on gpus

    Boyuan Zhang, Jiannan Tian, Sheng Di, Xiaodong Yu, Yunhe Feng, Xin Liang, Dingwen Tao, and Franck Cappello. Fz-gpu: A fast and high-ratio lossy com- pressor for scientific computing applications on gpus. InProceedings of the 32nd International Symposium on High-Performance Parallel and Distributed Computing, HPDC ’23, page 129–142, New York, NY, USA, 2023...

    work page 2023

  25. [25]

    Fast and effective lossy compression on gpus and cpus with guaranteed error bounds

    Alex Fallin, Noushin Azami, Sheng Di, Franck Cappello, and Martin Burtscher. Fast and effective lossy compression on gpus and cpus with guaranteed error bounds. In2025 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 874–887, 2025

    work page 2025

  26. [26]

    Fixed-rate compressed floating-point arrays.IEEE transactions on visualization and computer graphics, 20(12):2674–2683, 2014

    Peter Lindstrom. Fixed-rate compressed floating-point arrays.IEEE transactions on visualization and computer graphics, 20(12):2674–2683, 2014

    work page 2014

  27. [27]

    Massively parallel huffman decoding on gpus

    André Weißenberger and Bertil Schmidt. Massively parallel huffman decoding on gpus. InProceedings of the 47th International Conference on Parallel Processing, ICPP ’18, New York, NY, USA, 2018. Association for Computing Machinery

    work page 2018

  28. [28]

    Huffman coding with gap arrays for gpu acceleration

    Naoya Yamamoto, Koji Nakano, Yasuaki Ito, Daisuke Takafuji, Akihiko Kasagi, and Tsuguchika Tabaru. Huffman coding with gap arrays for gpu acceleration. InProceedings of the 49th International Conference on Parallel Processing, ICPP ’20, New York, NY, USA, 2020. Association for Computing Machinery

    work page 2020

  29. [29]

    Canonical huffman decoder on fine-grain many-core processor arrays

    Satyabrata Sarangi and Bevan Baas. Canonical huffman decoder on fine-grain many-core processor arrays. page 512–517, 2021

    work page 2021

  30. [30]

    Parallel huffman decoding with applica- tions to jpeg files.The Computer Journal, 46(5):487–497, 2003

    Shmuel Tomi Klein and Yair Wiseman. Parallel huffman decoding with applica- tions to jpeg files.The Computer Journal, 46(5):487–497, 2003

    work page 2003

  31. [31]

    Castelar, Carlos A

    Jairo A. Castelar, Carlos A. Angulo, and Carlos A. Fajardo. Parallel decompression of seismic data on gpu using a lifting wavelet algorithm. In2015 20th Symposium on Signal Processing, Images and Computer Vision (STSIV A), pages 1–7, 2015

    work page 2015

  32. [32]

    Accelerating huffman decoding of seismic data on gpus

    Carlos A Angulo, Christian D Hernández, Gabriel Rincón, Carlos A Boada, Javier Castillo, and Carlos A Fajardo. Accelerating huffman decoding of seismic data on gpus. In2015 20th Symposium on Signal Processing, Images and Computer Vision (STSIV A), pages 1–6. IEEE, 2015

    work page 2015

  33. [33]

    Image compression using wavelets and jpeg2000: a tutorial.Electronics & Communication Engineering Journal, 14(3):112–121, 2002

    Stuart Lawson and Jian Zhu. Image compression using wavelets and jpeg2000: a tutorial.Electronics & Communication Engineering Journal, 14(3):112–121, 2002

    work page 2002

  34. [34]

    The discrete cosine transform (dct): theory and application

    Syed Ali Khayam. The discrete cosine transform (dct): theory and application. Michigan State University, 114(1):31, 2003

    work page 2003

  35. [35]

    Gray and David L

    Robert M. Gray and David L. Neuhoff. Quantization.IEEE Transactions on Information Theory, 44(6):2325–2383, October 1998

    work page 1998

  36. [36]

    Larmore and Daniel S

    Lawrence L. Larmore and Daniel S. Hirschberg. A fast algorithm for optimal length-limited huffman codes.J. ACM, 37(3):464–473, July 1990

    work page 1990

  37. [37]

    Light- weight huffman coding for efficient gpu compression

    Milan Shah, Xiaodong Yu, Sheng Di, Michela Becchi, and Franck Cappello. Light- weight huffman coding for efficient gpu compression. InProceedings of the 37th ACM International Conference on Supercomputing, ICS ’23, page 99–110, New York, NY, USA, 2023. Association for Computing Machinery

    work page 2023

  38. [38]

    Components of a new research resource for complex physiologic signals.PhysioBank, PhysioToolkit, and Physionet, 2000

    Ary L Goldberger, Luís Amaral, Leon Glass, Jeffrey M Hausdorff, Plamen Ch Ivanov, Roger G Mark, Joseph E Mietus, George B Moody, Chung-Kang Peng, and H Eugene Stanley. Components of a new research resource for complex physiologic signals.PhysioBank, PhysioToolkit, and Physionet, 2000

    work page 2000

  39. [39]

    A large-scale multi-label 12-lead electrocardiogram database with standardized diagnostic statements.Scientific data, 9(1):272, 2022

    Hui Liu, Dan Chen, Da Chen, Xiyu Zhang, Huijie Li, Lipan Bian, Minglei Shu, and Yinglong Wang. A large-scale multi-label 12-lead electrocardiogram database with standardized diagnostic statements.Scientific data, 9(1):272, 2022

    work page 2022

  40. [40]

    Peter Triezenberg, Patrick E Hart, and Jonathan R Childs. National archive of marine seismic surveys (namss: A usgs data website of marine seismic reflection data within the us exclusive economic zone (eez).US Geological Survey (USGS) Data Release, page 39, 2016

    work page 2016

  41. [41]

    A multi-scale time-series dataset with benchmark for machine learning in decarbonized energy grids.Scientific Data, 9(1):359, 2022

    Xiangtian Zheng, Nan Xu, Loc Trinh, Dongqi Wu, Tong Huang, S Sivaranjani, Yan Liu, and Le Xie. A multi-scale time-series dataset with benchmark for machine learning in decarbonized energy grids.Scientific Data, 9(1):359, 2022

    work page 2022

  42. [42]

    A comparative analysis of methods for evaluation of ecg signal quality after compression.BioMed Research International, 2018:1–26, 2018

    Andrea Němcová, Radovan Smíšek, Lucie Maršánová, Lukáš Smital, and Martin Vítek. A comparative analysis of methods for evaluation of ecg signal quality after compression.BioMed Research International, 2018:1–26, 2018

    work page 2018

  43. [43]

    Dean, Ekrem Kutluay, Zeke Campbell, Sarah Schmitt, Nicola Donato, Jonathan J

    Filippo Battaglia, Mattia Galanti, Giovanni Gugliandolo, Stefan Rampp, Jan Remi, Alexandra Parashos, Sonali Sharma, Sonal Bhatia, Brian C. Dean, Ekrem Kutluay, Zeke Campbell, Sarah Schmitt, Nicola Donato, Jonathan J. Halford, and Giuseppe Campobello. Neurophysiology signal codecs for the DICOM®standard: Prelimi- nary results. In2024 IEEE International Sym...

    work page 2024

  44. [44]

    Frequency seismic response for EEWS testing on uniaxial shaking table.Entropy, 25(4):655, Apr 2023

    Codrin Donciu, Marian-Silviu Temneanu, Marius Paulet, and Alexandru Salceanu. Frequency seismic response for EEWS testing on uniaxial shaking table.Entropy, 25(4):655, Apr 2023. PubMed Central PMCID: PMC10137255

    work page 2023

  45. [45]

    Baker, Dorit M

    Allison H. Baker, Dorit M. Hammerling, Sheri A. Mickelson, et al. Evaluating lossy data compression on climate simulation data within a large ensemble. Geoscientific Model Development, 9:4381–4403, 2016

    work page 2016

  46. [46]

    Tcheou, Lisandro Lovisolo, Moisés V

    Michel P. Tcheou, Lisandro Lovisolo, Moisés V. R. Ribeiro, Eduardo A. B. da Silva, Marco A. M. Rodrigues, Jo ao M. T. Romano, and Paulo S. R. Diniz. The com- pression of electric signal waveforms for smart grids: State of the art and future trends.IEEE Transactions on Smart Grid, 5(1):291–302, 2014

    work page 2014