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

Fingerprint

Sign Pattern
Orthogonal frequency division multiplexing
Synchronization
Optimal Codes
Orthogonal Frequency Division multiplexing (OFDM)
Timing
Partition
Integer
Optimization

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{eb9747e59ae04999aa858d0d845f6db3,
title = "Optimal sign patterns for a generalized Schmidl-Cox method",
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.",
author = "Yutaka Jitsumatsu and Masahiro Hashiguchi and Tatsuro Higuchi",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-12325-7_23",
language = "English",
volume = "8865",
pages = "269--279",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Optimal sign patterns for a generalized Schmidl-Cox method

AU - Jitsumatsu, Yutaka

AU - Hashiguchi, Masahiro

AU - Higuchi, Tatsuro

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84911933519&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84911933519&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-12325-7_23

DO - 10.1007/978-3-319-12325-7_23

M3 - Article

AN - SCOPUS:84911933519

VL - 8865

SP - 269

EP - 279

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -