• Title/Summary/Keyword: datapath

Search Result 63, Processing Time 0.021 seconds

A 16-bit adiabatic macro blocks with supply clock generator for micro-power RISC datapath

  • Lee, Hanseung;Inho Na;Lee, Chanho;Yong Moon
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1563-1566
    • /
    • 2002
  • A 16-bit adiabatic datapath for micro-power RISC processor is designed. The datapath is composed of a 3-read and 1-write multi-port adiabatic register file and an arithmetic and logic unit. A four-phase clock generator is also designed to provide supply clocks fer adiabatic circuits and the driving capability control scheme is proposed. All the clock line charge on the capacitive interconnections is recovered to recycle energy. Adiabatic circuits are designed based on efficient charge recovery logic(ECRL) and are implemented using a 0.35 fm CMOS technology. Functional and energy simulation is carried out to show the feasibility of adiabatic datapath. Simulation results show that the power consumption of the adiabatic datapath including supply clock generator is reduced by a factor of 1.4∼1.5 compared to that of the conventional CMOS.

  • PDF

Implementation of SA-DCT using a datapath (데이터패스를 이용한 SA-DCT 구현)

  • 박주현;김영민
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.5
    • /
    • pp.25-32
    • /
    • 1998
  • In this paper, SA (shape adaptive)-DCT is implemented using a datapath with 4 MACs (multiplication & accumulator). DCT is a well-known bottleneck of real-time video compression using MPEG-like schemes. High-speed pipelined MACs presented here implement real-time DCT. A datapath in this paper executes DCT/IDCT algorithms for QCIF 15fps(frame per second), maximum rate of VLBV(very low bitrte video) in MPEG-4. A 32bit accumulator in a MAC prevents distortion caused by fixed-point process. It can be applied to various operations such as ME (motion estimation) and MC(motion compensation) with a absolutor and a halfer.

  • PDF

BIST Architecture for Datapath Megacells (데이터 패스 메가셀을 위한 BIST 구조)

  • 김형주;손일헌
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.1117-1120
    • /
    • 1998
  • BIST architecture and circuit design are presented for the self-test of various datapath megacells including embedded SRAM, barrel shifter, adder and multiplier. The BIST architecture is composed of VCO, ROM, comparator and otehr control logic to measure the megacell' performance up to 300MHz. PC interface and control logic are also implemented to perform the manual testing of each megacell with various test patterns. The control logic was designed using VHDL and its circuit is synthesized using Synopsys for $0.6\mu$ 1-poly, 3-matal CMOS technology.

  • PDF

Evaluation of Bit-Pipelined Array Circuits for Datapath DSP Applications

  • Israsena, Pasin
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1280-1283
    • /
    • 2002
  • This paper discusses issues in VLSI design and implementation of high performance datapath circuits. Of particular concern will he various types of multiplier and adder, which are fundamental to DSP operations. Performance comparison will be provided in terms of sampling speed, layout area, and in particular, power consumption, with techniques that may be applied to reduce power dissipation also suggested. As an example, a low power, high performance recursive filter achieved through bit-level pipelining technique is illustrated

  • PDF

A Scheduling Technique for Pipelined Datapath Synthesis (파이프라인형 데이타패스 합성을 위한 스케쥴링 기법)

  • 이근만;임인칠
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.4
    • /
    • pp.74-82
    • /
    • 1992
  • This paper deals with the scheduling problems, which are the most important subtask in High-level Synthesis. ILP(integer linear programming) formulations are used as a scheduling problem approach.For practical application to digital system design, we have concentrated our attentions on pipelined datapath scheduling. For experiment results, we choose the 5-th order digital wave filter as a benchmark and do the schedule. Finally, we can obtain better and near-optimal scheduling results.

  • PDF

An Efficient Datapath Placement Algorithm to Minimize Track Density Using Spectral Method (스팩트럴 방법을 이용해 트랙 밀도를 최소화 할 수 있는 효과적인 데이터패스 배치 알고리즘)

  • Seong, Gwang-Su
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.2
    • /
    • pp.55-64
    • /
    • 2000
  • In this paper, we propose an efficient datapath placement algorithm to minimize track density. Here, we consider each datapath element as a cluster, and merge the most strongly connected two clusters to a new cluster until only one cluster remains. As nodes in the two clusters to be merged are already linearly ordered respectively, we can merge two clusters with connecting them. The proposed algorithm produces circular linear ordering by connecting starting point and end point of the final cluster, and n different linear ordering by cutting between two contiguous elements of the circular linear ordering. Among the n different linear ordering, the linear ordering to minimize track density is final solution. In this paper, we show and utilize that if two clusters are strongly connected in a graph, the inner product of the corresponding vectors mapped in d-dimensional space using spectral method is maximum. Compared with previous datapath placement algorithm GA/S $A^{[2]}$, the proposed algorithm gives similar results with much less computation time.

  • PDF

