Support vector machines for optimal channel decoding.
Saved in:
| Title: | Support vector machines for optimal channel decoding. |
|---|---|
| Authors: | De Boni Rovella, Gastón1,2 (AUTHOR) gdeboni@fing.edu.uy, Benammar, Meryem3 (AUTHOR) meryem.benammar@isae-supaero.fr, Benaddi, Tarik4 (AUTHOR), Méric, Hugo5 (AUTHOR) |
| Source: | EURASIP Journal on Wireless Communications & Networking. 8/27/2025, Vol. 2025 Issue 1, p1-22. 22p. |
| Subjects: | Support vector machines, Channel coding, Mathematical optimization, Maximum likelihood statistics, Additive white Gaussian noise channels, Scalability, Machine learning |
| Abstract: | In this work, we investigate channel decoding techniques based on machine learning, and more specifically, on support vector machines (SVMs). Existing SVM-based decoders suffer from a scalability problem, characterized by the exponential growth of both the number of classifiers required to decode and the size of the training dataset as a function of the code dimension. This phenomenon, often referred to as the curse of dimensionality, renders existing SVM approaches impractical for larger codes. To partly address this limitation, we introduce a novel bit-wise SVM decoding strategy coupled with a noiseless optimization framework, which significantly reduces the computational burden. Specifically, for a code of length n and dimension k, our approach decreases the number of SVM classifiers from an exponential dependence to a linear in k, while the required training dataset is minimized to a single noiseless codeword per class, which remains exponential in k. We formulate the resulting optimization problem and derive its analytical solution. Moreover, we demonstrate that, under specific conditions, the solution of the optimization process produced by the proposed framework is equivalent to the optimal Maximum A Posteriori (MAP) decoding rule when applied to transmissions over additive white Gaussian noise (AWGN) channels. [ABSTRACT FROM AUTHOR] |
| Copyright of EURASIP Journal on Wireless Communications & Networking is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In this work, we investigate channel decoding techniques based on machine learning, and more specifically, on support vector machines (SVMs). Existing SVM-based decoders suffer from a scalability problem, characterized by the exponential growth of both the number of classifiers required to decode and the size of the training dataset as a function of the code dimension. This phenomenon, often referred to as the curse of dimensionality, renders existing SVM approaches impractical for larger codes. To partly address this limitation, we introduce a novel bit-wise SVM decoding strategy coupled with a noiseless optimization framework, which significantly reduces the computational burden. Specifically, for a code of length n and dimension k, our approach decreases the number of SVM classifiers from an exponential dependence to a linear in k, while the required training dataset is minimized to a single noiseless codeword per class, which remains exponential in k. We formulate the resulting optimization problem and derive its analytical solution. Moreover, we demonstrate that, under specific conditions, the solution of the optimization process produced by the proposed framework is equivalent to the optimal Maximum A Posteriori (MAP) decoding rule when applied to transmissions over additive white Gaussian noise (AWGN) channels. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 16871472 |
| DOI: | 10.1186/s13638-025-02493-6 |
