We consider synchronization based on the detection of a known sequence (preamble, unique word, or sync word), that is transmitted to delimit a frame of random data. Recently, preamble sequences with ternary symbols have been considered in ultrawide band (UWB) due to their improved (with respect to classical binary sequences) autocorrelation properties, and in particular to the need to allow the use of both coherent and noncoherent receivers. In this paper we consider preamble synchronization where the preamble symbols are ternary and data are random binary symbols, assuming a Gaussian channel and soft values available at the input of the synchronization device. We show that detection of preambles based on correlation is not optimal, and that a simple modification of the metric gives substantial improvements. More precisely, we derive the optimum test metric and a suboptimal low-complexity detector, and compare their performance with the usual correlation based preamble detector. Results show that the gap between the two metrics (optimal and suboptimal) is very small, and that both outperform the correlation based synchronizer.

Optimum Synchronization of Ternary Preamble Sequences in Gaussian Noise

CHIANI, MARCO;GIORGETTI, ANDREA;PAOLINI, ENRICO
2010

Abstract

We consider synchronization based on the detection of a known sequence (preamble, unique word, or sync word), that is transmitted to delimit a frame of random data. Recently, preamble sequences with ternary symbols have been considered in ultrawide band (UWB) due to their improved (with respect to classical binary sequences) autocorrelation properties, and in particular to the need to allow the use of both coherent and noncoherent receivers. In this paper we consider preamble synchronization where the preamble symbols are ternary and data are random binary symbols, assuming a Gaussian channel and soft values available at the input of the synchronization device. We show that detection of preambles based on correlation is not optimal, and that a simple modification of the metric gives substantial improvements. More precisely, we derive the optimum test metric and a suboptimal low-complexity detector, and compare their performance with the usual correlation based preamble detector. Results show that the gap between the two metrics (optimal and suboptimal) is very small, and that both outperform the correlation based synchronizer.
Proc. IEEE International Symposium on Wireless Pervasive Computing (ISWPC 2010)
146
150
M. Chiani; A. Giorgetti; E. Paolini
File in questo prodotto:
Eventuali allegati, non sono esposti

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: http://hdl.handle.net/11585/94038
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact