• Title/Summary/Keyword: Code size

Search Result 1,080, Processing Time 0.022 seconds

A Design of an Embedded Microprocessor with Variable Length Instruction Mode (가변길이 명령어 모드를 갖는 Embedded Microprocessor의 설계)

  • 박기현;오민석;이광엽;한진호;김영수;배영환;조한진
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.4
    • /
    • pp.83-90
    • /
    • 2004
  • In this paper, we proposed a new instruction set(X32Y ISA) with 3 different types of instruction mode. The proposed instruction set organizes 32-bit, 24-bit, 16-bit instruction in order to solves a problem of memory size limitation in an embedded microprocessor. We designed a 32-bit 5 stage pipeline RISC microprocessor based on the X32V ISA. To verify the proposed the X32V ISA and a microprocessor, we estimated a program code size of multimedia application programs using a X32V simulator. In result, we verified that the Light mode and the Ultra Light mode obtains 8%, 27% reduction of a program code size through comparison with the Default mode. The proposed microprocessor was verified all X32V instructions execution at Xilinx FPGA with 33MHz operating frequency,

Expanding Code Caches for Embedded Java Systems using Client Ahead-Of-Time Compilation (내장형 자바 시스템을 위한 클라이언트 선행 컴파일 기법을 이용한 코드 캐시 확장)

  • Hong, Sung-Hyun;Kim, Jin-Chul;Shin, Jin-Woo;Kwon, Jin-Woo;Lee, Joo-Hwan;Moon, Soo-Mook
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.8
    • /
    • pp.868-872
    • /
    • 2010
  • Many embedded Java systems are equipped with limited memory, which can constrain the code cache size provided for Java just-in-time compilation, affecting the Java performance. This paper proposes expanding the limited code cache when it is full, by saving the machine code for some methods in the code cache into the file system of the permanent storage and reloading it to the code cache when they are re-invoked later. This is applying the client ahead-of-time compilation during the execution time for the purpose of enlarging the code cache. Our experimental results indicate that the proposed execution method can improve the performance by as much as 1.6 times compared to the conventional method, when the code cache size is reduced by half.

A Sparse Code Motion Algorithm forlifetime and computational optimization (수명적, 계산적 최적화를 위한 희소코드모션 알고리즘)

  • Sim, Son-Kweon
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.9
    • /
    • pp.1079-1088
    • /
    • 2004
  • Generally, the code motion algorithm accomplishes the run-time optimal connected with the computational optimifation and the register overhead This paper proposes a sparse code motion, which considers the code size, in addition to computational optimization and lifetime optimization. The BCM algorithm carries out the optimal code motion computationally and the LCM algorithm reduces the register overhead in a sparse code motion algorithm. A sparse code motion algorithm is optimum algorithm computationally and lifetime because of suppression unnecessary code motion This algorithm improves runtime and efficiency of the program than the previous work through the performance test.

  • PDF

A Multiple-Disseminators Determining Mechanism for Fast Code Dissemination in Wireless Sensor Networks (무선 센서 네트워크에서 빠른 코드분배를 위한 다수분배자 선정 방법)

  • Kim, Mi-Hui;Hong, June-S.
    • Journal of Information Technology Services
    • /
    • v.10 no.2
    • /
    • pp.247-257
    • /
    • 2011
  • In this paper, we propose a multiple-disseminators determining mechanism for Efficient Code Dissemination with low-delay(ECoDi) for wireless sensor networks (WSN). Code dissemination is in the spotlight as an important research issue since sensor nodes are necessary for updating new software remotely or fixing bugs dynamically. In particular, the time factor for code dissemination is the most important factor in order that the normal operation of nodes can be continuously performed as soon as finishing the dissemination. For this factor, ECoDi determines the set of disseminators through regression analysis based on the size of distributed code and the time of past unicasts and broadcasts. Then it transmits the entire code as a unicast to multiple disseminators, and the disseminators broadcast the code to the remaining neighbor nodes. Performance results on a testbed show that ECoDi reduces dissemination time significantly compared to a conventional scheme.

Level Calibration of Ultrasonic Nondestructive Testing Considering Flaw Position (불연속부의 위치를 고려한 초음파비파괴검사 등급보정)

  • Shin, Byoung-Chul;Song, Ho-San;Jeong, Hwa-Young
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.5 no.4
    • /
    • pp.155-160
    • /
    • 2001
  • KS-code(KS B 0896) for nondestructive ultrasonic testing classifies the quality level by relative flaw size only. But flaw position is more important than the flaw size. Test blocks having artificial holes near surface show lower yield load than the blocks having deeply located holes from the surface. So, level calibration table was proposed for classifying the quality level of welded steel structures.

  • PDF

Fault Recover Algorithm for Cluster Head Node and Error Correcting Code in Wireless Sensor Network (무선센서 네트워크의 클러스터 헤드노드 고장 복구 알고리즘 및 오류 정정코드)

  • Lee, Joong-Ho
    • Journal of IKEEE
    • /
    • v.20 no.4
    • /
    • pp.449-453
    • /
    • 2016
  • Failures would occur because of the hostile nature environment in Wireless Sensor Networks (WSNs) which is deployed randomly. Therefore, considering faults in WSNs is essential when we design WSN. This paper classified fault model in the sensor node. Especially, this paper proposed new error correcting code scheme and fault recovery algorithm in the CH(Cluster Head) node. For the range of the small size information (<16), the parity size of the proposed code scheme has the same parity length compared with the Hamming code, and it has a benefit to generate code word very simple way. This is very essential to maintain reliability in WSN with increase power efficiency.

