Lossless Compression of Aldebaran-I Telemetry Data Using the On+ Algorithm

Lossless compression of telemetry data in satellites is essential due to the stringent limitations of bandwidth and onboard storage. Traditional methods based on information theory and entropy coding, such as Huffman and Arithmetic coding, exploit statistical redundancy but still present opportunities for improvement when applied to data with low redundancy, large alphabets, and near-uniform symbol distributions. This study proposes On+, a novel lossless compression algorithm for satellite telemetry data. Using real telemetry data captured by the Aldebaran-1 CubeSat satellite, a dataset consisting of 600 binary files was created. The performance of the proposed algorithm was evaluated in comparison with classical methods (Huffman and Arithmetic coding) and several commercial compressors (.rar, .zip, .7z, .xz, and .gz). The On+ algorithm achieved an average compression rate of 29.19%, with a standard deviation of 1.26 and a median of 29.09%, outperforming the traditional Huffman coding and Arithmetic coding methods in terms of compression efficiency. Furthermore, it exhibited superior performance compared with all commercial solutions evaluated, many of which resulted in file expansion (negative compression rates). These results demonstrate the effectiveness and viability of the On+ algorithm for optimizing telemetry data compression in satellites.

Authors

Institutions

Publication Details

Journal
Technologies
Published
2026-06-12
DOI
https://doi.org/10.3390/technologies14060353
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Lossless Compression of Aldebaran-I Telemetry Data Using the On+ Algorithm

Flávio de Barros, Allan Kardec Barros, Christian Diniz, Luis Claudio Silva et al.
Technologies
Algorithms and Data Compression
article

Lossless Compression of Aldebaran-I Telemetry Data Using the On+ Algorithm

Flávio de Barros, Allan Kardec Barros, Christian Diniz, Luis Claudio Silva, Letícia Correia, Gean Sousa, Caio Magno
article en

Abstract

Lossless compression of telemetry data in satellites is essential due to the stringent limitations of bandwidth and onboard storage. Traditional methods based on information theory and entropy coding, such as Huffman and Arithmetic coding, exploit statistical redundancy but still present opportunities for improvement when applied to data with low redundancy, large alphabets, and near-uniform symbol distributions. This study proposes On+, a novel lossless compression algorithm for satellite telemetry data. Using real telemetry data captured by the Aldebaran-1 CubeSat satellite, a dataset consisting of 600 binary files was created. The performance of the proposed algorithm was evaluated in comparison with classical methods (Huffman and Arithmetic coding) and several commercial compressors (.rar, .zip, .7z, .xz, and .gz). The On+ algorithm achieved an average compression rate of 29.19%, with a standard deviation of 1.26 and a median of 29.09%, outperforming the traditional Huffman coding and Arithmetic coding methods in terms of compression efficiency. Furthermore, it exhibited superior performance compared with all commercial solutions evaluated, many of which resulted in file expansion (negative compression rates). These results demonstrate the effectiveness and viability of the On+ algorithm for optimizing telemetry data compression in satellites.

TechnologiesVol. 14(6)
Universidade Federal do Maranhão (BR)
Openalex Percentile: Top 4%
Algorithms and Data Compression
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.