• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.8
• /
• pp.368-373
• /
• 2002

The inverse z-transform of a z-domain expression of a sequence can be Performed in many different methods among which the recursive computational method is based on the difference equation. In applying this method, a few initial values of the sequence should be obtained separately. Although the existing method generates the right initial values of the sequence, its derivation and justification are not theoretically in view of the definition of z-transform and its shift theorems. In this paper a general approach for formulating a difference equation and for obtaining required initial values of a sequence is proposed, which completely complies to the definition of the z-transform and an interpretation of the validity of the existing method which is theoretically incorrect.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.6
• /
• pp.105-114
• /
• 1984

A fast pseudo-noise (PN) sequence acquisition algorithm for the direct-sequence (DS) spread spectrum system is proposed. The basic concept of the algorithm has been adopted from that of the classical sliding correlator. Mathematical modeling, analysis and computer simulation of the proposed system have been done. The results of analysis and computer simulation show that the acquisition system yields a significant performance improvement over the sliding correlator. Its acquisition time takes only 45 ms when signal-to-noise ratio(SNR) is -18dB. The algorithm developed has been implemented in hardware and its experimental result is also given.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.693-698
• /
• 2000

Aspects of classical information theory, such as rate distortion theory, investigate how to encode and decode information from an independently identically distributed source so that the asymptotic distortion rate between the source and its quantized representation is minimized. However, in most natural dynamics, the source state is highly corrupted by disturbances, and the measurement contains the noise. In recent coder-estimator sequence is developed for state estimation problem based on observations transmitted with finite communication capacity constraints. Unlike classical estimation problems where the observation is a continuous process corrupted by additive noises, the condition is that the observations must be coded and transmitted over a digital communication channel with finite capacity. However, coder-estimator sequence does not provide such a quantitative analysis as a variance for estimation error. In this paper, under the assumption that the estimation error is Gaussian distribution, a variance for coder-estimation sequence is proposed and its fitness is evaluated through simulations with a simple example.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1307-1329
• /
• 2022

This paper proposes an improved Pseudorandom Sequence Generator (PRSG) based on the concept of modular arithmetic systems with non-integral numbers. The generated random sequence use in various cryptographic applications due to its unpredictability. Here the mathematical model is designed to solve the problem of the non-uniform distribution of the sequences. In addition, PRSG has passed the standard statistical and empirical tests, which shows that the proposed generator has good statistical characteristics. Finally, image encryption has been performed based on the sort-index method and diffusion processing to obtain the encrypted image. After a thorough evaluation of encryption performance, there has been no direct association between the original and encrypted images. The results show that the proposed PRSG has good statistical characteristics and security performance in cryptographic applications.

• Journal of Korean Society of Forest Science
• /
• v.96 no.4
• /
• pp.425-431
• /
• 2007

To investigate genetic diversity and PCR detection of Rhizina undulata, PCR detection and sequence analysis of rDNA ITS region of R. undulata in soil were analyzed and developed. The length of partial 18S rDNA from four R. undulata isolates were 1,375 nt. The sequence similarity of R. undulata isolates was 100%. The rDNA ITS regions of R. undulata isolates were 585 nt long. Nucleotide sequencing of the ITS regions showed that PDK-1, PTT-1 and PDJ-9 isolates had 100% sequence identity. But, PDS-5 isolate differed from the three isolates by two nucleotide substitution. R. undulata-specific primers designed by the sequence of ITS region were used in PCR detection of R. undulata. PCR products about 525 bp size, which is specific to R. undulata, were amplified from total DNAs of R. undulata isolates. To assay the sensitivity of PCR detection by R. undulata ITS-specific primer, purely cultured mycelial suspension of R. undulata was serially diluted and mixed with 100g of sterile sandy loam soil, respectively. And then, PCR products of total DNAs extracted from each mycelium-soil mixtures were analysed. The PCR protocol could detected up to 1ng mycelium of R. undulata within 100g of soil.