Neutronic simulation of the CEFR experiments with the nodal diffusion code system RAST-F

  • Tran, Tuan Quoc;Lee, Deokjung
    • Nuclear Engineering and Technology
    • /
    • v.54 no.7
    • /
    • pp.2635-2649
    • /
    • 2022
  • CEFR is a small core-size sodium-cooled fast reactor (SFR) using high enrichment fuel with stainless-steel reflectors, which brings a significant challenge to the deterministic methodologies due to the strong spectral effect. The neutronic simulation of the start-up experiments conducted at the CEFR have been performed with a deterministic code system RAST-F, which is based on the two-step approach that couples a multi-group cross-section generation Monte-Carlo (MC) code and a multi-group nodal diffusion solver. The RAST-F results were compared against the measurement data. Moreover, the characteristic of neutron spectrum in the fuel rings, and adjacent reflectors was evaluated using different models for generation of accurate nuclear libraries. The numerical solution of RAST-F system was verified against the full core MC solution MCS at all control rods fully inserted and withdrawn states. A good agreement between RAST-F and MCS solutions was observed with less than 120 pcm discrepancies and 1.2% root-mean-square error in terms of keff and power distribution, respectively. Meanwhile, the RAST-F result agreed well with the experimental values within two-sigma of experimental uncertainty. The good agreement of these results indicating that RAST-F can be used to neutronic steady-state simulations for small core-size SFR, which was challenged to deterministic code system.

A comparative study on the seismic provisions of different codes for RC buildings

  • Bilgin, Huseyin;Hadzima-Nyarko, Marijana;Isik, Ercan;Ozmen, Hayri Baytan;Harirchian, Ehsan
    • Structural Engineering and Mechanics
    • /
    • v.83 no.2
    • /
    • pp.195-206
    • /
    • 2022
  • Significant structural damages due to earthquakes reveal the importance of seismic design provisions. This paper presents a comparison between the seismic design provisions of Albania, Croatia, Iran, and Turkey for the design of mid-rise reinforced-concrete (RC) frames. Information on the historical development of the considered provisions are given. The code provisions are compared, illustrating the main differences in the minimum requirements for column and beam detailing and analysis for mid-rise RC frames. 4-story, 5-story, and 6-story buildings are designed according to each design code, and their performance is evaluated comparatively by using a displacement-based adaptive pushover procedure and eigenvalue analysis. It is observed that recent Turkish code has the highest and Albanian code has the lowest level of requirements in terms of member size and reinforcement detailing. The considered models indicate 15%, 20% and 50%, lower period values than the Croatia, Iran and Albania buildings, respectively. Additionally, building models per Croatia, Iran and Albania codes have 30%, 35% and 65% less base shear capacity when compared to Turkish building codes. Building models per Croatia and Iran codes indicate similar properties both in terms of strength and stiffness.

Algorithm of Decoding the Data Codeword in Two-Dimensional QR Code (이차원 QR Code에서 데이터 코드워드의 디코딩 알고리즘)

  • Park, Kwang Wook;Lee, Jong Yun
    • Journal of the Korea Convergence Society
    • /
    • v.4 no.4
    • /
    • pp.21-29
    • /
    • 2013
  • Two-dimensional QR Code has improved greatly the limits on the capacity, size, direction of the one-dimensional bar code. And it has the capacity of compressing and storing the massive amount of data and is widely used in many applications. Recently, the two-dimensional QR Code has been spread rapidly because of introducing the smart phones and increasing the amount of using them. However, there is little documentations about decoding the QR Code in which can store the large amount of information. In this paper, therefore, we present specific processing procedures and algorithms on decoding the two-dimensional QR Code and then make us understand their decoding process by explaining some examples.

A Study on Sizing System for Mail-Order Clothing (통신판매의류의 치수에 대한 조사 연구)

  • 박경화;천종숙
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.20 no.1
    • /
    • pp.43-53
    • /
    • 1996
  • This study was initiated to investigate (1) the current sizing system for mail-order clothing, (2) consumers' preference for sizing systems, and (3) consumers' satisfaction with garment size. The apparel items and the sizes available at various mail-order companies in Korea were also reviewed. This investigation of consumers' preferences for various size description systems includes a survey of 410 men and women who had purchased garments by mail-order. The data were analyzed by Statistical Analysis System/pc. The major results are as follows; 1. The sizing system of mail-order clothing was different by garment items. The number of apparel sizes available for mail-order purchasing was three or less. The most mail∼order garments were labeled by the numerical size codes of body girth nleasurements or letter code (S, M, L). 2. The size description system most prefered by female subjects(N : 360) was the numerical size code of a body measurement(55.4%). The combination of bust-hips-height measurements size codes were prefered by 13.3% . The pictogram was least premiered by the subjects. 3. The apparel items that subjects wanted to buy using mail-order were underwear, home -weat and night-wear. The heavy users of mail-order purchasing, however, also wanted to purchase expensive garments requiring precise fit. The subjects aged from 20's to 80's wanted to purchase childern's wear by mail. 4. The desire for diversity of garment item and size of mail-order apparel was relatively high. The subjets also wanted to purchase special size garments by mail-order, e. g., garment sizes for full or tall figure.

  • PDF