• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.10
• /
• pp.1020-1023
• /
• 2011

In this paper, we present a symbol remapping method of BRGC M-ary QAM signal by using LLR soft bit decision information which is obtained after iterative decoding process. In order to reconstruct estimated transmitted signal constellation, we have to use exponential or hyperbolic tangent(tanh) function resulting in high implementation complexity. The BRGC mapping rule enables us to use a recursive operation. In addtion, we reduce the implementing complexity by using a curve fitting algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.5
• /
• pp.2272-2278
• /
• 2011

It is essential to various evaluate about statistic character of the signal and additional noise for optimization of the optical communication system. We expressed various error probability with the m which was bandwidth and a bit numerical function and carried out performance evaluation of a PIN receiver. This research analyzed the receiving sensitivity of the PIN receiver and verified reception sensitivity through computer simulation in the optical communication system. As a result, the receiving sensitivity for PIN receiver are $9.2{\times}10^4$ photon/bit for given error probability.

• Convergence Security Journal
• /
• v.14 no.7
• /
• pp.9-15
• /
• 2014

In this paper, we proposed a new LDP code to solve a previous LDP code's problem and can include a face-color information. To include the face-color information, we developed various methods reducing the existing LDP code and analyzed the results. A new LDP code is represented by 6-bits different from the previous LDP code To adapt to a noise and environmental changes effectively and include 2-bits face-color information. The result shows better recognition rates of face and facial-expression than the existing methods effectively.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.31-39
• /
• 1990

An optimization problem of AND-EXOR PLA's with input decoders can be regarded as a minimization problem of Exclusive-Or Sum-Of-Products expressions (ESOP's) for multiple-valued input two-valued output functions. In this paper, We propose a minimization algorithm for ESOP's. The algorithm is based on an iterative improvement. Five rules are used to replace a pair of products with another one. We minimized many ESOP's for arithmetic circuits. In most cases, ESOP's required fewer products than SOP's to realized same functions.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.732-735
• /
• 2008

In order for fast calculation for the modular multiplication which plays an essential role in RSA cryptography algorithm, the Montgomery algorithm has been studed and developed in varous ways. Since there is no division operation in the algorithm, it is able to perform a fast modular multiplication. However, the Montgomery algorithm requires a few extra operations in the progress of which transformation from/to ordinary modular form to/from Montgomery form should be made. Concept of high radix operation can be considered by splitting the key size into word-defined units in the RSA cryptosystems which use longer than 1024 key bits. In this paper, We adopted the concept of operand scanning methods to enhance the traditional Montgomery algorithm. The methods consider issues of optimization, memory usage, and calculation time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.100-109
• /
• 2003

A differential index assignment scheme is proposed for the image encoding system in which a variable-length tree-structured vector quantizer is adopted. Each source vector is quantized into a terminal node of VLTSVQ and each terminal node is represented as a unique binary vector. The proposed index assignment scheme utilizes the correlation between interblocks of the image to increase the compression ratio with the image quality maintained. Simulation results show that the proposed scheme achieves a much higher compression ratio than the conventional one does and that the amount of the bit rate reduction of the proposed scheme becomes large as the correlation of the image becomes large. The proposed encoding scheme can be effectively used to encode R images whose pixel values we, in general, highly correlated with those of the neighbor pixels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.469-475
• /
• 2009

Overlap is one of the techniques for increasing bit rate in chirp spread spectrum (CSS). More overlaps can offer higher data throughput; however, they may cause more intersymbol interference (ISI) at the same time, resulting in serious bit error rate (BER) performance degradation. Thus, the number of overlaps should be decided according to the required BER performance. In this paper, we derive a closed form expression for BER of the overlap-based CSS system, exploiting the approximated Gaussian Q function. The derived BER expression includes the number of overlaps as a parameter, and thus, would be very useful in determining the number of overlaps for a specified BER. The numerical results demonstrate that the BER derived in a closed form closely agrees with the simulated BER.

• Convergence Security Journal
• /
• v.14 no.5
• /
• pp.17-24
• /
• 2014

This study proposed LDP (Local Directional Pattern) as a new local micro pattern for facial expression recognition to solve noise sensitive problem of LBP (Local Binary Pattern). The proposed method extracts 8-directional components using $m{\times}m$ mask to solve LBP's problem and choose biggest k components, each chosen component marked with 1 as a bit, otherwise 0. Finally, generates a pattern code with bit sequence as 8-directional components. The result shows better performance of rotation and noise adaptation. Also, a new local facial feature can be developed to present both PFF (permanent Facial Feature) and TFF (Transient Facial Feature) based on the proposed method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.6
• /
• pp.123-133
• /
• 2017

In this paper, we developed an optimal flicker-free control algorithm operating within 16 luminance implementation bits and 512 brightness implementation pulses irrespective of LPM(LED Pixel Matrix) module configuration on dynamic driving method of LED display system. As an implementation method, we turned the refresh rate up by increasing the number of scans through multiple shift-latches which were devised from conventional shift-latch scheme for full color representation. As a result, the LED display system of this method has no flicker phenomenon because of the novel refresh rate higher than 2,040[Hz] incomparable to 240~480[Hz] of conventional system.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.362-371
• /
• 2005

Similarity indexing and searching are well known to be difficult in high-dimensional applications such as multimedia databases. Especially, they become more difficult when multiple features have to be indexed together. In this paper, we propose a novel indexing method called the GB-index that is designed to efficiently handle complex similarity queries as well as relevance feedback in high-dimensional image databases. In order to provide the flexibility in controlling multiple features and query objects, the GB-index treats each dimension independently The efficiency of the GB-index is realized by specialized bitmap indexing that represents all objects in a database as a set of bitmaps. Main contributions of the GB-index are three-fold: (1) It provides a novel way to index high-dimensional data; (2) It efficiently handles complex similarity queries; and (3) Disjunctive queries driven by relevance feedback are efficiently treated. Empirical results demonstrate that the GB-index achieves great speedups over the sequential scan and the VA-file.