• Journal of KIISE
• /
• v.43 no.1
• /
• pp.34-39
• /
• 2016

JavaScript is widely used in web pages with HTML. Many JavaScript engines adopt Just-in-time compilers to accelerate the execution of JavaScript programs. Recently, many newly introduced devices are adopting 64-bit CPUs instead of 32-bit and Just-in-time compilers for 64-bit CPU are slowly being introduced in JavaScript engines. However, there are many inefficiencies in the currently available Just-in-time compilers for 64-bit devices. Especially, the size of code is significantly increased compared to 32-bit devices, mainly due to 64-bit wide addresses in 64-bit devices. In this paper, we are going to address the inefficiencies introduced by 64-bit wide addresses and values in the Just-in-time compiler for the V8 JavaScript engine and propose more efficient ways of generating constant values and addresses to reduce the size of code. We implemented the proposed optimization in the V8 JavaScript engine and measured the size of code as well as performance improvements with Octane and SunSpider benchmarks. We observed a 3.6% performance gain and 0.7% code size reduction in Octane and a 0.32% performance gain and 2.8% code size reduction in SunSpider.

• The Optical Journal
• /
• s.149
• /
• pp.11-13
• /
• 2014

우리 협회가 지난 12월 9일 부터 사흘간 'CODE V 및 LightTools를 이용한 광학설계 실습 세미나'를 개최했다. 서울 사당동 소재 한국직업전문학교에서 진행된 이번 세미나는 세코닉스, 해성옵틱스, 디지탈옵틱, 삼양옵틱스 등의 회원사는 물론 삼성디스플레이, 현대모비스, 캐논코리아비즈니스솔루션, LG전자, 카이스트, 광운대학교 등에서 총 30명의 연구원, 학생 등이 수강한 가운데 진행됐다.

• The Optical Journal
• /
• s.128
• /
• pp.36-37
• /
• 2010

광학설계 프로그램 전문업체인 (주)모던하이테크(대표 김영중, www.okmodern.com)는 지난 5월 10일부터 11일까지 양일간 서울 교육문화회관에서 '2010 LED핵심조명기술 및 CODE V & LightTools 컨퍼런스를 개최했다. '광학인의 날'이라는 주제로 한국광학기기협회와 전자신문 등이 후원한 이 행사에는 130여명의 국내 광학인들 외에 미국 Optical Research Associates(이하 ORA)사의 CEO인 Mr.Goerge Baze를 비롯한 임원진들이 함께하여 직접 비전을 소개하고 향후 국내 유저들을 위해 적극적인 서비스 지원을 약속했다.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.900-908
• /
• 2021

This paper proposes thermometer-code latches having five and six transistors for unidirectional and bidirectional thermometer-code shift-registers, respectively. The proposed latches omit the set and reset transistors by changing from two supply voltage nodes to the set and reset signals in the cross-coupled inverter. They set or reset the data by changing the supply voltage to ground in either of two inverters. They reduce the number of transistors to five and six compared with the conventional thermometer-code latches having six and eight transistors, respectively. The proposed thermometer-code latches were simulated using a 65 nm complementary metal-oxide-semiconductor (CMOS) process. For comparison, the proposed and conventional latches are adapted to the 64 bit thermometer-code shift-registers. The proposed unidirectional and bidirectional shift-registers occupy 140 ㎛² and 197 ㎛², respectively. Their consumption powers are 4.6 ㎼ and 5.3 ㎼ at a 100 MHz clock frequency with the supply voltage of 1.2 V. They decrease the areas by 16% and 13% compared with the conventional thermometer-code shift-register.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.27-34
• /
• 2011