Problem Analysis and Recommendations of CPU Contents in Korean Middle School Informatics Textbooks (중학교 정보 교과서에 제시된 중앙처리장치 내용 문제점 분석 및 개선 방안)

  • Lee, Sangwook;Suh, Taeweon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.4
    • /
    • pp.143-150
    • /
    • 2013
  • The School Curriculum amend in 2007 mandates the contents from which students can learn the principles and concepts of computer science. Computer Science is one of the most rapidly changing subjects, and the Informatics textbook should accurately explain the basic principles and concepts based on the latest technology. However, we found that the middle school textbooks in circulation lack accuracy and consistency in describing CPU. This paper attempted to discover the root-cause of the fallacy and suggest timely and appropriate explanation based on the historical and technical analysis. According to our study, it is appropriate to state that CPU is composed of datapath and control unit. The Datapath performs operations on data and holds data temporarily, and it is composed of the hardware components such as memory, register, ALU and adder. The Control unit decides the operation types of datapath elements, main memory and I/O devices. Nevertheless, considering the technological literacy of middle school students, we suggest the terms, 'arithmetic part' and 'control part' instead of datapath and control unit.

A Scheduling Algorithm for the Synthesis of a Pipelined Datapath using Collision Count (충돌수를 이용한 파이프라인 데이타패스 합성 스케쥴링 알고리즘)

  • Yu, Dong-Jin;Yoo, Hee-Jin;Park, Do-Soon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.11
    • /
    • pp.2973-2979
    • /
    • 1998
  • As this paper is a scheduling algorithm for the synthesis of a pipelined datapath under resource constraints in high level synthesis, the proposed heuristic algorithm uses a priority function based on the collision count of resourecs. In order to schedule the pipelined datapath under resource constraints, we define the collision count and the priority function based on the collision count, a number of resource, and the mobility of operations to resolve a resource collision. The proposed algorithm supports chaining, multicycling, and structural pipelining to design the realistic hardware. The evaluation of the Performance is compared with other systems using the results of the synthesis for a 16point FIR filter and a 5th order elliptic wave filter, where in most cases, the optimal solution is obtained.

  • PDF

Design of a High-Level Synthesis System for Automatic Generation of Pipelined Datapath (파이프라인 데이터패스 자동 생성을 위한 상위수준 합성 시스템의 설계)

  • 이해동;황선영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.3
    • /
    • pp.53-67
    • /
    • 1994
  • This paper describes the design of a high-level synthesis system. SODAS-VP. which automatically generates hardwares executing operation sequences in pipelined fashion.Target architecture and clocking schemes to drive pipelined datapath are determined, and the handling of pipeline hazards which degrade the performance of pipeline is considered. Partitioning of an operation into load, operation, and store stages, each of which is executed in partitiones control step, is performend. Pipelinecl hardware is generated by handling pipeline hazards with internal forwarding or delay insertion techniques in partitioning process and resolving resource conflicts among the partitioned control steps with similarity measure as a priority function in module allocation process. Experimental results show that SODAS-VP generates hardwares that execute faster than those generated by HAL and ALPS systems. SODAS-VP brings improvement in execution speed by 17.1% and 7.4% comparing with HAL and ALPS systems for a MCNC benchmark program, 5th order elliptical wave filter,respectively.

  • PDF

Design of a Synchronous Control Unit for a Datapath with Variable Delay Arithmetic Units (가변지연시간 연산기를 가진 데이터 경로에 대한 동기식 제어기의 설계)

  • 김의석;이정근;이동익
    • Proceedings of the IEEK Conference
    • /
    • 2002.06b
    • /
    • pp.321-324
    • /
    • 2002
  • Nowadays variable delay arithmetic units have been used for implementing a datapath of\ulcorner target system in pursuit of performance improvement. However. adoption of variable delay arithmetic units requires modification of a typical synchronous control units design methodology. There is a representative approach, which is called a monolithic approach. Although its results are good, its proposed methodology may cause critical problems in the aspects of area and performance with the size increase of initial system specifications. In order to solve this problems, a distributed approach is suggested. Experimental results show that the Proposed method can guarantee original performance of an initial system specification with minimized additional area increase.

  • PDF