{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LVDEKTVLTNV7ULCBRJPWPBWTIY","short_pith_number":"pith:LVDEKTVL","schema_version":"1.0","canonical_sha256":"5d46454eab9b6bfa2c418a5f6786d346023933a25d377f55d48af9e8cdea76c0","source":{"kind":"arxiv","id":"1801.07571","version":2},"attestation_state":"computed","paper":{"title":"Joint Optimization of Bit and Power Loading for Multicarrier Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Ebrahim Bedeer, Kareem E. Baddour, Mohamed H. Ahmed, Octavia A. Dobre","submitted_at":"2018-01-12T17:01:07Z","abstract_excerpt":"In this letter, a novel low complexity bit and power loading algorithm is formulated for multicarrier communication systems. The proposed algorithm jointly maximizes the throughput and minimizes the transmit power through a weighting coefficient $\\alpha$, while meeting constraints on the target bit error rate (BER) per subcarrier and on the total transmit power. The optimization problem is solved by the Lagrangian multiplier method if the initial $\\alpha$ causes the transmit power not to violate the power constraint; otherwise, a bisection search is used to find the appropriate $\\alpha$. Close"},"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":"1801.07571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-12T17:01:07Z","cross_cats_sorted":[],"title_canon_sha256":"72fd7652da7a905078fa6214a2c4538c747e630993c79f8d4a0fbd8a3d9379b9","abstract_canon_sha256":"a1b485a475fa5feae6516b7230468070c8c384c0841f58bd79245cc70c41b508"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:11.622625Z","signature_b64":"jerPNhDX5SJQqVlpmu+60snyzVHiR/tQ8zmFjHspuerOlMDyXP6T0P2hE1dwDZEo4X6Y/RLv7HwDiQZCE6rcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d46454eab9b6bfa2c418a5f6786d346023933a25d377f55d48af9e8cdea76c0","last_reissued_at":"2026-05-17T23:54:11.622113Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:11.622113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Optimization of Bit and Power Loading for Multicarrier Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Ebrahim Bedeer, Kareem E. Baddour, Mohamed H. Ahmed, Octavia A. Dobre","submitted_at":"2018-01-12T17:01:07Z","abstract_excerpt":"In this letter, a novel low complexity bit and power loading algorithm is formulated for multicarrier communication systems. The proposed algorithm jointly maximizes the throughput and minimizes the transmit power through a weighting coefficient $\\alpha$, while meeting constraints on the target bit error rate (BER) per subcarrier and on the total transmit power. The optimization problem is solved by the Lagrangian multiplier method if the initial $\\alpha$ causes the transmit power not to violate the power constraint; otherwise, a bisection search is used to find the appropriate $\\alpha$. Close"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07571","kind":"arxiv","version":2},"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":"1801.07571","created_at":"2026-05-17T23:54:11.622201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07571v2","created_at":"2026-05-17T23:54:11.622201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07571","created_at":"2026-05-17T23:54:11.622201+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVDEKTVLTNV7","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVDEKTVLTNV7ULCB","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVDEKTVL","created_at":"2026-05-18T12:32:37.024351+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/LVDEKTVLTNV7ULCBRJPWPBWTIY","json":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY.json","graph_json":"https://pith.science/api/pith-number/LVDEKTVLTNV7ULCBRJPWPBWTIY/graph.json","events_json":"https://pith.science/api/pith-number/LVDEKTVLTNV7ULCBRJPWPBWTIY/events.json","paper":"https://pith.science/paper/LVDEKTVL"},"agent_actions":{"view_html":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY","download_json":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY.json","view_paper":"https://pith.science/paper/LVDEKTVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07571&json=true","fetch_graph":"https://pith.science/api/pith-number/LVDEKTVLTNV7ULCBRJPWPBWTIY/graph.json","fetch_events":"https://pith.science/api/pith-number/LVDEKTVLTNV7ULCBRJPWPBWTIY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY/action/storage_attestation","attest_author":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY/action/author_attestation","sign_citation":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY/action/citation_signature","submit_replication":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY/action/replication_record"}},"created_at":"2026-05-17T23:54:11.622201+00:00","updated_at":"2026-05-17T23:54:11.622201+00:00"}