• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.640-654
• /
• 1996

This paper presents a synthesis method for multi-level Reed-Muller circuits using BDDs(Binary Decision Diagrams). The existing synthesis tool for Reed circuits, FACTOR, is not appropriate to the synthesis of large circuits because it uses matrix (map-type) to represent given logic functions, resulting in the exponential time and space in number of imput to the circuits. For solving this problems, a syntheisis method based on BDD is presented. Using BDDs, logic functions are represented compactly. Therefor storage spaces and computing time for synthesizing logic functions were greatly decreased, and this technique can be easily applied to large circuits. Using BDD representations, the proposed method extract best patterns to minimize multi-level Reed Muller circuits with good performance in area optimization and testability. Experimental results using the proposed method show better performance than those using previous methods〔2〕. For large circuits of considering the best input partition, synthesis results have been improved.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.614-621
• /
• 2011

This paper presents design of a wide tuning range digitally controlled oscillator(DCO) for Mobile-DTV applications. DCO is the key element of the ADPLL block that generates oscillation frequencies. We proposed a binary delay chain(BDC) structure, for wide tuning range DCO, modifying conventional fixed delay chain. The proposed structure generates oscillation frequencies by delay cell combination which has a variable delay time of $2^i$ in the range of $0{\leq}i{\leq}n-1$. The BOC structure can reduce the number of delay cells because it make possible to select delay cell and resolution. We simulated the proposed DCO by Cadence's Spectre RF tool in 1.8V chartered $0.18{\mu}m$ CMOS process. The simulation results showed 77MHz~2.07GHz frequency range and 3ps resolution. The phase noise yields -101dBc/Hz@1MHz at Mobile-DTV maximum frequency 1675MHz and the power consumption is 5.87mW. The proposed DCO satisfies Mobile-DTV standards such as ATSC-M/H, DVB-H, ISDB-T, T-DMB.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2698-2717
• /
• 2019

This paper proposes a multi-stage encryption technique to enhance the level of secrecy of image to facilitate its secured transmission through the public network. A great number of researches have been done on image secrecy. The existing image encryption techniques like visual cryptography (VC), steganography, watermarking etc. while are applied individually, usually they cannot provide unbreakable secrecy. In this paper, through combining several separate techniques, a hybrid multi-stage encryption technique is proposed which provides nearly unbreakable image secrecy, while the encryption/decryption time remains almost the same of the exiting techniques. The technique consecutively exploits VC, steganography and one time pad (OTP). At first it encrypts the input image using VC, i.e., splits the pixels of the input image into multiple shares to make it unpredictable. Then after the pixel to binary conversion within each share, the exploitation of steganography detects the least significant bits (LSBs) from each chunk within each share. At last, OTP encryption technique is applied on LSBs along with randomly generated OTP secret key to generate the ultimate cipher image. Besides, prior to sending the OTP key to the receiver, first it is converted from binary to integer and then an asymmetric cryptosystem is applied to encrypt it and thereby the key is delivered securely. Finally, the outcome, the time requirement of encryption and decryption, the security and statistical analyses of the proposed technique are evaluated and compared with existing techniques.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.45-48
• /
• 2019

Detection of crosswalk is an important issue for the blind to walk without the help of others. There is a braille block on the sidewalk, which helps the blind to walk. On the other hand, crosswalk is more dangerous due to the moving vehicles. However, there is no appropriate means to induce the blind. In this paper, we propose a method to detect crosswalk in front of a blind and estimate its direction using an image sensor. We adopt multi-ROIs and make their binary versions. In order to determine whether it is a crosswalk, two features are extracted; one is the number of crossing in the binary image and the other is the ratio of white area. We can also estimate the direction of the crosswalk through the slope of the projection data. We evaluated the performance using experimental dataset and the proposed algorithm showed 80% accuracy of detection.

• Asian-Australasian Journal of Animal Sciences
• /
• v.32 no.7
• /
• pp.966-976
• /
• 2019

Objective: The methane mitigating potential of various plant-based polyphenol sources is known, but effects of combinations have rarely been tested. The aim of the present study was to determine whether binary and 3-way combinations of such phenol sources affect ruminal fermentation less, similar or more intensively than separate applications. Methods: The extracts used were from Acacia mearnsii bark (acacia), Vitis vinifera (grape) seed, Camellia sinensis leaves (green tea), Uncaria gambir leaves (gambier), Vaccinium macrocarpon berries (cranberry), Fagopyrum esculentum seed (buckwheat), and Ginkgo biloba leaves (ginkgo). All extracts were tested using the Hohenheim gas test. This was done alone at 5% of dry matter (DM). Acacia was also combined with all other single extracts at 5% of DM each, and with two other phenol sources (all possible combinations) at 2.5%+2.5% of DM. Results: Methane formation was reduced by 7% to 9% by acacia, grape seed and green tea and, in addition, by most extract combinations with acacia. Grape seed and green tea alone and in combination with acacia also reduced methane proportion of total gas to the same degree. The extracts of buckwheat and gingko were poor in phenols and promoted ruminal fermentation. All treatments except green tea alone lowered ammonia concentration by up to 23%, and the binary combinations were more effective as acacia alone. With three extracts, linear effects were found with total gas and methane formation, while with ammonia and other traits linear effects were rare. Conclusion: The study identified methane and ammonia mitigating potential of various phenolic plant extracts and showed a number of additive and some non-linear effects of combinations of extracts. Further studies, especially in live animals, should concentrate on combinations of extracts from grape seed, green tea leaves Land acacia bark and determine the ideal dosages of such combinations for the purpose of methane mitigation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.6
• /
• pp.1013-1021
• /
• 2020

Malware Authorship Attribution is a research field for identifying malware by comparing the author characteristics of unknown malware with the characteristics of known malware authors. The authorship attribution method using binaries has the advantage that it is easy to collect and analyze targeted malicious codes, but the scope of using features is limited compared to the method using source code. This limitation has the disadvantage that accuracy decreases for a large number of authors. This study proposes a method of 'Defining semantic features from binaries' and 'Defining allowable ranges for redundant features using the concept of survival network' to complement the limitations in the identification of binary authors. The proposed method defines Opcode-based graph features from binary information, and defines the allowable range for selecting unique features for each author using the concept of a survival network. Through this, it was possible to define the feature definition and feature selection method for each author as a single technology, and through the experiment, it was confirmed that it was possible to derive the same level of accuracy as the source code-based analysis with an improvement of 5.0% accuracy compared to the previous study.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.3
• /
• pp.398-404
• /
• 2020

In this paper, we propose a new design method of signal constellation of the spiral quadrature amplitude modulation (QAM) exploiting a modified gradient descent search algorithm and its binary mapping rule. Unlike the conventional method, the new method, which uses and the constellation optimization algorithm and the maximum number of iterations as a parameter for the iterative design, is more robust to phase noise. And the proposed binary mapping rule significantly reduces the average Hamming distance of the spiral constellation. As a result, the proposed spiral QAM constellation has much improved error performance compared to the conventional ones even in a very severe phase noise environment. It is, therefore, considered that the proposed QAM may be a useful modulation format for coherent optical communication systems and orthogonal frequency division multiplexing (OFDM) systems.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.6
• /
• pp.492-505
• /
• 2022

This study is a study on the results of improving the logic to effectively transmit and decode compressed data in real time by improving the encoding and decoding performance of BL-beta codes that can be used for lossless real-time transmission of IoT sensing data. The encoding process of BL-beta code includes log function, exponential function, division and square root operation, etc., which have relatively high computational burden. To improve them, using bit operation, binary number pattern analysis, and initial value setting of Newton-Raphson method using bit pattern, a new regularity that can quickly encode and decode data into BL-beta code was discovered, and by applying this, the encoding speed of the algorithm was improved by an average of 24.8% and the decoding speed by an average of 5.3% compared to previous study.

• Journal of Internet of Things and Convergence
• /
• v.8 no.1
• /
• pp.79-85
• /
• 2022

Internet of Things (IoT) connects devices with various platforms, computing power, and functions. Due to the diversity of networks and the ubiquity of IoT devices, demands for security and privacy are increasing. Therefore, cryptographic mechanisms must be strong enough to meet these increased requirements, while at the same time effective enough to be implemented in devices with long-range specifications. In this paper, we present the performance and memory limitations of modern cryptographic primitives and schemes for different types of devices that can be used in IoT. In addition, detailed performance evaluation of the performance of the most commonly used encryption algorithms in low-spec devices frequently used in IoT networks is performed. To provide data protection, the binary ring uses encryption asymmetric fully homomorphic encryption and symmetric encryption AES 128-bit. As a result of the experiment, it can be seen that the IoT device had sufficient performance to implement a symmetric encryption, but the performance deteriorated in the asymmetric encryption implementation.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.629-640
• /
• 2000

this paper present an efficient line-drawing algorithm that reduces the amount of space required, Because of its efficiency , this line-drawing algorithm is faster than the Bresenham algorithm or the recursive bisection method. this efficiency was achieved through a new data structure; namely , the modified segment tree (MST). Using the modified segment tree and the distribution rule suggested in this paper, we dra lines without generating the recursive calls used in [3] and without creating the binary operation used in [4]. we also show that line accuracy improves in proportion to the display resolution . In practice, we can significantly improve the algorithm's performance with respect to time and space, This improvement offer an increase in speed, specially with lines at or near horizontal, diagonal. or vertical ; that is, this algorithm requires the time complexity of (n) and the space complexity O(2k+1), where n is the number of pixels and k is a level of the modified segment tree.