{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZVCUOMMJ4PMLTSAZH63L5DZXNI","short_pith_number":"pith:ZVCUOMMJ","schema_version":"1.0","canonical_sha256":"cd45473189e3d8b9c8193fb6be8f376a0490be3f6cd7562522ac9a307d79e78e","source":{"kind":"arxiv","id":"1101.2249","version":1},"attestation_state":"computed","paper":{"title":"Fixed-complexity Sphere Encoder for Multi-user MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"KyungHi Chang, Manar Mohaisen","submitted_at":"2011-01-12T01:17:45Z","abstract_excerpt":"In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user MIMO (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a 4 by 4 MU-MIMO system, the proposed FSE requires only 11.5% of the computational complexi"},"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":"1101.2249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-12T01:17:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"02e3e2a7fe00f65cedea135bd84ab002f11b9c602b63bcbbcfbcdd9723561951","abstract_canon_sha256":"a381806399565b177fe79cd0fb978c0e16d9e3e37a6b7b0cafcbc6a8e4a9dc59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:58.506622Z","signature_b64":"Yd13VHkXU2QntInUlTn+f98SjjBJGBsT5Lkm8XrGCe51sSOY+KikGEbAYOpfPvmkXVpFBQUE5rhiBk9nh+CTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd45473189e3d8b9c8193fb6be8f376a0490be3f6cd7562522ac9a307d79e78e","last_reissued_at":"2026-05-18T02:22:58.505641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:58.505641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-complexity Sphere Encoder for Multi-user MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"KyungHi Chang, Manar Mohaisen","submitted_at":"2011-01-12T01:17:45Z","abstract_excerpt":"In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user MIMO (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a 4 by 4 MU-MIMO system, the proposed FSE requires only 11.5% of the computational complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2249","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":"1101.2249","created_at":"2026-05-18T02:22:58.505799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2249v1","created_at":"2026-05-18T02:22:58.505799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2249","created_at":"2026-05-18T02:22:58.505799+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVCUOMMJ4PML","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVCUOMMJ4PMLTSAZ","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVCUOMMJ","created_at":"2026-05-18T12:26:50.516681+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/ZVCUOMMJ4PMLTSAZH63L5DZXNI","json":"https://pith.science/pith/ZVCUOMMJ4PMLTSAZH63L5DZXNI.json","graph_json":"https://pith.science/api/pith-number/ZVCUOMMJ4PMLTSAZH63L5DZXNI/graph.json","events_json":"https://pith.science/api/pith-number/ZVCUOMMJ4PMLTSAZH63L5DZXNI/events.json","paper":"https://pith.science/paper/ZVCUOMMJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZVCUOMMJ4PMLTSAZH63L5DZXNI","download_json":"https://pith.science/pith/ZVCUOMMJ4PMLTSAZH63L5DZXNI.json","view_paper":"https://pith.science/paper/ZVCUOMMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2249&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVCUOMMJ4PMLTSAZH63L5DZXNI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVCUOMMJ4PMLTSAZH63L5DZXNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVCUOMMJ4PMLTSAZH63L5DZXNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVCUOMMJ4PMLTSAZH63L5DZXNI/action/storage_attestation","attest_author":"https://pith.science/pith/ZVCUOMMJ4PMLTSAZH63L5DZXNI/action/author_attestation","sign_citation":"https://pith.science/pith/ZVCUOMMJ4PMLTSAZH63L5DZXNI/action/citation_signature","submit_replication":"https://pith.science/pith/ZVCUOMMJ4PMLTSAZH63L5DZXNI/action/replication_record"}},"created_at":"2026-05-18T02:22:58.505799+00:00","updated_at":"2026-05-18T02:22:58.505799+00:00"}