{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QMUKALBV626Z32Q5BO5CFPPCOJ","short_pith_number":"pith:QMUKALBV","schema_version":"1.0","canonical_sha256":"8328a02c35f6bd9dea1d0bba22bde27276d53016765d38f0f747c2a1ec7bfb31","source":{"kind":"arxiv","id":"1111.0704","version":1},"attestation_state":"computed","paper":{"title":"Reduced-Latency SC Polar Decoder Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Bo Yuan, Chuan Zhang, Keshab K. Parhi","submitted_at":"2011-11-03T01:12:49Z","abstract_excerpt":"Polar codes have become one of the most favorable capacity achieving error correction codes (ECC) along with their simple encoding method. However, among the very few prior successive cancellation (SC) polar decoder designs, the required long code length makes the decoding latency high. In this paper, conventional decoding algorithm is transformed with look-ahead techniques. This reduces the decoding latency by 50%. With pipelining and parallel processing schemes, a parallel SC polar decoder is proposed. Sub-structure sharing approach is employed to design the merged processing element (PE). M"},"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":"1111.0704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2011-11-03T01:12:49Z","cross_cats_sorted":[],"title_canon_sha256":"342d9b33e785c1ed59b6ea4a68ab9ab4834e6f7e003c72f6b062b824fab9b3a0","abstract_canon_sha256":"ce0e41342c8a9dadf1ed032212079b2da6133bd73a925ec77266d7559dc8a1cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:37.101695Z","signature_b64":"abDfcyV4L9QKiQitGv+vtS1oXl6kfjZJsH5ka4Dx+UIGCjyW7L+Jw6SpOlEjGclA6ZV7QFtCcKCfqvlMpKr9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8328a02c35f6bd9dea1d0bba22bde27276d53016765d38f0f747c2a1ec7bfb31","last_reissued_at":"2026-05-18T04:09:37.101050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:37.101050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduced-Latency SC Polar Decoder Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Bo Yuan, Chuan Zhang, Keshab K. Parhi","submitted_at":"2011-11-03T01:12:49Z","abstract_excerpt":"Polar codes have become one of the most favorable capacity achieving error correction codes (ECC) along with their simple encoding method. However, among the very few prior successive cancellation (SC) polar decoder designs, the required long code length makes the decoding latency high. In this paper, conventional decoding algorithm is transformed with look-ahead techniques. This reduces the decoding latency by 50%. With pipelining and parallel processing schemes, a parallel SC polar decoder is proposed. Sub-structure sharing approach is employed to design the merged processing element (PE). M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0704","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":"1111.0704","created_at":"2026-05-18T04:09:37.101120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0704v1","created_at":"2026-05-18T04:09:37.101120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0704","created_at":"2026-05-18T04:09:37.101120+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMUKALBV626Z","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMUKALBV626Z32Q5","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMUKALBV","created_at":"2026-05-18T12:26:39.201973+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/QMUKALBV626Z32Q5BO5CFPPCOJ","json":"https://pith.science/pith/QMUKALBV626Z32Q5BO5CFPPCOJ.json","graph_json":"https://pith.science/api/pith-number/QMUKALBV626Z32Q5BO5CFPPCOJ/graph.json","events_json":"https://pith.science/api/pith-number/QMUKALBV626Z32Q5BO5CFPPCOJ/events.json","paper":"https://pith.science/paper/QMUKALBV"},"agent_actions":{"view_html":"https://pith.science/pith/QMUKALBV626Z32Q5BO5CFPPCOJ","download_json":"https://pith.science/pith/QMUKALBV626Z32Q5BO5CFPPCOJ.json","view_paper":"https://pith.science/paper/QMUKALBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0704&json=true","fetch_graph":"https://pith.science/api/pith-number/QMUKALBV626Z32Q5BO5CFPPCOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QMUKALBV626Z32Q5BO5CFPPCOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMUKALBV626Z32Q5BO5CFPPCOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMUKALBV626Z32Q5BO5CFPPCOJ/action/storage_attestation","attest_author":"https://pith.science/pith/QMUKALBV626Z32Q5BO5CFPPCOJ/action/author_attestation","sign_citation":"https://pith.science/pith/QMUKALBV626Z32Q5BO5CFPPCOJ/action/citation_signature","submit_replication":"https://pith.science/pith/QMUKALBV626Z32Q5BO5CFPPCOJ/action/replication_record"}},"created_at":"2026-05-18T04:09:37.101120+00:00","updated_at":"2026-05-18T04:09:37.101120+00:00"}