OBHS: An Optimized Block Huffman Scheme for Real-Time Audio Compression
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911275086249984 |
|---|---|
| author | Mahfi, Muntahi Safwan Hasan, Md. Manzurul Hossain, Gahangir |
| author_facet | Mahfi, Muntahi Safwan Hasan, Md. Manzurul Hossain, Gahangir |
| contents | In this paper, we introduce OBHS (Optimized Block Huffman Scheme), a novel lossless audio compression algorithm tailored for real-time streaming applications. OBHS leverages block-wise Huffman coding with canonical code representation and intelligent fallback mechanisms to achieve high compression ratios while maintaining low computational complexity. Our algorithm partitions audio data into fixed-size blocks, constructs optimal Huffman trees for each block, and employs canonical codes for efficient storage and transmission. Experimental results demonstrate that OBHS attains compression ratios of up to 93.6% for silence-rich audio and maintains competitive performance across various audio types, including pink noise, tones, and real-world recordings. With a linear time complexity of O(n) for n audio samples, OBHS effectively balances compression efficiency and computational demands, making it highly suitable for resource-constrained real-time audio streaming scenarios. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_14793 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | OBHS: An Optimized Block Huffman Scheme for Real-Time Audio Compression Mahfi, Muntahi Safwan Hasan, Md. Manzurul Hossain, Gahangir Sound Audio and Speech Processing H.5.5; I.4.2 In this paper, we introduce OBHS (Optimized Block Huffman Scheme), a novel lossless audio compression algorithm tailored for real-time streaming applications. OBHS leverages block-wise Huffman coding with canonical code representation and intelligent fallback mechanisms to achieve high compression ratios while maintaining low computational complexity. Our algorithm partitions audio data into fixed-size blocks, constructs optimal Huffman trees for each block, and employs canonical codes for efficient storage and transmission. Experimental results demonstrate that OBHS attains compression ratios of up to 93.6% for silence-rich audio and maintains competitive performance across various audio types, including pink noise, tones, and real-world recordings. With a linear time complexity of O(n) for n audio samples, OBHS effectively balances compression efficiency and computational demands, making it highly suitable for resource-constrained real-time audio streaming scenarios. |
| title | OBHS: An Optimized Block Huffman Scheme for Real-Time Audio Compression |
| topic | Sound Audio and Speech Processing H.5.5; I.4.2 |
| url | https://arxiv.org/abs/2511.14793 |