Achievable rates of hierarchical bit-wise mapped higher-order network coding maps in H-MAC channel with relative fading
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00315047" target="_blank" >RIV/68407700:21230/17:00315047 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Achievable rates of hierarchical bit-wise mapped higher-order network coding maps in H-MAC channel with relative fading
Original language description
The paper addresses Wireless Physical Layer Network Coding with Hierarchical Decode and Forward strategy. We analyze achievable hierarchical rates in one stage hierarchical MAC channel for higher order component constellations with bit-wise Hierarchical Network Code (HNC) maps. This is motivated by a possible application of state-of-the-art binary (e.g. LDPC) codes over higher order constellations. We show that the bit-mapped binary codes do not have the same achievable rates as direct higher-order codes. On top of this, the individual bits in the HNC map might provide very uneven performance and it strongly depends on the combination of component alphabets.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
—
OECD FORD branch
20201 - Electrical and electronic engineering
Result continuities
Project
<a href="/en/project/LTC17042" target="_blank" >LTC17042: Cooperative Coding and Processing in Dense Radio Cloud Communication Networks</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů