{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MKWVIQF5UTGF2P4IUP7V6DNIYG","short_pith_number":"pith:MKWVIQF5","schema_version":"1.0","canonical_sha256":"62ad5440bda4cc5d3f88a3ff5f0da8c1a17f879b3443773cc0ff9bf3b18aa44b","source":{"kind":"arxiv","id":"2504.09233","version":1},"attestation_state":"computed","paper":{"title":"Complexity-Scalable Near-Optimal Transceiver Design for Massive MIMO-BICM Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Derrick Wing Kwan Ng, Giuseppe Caire, Jie Yang, Shuangyang Li, Wanchen Hu, Xin Wang, Yi Jiang","submitted_at":"2025-04-12T14:16:47Z","abstract_excerpt":"Future wireless networks are envisioned to employ multiple-input multiple-output (MIMO) transmissions with large array sizes, and therefore, the adoption of complexity-scalable transceiver becomes important. In this paper, we propose a novel complexity-scalable transceiver design for MIMO systems exploiting bit-interleaved coded modulation (termed MIMO-BICM systems). The proposed scheme leverages the channel bidiagonalization decomposition (CBD), based on which an optimization framework for the precoder and post-processor is developed for maximizing the mutual information (MI) with finite-alph"},"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":"2504.09233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-04-12T14:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"0b17a4a116b60a1470312b2e2b3a0f1c23a64bd371399e6d1624b7085b552b34","abstract_canon_sha256":"04fd9c26818b517f5680eb94151b31bbb12e6bb1e6997460fd7109a2f397d2e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:33.732538Z","signature_b64":"u1uRxmwoU6UWq09z51Rs6606N/vpOoh5E39wPG6qPI5k5PiPzWdh4b9lkh2PCbK0Z66uVqIht6Xvwce1UbLWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62ad5440bda4cc5d3f88a3ff5f0da8c1a17f879b3443773cc0ff9bf3b18aa44b","last_reissued_at":"2026-07-05T10:48:33.731963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:33.731963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity-Scalable Near-Optimal Transceiver Design for Massive MIMO-BICM Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Derrick Wing Kwan Ng, Giuseppe Caire, Jie Yang, Shuangyang Li, Wanchen Hu, Xin Wang, Yi Jiang","submitted_at":"2025-04-12T14:16:47Z","abstract_excerpt":"Future wireless networks are envisioned to employ multiple-input multiple-output (MIMO) transmissions with large array sizes, and therefore, the adoption of complexity-scalable transceiver becomes important. In this paper, we propose a novel complexity-scalable transceiver design for MIMO systems exploiting bit-interleaved coded modulation (termed MIMO-BICM systems). The proposed scheme leverages the channel bidiagonalization decomposition (CBD), based on which an optimization framework for the precoder and post-processor is developed for maximizing the mutual information (MI) with finite-alph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.09233","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.09233/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.09233","created_at":"2026-07-05T10:48:33.732035+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.09233v1","created_at":"2026-07-05T10:48:33.732035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.09233","created_at":"2026-07-05T10:48:33.732035+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKWVIQF5UTGF","created_at":"2026-07-05T10:48:33.732035+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKWVIQF5UTGF2P4I","created_at":"2026-07-05T10:48:33.732035+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKWVIQF5","created_at":"2026-07-05T10:48:33.732035+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/MKWVIQF5UTGF2P4IUP7V6DNIYG","json":"https://pith.science/pith/MKWVIQF5UTGF2P4IUP7V6DNIYG.json","graph_json":"https://pith.science/api/pith-number/MKWVIQF5UTGF2P4IUP7V6DNIYG/graph.json","events_json":"https://pith.science/api/pith-number/MKWVIQF5UTGF2P4IUP7V6DNIYG/events.json","paper":"https://pith.science/paper/MKWVIQF5"},"agent_actions":{"view_html":"https://pith.science/pith/MKWVIQF5UTGF2P4IUP7V6DNIYG","download_json":"https://pith.science/pith/MKWVIQF5UTGF2P4IUP7V6DNIYG.json","view_paper":"https://pith.science/paper/MKWVIQF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.09233&json=true","fetch_graph":"https://pith.science/api/pith-number/MKWVIQF5UTGF2P4IUP7V6DNIYG/graph.json","fetch_events":"https://pith.science/api/pith-number/MKWVIQF5UTGF2P4IUP7V6DNIYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKWVIQF5UTGF2P4IUP7V6DNIYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKWVIQF5UTGF2P4IUP7V6DNIYG/action/storage_attestation","attest_author":"https://pith.science/pith/MKWVIQF5UTGF2P4IUP7V6DNIYG/action/author_attestation","sign_citation":"https://pith.science/pith/MKWVIQF5UTGF2P4IUP7V6DNIYG/action/citation_signature","submit_replication":"https://pith.science/pith/MKWVIQF5UTGF2P4IUP7V6DNIYG/action/replication_record"}},"created_at":"2026-07-05T10:48:33.732035+00:00","updated_at":"2026-07-05T10:48:33.732035+00:00"}