Low-complexity Near-optimum Symbol Detection Based on Neural Enhancement of Factor Graphs

We consider the application of the factor graph framework for symbol detection on linear inter-symbol interference channels. Based on the Ungerboeck observation model, a detection algorithm with appealing complexity properties can be derived. However, since the underlying factor graph contains cycle...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on communications Ročník 70; číslo 11; s. 1
Hlavní autoři:	Schmid, Luca, Schmalen, Laurent
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.11.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms channels with memory Complexity Complexity theory Factor graphs Heuristic algorithms high-level parallelism Iterative methods Message passing neural belief propagation Performance enhancement Receivers Signal processing algorithms symbol detection Symbols Wireless communication
ISSN:	0090-6778, 1558-0857
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!

Buďte první, kdo okomentuje tento záznam!