• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2181-2187
• /
• 2011

In this paper, a family of binary sequences generated by GMW sequences and No sequences is introduced and analyzed. Each sequence within a family has period $N=2^n-1$, n=2m and there are $2^m$ sequences within that family. We obtain auto and cross-correlation values and linear span of the synthesized sequence.

• Journal of the Optical Society of Korea
• /
• v.9 no.3
• /
• pp.103-106
• /
• 2005

Recently, polymethyl methacrylate based plastic optical fibers (POFs) have attracted considerable attention as a potential medium for local area network (LAN) and home network applications. Since the POFs have very low optical loss at around 650mm, in particular, it becomes quite important to develop GHz transmitters operating at this wavelength for high bit rate optical transmission applications of the POFs. In this paper, we present generation of ${\geq}1.5 Gbps$ pseudo-random binary sequence optical signals by using a gain switched InGaA1P Fabry-Perot semiconductor laser with a high frequency filter, operating at 650mm, and the application of these signals to bandwidth measurement of POFs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.164-169
• /
• 2009

This paper presents a fast and accurate ranging algorithm for the WiBro system. The proposed algorithm detects a received ranging code and estimates its propagation delay using the correlation characteristics of the PRBS (Pseudo Random Binary Sequence) and the circular shift property of the discrete Fourier transform operator. The proposed ranging algorithm was applied to array antenna systems to show how it could improve the ranging performance of an array antenna system compared to a conventional base station system, which uses only a single antenna.

• Journal of Astronomy and Space Sciences
• /
• v.22 no.3
• /
• pp.233-242
• /
• 2005

The absolute dimensions and orbital elements of 66 near contact binaries, collected from literatures, have been analyzed to investigate the physical characteristics of the near contact binaries as well as co-relations among physical parameters. The relationship between the mass ratio and luminosity ratio of the near contact binary systems have been obtained as a $L_2/L_1{\approx}(M_2/M_1)^{1.45}$, which is similar to that of the early type contact binary system. The physical parameters of the new contact binaries show that the difference in mass, radius, luminosity and temperature between the primary and the secondary components for the F type NCBs are smaller than those for the A type NCBs. In H-R diagram, the components of the A types are located closer to the terminal age main sequence than those of the F types.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.8
• /
• pp.445-452
• /
• 2014

In this paper, we define ideal autocorrelation property for balanced quaternary sequence with even period. We also prove that our definition is ideal autocorrelation property for balanced quaternary sequence with even period. Furthermore, we propose a generation method of quaternary sequence with ideal autocorrelation property of period $2{\times}(2^n-1)$ using a binary sequence with ideal autocorrelation of period $2^n-1$ and Gray mapping. We also derive the autocorrelation value distribution of the newly proposed quaternary sequence.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1104-1109
• /
• 2015

Due to the rapid growth in digital contents, it is important for us to design a high speed and secure encryption algorithm which is able to comply with the existing and future needs. This paper proposes an alternative approach for self-decimated LM-128 summation sequence generator, which will generate a higher throughput if compared to the conventional generator. We design and implement a threshold clock-controlled LM-128 and prove that it has a lower clock cycle and hence giving a higher key stream generation speed. The proposed threshold clock-control LM-128 generator consists of 256 bits inner state with 128 bits secret key and initialization vector. The cipher achieves a security level of 128 bits to be adapted to the digital contents security with high definition and high quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7A
• /
• pp.727-734
• /
• 2004

Collision Management Protocol (CMP) efficiently resolves collisions when data frames are transmitted in networks consisting of HomPNA 3.0 asynchronous MAC mode device with random access. Unlike Distributed Fair Priority Queueing (DFPQ) algorithm in HomePNA 2.0 or Binary Exponential Backoff (BEB) algorithm in IEEE 802.11, order of retransmission is decided according to Collision Signaling Sequence (CSS) values allocated to each device. Thus, CMP can minimize the number of mean collisions because order of retransmission is decided in a deterministic way. In this paper. we evaluate the saturation performance of CMP in HomePNA 3.0 using an analytic method.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.196-202
• /
• 2021

DNA sequencing provides fundamental data in genomics, bioinformatics, biology and many other research areas. With the emergent evolution in DNA sequencing technology, a massive amount of genomic data is produced every day, mainly DNA sequences, craving for more storage and bandwidth. Unfortunately, managing, analyzing and specifically storing these large amounts of data become a major scientific challenge for bioinformatics. Those large volumes of data also require a fast transmission, effective storage, superior functionality and provision of quick access to any record. Data storage costs have a considerable proportion of total cost in the formation and analysis of DNA sequences. In particular, there is a need of highly control of disk storage capacity of DNA sequences but the standard compression techniques unsuccessful to compress these sequences. Several specialized techniques were introduced for this purpose. Therefore, to overcome all these above challenges, lossless compression techniques have become necessary. In this paper, it is described a new DNA compression mechanism of pattern matching extended Compression algorithm that read the input sequence as segments and find the matching pattern and store it in a permanent or temporary table based on number of bases. The remaining unmatched sequence is been converted into the binary form and then it is been grouped into binary bits i.e. of seven bits and gain these bits are been converted into an ASCII form. Finally, the proposed algorithm dynamically calculates the compression ratio. Thus the results show that pattern matching extended Compression algorithm outperforms cutting-edge compressors and proves its efficiency in terms of compression ratio regardless of the file size of the data.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1007-1012
• /
• 2014

Software birthmarks are used to detect software plagiarism. For binaries, however, only a few birthmarks have been developed. In this paper, we propose a static approach to generate API sequences along major paths, which are analyzed from control flow graphs of the binaries. Since our API sequences are extracted along the most plausible paths of the binary codes, they can represent actual API sequences produced from binary executions, but in a more concise form. Our similarity measures use the Smith-Waterman algorithm that is one of the popular sequence alignment algorithms for DNA sequence analysis. We evaluate our static path-based API sequence with multiple versions of five applications. Our experiment indicates that our proposed method provides a quite reliable similarity birthmark for binaries.

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