• Title/Summary/Keyword: non-linear binary sequence

Search Result 10, Processing Time 0.033 seconds

Non-linear Extended Binary Sequence with Low Cross-Correlation (낮은 상호 상관관계를 갖는 비선형 확장 이진 수열)

  • Choi, Un-Sook;Cho, Sung-Jin;Kwon, Sook-Hee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.4
    • /
    • pp.730-736
    • /
    • 2012
  • PN(Pseudo Noise) sequences play an important role in wireless communications, such as in a CDMA(code division multiple access) communication system. If there is a crash when multiple users simultaneously connected to a system, then PN sequences with low correlation help to minimize multiple access interference in such communication system. In this paper we propose a family of non-linear extended binary sequences with low cross-correlations and the family include $m$-sequence, GMW sequence, Kasami sequence and No sequence with optimal cross-correlation in terms of Welch bound. And we analyze cross-correlation of these sequences.

Analysis of Cross-Correlation of Extended Non-Linear Binary Sequences (확장된 비선형 이진수열의 상호상관관계 분석)

  • Choi, Un-Sook;Cho, Sung-Jin;Kwon, Sook-Hi
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.2
    • /
    • pp.263-269
    • /
    • 2012
  • Code-Division Multiple-Access(CDMA) allows several users simultaneous access to a common channel by assigning a distinct pseudonoise sequence called spectrum code to each user. Each user in a CDMA system uses a assigned spectrum code to modulate their signal. Choosing the codes used to modulate the signal is very important in the performance of CDMA systems. The best performance will occur when there is good separation between the signal of a desired user and the signals of other users. The receiver synchronizes the code to recover the data. The use of an independent code allows multiple users to access the same frequency band at the same time. In this paper we propose a generalized model of non-linear binary sequence using trace function and analyze cross-correlation of these sequences. These sequences with low correlation, large linear span and large family size, in a direct-sequence spread spectrum communication system, help to minimize multiple access interference, increase security degree of system and enlarge user number.

Design and Analysis of Linear Span of A New Family of Non-linear Binary Sequences with 5-Valued Cross-Correlation Functions (5-값 상호상관관계를 갖는 새로운 비선형 이진수열군의 설계와 선형스팬 분석)

  • Choi, Un-Sook;Cho, Sung-Jin;Kim, Han-Doo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.3
    • /
    • pp.619-626
    • /
    • 2013
  • The design of PN(Pseudo Noise) sequences with good cross-correlation properties is important for many research areas in communication systems. In this paper we propose new family of binary sequences $S^r=\{Tr_1^m\{[Tr_m^n(a{\alpha}^t+{\alpha}^{dt})]^r\}{\mid}a{\in}GF(2^n),\;0{\leq}t<2^n-1\}$ composed of Gold-like sequences and find the value of cross-correlation function when $d=2^{n-1}(3{\cdot}2^m-1)$, where n=2k, gcd(r, $2^m-1$)=1. Also we analyze the linear span of $S^r$ for some special r. Proposed sequences are extension of Gold-like sequences and GMW-sequences.

