• Title/Summary/Keyword: arithmetic circuit

Search Result 115, Processing Time 0.022 seconds

Timing analysis of RSFQ ALU circuit for the development of superconductive microprocessor (초전도 마이크로 프로세서개발을 위한 RSFQ ALU 회로의 타이밍 분석)

  • Kim J. Y;Baek S. H.;Kim S. H.;Kang J. H.
    • Progress in Superconductivity and Cryogenics
    • /
    • v.7 no.1
    • /
    • pp.9-12
    • /
    • 2005
  • We have constructed an RSFQ 4-bit Arithmetic Logic Unit (ALU) in a pipelined structure. An ALU is a core element of a computer processor that performs arithmetic and logic operation on the operands in computer instruction words. We have simulated the circuit by using Josephson circuit simulation tools. We used simulation tools of XIC, $WRspice^{TM}$, and Julia. To make the circuit work faster, we used a forward clocking scheme. This required a careful design of timing between clock and data pulses in ALU. The RSFQ 1-bit block of ALU used in constructing the 4-bit ALU was consisted of three DC current driven SFQ switches and a half-adder. By commutating output ports of the half adder, we could produce AND, OR, XOR, or ADD functions. The circuit size of the 4-bit ALU when fabricated was 3 mm x 1.5 mm, fitting in a 5 mm x 5mm chip. The fabricated 4-bit ALU operated correctly at 5 GHz clock frequency. The chip was tested at the liquid-helium temperature.

Design of Parallel Multiplier Circuit synthesized operation module over $GF(2^m)$ (연산 모듈의 결합에 의한 $GF(2^m)$상의 병렬 승산 회로의 설계)

  • Byun, Gi-Young;Kim, Heung-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2002.11c
    • /
    • pp.268-273
    • /
    • 2002
  • In this paper, a new parallel multiplier circuit over $GF(2^m)$ has been proposed. The new multiplier is composed of polynomial multiplicative operation part and modular arithmetic operation part, irreducible polynomial operation part. And each operation has modular circuit block. For design the new proposed circuit, it develop generalized equations using frame each operation idea and show a example for $GF(2^m)$.

  • PDF

Efficient ROM Size Reduction for Distributed Arithmetic (벡터 내적을 위한 효율적인 ROM 면적 감소 방법)

  • 최정필;성경진;유경주;정진균
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.3B
    • /
    • pp.584-591
    • /
    • 2000
  • In distributed arithmetic-based architecture for an inner product between two length-N vectors, the size of the ROM increases exponentially with N. Moreover, the ROMs are generally the bottleneck of speed, especially when their size is large. In this paper, a ROM size reduction technique for DA( distributed arithmetic ) is proposed. The proposed method is based on modified OBC( offset binary coding) and control circuit reduction technique. by simulations, it is shown that the use of the proposed technique can result in reduction in the number of gates up to 50%.

  • PDF

Design of Pipelined Floating-Point Arithmetic Unit for Mobile 3D Graphics Applications

  • Choi, Byeong-Yoon;Ha, Chang-Soo;Lee, Jong-Hyoung;Salclc, Zoran;Lee, Duck-Myung
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.6
    • /
    • pp.816-827
    • /
    • 2008
  • In this paper, two-stage pipelined floating-point arithmetic unit (FP-AU) is designed. The FP-AU processor supports seventeen operations to apply 3D graphics processor and has area-efficient and low-latency architecture that makes use of modified dual-path computation scheme, new normalization circuit, and modified compound adder based on flagged prefix adder. The FP-AU has about 4-ns delay time at logic synthesis condition using $0.18{\mu}m$ CMOS standard cell library and consists of about 5,930 gates. Because it has 250 MFLOPS execution rate and supports saturated arithmetic including a number of graphics-oriented operations, it is applicable to mobile 3D graphics accelerator efficiently.

  • PDF

Replacing Fractional Arithmetic by Integer Arithmetic on Rendering Graphics Primitives (정수 연산에 의한 그래픽스 프리미티브 랜더링 방법)

  • Wee, Young-Cheul;Kimn, Ha-Jine
    • Journal of the Korea Computer Graphics Society
    • /
    • v.6 no.3
    • /
    • pp.1-7
    • /
    • 2000
  • The number of pixels being processed in a raster graphics system often exceeds 1 million per frame. Replacing fractional arithmetic by integer arithmetic on rendering graphics primitives will therefore significantly improve the rendering performance. A scaling method that replaces fractional arithmetic by integer arithmetic on rendering graphics primitives is introduced. This method is applied to the filtered edge drawing and Gouraud shading. This method will also be applicable to some of other incremental algorithms for rendering graphics primitives. Because the scaling method requires only simple modifications upon the known algorithms that already have been implemented in ASIC (Application Specific Integrated Circuit), our algorithms can easily be implemented in ASIC. Our method will be useful especially for the low-price systems (e.g., home game machines, personal computers, etc.).

  • PDF

