default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir I. Prodanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Levi Rash, Vladimir I. Prodanov:
Providing Cadence Feedback in Real-Time to Guide Cardiovascular Workouts. MWSCAS 2024: 218-222
2010 – 2019
- 2018
- [c13]Vladimir I. Prodanov, Katherina Prodanov:
Relationship Between Time-constants and 3dB Cutoff of High-Order Damped LTI Systems. MWSCAS 2018: 85-88 - [c12]Michael Cheng, Vladimir I. Prodanov:
Experimental Study and Modeling of the gm-I Dependence of Long-Channel MOSFETs. MWSCAS 2018: 570-573 - 2013
- [c11]Gursewak S. Rai, Vladimir I. Prodanov, Stephen Garber:
A Class-C amplifier linearized by a constant conduction angle biasing circuit. MWSCAS 2013: 376-379 - 2012
- [c10]Vladimir I. Prodanov:
Empirical model for the transconductance-current dependence of short-channel MOSFETs. MWSCAS 2012: 290-293
2000 – 2009
- 2006
- [j3]Jesús Arias Álvarez, Peter Kiss, Vladimir I. Prodanov, Vito Boccuzzi, Mihai Banu, David Bisbal, Jacinto San Pablo, Luis Quintanilla, Juan Barbolla:
A 32-mW 320-MHz continuous-time complex delta-sigma ADC for multi-mode wireless-LAN receivers. IEEE J. Solid State Circuits 41(2): 339-351 (2006) - [c9]Vladimir I. Prodanov, Mihai Banu:
GHz Serial Passive Clock Distribution in VLSI Using Bidirectional Signaling. CICC 2006: 285-288 - 2004
- [j2]Yorgos Palaskas, Yannis P. Tsividis, Vladimir I. Prodanov, Vito Boccuzzi:
A "divide and conquer" technique for implementing wide dynamic range continuous-time filters. IEEE J. Solid State Circuits 39(2): 297-307 (2004) - [j1]Peter Kiss, Vladimir I. Prodanov:
One-tap wideband I/Q compensation for zero-IF filters. IEEE Trans. Circuits Syst. I Regul. Pap. 51-I(6): 1062-1074 (2004) - [c8]Peter Kiss, Vladimir I. Prodanov:
I/Q imbalance of two-path ladder filters. ISCAS (1) 2004: 1004-1007 - 2002
- [c7]Peter Kiss, Vladimir I. Prodanov, Jack P. F. Glas:
Complex low-pass filters. ISCAS (1) 2002: 525-528 - 2001
- [c6]Vladimir I. Prodanov, Vito Boccuzzi:
7V tristate-capable output buffer implemented in standard 2.5 V CMOS process. CICC 2001: 497-500 - [c5]Vladimir I. Prodanov:
Robust high-pass and notch Gm-(grounded) C biquads: how many different topologies are there? ISCAS (1) 2001: 21-24 - 2000
- [c4]Vladimir I. Prodanov:
V-I converters with transconductance proportional to bias current in any technology. ISCAS 2000: 201-204 - [c3]Adrian K. Ong, Vladimir I. Prodanov, Maurice Tarsia:
A method for reducing the variation in "on" resistance of a MOS sampling switch. ISCAS 2000: 437-440
1990 – 1999
- 1998
- [c2]Vladimir I. Prodanov, Michael M. Green:
New CMOS universal constant-Gm input stage. ICECS 1998: 359-362 - 1994
- [c1]Vladimir I. Prodanov, Michael M. Green:
A Current-Mode FDNR Circuit Element using Capacitive Gyrators. ISCAS 1994: 409-412
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-11 18:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
