{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3OGUYHWVFWAKCRWSCBFEBL2YSO","short_pith_number":"pith:3OGUYHWV","schema_version":"1.0","canonical_sha256":"db8d4c1ed52d80a146d2104a40af5893a3415dd0596d2350d2d292dad7fd0f21","source":{"kind":"arxiv","id":"1507.02954","version":3},"attestation_state":"computed","paper":{"title":"An Iterative Receiver for OFDM With Sparsity-Based Parametric Channel Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Bernard H. Fleury, Mihai-Alin Badiu, Peter B. J{\\o}rgensen, Thomas L. Hansen","submitted_at":"2015-07-10T16:19:21Z","abstract_excerpt":"In this work we design a receiver that iteratively passes soft information between the channel estimation and data decoding stages. The receiver incorporates sparsity-based parametric channel estimation. State-of-the-art sparsity-based iterative receivers simplify the channel estimation problem by restricting the multipath delays to a grid. Our receiver does not impose such a restriction. As a result it does not suffer from the leakage effect, which destroys sparsity. Communication at near capacity rates in high SNR requires a large modulation order. Due to the close proximity of modulation sy"},"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":"1507.02954","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T16:19:21Z","cross_cats_sorted":["eess.SP","math.IT","stat.AP"],"title_canon_sha256":"4e8d382e311bc41538c2c126aea9c6481421b5a52275c54bc70345b6cbee5dce","abstract_canon_sha256":"379e0753da4f7f7d05ce7ef85d3a90dc6bb6b15d789fce8a512018aaf90fedef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:34.829666Z","signature_b64":"ZA2wg8rwmkUreRaC/jmXn9JhmGzgzJmzpAdSEC84vUjBAWt5aIDaPMnrXY4aS8nxR39ckcfrbfCP52lGxEdfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db8d4c1ed52d80a146d2104a40af5893a3415dd0596d2350d2d292dad7fd0f21","last_reissued_at":"2026-05-18T00:05:34.829168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:34.829168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Iterative Receiver for OFDM With Sparsity-Based Parametric Channel Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Bernard H. Fleury, Mihai-Alin Badiu, Peter B. J{\\o}rgensen, Thomas L. Hansen","submitted_at":"2015-07-10T16:19:21Z","abstract_excerpt":"In this work we design a receiver that iteratively passes soft information between the channel estimation and data decoding stages. The receiver incorporates sparsity-based parametric channel estimation. State-of-the-art sparsity-based iterative receivers simplify the channel estimation problem by restricting the multipath delays to a grid. Our receiver does not impose such a restriction. As a result it does not suffer from the leakage effect, which destroys sparsity. Communication at near capacity rates in high SNR requires a large modulation order. Due to the close proximity of modulation sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02954","kind":"arxiv","version":3},"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":"1507.02954","created_at":"2026-05-18T00:05:34.829244+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02954v3","created_at":"2026-05-18T00:05:34.829244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02954","created_at":"2026-05-18T00:05:34.829244+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OGUYHWVFWAK","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OGUYHWVFWAKCRWS","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OGUYHWV","created_at":"2026-05-18T12:29:02.477457+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/3OGUYHWVFWAKCRWSCBFEBL2YSO","json":"https://pith.science/pith/3OGUYHWVFWAKCRWSCBFEBL2YSO.json","graph_json":"https://pith.science/api/pith-number/3OGUYHWVFWAKCRWSCBFEBL2YSO/graph.json","events_json":"https://pith.science/api/pith-number/3OGUYHWVFWAKCRWSCBFEBL2YSO/events.json","paper":"https://pith.science/paper/3OGUYHWV"},"agent_actions":{"view_html":"https://pith.science/pith/3OGUYHWVFWAKCRWSCBFEBL2YSO","download_json":"https://pith.science/pith/3OGUYHWVFWAKCRWSCBFEBL2YSO.json","view_paper":"https://pith.science/paper/3OGUYHWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02954&json=true","fetch_graph":"https://pith.science/api/pith-number/3OGUYHWVFWAKCRWSCBFEBL2YSO/graph.json","fetch_events":"https://pith.science/api/pith-number/3OGUYHWVFWAKCRWSCBFEBL2YSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OGUYHWVFWAKCRWSCBFEBL2YSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OGUYHWVFWAKCRWSCBFEBL2YSO/action/storage_attestation","attest_author":"https://pith.science/pith/3OGUYHWVFWAKCRWSCBFEBL2YSO/action/author_attestation","sign_citation":"https://pith.science/pith/3OGUYHWVFWAKCRWSCBFEBL2YSO/action/citation_signature","submit_replication":"https://pith.science/pith/3OGUYHWVFWAKCRWSCBFEBL2YSO/action/replication_record"}},"created_at":"2026-05-18T00:05:34.829244+00:00","updated_at":"2026-05-18T00:05:34.829244+00:00"}