default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid M. Binkley
Person information
- affiliation: University of North Carolina at Charlotte, Department of Electrical and Computer Engineering, NC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c10]Yi Yang, David M. Binkley, Changzhi Li
:
Using moderate inversion to optimize voltage gain, thermal noise, and settling time in two-stage CMOS amplifiers. ISCAS 2012: 432-435- 2011
- [c9]Yi Yang, David M. Binkley, Lu Li, Changzhan Gu, Changzhi Li:
All-CMOS subbandgap reference circuit operating at low supply voltage. ISCAS 2011: 893-896
2000 – 2009
- 2009
- [c8]Christian Jesús B. Fayomi, Gilson I. Wirth, David M. Binkley, Akira Matsuzawa:
An experimental 0.6-V 57.5-fJ/conversion-step 250-kS/s 8-bit rail-to-rail successive approximation ADC in 0.18µm CMOS. ICECS 2009: 195-198 - 2008
- [c7]David M. Binkley, Helmut E. Graeb, Georges G. E. Gielen, Jaijeet S. Roychowdhury:
From Transistor to PLL - Analogue Design and EDA Methods. DATE 2008 - 2006
- [j4]Srikanth S. Mohan, Arun Ravindran, David M. Binkley, Arindam Mukherjee:
Power Optimized Design of CMOS Programmable Gain Amplifiers. J. Low Power Electron. 2(2): 259-270 (2006) - 2004
- [j3]Brian K. Swann, Benjamin J. Blalock, Lloyd G. Clonts, David M. Binkley, James M. Rochelle, Eric Breeding, K. Michelle Baldwin:
A 100-ps time-resolution CMOS time-to-digital converter for positron emission tomography imaging applications. IEEE J. Solid State Circuits 39(11): 1839-1852 (2004) - 2003
- [j2]David M. Binkley, C. E. Hopper, Steve D. Tucker, Brian C. Moss, James M. Rochelle, Daniel Foty:
A CAD methodology for optimizing transistor current and sizing in analog CMOS design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(2): 225-237 (2003) - 2002
- [c6]Suriya Ashok Kumar, Rafic Z. Makki, David M. Binkley:
IDDT Testing of Embedded CMOS SRAMs. DATE 2002: 1117 - [c5]Daniel Foty, Matthias Bucher, David M. Binkley:
Re-interpreting the MOS transistor via the inversion coefficient and the continuum of gms/Id. ICECS 2002: 1179-1182 - [c4]Matthias Bucher, Dimitrios Kazazis, François Krummenacher, David M. Binkley, Daniel Foty, Yannis Papananos:
Analysis of transconductances at all levels of inversion in deep submicron CMOS. ICECS 2002: 1183-1186 - 2001
- [c3]Daniel Foty, David M. Binkley:
Re-Connecting MOS Modeling and Circuit Design: New Methods for Design Quality. ISQED 2001: 13 - 2000
- [c2]Daniel Foty, David M. Binkley:
MOSFET modeling and circuit design: re-establishing a lost connection (tutorial). DAC 2000: 560 - [c1]David M. Binkley, Matthias Bucher, Daniel Foty:
Design-oriented characterization of CMOS over the continuum of inversion level and channel length. ICECS 2000: 161-164
1990 – 1999
- 1998
- [j1]David M. Binkley, James M. Rochelle, Brian K. Swann, Lloyd G. Clonts, Rhonda N. Goble:
A micropower CMOS, direct-conversion, VLF receiver chip for magnetic-field wireless applications. IEEE J. Solid State Circuits 33(3): 344-358 (1998)
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-11-22 20:39 CET 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:
