Hyunsoo Ha

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hong-June Park

> Home > Persons > Hyunsoo Ha

Publications

2014
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tcas/HaLKPS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcas/HaLKPS14
Hyunsoo Ha, Seon-Kyoo Lee, Byungsub Kim, Hong-June Park, Jae-Yoon Sim:
A 0.5-V, 1.47- µW 40-kS/s 13-bit SAR ADC With Capacitor Error Compensation. IEEE Trans. Circuits Syst. II Express Briefs 61-II(11): 840-844 (2014)
2012
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/cicc/HaSLPS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cicc/HaSLPS12
Hyunsoo Ha, Yunjae Suh, Seon-Kyoo Lee, Hong-June Park, Jae-Yoon Sim:
A 0.5V, 11.3-μW, 1-kS/s resistive sensor interface circuit with correlated double sampling. CICC 2012: 1-4
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/isscc/LeeHPS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isscc/LeeHPS12
Seon-Kyoo Lee, Hyunsoo Ha, Hong-June Park, Jae-Yoon Sim:
A 5Gb/s single-ended parallel receiver with adaptive FEXT cancellation. ISSCC 2012: 140-142
2009
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/isscc/LeeKHSPS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isscc/LeeKHSPS09
Seon-Kyoo Lee, Young-Sang Kim, Hyunsoo Ha, Young Hun Seo, Hong-June Park, Jae-Yoon Sim:
A 650Mb/s-to-8Gb/s referenceless CDR circuit with automatic acquisition of data rate. ISSCC 2009: 184-185

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.