Numerically Optimized Uniformly Most Powerful Alphabets for Hierarchical-Decode-and-Forward Two-Way Relaying

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00183688" target="_blank" >RIV/68407700:21230/11:00183688 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Numerically Optimized Uniformly Most Powerful Alphabets for Hierarchical-Decode-and-Forward Two-Way Relaying

Popis výsledku v původním jazyce

We address the issue of the parametric performance of the Hierarchical-Decode-and-Forward (HDF) strategy in a wireless 2-way relay channel. Promising HDF, representing the concept of wireless network coding, performs well with a pre-coding strategy thatrequires Channel State Information (CSI) on the transceiver side. Assuming a practical case when CSI is available only on the receiver side and the channel conditions do not allow adaptive strategies, the parametrization causes significant HDF performance degradation for some modulation alphabets. Alphabets that are robust to the parametrization (denoted Uniformly Most Powerful (UMP)) have already been proposed restricting on the class of non-linear multi-dimensional frequency modulations. In this work,we focus on the general design of unrestricted UMP alphabets. We formulate an optimization problem which is solved by standard non-linear convex constrained optimization algorithms, particularly by Nelder-Mead global optimization search.

Název v anglickém jazyce

Numerically Optimized Uniformly Most Powerful Alphabets for Hierarchical-Decode-and-Forward Two-Way Relaying

Popis výsledku anglicky

We address the issue of the parametric performance of the Hierarchical-Decode-and-Forward (HDF) strategy in a wireless 2-way relay channel. Promising HDF, representing the concept of wireless network coding, performs well with a pre-coding strategy thatrequires Channel State Information (CSI) on the transceiver side. Assuming a practical case when CSI is available only on the receiver side and the channel conditions do not allow adaptive strategies, the parametrization causes significant HDF performance degradation for some modulation alphabets. Alphabets that are robust to the parametrization (denoted Uniformly Most Powerful (UMP)) have already been proposed restricting on the class of non-linear multi-dimensional frequency modulations. In this work,we focus on the general design of unrestricted UMP alphabets. We formulate an optimization problem which is solved by standard non-linear convex constrained optimization algorithms, particularly by Nelder-Mead global optimization search.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JA - Elektronika a optoelektronika, elektrotechnika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

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

Název periodika

Acta Polytechnica

ISSN

1210-2709

e-ISSN

—

Svazek periodika

51

Číslo periodika v rámci svazku

5

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

5

Strana od-do

53-57

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—