Loading...
  • Home
  • Search Results
729-730 of 4327 Papers

CURRENT-MODE ACTIVE-C BIQUAD FILTER USING SINGLE MO-CCCFTA

Published In: INTERNATIONAL CONFERENCE ON RECENT TRENDS IN COMPUTING AND COMMUNICATION ENGINEERING
Author(s): C. CHAUHAN , D. S. CHAUHAN , R. S. TOMAR

Abstract: This paper presents a new current-mode active-C biquad filter employing single multi-output current controlled current follower trans-conductance amplifier (MO-CCCFTA). The proposed filter employs only two grounded capacitors. The proposed filter can simultaneously realize low pass (LP), band pass (BP) and high pass (HP) responses in current form by choosing appropriate current output branches. In addition, the pole frequency of proposed current-mode filter circuit can be tuned electronically and independent of quality factor, by simultaneous adjusting the external bias currents. The circuit possesses low sensitivity performance and low power consumptions. The validity of proposed filter is verified through PSPICE simulations.

  • Publication Date: 21-Apr-2013
  • DOI: 10.15224/978-981-07-6184-4-57
  • Views: 0
  • Downloads: 0

A MULTI-ROUND ALGORITHM FOR MINIMUM PROCESSOR IN REAL-TIME DIVISIBLE LOAD SCHEDULING

Published In: INTERNATIONAL CONFERENCE ON RECENT TRENDS IN COMPUTING AND COMMUNICATION ENGINEERING
Author(s): IZA IN NURFATEHA RUZAN , MIMI LIZA ABDUL MAJID , PEGAH RAZMARA , SURIAYATI CHUPRAT

Abstract: Using of parallel and distributed system has become more common. Dividing data is one of the big challenges in this type of systems. Divisible Load Theory (DLT) is one of the proposed methods for scheduling data in parallel and distributed systems. Recent research has applied divisible load theory in real-time scheduling and has been introduced as an alternative for multiprocessor scheduling.There are two type of scheduling algorithm in real-time divisible load theory(RT-DLT) which is known as single-round and multi-round algorithm. Most studies in this field are about distributing data in single-round algorithm. Unfortunately, multi-round algorithms are difficult to analyze and have received only limited attention in real-time concept. In this paper, we will determine the minimum number of processors needed to complete the job by its deadline in multi-round algorithm. The two algorithms are compared on linear programming based formulation and result show that multi-round algorithm can

  • Publication Date: 21-Apr-2013
  • DOI: 10.15224/978-981-07-6184-4-58
  • Views: 0
  • Downloads: 0