Metraipolis › archive › dc_a05a8a4746ef
Low-Latency Joint Source-Channel Coding with Multiple Constant Curvature Curves — arXiv:2611.01476
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01476
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T19:08:55.843Z
- SHA-256 of the archived text
c987dab15fbcac573b23fd46b0cb7d94c59c04172ede4485def5a82633d48662- Stable URL of this page
https://metraipolis.com/documento/dc_a05a8a4746ef
How to cite
Low-Latency Joint Source-Channel Coding with Multiple Constant Curvature Curves — arXiv:2611.01476 — arXiv (en), https://arxiv.org/abs/2611.01476 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a05a8a4746ef (Metraipolis archive dc_a05a8a4746ef, sha256 c987dab15fbcac573b23fd46b0cb7d94c59c04172ede4485def5a82633d48662)
BibTeX
@misc{dca05a8a4746ef,
title = {Low-Latency Joint Source-Channel Coding with Multiple Constant Curvature Curves — arXiv:2611.01476},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01476},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a05a8a4746ef; sha256 c987dab15fbcac573b23fd46b0cb7d94c59c04172ede4485def5a82633d48662},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01476. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We propose constant-curvature curve multicode (C3M), a multi-branch extension of constant-curvature curve tube (C3T) analog joint source-channel coding for one-shot transmission over fixed isotropic AWGN channels. Instead of mapping a scalar source to a single curve on the power sphere, C3M partitions the source interval across a union of constant-speed branch curves in even-dimensional Euclidean space. This construction increases the available geometric degrees of freedom while preserving a low block length analog encoding structure. We derive the induced mixture output distribution, posterior representation, MAP and MMSE estimators, and mutual-information decomposition into branch-identification and along-curve components. We then introduce geometry- and classification-aware branch allocation rules based on tube density, curve length, and branch-classification reliability. The resulting design procedure fixes the optimal C3T curve as a starting branch and sequentially selects additional branches, thereby reducing the combinatorial cost of exhaustive multi-curve search. We use NORM-inspired branch-conditioned spectral decoders based on Fourier-feature lifting of the received ambient vector. Numerical experiments in four and six dimensions show that adding candidate branch curves improves the finite-dimensional end-to-end signal-to-distortion ratio, with selected two- and three-candidate C3M systems outperforming the one-curve baseline at +10 dB SNR. The results show that multi-curve analog mappings provide a practical finite-dimensional design route for low block length joint source-channel coding. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv eess.SP, nuovi lavori del giorno). Categorie arXiv: Signal Processing (eess.SP). Pagina del lavoro: https://arxiv.org/abs/2611.01476 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T18:25:52.918Z dalla pagina https://arxiv.org/list/eess.SP/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).