{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:X3A4MVGWN64YKEEUBVFPRNDGFV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3acb409300cbf0f90bdbaba14920ae3696835678698fbd891d8c9eec7d1376ad","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-15T05:55:41Z","title_canon_sha256":"b386e1d6551b5070531c59d908747072a96db4461ec211ca5f986ad19cc1ce20"},"schema_version":"1.0","source":{"id":"0809.2446","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.2446","created_at":"2026-05-18T02:15:34Z"},{"alias_kind":"arxiv_version","alias_value":"0809.2446v3","created_at":"2026-05-18T02:15:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.2446","created_at":"2026-05-18T02:15:34Z"},{"alias_kind":"pith_short_12","alias_value":"X3A4MVGWN64Y","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"X3A4MVGWN64YKEEU","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"X3A4MVGW","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:6cef2bf62a349ba716916f7f631b5650163102946b467e62c4f9a07bbf7bc7e5","target":"graph","created_at":"2026-05-18T02:15:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we present a low-complexity algorithm for detection in high-rate, non-orthogonal space-time block coded (STBC) large-MIMO systems that achieve high spectral efficiencies of the order of tens of bps/Hz. We also present a training-based iterative detection/channel estimation scheme for such large STBC MIMO systems. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed multistage likelihood ascent search (M-LAS) detector in conjunction with the proposed iterative detection/channel estimation scheme at low complex","authors_text":"A. Chockalingam, Ahmed Zaki, B. Sundar Rajan, Saif K. Mohammed","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-15T05:55:41Z","title":"High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Channel Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.2446","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:40a6eca1921356a406aa21fb748dcbc5419778efb6f97a827a40ee6e624a9b14","target":"record","created_at":"2026-05-18T02:15:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3acb409300cbf0f90bdbaba14920ae3696835678698fbd891d8c9eec7d1376ad","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-15T05:55:41Z","title_canon_sha256":"b386e1d6551b5070531c59d908747072a96db4461ec211ca5f986ad19cc1ce20"},"schema_version":"1.0","source":{"id":"0809.2446","kind":"arxiv","version":3}},"canonical_sha256":"bec1c654d66fb98510940d4af8b4662d7aec3d8e0e2fac8c4e6c648398fe374f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bec1c654d66fb98510940d4af8b4662d7aec3d8e0e2fac8c4e6c648398fe374f","first_computed_at":"2026-05-18T02:15:34.646231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:15:34.646231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZOZ1JQb9LmTgDaclN3bmbHIrMI1DsUy7TxziugFDQ/jDBiBt5x2Cyqd9kPvNvxEr8cKhrmlykAerz0a8SXFsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:15:34.646867Z","signed_message":"canonical_sha256_bytes"},"source_id":"0809.2446","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40a6eca1921356a406aa21fb748dcbc5419778efb6f97a827a40ee6e624a9b14","sha256:6cef2bf62a349ba716916f7f631b5650163102946b467e62c4f9a07bbf7bc7e5"],"state_sha256":"5ecec647ccd367942840220202f4d1d378c80e2370f47ccd685c65a66d3654c4"}