• Title/Summary/Keyword: sequences

Search Result 8,622, Processing Time 0.028 seconds

Hall's Sextic Residue 시퀀스 및 기타 시퀀스의 Trace 함수에 의한 표현

  • 이환근;노종선;정하봉;양경철;송홍엽
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.6
    • /
    • pp.1273-1278
    • /
    • 1997
  • Pseudonoise sequences of period 2$^{m}$ -1 with idel autocorrelation have been researched such as m-sequences, GMW sequences, Legendre sequences, and extended sequences. The m-sequences, the GMW sequences, the Legendre sequences, and the extended sequences are best described in terms of the trace function by previous works. Besides, there are Hall's sextic residue sequences and miscellaneous sequences with ideal autocorrelation, whose general constructions are not known so far. However, are are no explicit descripton of the Hall's sextic residue sequences and the miscellaneous sequences in terms of the trace function. In this paper, the Hall's sextic residue sequences and the miscellaneous sequences of period 2$^{m}$ -1 are expressed as a sum of trace functions. The miscellaneous sequences with ideal autocorrelation, which are newly found by computer search, are also expressed as a sum of trace functions.

  • PDF

Design of Binary Sequences with Optimal Cross-correlation Values (최적의 상호상관관계를 갖는 이진 수열의 설계)

  • Choi, Un-Sook;Cho, Sung-Jin
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.4
    • /
    • pp.539-544
    • /
    • 2011
  • Balanced binary sequences of period $2^n-1(n{\geq}1)$ having the two-valued autocorrelation function have many applications in spread-spectrum communications system. In this paper we propose new nonlinear binary sequences which are constructed from Legendre sequences with the same cross-correlation as the sequences proposed by Cho. These sequences include the m-sequences, GMW sequences, Kasami sequences and No sequences which are described in terms of the trace function over a finite field. Also the proposed sequences have more low cross-correlation distribution than the quadratic form sequences proposed by Klapper.

SOME MONOMIAL SEQUENCES ARISING FROM GRAPHS

  • IMBESI, MAURIZIO;LA BARBIERA, MONICA;TANG, ZHONGMING
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.4
    • /
    • pp.1201-1211
    • /
    • 2015
  • s-sequences and d-sequences are fundamental sequences intensively studied in many fields of algebra. In this paper we are interested in dealing with monomial sequences associated to graphs in order to establish conditions for which they are s-sequences and/or d-sequences.

CHARACTERIZATION OF OPERATORS TAKING P-SUMMABLE SEQUENCES INTO SEQUENCES IN THE RANGE OF A VECTOR MEASURE

  • Song, Hi-Ja
    • East Asian mathematical journal
    • /
    • v.24 no.2
    • /
    • pp.201-212
    • /
    • 2008
  • We characterize operators between Banach spaces sending unconditionally weakly p-summable sequences into sequences that lie in the range of a vector measure of bounded variation. Further, we describe operators between Banach spaces taking unconditionally weakly p-summable sequences into sequences that lie in the range of a vector measure.

  • PDF

Extended sequences of sequences generated by GMW sequences and No sequences (GMW 수열과 No 수열에 의해서 생성된 수열의 확장수열)

  • Cho, Sung-Jin;Yim, Ji-Mi;Kim, Jin-Gyoung;Kim, Seok-Tae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.2
    • /
    • pp.271-277
    • /
    • 2012
  • In this paper, we introduce the extended sequences of sequences generated by GMW sequences and No sequences. And we analyze cross-correlatons of the extended sequences. Also we give extended sequences which are constructed from Legendre sequences. This is helpful to a cryptosystem and a communication system. Particularly this study is useful to the CDMA system signal design.

Characterization of earthquake ground motion of multiple sequences

  • Moustafa, Abbas;Takewaki, Izuru
    • Earthquakes and Structures
    • /
    • v.3 no.5
    • /
    • pp.629-647
    • /
    • 2012
  • Multiple acceleration sequences of earthquake ground motions have been observed in many regions of the world. Such ground motions can cause large damage to the structures due to accumulation of inelastic deformation from the repeated sequences. The dynamic analysis of inelastic structures under repeated acceleration sequences generated from simulated and recorded accelerograms without sequences has been recently studied. However, the characteristics of recorded earthquake ground motions of multiple sequences have not been studied yet. This paper investigates the gross characteristics of earthquake records of multiple sequences from an engineering perspective. The definition of the effective number of acceleration sequences of the ground shaking is introduced. The implication of the acceleration sequences on the structural response and damage of inelastic structures is also studied. A set of sixty accelerograms is used to demonstrate the general properties of repeated acceleration sequences and to investigate the associated structural inelastic response.

A Proposal for Generating Good Assembly Sequences by Tournament Tree

  • Tsuboi, Kenji;Matsumoto, Toshiyuki;Shinoda, Shinji;Niwa, Akira
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.2
    • /
    • pp.161-169
    • /
    • 2011
  • In seeking further efficiency in production preparation, it is common to examine assembly sequences using digital manufacturing. The assembly sequences affect the product evaluation, so it is necessary to test several assembly sequences before actual production. However, because selection and testing of assembly sequences depends on the operator's personal experience and intuition, only a small number of assembly sequences are actually tested. Nevertheless, there is a systematic method for generating assembly sequences using a contact-related figure. However, the larger the number of parts, the larger the number of assembly sequences geometric becomes. The purpose of this study is to establish a systematic method of generating efficient assembly sequences regardless of the number of parts. To generate such assembly sequences selectively, a "Tournament Tree," which shows the structure of an assembly sequence, is formulated. Applying the method to assembly sequences of a water valve, good assembly sequences with the same structure as the Tournament Tree are identified. The structure of such a Tournament Tree tends to have fewer steps than the others. As a test, the structure is then applied for a drum cartridge with 38 parts. In all the assembly sequences generated from the contact-related figures, the best assembly sequence is generated by using the Tournament Tree.

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

ChimerDB - Database of Chimeric Sequences in the GenBank

  • Kim, Namshin;Shin, Seokmin;Cho, Kwang-Hwi;Lee, Sanghyuk
    • Genomics & Informatics
    • /
    • v.2 no.2
    • /
    • pp.61-66
    • /
    • 2004
  • Fusion proteins resulting from chimeric sequences are excellent targets for therapeutic drug development. We developed a database of chimeric sequences by examining the genomic alignment of mRNA and EST sequences in the GenBank. We identified 688 chimeric mRNA and 20,998 chimeric EST sequences. Including EST sequences greatly expands the scope of chimeric sequences even though it inevitably accompanies many artifacts. Chimeric sequences are clustered according to the ECgene ID so that the user can easily find chimeric sequences related to a specific gene. Alignments of chimeric sequences are displayed as custom tracks in the UCSC genome browser. ChimerDB, available at http://genome.ewha.ac.kr/ECgene/ChimerDB/, should be a valuable resource for finding drug targets to treat cancers.

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.