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

Result code in 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>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

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

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JA - Electronics and optoelectronics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

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

Publication year

2011

Confidentiality

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

Name of the periodical

Acta Polytechnica

ISSN

1210-2709

e-ISSN

—

Volume of the periodical

51

Issue of the periodical within the volume

5

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

5

Pages from-to

53-57

UT code for WoS article

—

EID of the result in the Scopus database

—