Circuit Design of a Blocking Effect Reduction Algorithm using B-Spline Curve (스플라인 곡선을 이용한 블록화 현상 감소 회로의 설계)

  • 박성모;김희정;최진호;김지홍
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.7
    • /
    • pp.1169-1177
    • /
    • 2003
  • The blocking effect results from independent coding of each image block and becomes highly visible, especially coded at very low bit rates. In this paper, a blocking effect reduction circuit is designed which is composed of a memory, arithmetic and logic unit, and control block. The circuit is based on a rational open uniform B-spline curve that uses to produce a smooth curve through a set of control points. The weight values and the modified pixel values in a rational open uniform B-spline curve are calculated using arithmetic and logic circuits. The simulation results show that the circuit has excellent performance for ail pattern of the blocking effects.

  • PDF

Development of Superconductive Arithmetic and Logic Devices (초전도 논리연산자의 개발)

  • Kang J. H
    • Progress in Superconductivity
    • /
    • v.6 no.1
    • /
    • pp.7-12
    • /
    • 2004
  • Due to the very fast switching speed of Josephson junctions, superconductive digital circuit has been a very good candidate fur future electronic devices. High-speed and Low-power microprocessor can be developed with Josephson junctions. As a part of an effort to develop superconductive microprocessor, we have designed an RSFQ 4-bit ALU (Arithmetic Logic Unit) in a pipelined structure. To make the circuit work faster, we used a forward clocking scheme. This required a careful design of timing between clock and data pulses in ALU. The RSFQ 1-bit block of ALU used in this work consisted of three DC current driven SFQ switches and a half-adder. We successfully tested the half adder cell at clock frequency up to 20 GHz. The switches were commutating output ports of the half adder to produce AND, OR, XOR, or ADD functions. For a high-speed test, we attached switches at the input ports to control the high-speed input data by low-frequency pattern generators. The output in this measurement was an eye-diagram. Using this setup, 1-bit block of ALU was successfully tested up to 40 GHz. An RSFQ 4-bit ALU was fabricated and tested. The circuit worked at 5 GHz. The circuit size of the 4-bit ALU was 3 mm ${\times}$ 1.5 mm, fitting in a 5 mm ${\times}$ 5 mm chip.

  • PDF

A Practical Synthesis Technique for Optimal Arithmetic Hardware based on Carry-Save-Adders (캐리-세이브 가산기에 기초한 연산 하드웨어 최적화를 위한 실질적 합성 기법)

  • Kim, Tae-Hwan;Eom, Jun-Hyeong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.10
    • /
    • pp.520-529
    • /
    • 2001
  • Carry-save-adder(CSA) is one of the most effective operation cells in implementing an arithmetic hardware with high performace and small circuit area. An fundamental drawback of the existing CAS applications is that the applications are limited to the local parts of arithmetic circuit that are directly converted to additions. To resolve the limitation, we propose a set of new CSA transformation techniques: optimizing arithmetics with multiplexors, optimizing arithmetics in multiple designs, and optimizing arithmetics with multiplications. We then design a new CSA transformation algorithm which integrates the proposed techniques, so that we are able to utilize CSAs more globally. An extensive experimentation for practical designs are provided to show the effectiveness of our proposed algorithm over the conventional CSA techniques.

  • PDF

A study on the implementation of the fault-tolerant digital filter using self-checking pulse rate residue arithmetic circuits. (자기검사(自己檢査) 펄스열(列) 잉여수연산회로(剩餘數演算回路)를 이용한 폴트 토러런트 디지탈 필타의 구성(構成)에 관한 연구(硏究))

  • Kim, Moon-Soo;Chun, Koo-Chae
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1185-1187
    • /
    • 1987
  • Digital systems are increasingly being used in the ranges of many control engineering. The residue number system offers the possibility of high speed operation and error correction. The compact self-checking pulse-train residue arithmetic circuit is proposed. A fault tolerant digital filter is practically implemented using these proposed circuits.

  • PDF

Design of a 3.3V high frequency CMOS PLL with an arithmetic functionality VCO (산술 연산 구조의 VCO를 이용한 3.3V 고주파수 CMOS 주파수 합성기의 설계)

  • 한윤철;윤광섭
    • Proceedings of the IEEK Conference
    • /
    • 2001.06b
    • /
    • pp.81-84
    • /
    • 2001
  • In recent years, the design of CMOS VCO at ever-higher frequencies has gained interest. This paper proposes an arithmetic functionality VCO circuit based on a differential ring oscillator for operating in high frequency. The proposed VCO architecture with half adder is able to produce two times higher frequency with my delay cell than conventional VCO produce double oscillation frequency and power dissipation is 14.59mW.

  • PDF