• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7C
• /
• pp.459-466
• /
• 2011

This paper addresses the problem in the acquisition of binary offset carrier (BOC) signals employed in global navigation satellite systems, which is caused by the multiple side-peaks of the BOC autocorrelation function. We first observe that the side-peaks arise due to the fact that the BOC autocorrelation is made up of the sum of the sub-correlations shaped irregularly, and then, propose a novel acquisition scheme based on a recombination of the sub-correlations with cyclostationarity. The proposed scheme is demonstrated to remove the side-peaks completely for any type of BOC signal and to provide a performance improvement over the conventional schemes in terms of the mean acquisition time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5C
• /
• pp.437-443
• /
• 2012

In this paper, we propose a novel unambiguous correlation function for binary offset carrier (BOC) signal acquisition. Specifically, we first find out that the side-peaks arise due to the fact that the BOC autocorrelation is the sum of the irregularly shaped BOC sub-correlations, and then, propose an unambiguous correlation function with no side-peak by combining the sub-correlations. The proposed scheme is shown to remove the side-peaks completely for any type of BOC signal and to provide a better acquisition performance than the conventional correlation functions.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2726-2728
• /
• 2001

This paper describes an optimal synthesis method of binary neural network(BNN) for an approximation problem of a circular region using a newly proposed learning algorithm[7] Our object is to minimize the number of connections and neurons in hidden layer by using a Newly Expanded and Truncated Learning Algorithm(NETLA) for the multilayer BNN. The synthesis method in the NETLA is based on the extension principle of Expanded and Truncated Learning(ETL) and is based on Expanded Sum of Product (ESP) as one of the boolean expression techniques. And it has an ability to optimize the given BNN in the binary space without any iterative training as the conventional Error Back Propagation(EBP) algorithm[6] If all the true and false patterns are only given, the connection weights and the threshold values can be immediately determined by an optimal synthesis method of the NETLA without any tedious learning. Futhermore, the number of the required neurons in hidden layer can be reduced and the fast learning of BNN can be realized. The superiority of this NETLA to other algorithms was proved by the approximation problem of one circular region.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.73-79
• /
• 2009

In this paper, a method is proposed that enhances the performance of the facial expression recognition using template matching of Local Binary Pattern(LBP) histogram. In this method, the face image is segmented into blocks, and the LBP histogram is constructed to be used as the feature of the block. Block dissimilarity is calculated between a block of input image and the corresponding block of the model image. Image dissimilarity is defined as the weighted sum of the block dissimilarities. In conventional methods, the block weights are assigned by intuition. In this paper a new method is proposed that optimizes the weights from training samples. An experiment shows the recognition rate is enhanced by the proposed method.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.227-230
• /
• 2003

We can not distinguish semantism of the feature of the current language “big”, “small”, “beautiful”. But we study artificial linguistic interface work and convert natural language to digital binary linguistic theory, we should define the basical conversion process. When we utilize the sum of product fuzzy theory and the visible numerical value, we can establish reasoning rule of input language. Fuzzy theory should be converted to general resulting rule.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.1-12
• /
• 1992

Parallel Genetic Algorithms (GAs) are developed to solve a single machine n-job scheduling problem which is to minimize the sum of absolute deviations of completion times from a common due date. (0, 1) binary scheme is employed to represent the n-job schedule. Two selection methods, best individual selection and simple selection are examined. The effect of crossover operator, due date adjustment mutation and due date adjustment reordering are discussed. The performance of the parallel genetic algorithm is illustrated with some example problems.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.3
• /
• pp.529-572
• /
• 2012

A basis of a subspace of $S_4({\Gamma}_0(79))$ is given and the formulas for the number of representations of positive integers by some direct sums of the quadratic forms $x^2_1+x_1x_2+20x^2_2$, $4x^2_1{\pm}x_1x_2+5x^2_2$, $2x^2_1{\pm}x_1x_2+10x^2_2$ are determined.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3C
• /
• pp.256-262
• /
• 2002

This paper presents a novel radix-4 modular multiplication algorithm based on the sign estimation technique (3). The sign estimation technique detects the sign of a number represented in the form of a carry-sum pair. It can be implemented with 5-bit carry look-ahead adder. The hardware speed of the cryptosystem is dependent on the performance modular multiplication of large numbers. Our algorithm requires only (n/2+3) clock cycle for n bit modulus in performing modular multiplication. Our algorithm out-performs existing algorithm in terms of required clock cycles by a half, It is efficient for modular exponentiation with large modulus used in RSA cryptosystem. Also, we use high-speed adder (7) instead of CPA (Carry Propagation Adder) for modular multiplication hardware performance in fecal stage of CSA (Carry Save Adder) output. We apply RL (Right-and-Left) binary method for modular exponentiation because the number of clock cycles required to complete the modular exponentiation takes n cycles. Thus, One 1024-bit RSA operation can be done after n(n/2+3) clock cycles.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.7
• /
• pp.552-558
• /
• 2014

In this paper, we propose a side-peak cancellation technique of composite binary offset carrier (CBOC) signals for e-navigation. First, we divide a CBOC sub-carrier into several sub-carrier pulses, and then, observe that CBOC autocorrelation is the sum of multiple sub-correlation functions. Finally, we propose a novel correlation function with no side-peak and a sharp main-peak by combining the sub-correlation functions to improve the positioning accuracy. From numerical results, we confirm that the proposed correlation function with a sharp main-peak provides a better positioning performance than the conventional correlation functions in terms of the tracking error standard deviation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1433-1440
• /
• 2015

In this paper, we propose an unambiguous correlation function to improve tracking performance for binary offset carrier (BOC) signals. Specifically, we divide a BOC sub-carrier into multiple rectangular pulses, and analyze that the BOC autocorrelation function is made up of the sum of several partial correlation functions. Then, we obtain two sub-correlation functions by combining two partial correlation functions and propose a novel unambiguous correlation function with no side-peak which can be regulated its width based on the combination of the sub-correlation functions and partial correlation functions. From numerical results, it is confirmed that the proposed correlation function provides a tracking performance improvement over the conventional correlation functions in terms of the tracking error standard deviation.