• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.5
• /
• pp.409-415
• /
• 2013

In this paper, we propose a correlation function using newly designed local signals for cosine-phased binary offset carrier (BOC) signal tracking. First, we divide a sub-carrier pulse over one pseudo random noise code period into multiple rectangular pulses, and subsequently, design novel local signals. Then, we obtain a correlation function with no side-peak based on a combination of correlations between the newly generated local signals and received cosine-phased BOC signal. 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.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.388-389
• /
• 2008

이중 이진 (double binary) 터보 디코더는 오류 정정 코드 중 하나로써, 높은 오류 정정 성능으로 인해 IEEE 802.16 표준 (WiMAX)에서 사용되고 있다. Maximum ${\alpha}$ posteriori probability (MAP) 디코딩 블록은 이중 이진 터보 디코더의 가장 핵심적인 블록으로, 본 논문은 이를 구현하기 위한 알고리즘 중 하나인 improved Max-Log-MAP 알고리즘에 대한 효율적인 하드웨어 구조를 제안한다. 제안하는 하드웨어 구조는 기존의 하드웨어 구조와 비교하였을 때, 오류 정정 성능은 동일만 반면, 구떤 복잡도는 감소한다. 0.13um 공정에서 입력 비트폭을 8비트로 가정하고 시뮬레이션 한 결과, 속도와 칩 면적, 그리고 소비전력 측면에서 각각 8.92%, 1845%, 그리고 29.93%의 향상을 보인다. 제안하는 구조를 WIMAX 설계에 적용하여 성능 개선을 이끌어낼 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1126-1139
• /
• 1994

This paper proposes an effective recognition system which recognizes the mixed document consisting of handwritten korean/alphanumeric texts and graphic images. In the preprocessing step, an input image is binarized by the proposed thresholding scheme, then graphic and character regions are separated by using connected components and chain codes. Separated Korean characters are merged based on partial recognition and their character types and sized. In the character recognition step, we use the branch and bound algorithm based on DP matching costs to recognize Korean characters. Also we recognize alphanumeric characters using several robust features. Finally we use a dictionary and information of a recognition step to correct wrong recognition results. Computer simulation with several test documents shows what the proposed algorithm recognized effectively handwritten mixed texts.

• Journal of KIISE:Software and Applications
• /
• v.35 no.11
• /
• pp.661-670
• /
• 2008

In some applications of software engineering such as the verification of software model or embedded program, SAT solver is used. To practical use a SAT solver, a problem is encoded to a CNF formula, but because the formula has lower expressiveness than software models or source codes, optimal CNF encoding is required. In this paper, we propose optimal encoding techniques for the problem of "Selecting adjacent $k{\leq}n$ among n objects," Through experimental results we show the proposed constraint is efficient and correct to solve Japanese puzzle. As we know, this paper is the first study about CNF encoding for adjacency in BCC.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.6
• /
• pp.215-218
• /
• 2014

In hashing-based methods for approximate nearest neighbors(ANN) search, by mapping data points to k-bit binary codes, nearest neighbors are searched in a binary embedding space. In this paper, we present a hashing method using a PCA-based clustering method, Principal Direction Divisive Partitioning(PDDP). PDDP is a clustering method which repeatedly partitions the cluster with the largest variance into two clusters by using the first principal direction. The proposed hashing method utilizes the first principal direction as a projective direction for binary coding. Experimental results demonstrate that the proposed method is competitive compared with other hashing methods.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.526-535
• /
• 2005

