{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:TF6FAT5TXME7K2YL5HXUZ7LGI4","short_pith_number":"pith:TF6FAT5T","schema_version":"1.0","canonical_sha256":"997c504fb3bb09f56b0be9ef4cfd66473ea804300de13054654d279ef53a489d","source":{"kind":"arxiv","id":"0704.2452","version":1},"attestation_state":"computed","paper":{"title":"Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masoud Ardakani, Raman Yazdani","submitted_at":"2007-04-19T02:22:52Z","abstract_excerpt":"On a fading channel with no channel state information at the receiver, calculating true log-likelihood ratios (LLR) is complicated. Existing work assume that the power of the additive noise is known and use the expected value of the fading gain in a linear function of the channel output to find approximate LLRs. In this work, we first assume that the power of the additive noise is known and we find the optimum linear approximation of LLRs in the sense of maximum achievable transmission rate on the channel. The maximum achievable rate under this linear LLR calculation is almost equal to the max"},"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":"0704.2452","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-19T02:22:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"29edd9263e468ee895e1535f26b47a8741fec6583b9ed993f196bd37baa38d99","abstract_canon_sha256":"b8bc152a7951ed9f28087bd621c3274f779cb2b8b9f8872de04919363d4f0dae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:53.953355Z","signature_b64":"zKanZyeE6m84xYUGLf8VVKVj5sRT6l9jfpVJHG4ZHddVfC3yQqvgo013MQ3CQ6imm07QB7vi9Ahax9+Z/Nu0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"997c504fb3bb09f56b0be9ef4cfd66473ea804300de13054654d279ef53a489d","last_reissued_at":"2026-05-18T03:57:53.952624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:53.952624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masoud Ardakani, Raman Yazdani","submitted_at":"2007-04-19T02:22:52Z","abstract_excerpt":"On a fading channel with no channel state information at the receiver, calculating true log-likelihood ratios (LLR) is complicated. Existing work assume that the power of the additive noise is known and use the expected value of the fading gain in a linear function of the channel output to find approximate LLRs. In this work, we first assume that the power of the additive noise is known and we find the optimum linear approximation of LLRs in the sense of maximum achievable transmission rate on the channel. The maximum achievable rate under this linear LLR calculation is almost equal to the max"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.2452","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":"0704.2452","created_at":"2026-05-18T03:57:53.952760+00:00"},{"alias_kind":"arxiv_version","alias_value":"0704.2452v1","created_at":"2026-05-18T03:57:53.952760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.2452","created_at":"2026-05-18T03:57:53.952760+00:00"},{"alias_kind":"pith_short_12","alias_value":"TF6FAT5TXME7","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"TF6FAT5TXME7K2YL","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"TF6FAT5T","created_at":"2026-05-18T12:25:56.245647+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/TF6FAT5TXME7K2YL5HXUZ7LGI4","json":"https://pith.science/pith/TF6FAT5TXME7K2YL5HXUZ7LGI4.json","graph_json":"https://pith.science/api/pith-number/TF6FAT5TXME7K2YL5HXUZ7LGI4/graph.json","events_json":"https://pith.science/api/pith-number/TF6FAT5TXME7K2YL5HXUZ7LGI4/events.json","paper":"https://pith.science/paper/TF6FAT5T"},"agent_actions":{"view_html":"https://pith.science/pith/TF6FAT5TXME7K2YL5HXUZ7LGI4","download_json":"https://pith.science/pith/TF6FAT5TXME7K2YL5HXUZ7LGI4.json","view_paper":"https://pith.science/paper/TF6FAT5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0704.2452&json=true","fetch_graph":"https://pith.science/api/pith-number/TF6FAT5TXME7K2YL5HXUZ7LGI4/graph.json","fetch_events":"https://pith.science/api/pith-number/TF6FAT5TXME7K2YL5HXUZ7LGI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TF6FAT5TXME7K2YL5HXUZ7LGI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TF6FAT5TXME7K2YL5HXUZ7LGI4/action/storage_attestation","attest_author":"https://pith.science/pith/TF6FAT5TXME7K2YL5HXUZ7LGI4/action/author_attestation","sign_citation":"https://pith.science/pith/TF6FAT5TXME7K2YL5HXUZ7LGI4/action/citation_signature","submit_replication":"https://pith.science/pith/TF6FAT5TXME7K2YL5HXUZ7LGI4/action/replication_record"}},"created_at":"2026-05-18T03:57:53.952760+00:00","updated_at":"2026-05-18T03:57:53.952760+00:00"}