With the aim of extending the coverage and improv- ing the performance of impulse radio ultra-wideband (UWB) systems, this paper focuses on developing a novel single differen- tial encoded decode and forward (DF) non-cooperative relaying scheme (NCR). To favor simple receiver structures, differential noncoherent detection is employed which enables effective energy capture without any channel estimation. Putting emphasis on the general case of multi-hop relaying, we illustrate an original algorithm for the joint power allocation and path selection (JPAPS), minimizing an approximate expression of the overall bit error rate (BER). In particular, after deriving a closed-form power allocation strategy, the optimal path selection is reduced to a shortest path problem on a connected graph, which can be solved without any topology information with complexity O(N 3 ), N being the number of available relays of the network. An approximate scheme is also presented, which reduces the complexity to O(N 2 ) while showing a negligible performance loss, and for benchmarking purposes, an exhaustive-search based multi-hop DF cooperative strategy is derived. Simulation results for various network setups corroborate the effectiveness of the proposed low-complexity JPAPS algorithm, which favorably compares to existing AF and DF relaying methods.

Joint Power Allocation and Path Selection for Multi-Hop Noncoherent Decode and Forward UWB Communications

LOTTICI, VINCENZO
Co-primo
Writing – Review & Editing
;
2014-01-01

Abstract

With the aim of extending the coverage and improv- ing the performance of impulse radio ultra-wideband (UWB) systems, this paper focuses on developing a novel single differen- tial encoded decode and forward (DF) non-cooperative relaying scheme (NCR). To favor simple receiver structures, differential noncoherent detection is employed which enables effective energy capture without any channel estimation. Putting emphasis on the general case of multi-hop relaying, we illustrate an original algorithm for the joint power allocation and path selection (JPAPS), minimizing an approximate expression of the overall bit error rate (BER). In particular, after deriving a closed-form power allocation strategy, the optimal path selection is reduced to a shortest path problem on a connected graph, which can be solved without any topology information with complexity O(N 3 ), N being the number of available relays of the network. An approximate scheme is also presented, which reduces the complexity to O(N 2 ) while showing a negligible performance loss, and for benchmarking purposes, an exhaustive-search based multi-hop DF cooperative strategy is derived. Simulation results for various network setups corroborate the effectiveness of the proposed low-complexity JPAPS algorithm, which favorably compares to existing AF and DF relaying methods.
2014
Mondelli, M.; Zhou, Q.; Lottici, Vincenzo; Ma, X.
File in questo prodotto:
File Dimensione Formato  
TWC_Mar2014.pdf

solo utenti autorizzati

Descrizione: Articolo di ricerca su rivista internazionale
Tipologia: Versione finale editoriale
Licenza: Importato da Ugov Ricerca - Accesso privato/ristretto
Dimensione 1.49 MB
Formato Adobe PDF
1.49 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
DF_UWB__Postprint.pdf

accesso aperto

Tipologia: Documento in Post-print
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 2.07 MB
Formato Adobe PDF
2.07 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/844531
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? 10
social impact