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

Channel 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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of global optimization Ročník 81; číslo 3; s. 805 - 834
Hlavní autoři: Kabakulak, Banu, Taşkın, Z. Caner, Pusane, Ali Emre
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.11.2021
Springer
Springer Nature B.V
Témata:
Algorithms
Codes
Communications systems
Computer Science
Decoding
Error correcting codes
Heuristic
Integer programming
Iterative methods
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Performance enhancement
Real Functions
Integer programming
LDPC decoding
Telecommunications
Branch-cut-and-price algorithm
ISSN:0925-5001, 1573-2916
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Channel 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-021-01073-4