Physical Address
304 North Cardinal St.
Dorchester Center, MA 02124
BS Z — Space Data Systems Lossless Data Compression (BS Z 17:2000 / ISO 15887:2000)
BS Z 17:2000 — Space Data and Information Transfer Systems — Lossless Data Compression（ISO 15887:2000）
🛰️ BS Z 17:2000 is a British Standard published by BSI for lossless data compression in space data and information transfer systems. It reproduces verbatim the International Standard ISO 15887:2000 (Space data and information transfer systems – Data systems – Lossless data compression) and implements it as the UK national standard. It belongs to the aerospace “Z” series for space applications and specifies lossless compression algorithms and data formats applied to spacecraft telemetry, remote sensing and science data before downlink, within the framework of CCSDS (Consultative Committee for Space Data Systems) recommended standards, enabling efficient transmission and reconstruction between spacecraft and ground stations.
💡 Lossless compression reduces downlink data rate and storage requirements without losing any information. It is a key technology widely adopted in deep-space, remote-sensing and space-science missions, especially for bandwidth-limited downlinks.
1. Standard Overview and Series Positioning 📌
This article is the summary review for the “BS Z” prefix of the BSB223 batch. The standard in this batch is BS Z 17:2000 (ISO 15887:2000). It was published by BSI on 16 December 2000, reproducing verbatim ISO 15887:2000 as the UK national standard. UK participation in its preparation was entrusted to Technical Committee ACW/67 (Data and information transfer standards for civil space applications).
| Batch Prefix | Standard | Title | Status |
|---|---|---|---|
| BS Z | BS Z 17:2000 | Space data and information transfer systems – Data systems – Lossless data compression | Identical to ISO 15887:2000 |
The standard applies to the data-system stage of space data and information transfer systems. It addresses downlink compression of telemetry and science data, and its algorithm and format are consistent with the CCSDS 121.0-B-1 recommended standard for lossless data compression.
⚠️ The source material for this batch is a scanned document. The technical content below is written based on public domain knowledge; specific algorithm parameters and format fields should be confirmed against the original standard and the related CCSDS recommended standards.
2. Lossless Compression Framework and Algorithm Principles 🔧
ISO 15887:2000 / BS Z 17:2000 defines a two-stage lossless compression framework built on the CCSDS lossless data compression (LDC) algorithm:
- Stage 1 – Preprocessing (prediction / decorrelation): the input samples are preprocessed, typically using differential pulse-code modulation (DPCM) or adaptive prediction, to remove correlation between adjacent samples and produce an error (residual) sequence.
- Stage 2 – Entropy coding: the error sequence is adaptively entropy coded, most commonly with bit-plane based adaptive Rice coding. The coder automatically selects the optimal coding option according to the statistical characteristics of the data (fundamental sequence / split options) to achieve near-entropy compression.
| Module | Function | Key Parameters |
|---|---|---|
| Input parameters | Define dimensionality, sample width, block size | Block size, number of samples, bits per sample |
| Predictor | Remove spatial/temporal correlation | Predictor selection, residual computation |
| Entropy coder | Adaptive coding of error signal | Coding option k, coding mode selection |
| Data format | Packaging and identification of compressed data | Sync marker, header fields, compressed data units |
💡 The advantage of the adaptive entropy coder is that no a-priori knowledge of the data statistics is required: the coder selects the optimal coding option within each block, so good compression ratios are achieved over data with very different statistics (images, spectra, particle counts).
3. Key Technical Requirements 🔥
3.1 Losslessness
“Lossless” is the fundamental constraint of this standard: the compression – decompression process must recover the original data bit-for-bit; the decompressed output is identical to the original input. In engineering practice, round-trip tests verify encoder/decoder consistency, and data-integrity checks should be defined.
3.2 Data Format and Interfaces
The standard specifies the format, synchronization and identification mechanisms of the compressed data so that ground systems can recognize the compressed stream and decompress it correctly. It also defines the interface conventions with uplink/downlink data units (such as CCSDS space packets), allowing the compression module to be plug-and-play in the telemetry chain.
3.3 Adaptive Coding Options
The algorithm uses adaptive entropy coding: the coder selects the k option (split options) or fundamental-sequence coding within each block according to the statistics of the error samples, achieving near-entropy coding efficiency. The decoder infers the coding option without extra information, keeping the stream self-describing.
🚨 Lossless compression does not apply to already encrypted or already compressed data (such data is near-random and offers no redundancy). Nor should compression be confused with encryption – compression is normally performed before secure encryption, or the order is set by the mission link design.
4. Engineering Application Points 🛠️
- 🛰️ Telemetry chains: apply lossless compression in on-board data management to increase science data throughput without raising downlink bandwidth.
- 📡 Deep-space missions: deep-space downlinks have extremely limited bandwidth; lossless compression (optionally combined with lossy compression) is an important way to increase science return.
- 🖥️ Ground processing: ground-station decompression software must implement the decompression algorithm strictly to the standard and be consistency-tested against the compressor.
- 📊 Performance evaluation: assess compression ratio, throughput, resource overhead and real-time behaviour, and choose the block size according to the data characteristics.
- 🔗 Interoperability: using the standard algorithm and format ensures data interchange between manufacturers and missions; the compression module can be reused as a standard component.
✅ CCSDS has since published the 122.0 series (image data compression) and updated lossless compression recommended standards. Engineering implementations should reference the latest CCSDS Blue Books to remain compatible with in-orbit missions and ground systems.
5. Frequently Asked Questions ❓
❓ Q: What is the relationship between BS Z 17 and CCSDS lossless compression?
A: ISO 15887:2000 (BS Z 17:2000) implements and standardizes the lossless compression algorithm of the CCSDS 121.0 recommended standard; the algorithms are identical, and BS Z 17 is its expression at UK national-standard level.
A: ISO 15887:2000 (BS Z 17:2000) implements and standardizes the lossless compression algorithm of the CCSDS 121.0 recommended standard; the algorithms are identical, and BS Z 17 is its expression at UK national-standard level.
❓ Q: How do you choose between lossless and lossy compression?
A: Use lossless compression when exact reconstruction of scientific data is required; lossy compression may be used for data such as imagery where some distortion is acceptable, yielding higher compression ratios. The trade-off between data value and bandwidth must be made during mission design.
A: Use lossless compression when exact reconstruction of scientific data is required; lossy compression may be used for data such as imagery where some distortion is acceptable, yielding higher compression ratios. The trade-off between data value and bandwidth must be made during mission design.
❓ Q: Why cannot encrypted data be losslessly compressed?
A: Encrypted data is near-random, its entropy approaches the maximum, and compression algorithms (especially entropy coding) find almost no redundancy to exploit. Lossless compression should therefore act on raw or preprocessed data.
A: Encrypted data is near-random, its entropy approaches the maximum, and compression algorithms (especially entropy coding) find almost no redundancy to exploit. Lossless compression should therefore act on raw or preprocessed data.
🔍 Q: Why does the adaptive coder need no a-priori statistical information?
A: The coder selects the optimal coding option adaptively within each block and embeds it in the stream; the decoder infers the option from synchronization and header information, so the coder adapts to the data statistics.
A: The coder selects the optimal coding option adaptively within each block and embeds it in the stream; the decoder infers the option from synchronization and header information, so the coder adapts to the data statistics.
❓ Q: What factors affect the compression ratio?
A: Mainly data correlation (residual dynamic range after decorrelation), sample bit-width, block size and coding-option selection; the stronger the correlation, the higher the compression ratio.
A: Mainly data correlation (residual dynamic range after decorrelation), sample bit-width, block size and coding-option selection; the stronger the correlation, the higher the compression ratio.