A branch-cut-and-price algorithm for optimal decoding in digital communication systems

Basit Öğe Kaydı
dc.authoridKabakulak, Banu/0000-0001-8613-3266
dc.authorwosidPusane, Ali E/A-2648-2016
dc.authorwosidTaskin, Z. Caner/Q-2637-2015
dc.contributor.authorKabakulak, Banu
dc.contributor.authorTaskin, Z. Caner
dc.contributor.authorPusane, Ali Emre
dc.date.accessioned2024-07-18T20:42:13Z
dc.date.available2024-07-18T20:42:13Z
dc.date.issued2021
dc.departmentİstanbul Bilgi Üniversitesien_US
dc.description.abstractChannel coding aims to minimize the errors that occur during the transmission of digital information from one place to another. Low-density parity-check codes can detect and correct transmission errors if one encodes the original information by adding redundant bits. In practice, heuristic iterative decoding algorithms are used to decode the received vector. However, these algorithms may fail to decode if the received vector contains multiple errors. We consider decoding the received vector with minimum error as an integer programming (IP) problem and propose a branch-and-price method for its solution. We improve the performance of our method by introducing heuristic feasible solutions and adding valid cuts to the mathematical formulation. Our computational experiments reveal that our branch-cut-and-price algorithm significantly improves solvability of the problem compared to a state-of-the-art IP decoder in the literature and has superior error performance than the conventional sum-product algorithm.en_US
dc.description.sponsorshipTurkish Scientific and Technological Research Council [113M499]en_US
dc.description.sponsorshipThis research has been supported by the Turkish Scientific and Technological Research Council with Grant No. 113M499.en_US
dc.identifier.doi10.1007/s10898-021-01073-4
dc.identifier.endpage834en_US
dc.identifier.issn0925-5001
dc.identifier.issn1573-2916
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-85114863471en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage805en_US
dc.identifier.urihttps://doi.org/10.1007/s10898-021-01073-4
dc.identifier.urihttps://hdl.handle.net/11411/7188
dc.identifier.volume81en_US
dc.identifier.wosWOS:000695785000002en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofJournal of Global Optimizationen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectTelecommunicationsen_US
dc.subjectLdpc Decodingen_US
dc.subjectInteger Programmingen_US
dc.subjectBranch-Cut-And-Price Algorithmen_US
dc.subjectParity-Check Codesen_US
dc.subjectLdpc Codesen_US
dc.subjectPerformanceen_US
dc.titleA branch-cut-and-price algorithm for optimal decoding in digital communication systemsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Web of Science Indexed Publications
Scopus Indexed Publications