• The Plant Pathology Journal
• /
• v.21 no.3
• /
• pp.229-236
• /
• 2005

Molecular profIles of PCR-RFLP and sequence analysis of internal transcribed spacer (ITS) regions of rDNA were compared between morphologically distinguishable species of Trichoderma isolated from substrates of oyster mushroom in Korea, T. atroviride, T. citrinoviride, T. harzianum, T. longibrachiatum, T. virens, and two unidentified species, Trichoderma sp. 1 and 2. PCR­RFLP analysis divided the Trichoderma spp. into six RFLP groups, A, B, C, D, E, and F. The RFLP groups were generally agreed with described morphological species, except that the RFLP group A containing the two unidentified species. A neighbor-joining tree based on ITS sequences well supported RFLP groups observed by RFLP analysis of ITS regions of rDNA. Additionally, the two unidentified species, Trichoderma sp. 1 and 2, which could not be distinguished by PCR­RFLP analysis, were separated in sequence analysis of ITS regions of rDNA.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.4
• /
• pp.325-332
• /
• 2017

In this paper, a survey of test sequence generation methods for testing the conformance of a protocol implementation to its specification is presented. The best known methods proposed in the literature are called transition tour, distinguishing sequence, characterizing sequence, and unique input/output sequence. Also, several variants of the above methods are introduced. Applications of these methods to the finite state machine model are discussed. Then, comparative analysis of the methods is made in terms of test sequence length. Finally, conclusions are given as follows. The T-method produces the shortest test sequence, but it has the worst fault coverage. The W-method tends to produce excessively long test sequences even though its fault coverage is complete. The problem with the DS-method is that a distinguishing sequence may not exist. The UIO-method is more widely applicable, but it does not provide the same fault coverage as the DS-method.

• Bioinformatics and Biosystems
• /
• v.1 no.1
• /
• pp.46-50
• /
• 2006

According to the advancement of experimental techniques in molecular biology, genomic and protein sequence databases are increasing in size exponentially, and mean sequence lengths are also increasing. Because the sizes of these databases become larger, it is difficult to search similar sequences in biological databases with significant homologies to a query sequence. In this paper, we present the N-gram indexing method to retrieve similar sequences fast, precisely and comparably. This method regards a protein sequence as a text written in language of 20 amino acid codes, adapts N-gram tokens of fixed-length as its indexing scheme for sequence strings. After such tokens are indexed for all the sequences in the database, sequences can be searched with information retrieval algorithms. Using this new method, we have developed a protein sequence search system named as ProSeS (PROtein Sequence Search). ProSeS is a protein sequence analysis system which provides overall analysis results such as similar sequences with significant homologies, predicted subcellular locations of the query sequence, and major keywords extracted from annotations of similar sequences. We show experimentally that the N-gram indexing approach saves the retrieval time significantly, and that it is as accurate as current popular search tool BLAST.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.230-236
• /
• 2012

Based on the known binary sequence sets and Gray mapping, a new method for constructing quaternary sequence sets is presented and the resulting sequence sets' properties are investigated. As three direct applications of the proposed method, when we choose the binary aperiodic, periodic, and Z-complementary sequence sets as the known binary sequence sets, the resultant quaternary sequence sets are the quaternary aperiodic, periodic, and Z-complementary sequence sets, respectively. In comparison with themethod proposed by Jang et al., the new method can cope with either both the aperiodic and periodic cases or both even and odd lengths of sub-sequences, whereas the former is only fit for the periodic case with even length of sub-sequences. As a consequence, by both our and Jang et al.'s methods, an arbitrary binary aperiodic, periodic, or Z-complementary sequence set can be transformed into a quaternary one no matter its length of sub-sequences is odd or even. Finally, a table on the existing quaternary periodic complementary sequence sets is given as well.

• Journal of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.281-294
• /
• 1998

In this paper, we extend the G-sequence of a CW-pair to the G-sequence of a map and show the existence of a map with nonexact G-sequence. We also give an example of a finite CW-pair with nontrivial $\omega$-homology in high order.