• Title/Summary/Keyword: Periodic sequences

Search Result 32, Processing Time 0.024 seconds

ON THE COMPUTATION OF THE NON-PERIODIC AUTOCORRELATION FUNCTION OF TWO TERNARY SEQUENCES AND ITS RELATED COMPLEXITY ANALYSIS

  • Koukouvinos, Christos;Simos, Dimitris E.
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.3_4
    • /
    • pp.547-562
    • /
    • 2011
  • We establish a new formalism of the non-periodic autocorrelation function (NPAF) of two sequences, which is suitable for the computation of the NPAF of any two sequences. It is shown, that this encoding of NPAF is efficient for sequences of small weight. In particular, the check for two sequences of length n having weight w to have zero NPAF can be decided in $O(n+w^2{\log}w)$. For n > w^2{\log}w$, the complexity is O(n) thus we cannot expect asymptotically faster algorithms.

New Construction Method for Quaternary Aperiodic, Periodic, and Z-Complementary Sequence Sets

  • Zeng, Fanxin;Zeng, Xiaoping;Zhang, Zhenyu;Zeng, Xiangyong;Xuan, Guixin;Xiao, Lingna
    • Journal of Communications and Networks
    • /
    • v.14 no.3
    • /
    • pp.230-236
    • /
    • 2012
  • Based on the known binary sequence sets and Gray mapping, a new method for constructing quaternary sequence sets is presented and the resulting sequence sets' properties are investigated. As three direct applications of the proposed method, when we choose the binary aperiodic, periodic, and Z-complementary sequence sets as the known binary sequence sets, the resultant quaternary sequence sets are the quaternary aperiodic, periodic, and Z-complementary sequence sets, respectively. In comparison with themethod proposed by Jang et al., the new method can cope with either both the aperiodic and periodic cases or both even and odd lengths of sub-sequences, whereas the former is only fit for the periodic case with even length of sub-sequences. As a consequence, by both our and Jang et al.'s methods, an arbitrary binary aperiodic, periodic, or Z-complementary sequence set can be transformed into a quaternary one no matter its length of sub-sequences is odd or even. Finally, a table on the existing quaternary periodic complementary sequence sets is given as well.

OPERATIONS ON ELLIPTIC DIVISIBILITY SEQUENCES

  • Bizim, Osman;Gezer, Betul
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.3
    • /
    • pp.763-776
    • /
    • 2018
  • In this paper we consider the element-wise (Hadamard) product (or sum) of elliptic divisibility sequences and study the periodic structure of these sequences. We obtain that the element-wise product (or sum) of elliptic divisibility sequences are periodic modulo a prime p like linear recurrence sequences. Then we study periodicity properties of product sequences. We generalize our results to the case of modulo $p^l$ for some prime p > 3 and positive integer l. Finally we consider the p-adic behavior of product sequences and give a generalization of [9, Theorem 4].

Linear Complexity of 1-Symbol Insertion Sequences from m-Sequences (최대주기 수열의 1-심볼 추가 선형복잡도)

  • Chung, Jin-Ho;Yang, Kyeong-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1C
    • /
    • pp.6-11
    • /
    • 2008
  • From a periodic sequence, we can obtain new sequences with a longer period by r-symbol insertion to each period. In this paper we review previous results on the linear complexity of periodic sequences obtained by r-symbol insertion. We derive the distribution of the linear complexity of 1-symbol insertion sequences obtained from m-sequences over GF(p), and prove some relationship between their linear complexity and the insertion position. Then, we analyze the k-error linear complexity of the 1-symbol insertion sequences from binary m-sequences.

On the ${\kappa}$-Error Linear Complexity of $p^m$-Periodic Binary Sequences and Its Applications to Binary Cyclic Codes ($p^m$-주기 이진 수열의 ${\kappa}$-오류 선형복잡도와 이진 순환 부호에의 응용)

  • Han Yun-Kyoung;Yang Kyeong-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9C
    • /
    • pp.846-852
    • /
    • 2006
  • The ${\kappa}$-error linear complexity is a ky measure of the stability of the sequences used in the areas of communication systems, stream ciphers in cryptology and so on. This paper introduces an efficient algorithm to determine the ${\kappa}$-error linear complexity and the corresponding error vectors of $p^m$-periodic binary sequences, where : is a prime and 2 is a primitive root modulo $p^2$. We also give a new sense about the ${\kappa}$-error linear complexity in viewpoint of coding theory instead of cryptographic results. We present an efficient algorithm for decoding binary cyclic codes of length $p^m$ and derive key properties of the minimum distance of these codes.

FIBONACCI SEQUENCES ON MV-ALGEBRAS

  • Jahanshahi, Morteza Afshar;Saeid, Arsham Borumand
    • The Pure and Applied Mathematics
    • /
    • v.25 no.4
    • /
    • pp.253-265
    • /
    • 2018
  • In this paper, we introduce the concept of Fibonacci sequences on MV-algebras and study them accurately. Also, by introducing the concepts of periodic sequences and power-associative MV-algebras, other properties are also obtained. The relation between MV-algebras and Fibonacci sequences is investigated.

ON THE BOUNDS FOR THE SPECTRAL NORMS OF GEOMETRIC AND R-CIRCULANT MATRICES WITH BI-PERIODIC JACOBSTHAL NUMBERS

  • UYGUN, SUKRAN;AYTAR, HULYA
    • Journal of applied mathematics & informatics
    • /
    • v.38 no.1_2
    • /
    • pp.99-112
    • /
    • 2020
  • The study is about the bounds of the spectral norms of r-circulant and geometric circulant matrices with the sequences called biperiodic Jacobsthal numbers. Then we give bounds for the spectral norms of Kronecker and Hadamard products of these r-circulant matrices and geometric circulant matrices. The eigenvalues and determinant of r-circulant matrices with the bi-periodic Jacobsthal numbers are obtained.

Basic characteristics of super-multi-stabilized chaotic pulse-trains

  • Furumachi, Ryouhei;Torikai, Hirouki;Saito, Toshimichi
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1996-1999
    • /
    • 2002
  • Applying a higher frequency periodic control signal, a state of a chaotic pulse-train generator is quantized. The circuit has various co-existing super-stable periodic pulse-trains (ab. SSPTs) and generates one of them depending on the initial state. Also correlation characteristics of the SSPTs are analyzed precisely. We then consider application of the SSPTs to spread sequences of CDMA with pulse-train signals.

  • PDF

Approximating Coupled Solutions of Coupled PBVPs of Non-linear First Order Ordinary Differential Equations

  • Dhage, Bapurao Chandrabhan
    • Kyungpook Mathematical Journal
    • /
    • v.56 no.1
    • /
    • pp.221-233
    • /
    • 2016
  • The present paper proposes a new monotone iteration method for existence as well as approximation of the coupled solutions for a coupled periodic boundary value problem of first order ordinary nonlinear differential equations. A new hybrid coupled fixed point theorem involving the Dhage iteration principle is proved in a partially ordered normed linear space and applied to the coupled periodic boundary value problems for proving the main existence and approximation results of this paper. An algorithm for the coupled solutions is developed and it is shown that the sequences of successive approximations defined in a certain way converge monotonically to the coupled solutions of the related differential equations under some suitable mixed hybrid conditions. A numerical example is also indicated to illustrate the abstract theory developed in the paper.