{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:CZMYJDJG74QG7256KNH5PCXRAI","short_pith_number":"pith:CZMYJDJG","schema_version":"1.0","canonical_sha256":"1659848d26ff206febbe534fd78af1020a690cb253b60f7b4f4678221dd7bfa9","source":{"kind":"arxiv","id":"0806.2198","version":1},"attestation_state":"computed","paper":{"title":"Capacity-achieving CPM schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alberto Perotti, Alberto Tarable, Guido Montorsi, Sergio Benedetto","submitted_at":"2008-06-13T07:40:35Z","abstract_excerpt":"The pragmatic approach to coded continuous-phase modulation (CPM) is proposed as a capacity-achieving low-complexity alternative to the serially-concatenated CPM (SC-CPM) coding scheme. In this paper, we first perform a selection of the best spectrally-efficient CPM modulations to be embedded into SC-CPM schemes. Then, we consider the pragmatic capacity (a.k.a. BICM capacity) of CPM modulations and optimize it through a careful design of the mapping between input bits and CPM waveforms. The so obtained schemes are cascaded with an outer serially-concatenated convolutional code to form a pragma"},"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":"0806.2198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-06-13T07:40:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"665e1a7a779df9d55bb9bdea70eff7e97c82d1c87ea871829d2d477e4b7fb77c","abstract_canon_sha256":"43c303b22be0e7f2efbaf53d44f5700c2979ea6ef1be6c63ee219abe1bd27a5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.542962Z","signature_b64":"r1YgufMUbE/qI7142JWDdnGxR8oQRMWH0q1tH8qZk46qOoS8/bZp4zrrcfJ+hLu/R5MKXl9jlm5WtuxvoRFjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1659848d26ff206febbe534fd78af1020a690cb253b60f7b4f4678221dd7bfa9","last_reissued_at":"2026-05-18T00:58:25.542271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.542271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity-achieving CPM schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alberto Perotti, Alberto Tarable, Guido Montorsi, Sergio Benedetto","submitted_at":"2008-06-13T07:40:35Z","abstract_excerpt":"The pragmatic approach to coded continuous-phase modulation (CPM) is proposed as a capacity-achieving low-complexity alternative to the serially-concatenated CPM (SC-CPM) coding scheme. In this paper, we first perform a selection of the best spectrally-efficient CPM modulations to be embedded into SC-CPM schemes. Then, we consider the pragmatic capacity (a.k.a. BICM capacity) of CPM modulations and optimize it through a careful design of the mapping between input bits and CPM waveforms. The so obtained schemes are cascaded with an outer serially-concatenated convolutional code to form a pragma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.2198","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":"0806.2198","created_at":"2026-05-18T00:58:25.542385+00:00"},{"alias_kind":"arxiv_version","alias_value":"0806.2198v1","created_at":"2026-05-18T00:58:25.542385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.2198","created_at":"2026-05-18T00:58:25.542385+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZMYJDJG74QG","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZMYJDJG74QG7256","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZMYJDJG","created_at":"2026-05-18T12:25:57.157939+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/CZMYJDJG74QG7256KNH5PCXRAI","json":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI.json","graph_json":"https://pith.science/api/pith-number/CZMYJDJG74QG7256KNH5PCXRAI/graph.json","events_json":"https://pith.science/api/pith-number/CZMYJDJG74QG7256KNH5PCXRAI/events.json","paper":"https://pith.science/paper/CZMYJDJG"},"agent_actions":{"view_html":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI","download_json":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI.json","view_paper":"https://pith.science/paper/CZMYJDJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0806.2198&json=true","fetch_graph":"https://pith.science/api/pith-number/CZMYJDJG74QG7256KNH5PCXRAI/graph.json","fetch_events":"https://pith.science/api/pith-number/CZMYJDJG74QG7256KNH5PCXRAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI/action/storage_attestation","attest_author":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI/action/author_attestation","sign_citation":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI/action/citation_signature","submit_replication":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI/action/replication_record"}},"created_at":"2026-05-18T00:58:25.542385+00:00","updated_at":"2026-05-18T00:58:25.542385+00:00"}