A Low-Voltage Electronically Tunable MOSFET-C Voltage-Mode First-Order All-Pass Filter Design

This paper presents a simple electronically tunable voltage-mode first-order all-pass filter realization with MOSFET-C technique. In comparison to the classical MOSFET-C filter circuits that employ active elements including large number of transistors the proposed circuit is only composed of a single two n-channel MOSFET-based inverting voltage buffer, three passive components, and one NMOS-based voltage-controlled resistor, which is with advantage used to electronically control the pole frequency of the filter in range 103 kHz to 18.3 MHz. The proposed filter is also very suitable for low-voltage operation, since between its supply rails it uses only two MOSFETs. In the paper the effect of load is investigated. In addition, in order to suppress the effect of non-zero output resistance of the inverting voltage buffer, two compensation techniques are also introduced. The theoretical results are verified by SPICE simulations using PTM 90 nm level-7 CMOS process BSIM3v3 parameters, where +/- 0.45 V supply voltages are used. Moreover, the behavior of the proposed filter was also experimentally measured using readily available array transistors CD4007UB by Texas Instruments

Service Prototyping Lab Report - 2018 (Y3)

The annual activity report of the Service Prototyping Lab at Zurich University of Applied Sciences. Research trends and initiatives, research projects, transfer to education and local industry, academic community involvement, qualification and scientific development over the period of one year are among the covered topics

Research & scholarly achievements, July 1, 1985 - June 30, 1986

Annual summary of scholarly activities at UCF for the period from July 1, 1985 to June 30, 1986. This report highlights the contributions to scholarship by the Faculty during this period, including books and monographs, articles, creative works, presentations, grants and contracts

Focal Spot, Winter 1983/84

https://digitalcommons.wustl.edu/focal_spot_archives/1036/thumbnail.jp

Focal Spot, Winter 1983/84

https://digitalcommons.wustl.edu/focal_spot_archives/1036/thumbnail.jp

Interim research assessment 2003-2005 - Computer Science

This report primarily serves as a source of information for the 2007 Interim Research Assessment Committee for Computer Science at the three technical universities in the Netherlands. The report also provides information for others interested in our research activities

Annual Research Report, 2009-2010

Annual report of collaborative research projects of Old Dominion University faculty and students in partnership with business, industry and governmenthttps://digitalcommons.odu.edu/or_researchreports/1001/thumbnail.jp

Minimizing Movement for Target Coverage and Network Connectivity in Mobile Sensor Networks

PublishedJournal Article© 2014 IEEE. Coverage of interest points and network connectivity are two main challenging and practically important issues of Wireless Sensor Networks (WSNs). Although many studies have exploited the mobility of sensors to improve the quality of coverage andconnectivity, little attention has been paid to the minimization of sensors' movement, which often consumes the majority of the limited energy of sensors and thus shortens the network lifetime significantly. To fill in this gap, this paper addresses the challenges of the Mobile Sensor Deployment (MSD) problem and investigates how to deploy mobile sensors with minimum movement to form a WSN that provides both target coverage and network connectivity. To this end, the MSD problem is decomposed into two sub-problems: the Target COVerage (TCOV) problem and the Network CONnectivity (NCON) problem. We then solve TCOV and NCON one by one and combine their solutions to address the MSD problem. The NP-hardness of TCOV is proved. For a special case of TCOV where targets disperse from each other farther than double of the coverage radius, an exact algorithm based on the Hungarian method is proposed to find the optimal solution. For general cases of TCOV, two heuristic algorithms, i.e., the Basic algorithm based on clique partition and the TV-Greedy algorithm based on Voronoi partition of the deployment region, are proposed to reduce the total movement distance ofsensors. For NCON, an efficient solution based on the Steiner minimum tree with constrained edge length is proposed. Thecombination of the solutions to TCOV and NCON, as demonstrated by extensive simulation experiments, offers a promising solutionto the original MSD problem that balances the load of different sensors and prolongs the network lifetime consequently.This work is supported in part by the National Science Foundation of China (Grant Nos. 61232001, 61103203, 61173169, and 61173051), the Major Science & Technology Research Program for Strategic Emerging Industry of Hunan (Grant No. 2012GK4054), and the Scientific Research Fund of Hunan Provincial Education Department (Grant No. 14C0030)