Analysis of Cross-correlation Frequency between Non-linear Binary Sequences Family with 5-Valued Cross-Correlation Functions (5-값 상호상관관계를 갖는 비선형 이진수열군의 상호상관관계 빈도 분석)

  • Choi, Un-Sook;Cho, Sung-Jin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.12
    • /
    • pp.2875-2882
    • /
    • 2013
  • The design of PN(Pseudo Noise) sequences with good cross-correlation properties is important for many research areas in communication systems. Also analyses of cross-correlation frequency between designed sequences have been researched. In this paper we analyze of cross-correlation distribution and properties of non-linear binary sequences family $S^r=\{Tr^m_1\{[Tr^n_m(a{\alpha}^t+{\alpha}^{dt}]^r\}{\mid}a{\in}GF(2^m),0{\leq}t &lt; 2^n-1\}$, where $gcd(r,2^m-1)=1$ with 5-valued cross-correlation.

Analysis of Linear Span of Non-linear Binary Sequences with Decimation d=2m-2(2m+3) (데시메이션이 d=2m-2(2m+3)인 비선형 이진수열의 선형스팬 분석)

  • Yim, Ji-Mi;Cho, Sung-Jin;Kim, Han-Doo;Kim, Seok-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.3
    • /
    • pp.609-616
    • /
    • 2014
  • Large linear span makes difficult to predict, so this study is important to the security and code system. It has been studied about the non-linear binary sequences having low correlation values and large linear span. In this paper we analyze the linear span of $S^r_a(t)=Tr^m_1\{[Tr^n_m(a{\alpha}^t+{\alpha}^{dt})]^r\}$ ($a{\in}GF(2^m)$, $0{\leq}t{\leq}2^m-2$) where n=2m and $d=2^{m-2}(2^m+3)$.

Computing Method of Cross-Correlation of Non-Linear Sequences Using Subfield (부분체를 이용한 비선형 수열의 상호상관관계의 효율적인 계산방법)

  • Choi, Un-Sook;Cho, Sung-Jin;Kim, Seok-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.8
    • /
    • pp.1686-1692
    • /
    • 2012
  • Spreading sequence play an important role in wireless communications, such as in a CDMA(code division multiple access) communication system and multi-carrier spectrum communication system. Spreading sequences with low cross-correlation, in a direct-sequence spread spectrum communication system, help to minimize multiple access interference and to increase security degree of system. Analysis of cross-correlations between the sequences is a necessary process to design sequences. However it require lots of computing time for analysis of cross-correlations between sequences. In this paper we propose a method which is possible to compute effectively cross-correlation using subfield in the process of practical computation of cross-correlation between nonlinear binary sequences.

Online Selective-Sample Learning of Hidden Markov Models for Sequence Classification

  • Kim, Minyoung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.15 no.3
    • /
    • pp.145-152
    • /
    • 2015
  • We consider an online selective-sample learning problem for sequence classification, where the goal is to learn a predictive model using a stream of data samples whose class labels can be selectively queried by the algorithm. Given that there is a limit to the total number of queries permitted, the key issue is choosing the most informative and salient samples for their class labels to be queried. Recently, several aggressive selective-sample algorithms have been proposed under a linear model for static (non-sequential) binary classification. We extend the idea to hidden Markov models for multi-class sequence classification by introducing reasonable measures for the novelty and prediction confidence of the incoming sample with respect to the current model, on which the query decision is based. For several sequence classification datasets/tasks in online learning setups, we demonstrate the effectiveness of the proposed approach.

Phase Representation with Linearity for CORDIC based Frequency Synchronization in OFDM Receivers (OFDM 수신기의 CORDIC 기반 주파수 동기를 위한 선형적인 위상 표현 방법)

  • Kim, See-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.3
    • /
    • pp.81-86
    • /
    • 2010
  • Since CORDIC (COordinate Rotation DIgital Computer) is able to carry out the phase operation, such as vector to phase conversion or rotation of vectors, with adders and shifters, it is well suited for the design of the frequency synchronization unit in OFDM receivers. It is not easy, however, to fully utilize the CORDIC in the OFDM demodulator because of the non-linear characteristics of the direction sequence (DS), which is the representation of the phase in CORDIC. In this paper a new representation method is proposed to linearize the direction sequence approximately. The maximum phase error of the linearized binary direction sequence (LBDS) is also discussed. For the purpose of designing the hardware, the architectures for the binary DS (BDS) to LBDS converter and the LBDS to BDS inverse converter are illustrated. Adopting LBDS, the overall frequency synchronization hardware for OFDM receivers can be implemented fully utilizing CORDIC and general arithmetic operators, such as adders and multipliers, for the phase estimation, loop filtering of the frequency offset, derotation for the frequency offset correction. An example of the design of 22 bit LBDS for the T-DMB demodulator is also presented.

Relation between the Irreducible Polynomials that Generates the Same Binary Sequence Over Odd Characteristic Field

  • Ali, Md. Arshad;Kodera, Yuta;Park, Taehwan;Kusaka, Takuya;Nogmi, Yasuyuki;Kim, Howon
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.3
    • /
    • pp.166-172
    • /
    • 2018
  • A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

MS64: A Fast Stream Cipher for Mobile Devices (모바일 단말에 적합한 고속 스트림 암호 MS64)

  • Kim, Yoon-Do;Kim, Gil-Ho;Cho, Gyeong-Yeon;Seo, Kyung-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.6
    • /
    • pp.759-765
    • /
    • 2011
  • In this paper, we proposed fast stream cipher MS64 for use mobile that it is secure, fast, and easy to implement software. The proposed algorithm use the fast operating 213-bit arithmetic shift register(ASR) to generate a binary sequence and produce 64-bit stream cipher by using simple logical operation in non linear transform. MS64 supports 128-bit key in encryption algorithm and satisfy with the safety requirement in modern encryption algorithm. In simulation result shows that MS64 is faster than a 32-bit stream cipher SSC2 in the speed of operation with small usage of memory thus MS64 can be used for mobile devices with fast ciphering.