A Construction of Odd Length Generators for Optimal Families of Perfect Sequences

Min Kyu Song; Hong Yeop Song

doi:10.1109/TIT.2018.2801796

A Construction of Odd Length Generators for Optimal Families of Perfect Sequences

Min Kyu Song, Hong Yeop Song

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

In this paper, we give a construction of optimal families of N-ary perfect sequences of period N², where N is a positive odd integer. For this, we re-define perfect generators and optimal generators of any length N which were originally defined only for odd prime lengths by Park, Song, Kim, and Golomb in 2016, but investigate the necessary and sufficient condition for these generators for arbitrary length N. Based on this, we propose a construction of odd length optimal generators by using odd prime length optimal generators. For a fixed odd integer N and its odd prime factor p, the proposed construction guarantees at least (N/p)^p-1φ(N/p)φ(p)φ(p-1)/φ(N)² inequivalent optimal generators of length N in the sense of constant multiples, cyclic shifts, and/or decimations. Here, φ (·) is Euler's totient function. From an optimal generator one can construct lots of different N-ary optimal families of period N², all of which contain p_min^-1 perfect sequences, where p_min is the least positive prime factor of N.

Original language	English
Pages (from-to)	2901-2909
Number of pages	9
Journal	IEEE Transactions on Information Theory
Volume	64
Issue number	4
DOIs	https://doi.org/10.1109/TIT.2018.2801796
Publication status	Published - 2018 Apr

Bibliographical note

Funding Information:
Manuscript received May 31, 2017; revised January 24, 2018; accepted January 24, 2018. Date of publication February 5, 2018; date of current version March 15, 2018. This work was supported by the National Research Foundation of Korea Grant through the Korea Government (MSIP) under Grant 2017R1A2B4011191. This paper was presented in part at the 2017 International Workshop on Signal Design and Its Applications in Communications.

Publisher Copyright:
© 2018 IEEE.

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/TIT.2018.2801796

Cite this

@article{0e157c4ad8304e99bbf7da90ad1ad94b,

title = "A Construction of Odd Length Generators for Optimal Families of Perfect Sequences",

abstract = "In this paper, we give a construction of optimal families of N-ary perfect sequences of period N2, where N is a positive odd integer. For this, we re-define perfect generators and optimal generators of any length N which were originally defined only for odd prime lengths by Park, Song, Kim, and Golomb in 2016, but investigate the necessary and sufficient condition for these generators for arbitrary length N. Based on this, we propose a construction of odd length optimal generators by using odd prime length optimal generators. For a fixed odd integer N and its odd prime factor p, the proposed construction guarantees at least (N/p)p-1φ(N/p)φ(p)φ(p-1)/φ(N)2 inequivalent optimal generators of length N in the sense of constant multiples, cyclic shifts, and/or decimations. Here, φ (·) is Euler's totient function. From an optimal generator one can construct lots of different N-ary optimal families of period N2, all of which contain pmin-1 perfect sequences, where pmin is the least positive prime factor of N.",

author = "Song, {Min Kyu} and Song, {Hong Yeop}",

note = "Funding Information: Manuscript received May 31, 2017; revised January 24, 2018; accepted January 24, 2018. Date of publication February 5, 2018; date of current version March 15, 2018. This work was supported by the National Research Foundation of Korea Grant through the Korea Government (MSIP) under Grant 2017R1A2B4011191. This paper was presented in part at the 2017 International Workshop on Signal Design and Its Applications in Communications. Publisher Copyright: {\textcopyright} 2018 IEEE.",

year = "2018",

month = apr,

doi = "10.1109/TIT.2018.2801796",

language = "English",

volume = "64",

pages = "2901--2909",

journal = "IRE Professional Group on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - A Construction of Odd Length Generators for Optimal Families of Perfect Sequences

AU - Song, Min Kyu

AU - Song, Hong Yeop

N1 - Funding Information: Manuscript received May 31, 2017; revised January 24, 2018; accepted January 24, 2018. Date of publication February 5, 2018; date of current version March 15, 2018. This work was supported by the National Research Foundation of Korea Grant through the Korea Government (MSIP) under Grant 2017R1A2B4011191. This paper was presented in part at the 2017 International Workshop on Signal Design and Its Applications in Communications. Publisher Copyright: © 2018 IEEE.

PY - 2018/4

Y1 - 2018/4

N2 - In this paper, we give a construction of optimal families of N-ary perfect sequences of period N2, where N is a positive odd integer. For this, we re-define perfect generators and optimal generators of any length N which were originally defined only for odd prime lengths by Park, Song, Kim, and Golomb in 2016, but investigate the necessary and sufficient condition for these generators for arbitrary length N. Based on this, we propose a construction of odd length optimal generators by using odd prime length optimal generators. For a fixed odd integer N and its odd prime factor p, the proposed construction guarantees at least (N/p)p-1φ(N/p)φ(p)φ(p-1)/φ(N)2 inequivalent optimal generators of length N in the sense of constant multiples, cyclic shifts, and/or decimations. Here, φ (·) is Euler's totient function. From an optimal generator one can construct lots of different N-ary optimal families of period N2, all of which contain pmin-1 perfect sequences, where pmin is the least positive prime factor of N.

AB - In this paper, we give a construction of optimal families of N-ary perfect sequences of period N2, where N is a positive odd integer. For this, we re-define perfect generators and optimal generators of any length N which were originally defined only for odd prime lengths by Park, Song, Kim, and Golomb in 2016, but investigate the necessary and sufficient condition for these generators for arbitrary length N. Based on this, we propose a construction of odd length optimal generators by using odd prime length optimal generators. For a fixed odd integer N and its odd prime factor p, the proposed construction guarantees at least (N/p)p-1φ(N/p)φ(p)φ(p-1)/φ(N)2 inequivalent optimal generators of length N in the sense of constant multiples, cyclic shifts, and/or decimations. Here, φ (·) is Euler's totient function. From an optimal generator one can construct lots of different N-ary optimal families of period N2, all of which contain pmin-1 perfect sequences, where pmin is the least positive prime factor of N.

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

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

U2 - 10.1109/TIT.2018.2801796

DO - 10.1109/TIT.2018.2801796

M3 - Article

AN - SCOPUS:85041671360

SN - 0018-9448

VL - 64

SP - 2901

EP - 2909

JO - IRE Professional Group on Information Theory

JF - IRE Professional Group on Information Theory

IS - 4

ER -

A Construction of Odd Length Generators for Optimal Families of Perfect Sequences

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this