우리나라의 주민등록증은 주소지, 주민등록 변호, 얼굴사진, 지문 등 개개인의 방대한 정보를 가진다. 현재의 플라스틱 주민등록증은 위조 및 변조가 쉽고 날로 전문화 되어가고 있다. 따라서 육안으로 위조 및 변조 사실을 쉽게 확인하기가 어려워 사회적으로 많은 문제를 일으키고 있다. 이에 본 논문에서는 주민등록증 영상을 자동 인식할 수 있는 개선된 ART2 기반 RBF 네트워크와 얼굴인증을 이용한 주민등록증 자동 인식 방법을 제안한다. 제안된 방법은 주민등록증 영상에서 주민등록번호와 발행일을 추출하기 위하여 영상을 소벨마스크와 미디언 필터링을 적용한 후에 수평 스미어링을 적용하여 주민등록번호와 발행일 영역을 검출한다. 그리고 4 방향 윤곽선 추적 알고리즘으로 개별 문자를 추출하기 위한 전 단계로 주민등록증 영상에 대해 고주파 필터링을 적용하여 주민등록증 영상 전체를 이진화 한다. 이진화된 주민등록영상에서 COM 마스크를 적용하여 주민등록번호와 발행일 코드를 복원하고 검출된 각 영역에 대해 4 방향 윤곽선 추적 알고리즘으로 개별 문자를 추출한다. 추출된 개별 문자는 개선된 ART2 기반 RBF 네트워크를 제안하여 인식에 적용한다. 제안된 ART2 기반 RBF 네트워크는 학습 성능을 개선하기 위하여 중간충과 출력층의 학습에 퍼지 제어 기법을 적용하여 학습률을 동적으로 조정한다. 얼굴인증은 템플릿 매칭 알고리즘을 이용하여 얼굴 템플릿 데이터베이스를 구축하고 주민등록증애서 추출된 얼굴영역과의 유사도를 측정하여 주민등록증 얼굴 영역의 위조여부를 판별한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.73-86
• /
• 2009

This paper proposes a new data hiding scheme for binary image authentication with minimizing the distortion of host image. Based on the Hamming-Code-Based data embedding algorithm, the proposed scheme makes it possible to embed authentication information into host image with only flipping small number of pixels. To minimize visual distortion, the proposed scheme only modifies the values of the flippable pixels that are selected based on Yang et al's flippablity criteria. In addition to this, by randomly shuffling the bit-order of the authentication information to be embedded, only the designated receiver, who has the secret key that was used for data embedding, can extract the embedded data. To show the superiority of the proposed scheme, the two measurement metrics, the miss detection rate and the number of flipped pixels by data embedding, are used for the comparison analysis between the proposed scheme and the previous schemes. As a result of analysis, it has been shown that the proposed scheme flips smaller number of pixels than the previous schemes to embed the authentication information of the same bit-length. Moreover, it has been shown that the proposed scheme causes smaller visual distortion and more resilient against recent steg-analysis attacks than the previous schemes by the experimental results.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.1
• /
• pp.77-82
• /
• 2004

In this paper we present a barcode reader to decode two-dimensional symbology PDF417 and propose a novel method to extract the bar-space Patterns directly from the gray-level barcode image, which employs the location and the distance between extreme points of each row or column of the barcode image. This algerian proves to be very robust from the high convolutional distortion environments such as defocussing and warping, even under badly illuminating condition. If the scanned barcode image is a result of the convolution of a Gaussian-shaped point spread function with a hi-level image, popular image segmentation methods such as image thresholding can not distinguish between very narrow bar-space patterns. The Proposed algorithm shows improved Performance over current barcode readers.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.11
• /
• pp.61-66
• /
• 2005

This paper describes a 10-bit 210MHz CMOS current-mode Digital-to-Analog Converter (DAC) consisting of 6 bit MSB current cell matrix Sub-DAC, 2 bit mSB unary current source Sub-DAC, and 2 bit LSB binary weighting Sub-DAC for Wireless LAN application. A new deglitch circuit is proposed to control a crossing point of signals and minimize a glitch energy. The proposed 10-bit CMOS current mode DAC was designed by a $0.35{\mu}m$ CMOS double-poly four-metal technology rate of 210MHz, DNL/INL of ${\pm}0.7LSB/{\pm}1.1LSB$, a glitch energy of $76pV{\cdot}sec$, a SNR of 50dB, a SFDR of 53dB at 200MHz sampling clock and power dissipation of 83mW at 3.3V

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.1008-1012
• /
• 2009

Obfuscation is known as one of the most effective methods to protect software against malicious reverse engineering transforming the software into more complicated one with still preserving the original semantic. However, obfuscating a program can increase both code size of the program and execution time compared to the original program. In mobile devices, the increases of code size and execution time incur the waste of resources including the increase of power consumption. This paper has analyzed the effectiveness of some high-level obfuscation algorithms as well as their power consumption with implementing them under an embedded board equipped with ARM processor. The analysis results show that there is (are) an efficient obfuscation method(s) in terms of execution time or power consumption according to characteristics of a given program.