The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
일반 채널에 대한 비용 제약이 있는 채널 코딩 문제를 고려합니다. Verdú와 Han은 일반 채널에 대한 ϵ 용량을 도출했습니다. 동일한 증명 내용을 따라 비용 제약 조건을 적용하여 ϵ 용량을 도출할 수도 있습니다. 본 논문에서는 오버런을 허용하는 비용 제약 조건을 갖춘 ϵ-용량 공식을 유도합니다. 이 정리를 증명하기 위해 Feinstein의 보조정리의 새로운 변형을 적용하여 비용 제약 조건을 만족하는 코드워드와 비용 제약 조건을 만족하지 않는 코드워드를 선택합니다.
Masaki HORI
Shinshu University
Mikihiko NISHIARA
Shinshu University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Masaki HORI, Mikihiko NISHIARA, "Channel Capacity with Cost Constraint Allowing Cost Overrun" in IEICE TRANSACTIONS on Fundamentals,
vol. E107-A, no. 3, pp. 458-463, March 2024, doi: 10.1587/transfun.2023TAP0010.
Abstract: A channel coding problem with cost constraint for general channels is considered. Verdú and Han derived ϵ-capacity for general channels. Following the same lines of its proof, we can also derive ϵ-capacity with cost constraint. In this paper, we derive a formula for ϵ-capacity with cost constraint allowing overrun. In order to prove this theorem, a new variation of Feinstein's lemma is applied to select codewords satisfying cost constraint and codewords not satisfying cost constraint.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2023TAP0010/_p
부
@ARTICLE{e107-a_3_458,
author={Masaki HORI, Mikihiko NISHIARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Channel Capacity with Cost Constraint Allowing Cost Overrun},
year={2024},
volume={E107-A},
number={3},
pages={458-463},
abstract={A channel coding problem with cost constraint for general channels is considered. Verdú and Han derived ϵ-capacity for general channels. Following the same lines of its proof, we can also derive ϵ-capacity with cost constraint. In this paper, we derive a formula for ϵ-capacity with cost constraint allowing overrun. In order to prove this theorem, a new variation of Feinstein's lemma is applied to select codewords satisfying cost constraint and codewords not satisfying cost constraint.},
keywords={},
doi={10.1587/transfun.2023TAP0010},
ISSN={1745-1337},
month={March},}
부
TY - JOUR
TI - Channel Capacity with Cost Constraint Allowing Cost Overrun
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 458
EP - 463
AU - Masaki HORI
AU - Mikihiko NISHIARA
PY - 2024
DO - 10.1587/transfun.2023TAP0010
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E107-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2024
AB - A channel coding problem with cost constraint for general channels is considered. Verdú and Han derived ϵ-capacity for general channels. Following the same lines of its proof, we can also derive ϵ-capacity with cost constraint. In this paper, we derive a formula for ϵ-capacity with cost constraint allowing overrun. In order to prove this theorem, a new variation of Feinstein's lemma is applied to select codewords satisfying cost constraint and codewords not satisfying cost constraint.
ER -