{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VPTL254EAL5N7FRKYSYNFLYMJW","short_pith_number":"pith:VPTL254E","schema_version":"1.0","canonical_sha256":"abe6bd778402fadf962ac4b0d2af0c4d9bbd6cdadc2c63b32724ef21d29d36d3","source":{"kind":"arxiv","id":"1506.00330","version":1},"attestation_state":"computed","paper":{"title":"Signaling Design of Two-Way MIMO Full-Duplex Channel: Optimality Under Imperfect Transmit Front-End Chain","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behnaam Aazhang, Shuqiao Jia","submitted_at":"2015-06-01T02:37:33Z","abstract_excerpt":"We derive the optimal signaling for a multiple input multiple output (MIMO) full-duplex two-way channel under the imperfect transmit front-end chain. We characterize the two-way rates of the channel by using a game-theoretical approach, where we focus on the Pareto boundary of the achievable rate region and Nash equilibia (NE). For a MISO full-duplex two-way channel, we prove that beamforming is an optimal transmission strategy which can achieve any point on the Pareto boundary. Furthermore, we present a closed-form expression for the optimal beamforming weights. In our numerical examples we q"},"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":"1506.00330","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2015-06-01T02:37:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d9a78171378a15613794589375dce84f6835db41b39e0962be08536846d2bb88","abstract_canon_sha256":"657a422b581c009e2e3d13d11721c4b4369d3a22de2730819c7b8e8e970745b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:54.804828Z","signature_b64":"YvmLQKkNAtOeR/z9NQSZSKq7ARZRkh/Om09ZPidS4QYMFVPCvf2ClIOJrzM8+ZiVTXIj+iKz8sVtQE8jZQvHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abe6bd778402fadf962ac4b0d2af0c4d9bbd6cdadc2c63b32724ef21d29d36d3","last_reissued_at":"2026-05-18T01:59:54.804387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:54.804387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Signaling Design of Two-Way MIMO Full-Duplex Channel: Optimality Under Imperfect Transmit Front-End Chain","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behnaam Aazhang, Shuqiao Jia","submitted_at":"2015-06-01T02:37:33Z","abstract_excerpt":"We derive the optimal signaling for a multiple input multiple output (MIMO) full-duplex two-way channel under the imperfect transmit front-end chain. We characterize the two-way rates of the channel by using a game-theoretical approach, where we focus on the Pareto boundary of the achievable rate region and Nash equilibia (NE). For a MISO full-duplex two-way channel, we prove that beamforming is an optimal transmission strategy which can achieve any point on the Pareto boundary. Furthermore, we present a closed-form expression for the optimal beamforming weights. In our numerical examples we q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00330","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":"1506.00330","created_at":"2026-05-18T01:59:54.804451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00330v1","created_at":"2026-05-18T01:59:54.804451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00330","created_at":"2026-05-18T01:59:54.804451+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPTL254EAL5N","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPTL254EAL5N7FRK","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPTL254E","created_at":"2026-05-18T12:29:47.479230+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/VPTL254EAL5N7FRKYSYNFLYMJW","json":"https://pith.science/pith/VPTL254EAL5N7FRKYSYNFLYMJW.json","graph_json":"https://pith.science/api/pith-number/VPTL254EAL5N7FRKYSYNFLYMJW/graph.json","events_json":"https://pith.science/api/pith-number/VPTL254EAL5N7FRKYSYNFLYMJW/events.json","paper":"https://pith.science/paper/VPTL254E"},"agent_actions":{"view_html":"https://pith.science/pith/VPTL254EAL5N7FRKYSYNFLYMJW","download_json":"https://pith.science/pith/VPTL254EAL5N7FRKYSYNFLYMJW.json","view_paper":"https://pith.science/paper/VPTL254E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00330&json=true","fetch_graph":"https://pith.science/api/pith-number/VPTL254EAL5N7FRKYSYNFLYMJW/graph.json","fetch_events":"https://pith.science/api/pith-number/VPTL254EAL5N7FRKYSYNFLYMJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPTL254EAL5N7FRKYSYNFLYMJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPTL254EAL5N7FRKYSYNFLYMJW/action/storage_attestation","attest_author":"https://pith.science/pith/VPTL254EAL5N7FRKYSYNFLYMJW/action/author_attestation","sign_citation":"https://pith.science/pith/VPTL254EAL5N7FRKYSYNFLYMJW/action/citation_signature","submit_replication":"https://pith.science/pith/VPTL254EAL5N7FRKYSYNFLYMJW/action/replication_record"}},"created_at":"2026-05-18T01:59:54.804451+00:00","updated_at":"2026-05-18T01:59:54.804451+00:00"}