Dual-Branch Codec With Orthogonality Constraint and Knowledge Distillation for Noisy Environment
Audio codecs, by discretizing continuous audio signals into finite token sets, achieve high-quality reconstruction at low bitrates in clean environments. However, real-world speech often deviates from ideal conditions, particularly in noisy environments with low signal-to-noise ratios (SNRs), limiting the performance of existing codecs in restoring clean audio from noisy inputs. To address this challenge, this paper introduces a Dual-Branch Codec (DB-Codec). Leveraging the hierarchical decomposition capability of residual vector quantization (RVQ), we separate noise and speech into codebooks at different layers through dual-branch reconstruction and orthogonality constraints between noise and speech features. DB-Codec integrates enhancement and synthesis into a unified model, enabling flexible control over noise suppression or signal recovery at equivalent compression rates to conventional codecs. Experiments demonstrate that our DB-Codec achieve an average improvement of 0.83 in PESQ and 9.16 in STOI compared to traditional codecs under low SNR conditions.
Authors
- Lijuan Liu (ORCID: https://orcid.org/0000-0001-6804-848X)
- Hang Chen (ORCID: https://orcid.org/0009-0008-7585-033X)
- Jun Du
- Yi Han
Institutions
- University of Science and Technology of China (CN)
Publication Details
- Journal
- IEEE Signal Processing Letters
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1109/lsp.2025.3591726
- Primary Topic
- Advanced Data Compression Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00