{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N3AYLO7CITIZCHYQPFB6OVHD7T","short_pith_number":"pith:N3AYLO7C","schema_version":"1.0","canonical_sha256":"6ec185bbe244d1911f107943e754e3fcfadd99afed1ddf3921a738a0bb7a5dc9","source":{"kind":"arxiv","id":"1709.10396","version":1},"attestation_state":"computed","paper":{"title":"Analysis and Design of Cost-Effective, High-Throughput LDPC Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"eess.SP","authors_text":"David Declercq, Fakhreddine Ghaffari, Khoa Le, Oana Boncalo, Thien Truong Nguyen-Ly, Valentin Savin","submitted_at":"2017-08-23T09:42:17Z","abstract_excerpt":"This paper introduces a new approach to cost-effective, high-throughput hardware designs for Low Density Parity Check (LDPC) decoders. The proposed approach, called Non-Surjective Finite Alphabet Iterative Decoders (NS-FAIDs), exploits the robustness of message-passing LDPC decoders to inaccuracies in the calculation of exchanged messages, and it is shown to provide a unified framework for several designs previously proposed in the literature. NS-FAIDs are optimized by density evolution for regular and irregular LDPC codes, and are shown to provide different trade-offs between hardware complex"},"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":"1709.10396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-08-23T09:42:17Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"9c91bc56eafebd8d6f7eaa0d9c11a1ff5ee5a780b43f5b15065321f568dff1e7","abstract_canon_sha256":"440f4a586bfe3833477ea5288d760770f0e18a8be9547001d6de1fe120e2f625"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:01.208069Z","signature_b64":"mh2kQcrras+RmS/UN7qgrWt3w/muIgGJYuBKFBwJJJqjutFhPAU+9ULV7VYAgMOuY38khEzBpYRg6WKgyLHQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ec185bbe244d1911f107943e754e3fcfadd99afed1ddf3921a738a0bb7a5dc9","last_reissued_at":"2026-05-18T00:34:01.207326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:01.207326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis and Design of Cost-Effective, High-Throughput LDPC Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"eess.SP","authors_text":"David Declercq, Fakhreddine Ghaffari, Khoa Le, Oana Boncalo, Thien Truong Nguyen-Ly, Valentin Savin","submitted_at":"2017-08-23T09:42:17Z","abstract_excerpt":"This paper introduces a new approach to cost-effective, high-throughput hardware designs for Low Density Parity Check (LDPC) decoders. The proposed approach, called Non-Surjective Finite Alphabet Iterative Decoders (NS-FAIDs), exploits the robustness of message-passing LDPC decoders to inaccuracies in the calculation of exchanged messages, and it is shown to provide a unified framework for several designs previously proposed in the literature. NS-FAIDs are optimized by density evolution for regular and irregular LDPC codes, and are shown to provide different trade-offs between hardware complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10396","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":"1709.10396","created_at":"2026-05-18T00:34:01.207439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.10396v1","created_at":"2026-05-18T00:34:01.207439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10396","created_at":"2026-05-18T00:34:01.207439+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3AYLO7CITIZ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3AYLO7CITIZCHYQ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3AYLO7C","created_at":"2026-05-18T12:31:31.346846+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/N3AYLO7CITIZCHYQPFB6OVHD7T","json":"https://pith.science/pith/N3AYLO7CITIZCHYQPFB6OVHD7T.json","graph_json":"https://pith.science/api/pith-number/N3AYLO7CITIZCHYQPFB6OVHD7T/graph.json","events_json":"https://pith.science/api/pith-number/N3AYLO7CITIZCHYQPFB6OVHD7T/events.json","paper":"https://pith.science/paper/N3AYLO7C"},"agent_actions":{"view_html":"https://pith.science/pith/N3AYLO7CITIZCHYQPFB6OVHD7T","download_json":"https://pith.science/pith/N3AYLO7CITIZCHYQPFB6OVHD7T.json","view_paper":"https://pith.science/paper/N3AYLO7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.10396&json=true","fetch_graph":"https://pith.science/api/pith-number/N3AYLO7CITIZCHYQPFB6OVHD7T/graph.json","fetch_events":"https://pith.science/api/pith-number/N3AYLO7CITIZCHYQPFB6OVHD7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3AYLO7CITIZCHYQPFB6OVHD7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3AYLO7CITIZCHYQPFB6OVHD7T/action/storage_attestation","attest_author":"https://pith.science/pith/N3AYLO7CITIZCHYQPFB6OVHD7T/action/author_attestation","sign_citation":"https://pith.science/pith/N3AYLO7CITIZCHYQPFB6OVHD7T/action/citation_signature","submit_replication":"https://pith.science/pith/N3AYLO7CITIZCHYQPFB6OVHD7T/action/replication_record"}},"created_at":"2026-05-18T00:34:01.207439+00:00","updated_at":"2026-05-18T00:34:01.207439+00:00"}