• Title/Summary/Keyword: M-시퀀스

Search Result 131, Processing Time 0.027 seconds

Extended Legendre 시퀀스의 선형스팬

  • 노종선
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.8 no.1
    • /
    • pp.3-9
    • /
    • 1998
  • 본 논문에서는 2$_{m}$ -1의 메센소수 주기를 갖는 Legendre 시퀀스에 확장이론을 적용하여 유도되는 주기가 2$^{em}$ -1인 extdndre 시퀀스를 decimated m-시퀀스들의 합으로 표현하였으며 이를 이용하여 extended Legendre시퀀스를 decimated m-시퀀스들의 합으로 표현하였으며 이를 이용하여 extended Legendre 시퀀스의 선형스팬의 상한식 및 선형스팬에 관한 conjecture를 유도하였다.

Performance of PN Code Based Time Hopping Sequences in M-ary Ultra Wide Band Multiple Access Systems Using Equicorrelated Signal Sets (동일 상관 신호군을 이용하는 M-ary UWB 다원 접속 시스템에서 PN 부호 기반 시간 도약 시퀀스의 성능)

  • 양석철;신요안
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10A
    • /
    • pp.816-829
    • /
    • 2003
  • In this paper, we evaluate the performance of PN (Pseudo Noise) code based time hopping sequences for M-ary UWB (Ultra Wide Band) multiple access systems using the equicorrelated signal sets. In particular, we consider two different types of M-ary UWB systems in UWB indoor wireless multipath channels: The first type of the systems (System #1) has identical symbol transmission rate regardless of the number of symbols M since the length of signal pulse train is fixed while M increases, and the second type of the systems (System #2) has the same bit transmission rate regardless of M since the length of signal pulse train is extended according to the increase of M. We compare the proposed systems with those using the ideal random time hopping sequence in terms of the symbol error rate performance. Simulation results show that the PN code based time hopping sequence achieves quite good performance which is favorably comparable to that of the ideal random sequence. Moreover, as M increases, we observe that System #2 shows better robustness against multiple access interference than System # 1.

Binary pseudorandom sequences of period $2^{m}-1$ with ideal autocorrelation generated by the polynomial $z^{d}+(z+1)^{d}$ (다항식 $z^{d}+(z+1)^{d}$에 의해 발생된 이상적인 자기상관을 갖는 주기 $2^{m}-1$의 이진 의사불규칙 시퀀스)

  • 노종선;정하봉;윤민선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.5
    • /
    • pp.1165-1172
    • /
    • 1998
  • In this paper, we present a construction for binary pseudorandom sequences of period $2^{m}-1$ with ideal autocorraltion property using the polynomial $z^{d}+(z+1)^{d}$. We show that the sequence obtained from the polynomial becomes an m-sequence for certain values of d. We also find a few values of d which yield new binary sequences with ideal autocorrelation property when m is $3k{\pm}1$, where k is a positive integer. These new sequences are represented using trace function and the results are tabulated.

  • PDF

A Study on Time-Series Subsequence Matching using Multi MBRs (다수의 MBR을 이용한 시계열 서브시퀀스 매칭 연구)

  • Ihm, Sun-Young;Park, Young-Ho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.04a
    • /
    • pp.1068-1069
    • /
    • 2012
  • 시계열 데이타는 일정 시간 간격으로 측정한 값의 시퀀스를 뜻하는데, 사용자에 의해 주어진 질의 시퀀스와 유사한 데이타 시퀀스를 검색하는 방법을 유사 시퀀스 매칭이라고 한다. 본 논문에서는 유사 시퀀스 매칭 시, 질의 시퀀스로 MBR을 구성할 때 한 개의 MBR이 아닌 다수의 MBR로 구성하는 방법을 제안하였다. 다수의 MBR로 구성하여 질의 처리를 하면 질의 시퀀스의 길이가 길 경우 적은 비용으로 질의 처리를 수행할 수 있다.

M2M Transformation Rules for Automatic Test Case Generation from Sequence Diagram (시퀀스 다이어그램으로부터 테스트 케이스 자동 생성을 위한 M2M(Model-to-Model) 변환 규칙)

  • Kim, Jin-a;Kim, Su Ji;Seo, Yongjin;Cheon, Eunyoung;Kim, Hyeon Soo
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.1
    • /
    • pp.32-37
    • /
    • 2016
  • In model-based testing using sequence diagrams, test cases are automatically derived from the sequence diagrams. For the generation of test cases, scenarios need to be found for representing as a sequence diagram, and to extract test paths satisfying the test coverage. However, it is hard to automatically extract test paths from the sequence diagram because a sequence diagram represents loop, opt, and alt information using CombinedFragments. To resolve this problem, we propose a transformation process that transforms a sequence diagram into an activity diagram which represents scenarios as a type of control flows. In addition, we generate test cases from the activity diagram by applying a test coverage concept. Finally, we present a case study for test cases generation from a sequence diagram.

Multi-Sequence Signaling Based Asynchronous Trellis-Coded DS/CDMA System (다중 시퀀스 시그날링에 기초한 비동기 트레리스 부호화 DS/CDMA 시스템)

  • Sangho Choe
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3A
    • /
    • pp.248-256
    • /
    • 2004
  • Woerner had suggested an asynchronous trellis-coded DS/CDMA system based on a multi-sequence signaling, biorthogonal sequence, which is superior to single sequence signaling, such as M-ary PSK, due to their better cross-correlation properties. This paper analyzes and compares system performance between OPSM, a recently-presented multi-sequence signaling scheme, and biorthogonal sequence signaling. Interuser interference moments of the two schemes are derived and compared which verifies that OPSM, having smaller signature sequences per symbol than biorthogonal signaling, reduces cross-correlation. Numerical results compare the power and spectral efficiency of asynchronous trellis-coded DS/CDMA systems based on multi-sequence signaling.

Similar Sequence Search Supporting Shifting (쉬프팅을 지원하는 유사 시퀀스 검색)

  • Kang, Seok-Won;Kim, Su-Hyun;Song, Junho;Kim, Sang-Wook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.10a
    • /
    • pp.1191-1192
    • /
    • 2015
  • 기존의 유사 시퀀스 검색 방법들은 시퀀스 간의 거리를 이용하여 유사도를 판단하였다. 그러나 이러한 방법은 시퀀스의 형태를 고려하지 못하는 문제가 있다. 본 논문에서는 시퀀스를 쉬프팅하여 형태를 고려하고 시퀀스 간의 거리를 이용해 유사한 시퀀스를 검색하는 방법을 제안하고자 한다.

Robust Digital Watermarking Using Chaotic Sequence (카오스 시퀀스를 이용한 견고한 디지털 워터마킹)

  • 김현환;정기룡
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.4
    • /
    • pp.630-637
    • /
    • 2003
  • This paper proposed a new watermarking algorithm using chaotic sequence instead of conventional M-sequence for protecting copyright to the author. Robustness and security is very important for watermarking process. We use multi-threshold value according to the human visual system for improving robustness of watermarking to each subband images coefficient differently after wavelet transform. And then, we embedded watermark image to original image by multi-watermark weights which are made by random sequence generator. We detect watermark image from the difference data which is made from each wavelet subband images. We also simulate the efficiency from the various possible attacks. Chaotic sequence is better than M-sequence, because the one is very easy to make sequence and the chaotic sequence is changed easy according to the initial value. So, the chaotic sequence has the better security than the conventional M-sequence.

The Correlation Parameters and the Optimization of a PN Sequence Phase for Variable Spreading Gain (VSG) Multi-Rate DS/CDMA System (멀티레이트 서비스를 지원하는 VSG-DS/C음 시스템에서의 PN 시퀀스 상관 파라미터 특성과 최적화)

  • 이연우;김응배;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.10-17
    • /
    • 2000
  • In this paper, we evaluate the correlation properties and the optimization of PN sequence phase for multi-media DS/CDMA system with variable spreading gain (VSG) scheme. In multi-media multi-rate DS/CDMA systems, the optimization of PN sequence phase is not a tractable problem, since the sequences should be optimized against both sequences of the same length and other sequences with different length. Hence, we verify the correlation properties of PN sequence phase in multi-rate system environment and furthermore, we propose the new phase criterion, MIN-AIP (minimum-average interference parameter), to minimize the bit error rate (BER). As the results of performance evaluations, it is shown that the performance of MIN-AIP criteria gives the best results.

  • PDF

On the Phase Sequence Set of SLM Scheme for Crest Factor Reduction in OFDM System (OFDM 시스템의 Crest 값을 감소하기 위한 SLM 기법의 위상 시퀀스에 관한 연구)

  • Lim Dae-Woon;Heo Seok-Joong;No Jong-Seon;Chung Ha-Bong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9C
    • /
    • pp.889-896
    • /
    • 2006
  • The crest factor distribution of orthogonal frequency division multiplexing (OFDM) symbol sequences is evaluated and it is shown that OFDM symbol sequences with a short period are expected to have a high crest factor. The crest factor relationship between two input symbol sequences, Hamming distance D apart is also derived. Using these two results, we propose two criteria for a phase sequence set of the selected mapping (SLM) scheme and suggest the rows of the cyclic Hadamard matrix constructed from an m-sequence as the near optimal phase sequence set of the SLM scheme.