{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TR4WFNBTRDCBLMH5ZPTII74KVL","short_pith_number":"pith:TR4WFNBT","schema_version":"1.0","canonical_sha256":"9c7962b43388c415b0fdcbe6847f8aaac27654a30ef63af3b06ce138fab2b49e","source":{"kind":"arxiv","id":"1103.5542","version":2},"attestation_state":"computed","paper":{"title":"Sparsity Enhanced Decision Feedback Equalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jovana Ilic, Thomas Strohmer","submitted_at":"2011-03-29T04:33:44Z","abstract_excerpt":"For single-carrier systems with frequency domain equalization, decision feedback equalization (DFE) performs better than linear equalization and has much lower computational complexity than sequence maximum likelihood detection. The main challenge in DFE is the feedback symbol selection rule. In this paper, we give a theoretical framework for a simple, sparsity based thresholding algorithm. We feed back multiple symbols in each iteration, so the algorithm converges fast and has a low computational cost. We show how the initial solution can be obtained via convex relaxation instead of linear eq"},"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":"1103.5542","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-29T04:33:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d99790940cbffc107468c173d078ae89d9e71929417455b9bf8ccc02a3af39fc","abstract_canon_sha256":"2edd23b3e4f220b9c3effb3fe0c9bfa815f9df6bd3997dc07e481600bf5cffaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:43.712104Z","signature_b64":"lNYbKeheCN1MXLfEk7Ey8GpGGfABO674wwJuyssbV4RgGbPjkYPO5MZWIwQZ/wV1Wq1prlrgkM0mD96uD5SjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c7962b43388c415b0fdcbe6847f8aaac27654a30ef63af3b06ce138fab2b49e","last_reissued_at":"2026-05-18T02:02:43.711432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:43.711432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsity Enhanced Decision Feedback Equalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jovana Ilic, Thomas Strohmer","submitted_at":"2011-03-29T04:33:44Z","abstract_excerpt":"For single-carrier systems with frequency domain equalization, decision feedback equalization (DFE) performs better than linear equalization and has much lower computational complexity than sequence maximum likelihood detection. The main challenge in DFE is the feedback symbol selection rule. In this paper, we give a theoretical framework for a simple, sparsity based thresholding algorithm. We feed back multiple symbols in each iteration, so the algorithm converges fast and has a low computational cost. We show how the initial solution can be obtained via convex relaxation instead of linear eq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5542","kind":"arxiv","version":2},"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":"1103.5542","created_at":"2026-05-18T02:02:43.711533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5542v2","created_at":"2026-05-18T02:02:43.711533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5542","created_at":"2026-05-18T02:02:43.711533+00:00"},{"alias_kind":"pith_short_12","alias_value":"TR4WFNBTRDCB","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TR4WFNBTRDCBLMH5","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TR4WFNBT","created_at":"2026-05-18T12:26:42.757692+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/TR4WFNBTRDCBLMH5ZPTII74KVL","json":"https://pith.science/pith/TR4WFNBTRDCBLMH5ZPTII74KVL.json","graph_json":"https://pith.science/api/pith-number/TR4WFNBTRDCBLMH5ZPTII74KVL/graph.json","events_json":"https://pith.science/api/pith-number/TR4WFNBTRDCBLMH5ZPTII74KVL/events.json","paper":"https://pith.science/paper/TR4WFNBT"},"agent_actions":{"view_html":"https://pith.science/pith/TR4WFNBTRDCBLMH5ZPTII74KVL","download_json":"https://pith.science/pith/TR4WFNBTRDCBLMH5ZPTII74KVL.json","view_paper":"https://pith.science/paper/TR4WFNBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5542&json=true","fetch_graph":"https://pith.science/api/pith-number/TR4WFNBTRDCBLMH5ZPTII74KVL/graph.json","fetch_events":"https://pith.science/api/pith-number/TR4WFNBTRDCBLMH5ZPTII74KVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TR4WFNBTRDCBLMH5ZPTII74KVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TR4WFNBTRDCBLMH5ZPTII74KVL/action/storage_attestation","attest_author":"https://pith.science/pith/TR4WFNBTRDCBLMH5ZPTII74KVL/action/author_attestation","sign_citation":"https://pith.science/pith/TR4WFNBTRDCBLMH5ZPTII74KVL/action/citation_signature","submit_replication":"https://pith.science/pith/TR4WFNBTRDCBLMH5ZPTII74KVL/action/replication_record"}},"created_at":"2026-05-18T02:02:43.711533+00:00","updated_at":"2026-05-18T02:02:43.711533+00:00"}