{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DB4QCI7ZPWAQEG47AKA4DTC5XB","short_pith_number":"pith:DB4QCI7Z","schema_version":"1.0","canonical_sha256":"18790123f97d81021b9f0281c1cc5db86652036632badbdd04e1892deb67b0e0","source":{"kind":"arxiv","id":"1702.02634","version":1},"attestation_state":"computed","paper":{"title":"Precoding for the Sparsely Spread MC-CDMA Downlink with Discrete-Alphabet Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunshan Liu, Min Li, Stephen V. Hanly","submitted_at":"2017-02-08T22:04:50Z","abstract_excerpt":"Sparse signatures have been proposed for the CDMA uplink to reduce multi-user detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this work, we propose a Multi-Carrier CDMA (MC-CDMA) downlink communication, where regular sparse signatures are deployed in the frequency domain. Taking the symbol detection point of view, we formulate a problem appropriate for the downlink with discrete alphabets as inputs. The solution to the problem provides a power-efficient precoding algorithm for the base station, subject to minimum symbol error probability (SEP) "},"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":"1702.02634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T22:04:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be159fb02180d8cf1b826becd648aac4093ffc92b888c9c149f421b5e86f48d1","abstract_canon_sha256":"1ec5de6abe2cb6ca23d8a61f8fbbe58b0ec928070fdf1662c3b32aaf958b9016"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:03.831533Z","signature_b64":"3WfLwQq5pFQD8R2LT8LoP1AG0smjwgktyQQq7VACJ/kaPCECV+uftxsYCgILqetyZHy/1LF0SHC72J3gac/ACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18790123f97d81021b9f0281c1cc5db86652036632badbdd04e1892deb67b0e0","last_reissued_at":"2026-05-18T00:51:03.831134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:03.831134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Precoding for the Sparsely Spread MC-CDMA Downlink with Discrete-Alphabet Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunshan Liu, Min Li, Stephen V. Hanly","submitted_at":"2017-02-08T22:04:50Z","abstract_excerpt":"Sparse signatures have been proposed for the CDMA uplink to reduce multi-user detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this work, we propose a Multi-Carrier CDMA (MC-CDMA) downlink communication, where regular sparse signatures are deployed in the frequency domain. Taking the symbol detection point of view, we formulate a problem appropriate for the downlink with discrete alphabets as inputs. The solution to the problem provides a power-efficient precoding algorithm for the base station, subject to minimum symbol error probability (SEP) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02634","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":"1702.02634","created_at":"2026-05-18T00:51:03.831194+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02634v1","created_at":"2026-05-18T00:51:03.831194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02634","created_at":"2026-05-18T00:51:03.831194+00:00"},{"alias_kind":"pith_short_12","alias_value":"DB4QCI7ZPWAQ","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DB4QCI7ZPWAQEG47","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DB4QCI7Z","created_at":"2026-05-18T12:31:10.602751+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/DB4QCI7ZPWAQEG47AKA4DTC5XB","json":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB.json","graph_json":"https://pith.science/api/pith-number/DB4QCI7ZPWAQEG47AKA4DTC5XB/graph.json","events_json":"https://pith.science/api/pith-number/DB4QCI7ZPWAQEG47AKA4DTC5XB/events.json","paper":"https://pith.science/paper/DB4QCI7Z"},"agent_actions":{"view_html":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB","download_json":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB.json","view_paper":"https://pith.science/paper/DB4QCI7Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02634&json=true","fetch_graph":"https://pith.science/api/pith-number/DB4QCI7ZPWAQEG47AKA4DTC5XB/graph.json","fetch_events":"https://pith.science/api/pith-number/DB4QCI7ZPWAQEG47AKA4DTC5XB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB/action/storage_attestation","attest_author":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB/action/author_attestation","sign_citation":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB/action/citation_signature","submit_replication":"https://pith.science/pith/DB4QCI7ZPWAQEG47AKA4DTC5XB/action/replication_record"}},"created_at":"2026-05-18T00:51:03.831194+00:00","updated_at":"2026-05-18T00:51:03.831194+00:00"}