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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11C
• /
• pp.1059-1065
• /
• 2007

In this paper, we propose a class of polyphase signature sequences, whose general odd correlation properties are useful for M-ary phase signaling systems. The maximum magnitude of the general odd correlation functions of the proposed sequences are investigated and compared with those of FZC (Frank-Zadoff-Chu) sequences and those of EOE (equivalent odd and even correlation) sequences. The performance of the asynchronous M-ary phase signaling systems using the proposed sequences is simulated and compared with that using FZC sequences in direct sequence code division multiple access (DS/CDMA) systems. The performance of the system using the proposed sequence is shown to be better than that using FZC sequences when the multipath fading is in existence.

• Journal of Korean Library and Information Science Society
• /
• v.37 no.4
• /
• pp.111-141
• /
• 2006

This Study has developed the contents(scope and sequence) of reading education in school library. For this purpose, this study compares and analyze the contents of reading education curriculum in Korea, American and Japan. Basing on the comparative and analyzed results, It has established a scope for reading education, 10 area and 45 elements. It survey reliability against established a scope and sequence(suitable school year) with 52 teacher librarian in Korea. It proposed the contents(scope and sequence) of reading education in school library with final.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.9
• /
• pp.1395-1403
• /
• 1993

Protocol conformance is crucial to inter-operability and cost effective computer communication. Given a protocol specification, the task of checking whether an inplementation conforms to the specification is called conformance testing. The efficiency and fault coverage of conformance testing are largely dependent on how test cases are chosen. Some states may have more one UIO sequence when the protocol is represented by FSM (Finite State Machine). The length of test sequence can be minimized if the optimal test sequences are chosen. In this paper, we construct the depth-tree to find the maximum overlapping among the test sequence. By using the resulting depth-tree, we generate the minimum-length test sequence. We show the example of the minimum-length test sequence obtained by using the resulting depth-tree.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.2
• /
• pp.137-145
• /
• 1989

In this paper we consider the design of bent sequence generators employing a modified bent function. Through the experimental results and simulation, we show that the period of sequences is $2^n$-1, the number of sequences in the set is $2n/2$, the largest magnitude of correlation is $2n/2$+1, and the sequence generators easy to randomly initialize into any assigned code and hence can be rapidly hopped from sequence to sequence. And we construct a code synchronization system with bent sequence generator as the local code generator, a sliding correlator and DLL as the acquisition subsystem and the tracking subsystem, respectively for DS-CODA, and verify the experimenta results for accomplishing code synchronism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11C
• /
• pp.1113-1121
• /
• 2009

In this paper, the channel estimation and pilot sequence design technique of multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems in multi-cell environments are studied for situations in which the inter cell interference (ICI) is the dominant channel impairment. We design pilot sequence aiming at minimizing mean square error and propose the channel estimation technique correspond to the designed pilot sequences. The proposed pilot sequences employ the sequences with good correlation properties such as Chu sequence and through simulations, it is shown that channel estimation algorithm using designed pilot sequence is effective for mitigating the ICI.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.971-980
• /
• 1994

The need increased capacity in the cellular system has resulted in the adoption of digital technology with CDMA as the channel access method. It has been recognized that the distinction of the base station is important for its performance in CDMA, since the same spreading sequences are used by the all base stations. Time offset of the pseudo-random noise binary code are used to distinguish signals received at a mobile station from different base station. But the start of the zero offset PN sequence is chosen arbitrary without the background of the systematic and mathematical elaboration. This paper proposes a mothed that define the start of the zero offset PN sequence mathematically. This paper also discusses a method that can easily calculate the time offset of the received spreading sequence with respect to the zero offset PN sequence.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.614-616
• /
• 2010

Recently, there is increasing concern about smart phone due to the release of iPhone and Android phone. So, There are many kinds of application in smart phone, and applications using multimedia contents is increasing. The famous codecs for Image and video are JPEG, MPEG and h.264, which is popular recently as a vedeo codec because of its high compression ratio compared with the other video codecs. In this paper, we will divide Jpeg Sequence to each Jpeg and will display that Jpeg looks like a video continuously in Android. And we will show you the simulation result.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2881-2894
• /
• 2014

In complicated environment, context information plays an important role in image segmentation/labeling. The recently proposed auto-context algorithm is one of the effective context-based methods. However, the standard auto-context approach samples the context locations utilizing a fixed radius sequence, which is sensitive to large scale-change of objects. In this paper, we present a scale invariant auto-context (SIAC) algorithm which is an improved version of the auto-context algorithm. In order to achieve scale-invariance, we try to approximate the optimal scale for the image in an iterative way and adopt the corresponding optimal radius sequence for context location sampling, both in training and testing. In each iteration of the proposed SIAC algorithm, we use the current classification map to estimate the image scale, and the corresponding radius sequence is then used for choosing context locations. The algorithm iteratively updates the classification maps, as well as the image scales, until convergence. We demonstrate the SIAC algorithm on several image segmentation/labeling tasks. The results demonstrate improvement over the standard auto-context algorithm when large scale-change of objects exists.