In this paper, it was presented a design on the dynamic multimedia fingerprinting code for anti-collusion code(ACC) in the protection of multimedia content. Multimedia fingerprinting code for the conventional ACC, is designed with a mathematical method to increase k to k+1 by transform from BIBD's an incidence matrix to a complement matrix. A codevector of the complement matrix is allowanced fingerprinting code to a user' authority and embedded into a content. In the proposed algorithm, the feature points were drawing from a content which user bought, with based on these to design the dynamical multimedia fingerprinting code. The candidate codes of ACC which satisfied BIBD's v and k+1 condition is registered in the codebook, and then a matrix is generated(Below that it calls "Rhee matrix") with ${\lambda}+1$ condition. In the experimental results, the codevector of Rhee matrix based on a feature point of the content is generated to exist k in the confidence interval at the significance level ($1-{\alpha}$). Euclidean distances between row and row and column and column each other of Rhee matrix is working out same k value as like the compliment matrices based on BIBD and Graph. Moreover, first row and column of Rhee matrix are an initial firing vector and to be a forensic mark of content protection. Because of the connection of the rest codevectors is reported in the codebook, when trace a colluded code, it isn't necessity to solve a correlation coefficient between original fingerprinting code and the colluded code but only search the codebook then a trace of the colluder is easy. Thus, the generated Rhee matrix in this paper has an excellent robustness and fidelity more than the mathematically generated matrix based on BIBD as ACC.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.55-58
• /
• 2004

This this paper, we propose vertical Bell laboratories layered space time (V-BLAST) system based on variable rate Low-Density Parity Check (LDPC) codes to improve performance of receiver when QR decomposition interference suppression combined with interference cancellation is used over independent Rayleigh fading channel. The different rate LDPC codes can be made by puncturing some rows of a given parity check matrix. This allows to implement a single encoder and decoder for different rate LDPC codes. The performance can be improved by assigning stronger LDPC codes in lower layer than upper layer because the poor SNR of first detected data streams makes error propagation. Keeping the same overall code rates, the V-BLAST system with different rate LDPC codes has the better performance (in terms of Bit Error Rate) than with constant rate LDPC code in fast fading channel.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.4
• /
• pp.194-200
• /
• 2012

In this paper we analyze the code sequence generating algorism defined on $GF(2^n)$ proposed by S.Bostas and V.Kumar[7] and derive the implementation functions of code sequence generator using Boolean functions which can map the vector space $F_2^n$ of all binary vectors of length n, to the finite field with two elements $F_2$. We find the code sequence generating boolean functions based on two kinds of the primitive polynomials of degree, n=5 and n=7 from trace function. We then design and implement the code sequence generators using these functions, and produce two code sequence groups. The two groups have the period 31 and 127 and the magnitudes of out of phase(${\tau}{\neq}0$) autocorrelation and crosscorrelation functions {-9, -1, 7} and {-17, -1, 15}, satisfying the period $L=2^n-1$ and the correlation functions $R_{ij}({\tau})=\{-2^{(n+1)/2}-1,-1,2^{(n+l)/2}-1\}$ respectively. Through these results, we confirm that the code sequence generators using boolean functions are designed and implemented correctly.

• Proceedings of the Korean Nuclear Society Conference
• /
• 2003.05a
• /
• pp.61.1-61.1
• /
• 2003

• Proceedings of the Korean Nuclear Society Conference
• /
• 2003.10a
• /
• pp.67.1-67.1
• /
• 2003

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.2
• /
• pp.35-40
• /
• 2019

In this paper, we propose a technique to reconstruct the iris image from the iris code by analyzing the process of generating the iris code and calculating it inversely. Iris recognition is an authentication method for authenticating an individual's identity by using iris information of an eye having unique information of an individual. The iris recognition extracts the features of the iris from the iris image, creates the iris code, and determines whether to authenticate using the corresponding code. The iris recognition method using the iris code is a method proposed by Daugman for the first time and is widely used as a representative method of iris recognition technology currently used commercially. In this paper, we restore the iris image with only the iris code, and test whether the reconstructed image and the original image can be recognized, and analyze restoration vulnerability of Daugman's iris code.