The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article décrit un algorithme pour les CAN de registre d'approximation successive (SAR) avec des étapes qui se chevauchent qui permettent de corriger numériquement les erreurs de décision de comparaison (dues, par exemple, à une stabilisation incomplète du DAC). Nous généralisons cet algorithme de recherche non binaire et clarifions les erreurs de décision qu'il peut corriger numériquement. Cet algorithme nécessite plus d'étapes de conversion d'un CAN SAR qu'un algorithme de recherche binaire, mais nous montrons que la vitesse d'échantillonnage d'un CAN SAR utilisant cet algorithme peut être plus rapide que celle d'un CAN SAR à recherche binaire classique -- parce que ce dernier doit attendre le temps de stabilisation du DAC à l’intérieur du SAR ADC.
Tomohiko OGAWA
Haruo KOBAYASHI
Yosuke TAKAHASHI
Nobukazu TAKAI
Masao HOTTA
Hao SAN
Tatsuji MATSUURA
Akira ABE
Katsuyoshi YAGI
Toshihiko MORI
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Tomohiko OGAWA, Haruo KOBAYASHI, Yosuke TAKAHASHI, Nobukazu TAKAI, Masao HOTTA, Hao SAN, Tatsuji MATSUURA, Akira ABE, Katsuyoshi YAGI, Toshihiko MORI, "SAR ADC Algorithm with Redundancy and Digital Error Correction" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 2, pp. 415-423, February 2010, doi: 10.1587/transfun.E93.A.415.
Abstract: This paper describes an algorithm for Successive Approximation Register (SAR) ADCs with overlapping steps that allow comparison decision errors (due to, such as DAC incomplete settling) to be digitally corrected. We generalize this non-binary search algorithm, and clarify which decision errors it can digitally correct. This algorithm requires more SAR ADC conversion steps than a binary search algorithm, but we show that the sampling speed of an SAR ADC using this algorithm can be faster than that of a conventional binary-search SAR ADC -- because the latter must wait for the settling time of the DAC inside the SAR ADC.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.415/_p
Copier
@ARTICLE{e93-a_2_415,
author={Tomohiko OGAWA, Haruo KOBAYASHI, Yosuke TAKAHASHI, Nobukazu TAKAI, Masao HOTTA, Hao SAN, Tatsuji MATSUURA, Akira ABE, Katsuyoshi YAGI, Toshihiko MORI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={SAR ADC Algorithm with Redundancy and Digital Error Correction},
year={2010},
volume={E93-A},
number={2},
pages={415-423},
abstract={This paper describes an algorithm for Successive Approximation Register (SAR) ADCs with overlapping steps that allow comparison decision errors (due to, such as DAC incomplete settling) to be digitally corrected. We generalize this non-binary search algorithm, and clarify which decision errors it can digitally correct. This algorithm requires more SAR ADC conversion steps than a binary search algorithm, but we show that the sampling speed of an SAR ADC using this algorithm can be faster than that of a conventional binary-search SAR ADC -- because the latter must wait for the settling time of the DAC inside the SAR ADC.},
keywords={},
doi={10.1587/transfun.E93.A.415},
ISSN={1745-1337},
month={February},}
Copier
TY - JOUR
TI - SAR ADC Algorithm with Redundancy and Digital Error Correction
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 415
EP - 423
AU - Tomohiko OGAWA
AU - Haruo KOBAYASHI
AU - Yosuke TAKAHASHI
AU - Nobukazu TAKAI
AU - Masao HOTTA
AU - Hao SAN
AU - Tatsuji MATSUURA
AU - Akira ABE
AU - Katsuyoshi YAGI
AU - Toshihiko MORI
PY - 2010
DO - 10.1587/transfun.E93.A.415
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2010
AB - This paper describes an algorithm for Successive Approximation Register (SAR) ADCs with overlapping steps that allow comparison decision errors (due to, such as DAC incomplete settling) to be digitally corrected. We generalize this non-binary search algorithm, and clarify which decision errors it can digitally correct. This algorithm requires more SAR ADC conversion steps than a binary search algorithm, but we show that the sampling speed of an SAR ADC using this algorithm can be faster than that of a conventional binary-search SAR ADC -- because the latter must wait for the settling time of the DAC inside the SAR ADC.
ER -