All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Hierarchical Network Transfer Function and Doubly-Greedy Half-Duplex Stage Scheduling for WPNC Networks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00233397" target="_blank" >RIV/68407700:21230/15:00233397 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/LCOMM.2015.2417874" target="_blank" >http://dx.doi.org/10.1109/LCOMM.2015.2417874</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/LCOMM.2015.2417874" target="_blank" >10.1109/LCOMM.2015.2417874</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Hierarchical Network Transfer Function and Doubly-Greedy Half-Duplex Stage Scheduling for WPNC Networks

  • Original language description

    Wireless Physical Layer Network Coding (WPNC) based communication networks deliver the information from sources to destinations through the complex relay network. To properly design the Network Coded Modulation transmitted by network nodes and the relayprocessing including the Hierarchical Network Code (HNC) maps, we need a formal description of the global network processing function. Any practical implementation also implies the half-duplex constrained relays which imposes the network to work in multiple stages. We present a polynomial based formalism defining the Hierarchical Network Transfer Function (H-NTF). It captures all phenomena related to the stage dependent transmit and receive activity over the network, including potential buffering, and mainly the hierarchy of forming the local HNC maps into the global hierarchical flow description. Using the polynomial formalism of H-NTF, we develop the half-duplex constrained stage scheduling algorithm. It starts with finding a causal m

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • 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)

Others

  • Publication year

    2015

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    IEEE Communications Letters

  • ISSN

    1089-7798

  • e-ISSN

  • Volume of the periodical

    19

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    4

  • Pages from-to

    1029-1032

  • UT code for WoS article

    000356164000035

  • EID of the result in the Scopus database

    2-s2.0-84933524016