• 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 < 2^n-1\}$, where $gcd(r,2^m-1)=1$ with 5-valued cross-correlation.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.567-570
• /
• 2000

A design method of nonlinear feedback shift registers that can produce maximal-period sequences is given. Such a design is based on one-to-one mappings which are similar to well-known chaotic maps. Some properties of generated binary sequences are investigated and discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1A
• /
• pp.42-50
• /
• 2002

In this paper, for a prime number p, a construction method to genarate p-ary d-from sequences with ideal autocorrelation property is proposed and using the ternary sequences with ideal autocorrelation found by Helleseth, Kumar and Martinsen, ternary d-form sequences with ideal autocorrelation introduced. By combining the methods for generation the p-ary extended sequence (a special case of geometric sequences) and the p-ary d-from sequences, a construction method of p-ary unified (extended d-form) sequences which also have ideal autocorrelation property is proposed, which is very general class of p-ary sequences including the binary and nonbinary extended sequences and d-form seuqences. Form the ternary sequences with ideal autocorrelation by Helleseth, Kumar and Martinesen, ternary unified sequences with ideal autocorrelation property are also generated.

• ETRI Journal
• /
• v.32 no.5
• /
• pp.676-686
• /
• 2010

Mining sequential patterns is an important research issue in data mining and knowledge discovery with broad applications. However, the existing sequential pattern mining approaches consider only binary frequency values of items in sequences and equal importance/significance values of distinct items. Therefore, they are not applicable to actually represent many real-world scenarios. In this paper, we propose a novel framework for mining high-utility sequential patterns for more real-life applicable information extraction from sequence databases with non-binary frequency values of items in sequences and different importance/significance values for distinct items. Moreover, for mining high-utility sequential patterns, we propose two new algorithms: UtilityLevel is a high-utility sequential pattern mining with a level-wise candidate generation approach, and UtilitySpan is a high-utility sequential pattern mining with a pattern growth approach. Extensive performance analyses show that our algorithms are very efficient and scalable for mining high-utility sequential patterns.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.226-233
• /
• 2007

In this paper, we construct new LCZ sequence sets with parameters $(2^{n+1}-2,M,L,2)$. In this scheme, we can relatively freely choose the LCZ length L and the resulting LCZ sequence set has the size in which is nearly optimal with respect to Tang, Fan, and Matsufuji bound.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.313-319
• /
• 2005

In this paper, we propose a class of polyphase signature sequences, whose general odd correlation properties are useful for 4-phase signaling systems. The performance of the direct sequence code division multiple access (DS/CDMA) systems using the proposed sequences is compared with that using binary pseudo-noise sequences. The performance of the system using the proposed sequence is shown to be better than that using other conventional sequences both from the worst-case analysis and bit error rate simulations.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.2019-2022
• /
• 2002

This paper presents design of spreading codes for asynchronous DS-CDMA systems. We have been trying to generate maximal-period sequences based on one-dimensional maps with finite bits whose shapes are similar to piecewise linear chaotic maps. We propose an efficient search algorithm finding such mammal-period sequences. This algorithm makes it possible to find many kinds of maximal-period sequences with sufficiently long period for CDMA applications. We also investigate bit error rate(BER) in asynchronous DS-CDMA systems using the maximal-period binary sequences by computer simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.3
• /
• pp.532-543
• /
• 2003

In this paper, we proposed structure of a reversible discrete-time cellular neural network (DTCNN) for labeling digital images to protect copylight. First, we present the concept and the structure of reversible DTCNN, which can be used to generate 2D binary pseudo-random images sequences. We presented some, output examples of different kinds of reversible DTCNNs to show their complex behaviors. Then both the original image and the copyright label, which is often another binary image, are used to generate a binary random key image. The key image is then used to scramble the original image. Since the reversibility of a reversible DTCNN, the same reversible DTCNN can recover the copyright label from a labeled image. Due to the high speed of a DTCNN chip, our method can be used to label image sequences, e.g., video sequences, in real time. Computer simulation results are presented.

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

• Journal of Information Processing Systems
• /
• v.20 no.4
• /
• pp.432-441
• /
• 2024

To improve the security of gene information and the accuracy of matching, this paper designs a homomorphic encryption algorithm for gene matching based on cloud computing environment. Firstly, the gene sequences of cloud files entered by users are collected, which are converted into binary code by binary function, so that the encrypted text is obviously different from the original text. After that, the binary code of genes in the database is compared with the generated code to complete gene matching. Experimental analysis indicates that when the number of fragments in a 1 GB gene file is 65, the minimum encryption time of the algorithm is 80.13 ms. Aside from that, the gene matching time and energy consumption of this algorithm are the least, which are 85.69 ms and 237.89 J, respectively.