Joint and recursive hierarchical interference cancellation with successive compute & forward decoding
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00222969" target="_blank" >RIV/68407700:21230/14:00222969 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Joint and recursive hierarchical interference cancellation with successive compute & forward decoding
Original language description
The paper addresses Physical Layer Network Coding in multinode wireless relaying networks. We generalize Compute & Forward (CF) strategy by introducing the concept of Hierarchical Interference Cancellation (H-IFC) using Successive CF Decoding. This technique allows increasing the number of degrees of freedom in lattice misalignment equalizer while using all available hierarchical (many-to-one function) auxiliary codeword maps. The technique is not constrained to use linear map combinations and allows more freedom in choosing a given desired codeword map at the relay in a complicated multi-stage network. The H-IFC technique is developed in two, joint and recursive, forms. Numerical results show that the achievable computation rates can substantially outperform standard linear multi-map CF technique.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
JA - Electronics and optoelectronics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LD12062" target="_blank" >LD12062: Wireless Network Coding and Processing in Cooperative and Distributed Multi-Terminal and Multi-Node Communication Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů