Optimal sign patterns for a generalized Schmidl-Cox method

Yutaka Jitsumatsu, Masahiro Hashiguchi, Tatsuro Higuchi

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The timing synchronization method proposed by Schmidl and Cox for orthogonal frequency division multiplexing (OFDM) systems uses a reference block consisting of two identical parts, while the one proposed by Shi and Serpedin uses a reference block consisting of four parts with a sign pattern (+1, +1,−1, +1). The accuracy of estimated delays of the latter method is higher than the former. In this paper, the number of partitions is generalized as an integer number M. Two criteria for optimization are proposed. Optimal codes with code length 5 ≤ M ≤ 30 are investigated.

Original languageEnglish
Pages (from-to)269-279
Number of pages11
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8865
DOIs
Publication statusPublished - Jan 1 2014

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Optimal sign patterns for a generalized Schmidl-Cox method'. Together they form a unique fingerprint.

  • Cite this