• Title/Summary/Keyword: pipeline structure

Search Result 269, Processing Time 0.022 seconds

Design of AES-Based Encryption Chip for IoT Security (IoT 보안을 위한 AES 기반의 암호화칩 설계)

  • Kang, Min-Sup
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.1
    • /
    • pp.1-6
    • /
    • 2021
  • The paper proposes the design of AES-based encryption chip for IoT security. ROM based S-Box implementation occurs a number of memory space and some delay problems for its access. In this approach, S-Box is designed by pipeline structure on composite field GF((22)2) to get faster calculation results. In addition, in order to achieve both higher throughput and less delay, shared S-Box are used in each round transformation and the key scheduling process. The proposed AES crypto-processor is described in Veilog-HDL, and Xilinx ISE 14.7 tool is used for logic synthesis by using Xilinx XC6VLX75T FPGA. In order to perform the verification of the crypto-processor, the timing simulator(ModelSim 10.3) is also used.

Design of Image Extraction Hardware for Hand Gesture Vision Recognition

  • Lee, Chang-Yong;Kwon, So-Young;Kim, Young-Hyung;Lee, Yong-Hwan
    • Journal of Advanced Information Technology and Convergence
    • /
    • v.10 no.1
    • /
    • pp.71-83
    • /
    • 2020
  • In this paper, we propose a system that can detect the shape of a hand at high speed using an FPGA. The hand-shape detection system is designed using Verilog HDL, a hardware language that can process in parallel instead of sequentially running C++ because real-time processing is important. There are several methods for hand gesture recognition, but the image processing method is used. Since the human eye is sensitive to brightness, the YCbCr color model was selected among various color expression methods to obtain a result that is less affected by lighting. For the CbCr elements, only the components corresponding to the skin color are filtered out from the input image by utilizing the restriction conditions. In order to increase the speed of object recognition, a median filter that removes noise present in the input image is used, and this filter is designed to allow comparison of values and extraction of intermediate values at the same time to reduce the amount of computation. For parallel processing, it is designed to locate the centerline of the hand during scanning and sorting the stored data. The line with the highest count is selected as the center line of the hand, and the size of the hand is determined based on the count, and the hand and arm parts are separated. The designed hardware circuit satisfied the target operating frequency and the number of gates.

A Experimental Study on the Determination of Construction method of Controled Low-strength Material Accelerated Flow Ability Using Surplus Soil for Underground Power Line (지중송전관로용 급결 유동성 뒤채움재의 시공법 설정에 관한 실험적 연구)

  • Oh, Gi-Dae;Kim, Dae Hong
    • Journal of the Korean Recycled Construction Resources Institute
    • /
    • v.5 no.3
    • /
    • pp.84-93
    • /
    • 2010
  • Compaction of backfill material of Underground power lines is difficult, especially under pipeline. so it could cause structural problem because of low compaction efficiency. So various methods have been taken to solve the problem and one of them is CLSM(Controled low-strength material accelerated flow ability). But In other countries, these are already in progress for a long time to research and development and recently on practical steps. But, in our country, study for only general structures, not for underground power line structure that is being constructed at night rapidly. In this study, we performed property tests and indoor & outdoor test (3 cases). The tests showed flow ability reached at the limit construction(160 mm) flowability by 9 to 15 minute after starting to mix, and construction buoyant is lowering after placing CLSM by 70 % of theoretical buoyant that is calculated by unit weight of material. In this paper, we performed indoor tests and outdoor tests to estimate mechanical properties and to suggest construction method(using batch plant, setting spacer at 1.8 m and placing at 2m) for CLSM that using surplus soil. And the test showed good results for construction quality, workability and structure safety.

  • PDF

A Study on the Optimization Algorithm for Correlation Analysis of the Underground Utility Structure Density in Urban Areas and Recorded Ground Subsidence (도심지 지중매설물 밀집도와 이력지반함몰의 상관성 분석을 위한 최적화 알고리즘에 관한 연구)

  • Choi, Changho;Kim, Jin-Young;Baek, Sung-Ha;Kang, Jae Mo
    • Journal of the Korean Geotechnical Society
    • /
    • v.37 no.10
    • /
    • pp.77-87
    • /
    • 2021
  • Several studies have been conducted to analyze, predict, and prevent the risk of ground subsidence occurring in urban areas. Nevertheless, there is insufficient research effort on risk analysis that utilizes the correlation between the density of underground structures (i.e., the spatial quantity of buried objects installed in the ground around the interested area) and the occurrence of ground subsidence. In this paper, a study was conducted to analyze the line density of underground structures using GIS-based spatial information data, and to link this with the recorded ground subsidences. An optimization algorithm was developed to maximize the correlation between the line density of 29 recorded ground subsidences and 6 types of underground structures that occurred between 2010 and 2015 for the analysis area. The concept of normalized line density was also proposed for the analysis. The normalized line density of the analysis area was divided into five grades (Grade 1: lowest, Grade 5: highest). When the optimization algorithm was applied, the case where the normalized line density was Grade 4 or higher at the location of the recorded ground subsidences was about > 80%. It is thought that the density analysis result of underground facilities can be applied to the ground subsidence risk analysis by using the proposed optimization algorithm.

Study on the structure of the articulation jack and skin plate of the sharp curve section shield TBM in numerical analysis (수치해석을 통한 급곡선 구간 Shield TBM의 중절잭 및 스킨플레이트 구조에 관한 연구)

  • Kang, Sin-Hyun;Kim, Dong-Ho;Kim, Hun-Tae;Song, Seung-Woo
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.19 no.3
    • /
    • pp.421-435
    • /
    • 2017
  • Recently, due to the saturation of ground structures and the overpopulation of pipeline facilities requires to development of underground structures as an alternative to ground structures. Thus, mechanized tunnel construction of the shield TBM method has been increasing in order to prevent vibration and noise problems in construction of the NATM tunnel for the urban infrastructure construction. Tunnel construction plan for the tunnel line should be formed in a sharp curve to avoid building foundation and underground structures and it is inevitable to develop a shield TBM technology that suits the sharp curve tunnel construction. Therefore, this study is about the structural stability technology of the articulation jack, shield jack and skin plate for the shield TBM thrust in case of the mechanized tunnel construction that is a straight and sharp curve line. The construction case study and shield TBM operation principle are examined and analyzed by the theoretical approach. The torque of the cutter head, the thrust of the articulation jack and the shield jack, the amount of over cutting for curve is important respectively in shield TBM construction of straight and sharp curve line. In addition, it is very important to secure the stability of the skin plate structure to ensure the safety of the inside worker. This study examines the general structure and construction of the equipment, experimental simulation was carried out through numerical analysis to examine the main factors and structural stability of the skin plate structure. The structural stability of the skin plate was evaluated and optimizes the shape by comparing the loads of the articulation jack by selecting the virtual soil to be applied in a straight and sharp curve line construction. Since the present structure and operation method of the shield TBM type in domestic constructions are very similar, this study will help to develop the localized shield TBM technology for the new equipment and the vulnerability and stability review.

Design of a Bit-Level Super-Systolic Array (비트 수준 슈퍼 시스톨릭 어레이의 설계)

  • Lee Jae-Jin;Song Gi-Yong
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.12
    • /
    • pp.45-52
    • /
    • 2005
  • A systolic array formed by interconnecting a set of identical data-processing cells in a uniform manner is a combination of an algorithm and a circuit that implements it, and is closely related conceptually to arithmetic pipeline. High-performance computation on a large array of cells has been an important feature of systolic array. To achieve even higher degree of concurrency, it is desirable to make cells of systolic array themselves systolic array as well. The structure of systolic array with its cells consisting of another systolic array is to be called super-systolic array. This paper proposes a scalable bit-level super-systolic amy which can be adopted in the VLSI design including regular interconnection and functional primitives that are typical for a systolic architecture. This architecture is focused on highly regular computational structures that avoids the need for a large number of global interconnection required in general VLSI implementation. A bit-level super-systolic FIR filter is selected as an example of bit-level super-systolic array. The derived bit-level super-systolic FIR filter has been modeled and simulated in RT level using VHDL, then synthesized using Synopsys Design Compiler based on Hynix $0.35{\mu}m$ cell library. Compared conventional word-level systolic array, the newly proposed bit-level super-systolic arrays are efficient when it comes to area and throughput.

An FPGA Implementation of the Synthesis Filter for MPEG-1 Audio Layer III by a Distributed Arithmetic Lookup Table (분산산술연산방식을 이용한 MPEG-1 오디오 계층 3 합성필터의 FPGA 군현)

  • Koh Sung-Shik;Choi Hyun-Yong;Kim Jong-Bin;Ku Dae-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.23 no.8
    • /
    • pp.554-561
    • /
    • 2004
  • As the technologies of semiconductor and multimedia communication have been improved. the high-quality video and the multi-channel audio have been highlighted. MPEG Audio Layer 3 decoder has been implemented as a Processor using a standard. Since the synthesis filter of MPEG-1 Audio Layer 3 decoder requires the most outstanding operation in the entire decoder. the synthesis filter that can reduce the amount of operation is needed for the design of the high-speed processor. Therefore, in this paper, the synthesis filter. the most important part of MPEG Audio, is materialized in FPGA using the method of DAULT (distributed arithemetic look-up table). For the design of high-speed synthesis filter, the DAULT method is used instead of a multiplier and a Pipeline structure is used. The Performance improvement by 30% is obtained by additionally making the result of multiplication of data with cosine function into the table. All hardware design of this Paper are described using VHDL (VHIC Hardware Description Language) Active-HDL 6.1 of ALDEC is used for VHDL simulation and Synplify Pro 7.2V is used for Model-sim and synthesis. The corresponding library is materialized by XC4013E and XC4020EX. XC4052XL of XILINX and XACT M1.4 is used for P&R tool. The materialized processor operates from 20MHz to 70MHz.

A Versatile Reed-Solomon Decoder for Continuous Decoding of Variable Block-Length Codewords (가변 블록 길이 부호어의 연속 복호를 위한 가변형 Reed-Solomon 복호기)

  • 송문규;공민한
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.3
    • /
    • pp.187-187
    • /
    • 2004
  • In this paper, we present an efficient architecture of a versatile Reed-Solomon (RS) decoder which can be programmed to decode RS codes continuously with my message length k as well as any block length n. This unique feature eliminates the need of inserting zeros for decoding shortened RS codes. Also, the values of the parameters n and k, hence the error-correcting capability t can be altered at every codeword block. The decoder permits 3-step pipelined processing based on the modified Euclid's algorithm (MEA). Since each step can be driven by a separate clock, the decoder can operate just as 2-step pipeline processing by employing the faster clock in step 2 and/or step 3. Also, the decoder can be used even in the case that the input clock is different from the output clock. Each step is designed to have a structure suitable for decoding RS codes with varying block length. A new architecture for the MEA is designed for variable values of the t. The operating length of the shift registers in the MEA block is shortened by one, and it can be varied according to the different values of the t. To maintain the throughput rate with less circuitry, the MEA block uses both the recursive technique and the over-clocking technique. The decoder can decodes codeword received not only in a burst mode, but also in a continuous mode. It can be used in a wide range of applications because of its versatility. The adaptive RS decoder over GF($2^8$) having the error-correcting capability of upto 10 has been designed in VHDL, and successfully synthesized in an FPGA chip.

A Versatile Reed-Solomon Decoder for Continuous Decoding of Variable Block-Length Codewords (가변 블록 길이 부호어의 연속 복호를 위한 가변형 Reed-Solomon 복호기)

  • 송문규;공민한
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.3
    • /
    • pp.29-38
    • /
    • 2004
  • In this paper, we present an efficient architecture of a versatile Reed-Solomon (RS) decoder which can be programmed to decode RS codes continuously with my message length k as well as any block length n. This unique feature eliminates the need of inserting zeros for decoding shortened RS codes. Also, the values of the parameters n and k, hence the error-correcting capability t can be altered at every codeword block. The decoder permits 3-step pipelined processing based on the modified Euclid's algorithm (MEA). Since each step can be driven by a separate clock, the decoder can operate just as 2-step pipeline processing by employing the faster clock in step 2 and/or step 3. Also, the decoder can be used even in the case that the input clock is different from the output clock. Each step is designed to have a structure suitable for decoding RS codes with varying block length. A new architecture for the MEA is designed for variable values of the t. The operating length of the shift registers in the MEA block is shortened by one, and it can be varied according to the different values of the t. To maintain the throughput rate with less circuitry, the MEA block uses both the recursive technique and the over-clocking technique. The decoder can decodes codeword received not only in a burst mode, but also in a continuous mode. It can be used in a wide range of applications because of its versatility. The adaptive RS decoder over GF(2$^{8}$ ) having the error-correcting capability of upto 10 has been designed in VHDL, and successfully synthesized in an FPGA chip.

A Load Balancing Method using Partition Tuning for Pipelined Multi-way Hash Join (다중 해시 조인의 파이프라인 처리에서 분할 조율을 통한 부하 균형 유지 방법)

  • Mun, Jin-Gyu;Jin, Seong-Il;Jo, Seong-Hyeon
    • Journal of KIISE:Databases
    • /
    • v.29 no.3
    • /
    • pp.180-192
    • /
    • 2002
  • We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new harsh join methods in the shared-nothing multiprocessor environment. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets dynamically via a frequency distribution. Using harsh-based joins, multiple joins can be pipelined to that the early results from a join, before the whole join is completed, are sent to the next join processing without staying in disks. Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. However, this hardware structure is very sensitive to the data skew. Unless the pipelining execution of multiple hash joins includes some dynamic load balancing mechanism, the skew effect can severely deteriorate the system performance. In this parer, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.