{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5PGNRQ3UCWNFZU6M662HZKDY26","short_pith_number":"pith:5PGNRQ3U","schema_version":"1.0","canonical_sha256":"ebccd8c374159a5cd3ccf7b47ca878d79a76b094691f6d1745cd5e32a1e1a11a","source":{"kind":"arxiv","id":"1811.11102","version":1},"attestation_state":"computed","paper":{"title":"Maximal Entropy Reduction Algorithm for SAR ADC Clock Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"eess.SP","authors_text":"Arkady Molev-Shteiman, Xiao-Feng Qi","submitted_at":"2018-11-07T19:19:58Z","abstract_excerpt":"Reduction of comparison cycles leads to power savings of a successive-approximation-register (SAR) analog-to-digital converters (ADC). We establish that the lowest average number of comparison cycles of a SAR ADC approaches the entropy of the ADC output, and proposed a simple adaptive algorithm that approaches this lower bound. Today's SAR ADC uses binary search, which consumes more power than necessary for non-uniform input distributions commonly found in practice. We refer to a SAR ADC employing such algorithm the maximal entropy reduction (MER) ADC."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.11102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-07T19:19:58Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"1e6890490547d29d2b0c7128d17e06907980e7ff2ee2632ac6faf25bd1ba37a1","abstract_canon_sha256":"09bdbcd64fdb67f54198b6a3393e67c34e9881a5fd2fe5980559c2b8bd580e80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:45.256008Z","signature_b64":"/JE+2BWrPRQBueSAFoQqzSu/Vod8/p4QWCZeTZkpz1Rrfrb8k5SVlx4W++xYwOQfu1obGxIwh2pd29nsBVJRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebccd8c374159a5cd3ccf7b47ca878d79a76b094691f6d1745cd5e32a1e1a11a","last_reissued_at":"2026-05-17T23:59:45.255454Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:45.255454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal Entropy Reduction Algorithm for SAR ADC Clock Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"eess.SP","authors_text":"Arkady Molev-Shteiman, Xiao-Feng Qi","submitted_at":"2018-11-07T19:19:58Z","abstract_excerpt":"Reduction of comparison cycles leads to power savings of a successive-approximation-register (SAR) analog-to-digital converters (ADC). We establish that the lowest average number of comparison cycles of a SAR ADC approaches the entropy of the ADC output, and proposed a simple adaptive algorithm that approaches this lower bound. Today's SAR ADC uses binary search, which consumes more power than necessary for non-uniform input distributions commonly found in practice. We refer to a SAR ADC employing such algorithm the maximal entropy reduction (MER) ADC."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11102","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.11102","created_at":"2026-05-17T23:59:45.255554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11102v1","created_at":"2026-05-17T23:59:45.255554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11102","created_at":"2026-05-17T23:59:45.255554+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PGNRQ3UCWNF","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PGNRQ3UCWNFZU6M","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PGNRQ3U","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26","json":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26.json","graph_json":"https://pith.science/api/pith-number/5PGNRQ3UCWNFZU6M662HZKDY26/graph.json","events_json":"https://pith.science/api/pith-number/5PGNRQ3UCWNFZU6M662HZKDY26/events.json","paper":"https://pith.science/paper/5PGNRQ3U"},"agent_actions":{"view_html":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26","download_json":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26.json","view_paper":"https://pith.science/paper/5PGNRQ3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11102&json=true","fetch_graph":"https://pith.science/api/pith-number/5PGNRQ3UCWNFZU6M662HZKDY26/graph.json","fetch_events":"https://pith.science/api/pith-number/5PGNRQ3UCWNFZU6M662HZKDY26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26/action/storage_attestation","attest_author":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26/action/author_attestation","sign_citation":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26/action/citation_signature","submit_replication":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26/action/replication_record"}},"created_at":"2026-05-17T23:59:45.255554+00:00","updated_at":"2026-05-17T23:59:45.255554+00:00"}