{"title":"使用辅助设备进行调制和估算","authors":"Anatoly Khina;Neri Merhav","doi":"10.1109/TIT.2024.3422308","DOIUrl":null,"url":null,"abstract":"The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a description of limited rate \n<inline-formula> <tex-math>$R_{\\mathrm {h}}$ </tex-math></inline-formula>\n to the transmitter and/or the receiver. We derive upper and lower bounds on the optimal achievable \n<inline-formula> <tex-math>$\\alpha $ </tex-math></inline-formula>\n-th moment of the estimation error and show that they coincide for small values of \n<inline-formula> <tex-math>$\\alpha $ </tex-math></inline-formula>\n and for high values of \n<inline-formula> <tex-math>$R_{\\mathrm {h}}$ </tex-math></inline-formula>\n. The upper bound relies on a recently proposed channel-coding scheme that effectively conveys \n<inline-formula> <tex-math>$R_{\\mathrm {h}}$ </tex-math></inline-formula>\n bits essentially error-free and the rest of the rate—over the same AWGN channel without help, with the error-free bits being allocated to the most significant bits of the quantized parameter. We then concentrate on the setting with a total transmit energy constraint, for which we derive achievability results for both channel coding and parameter modulation for several scenarios: when the helper assists only the transmitter or only the receiver and knows the noise, and when the helper assists the transmitter and/or the receiver and knows both the noise and the message. In particular, for the message-informed helper that assists both the receiver and the transmitter, it is shown that the error probability in the channel-coding task decays doubly exponentially. Finally, we translate these results to those for continuous-time power-limited AWGN channels with unconstrained bandwidth. As a byproduct, we show that the capacity with a message-informed helper that is available only at the transmitter can exceed the sum of the capacity without help and the help rate \n<inline-formula> <tex-math>$R_{\\mathrm {h}}$ </tex-math></inline-formula>\n.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 9","pages":"6189-6210"},"PeriodicalIF":2.2000,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Modulation and Estimation With a Helper\",\"authors\":\"Anatoly Khina;Neri Merhav\",\"doi\":\"10.1109/TIT.2024.3422308\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a description of limited rate \\n<inline-formula> <tex-math>$R_{\\\\mathrm {h}}$ </tex-math></inline-formula>\\n to the transmitter and/or the receiver. We derive upper and lower bounds on the optimal achievable \\n<inline-formula> <tex-math>$\\\\alpha $ </tex-math></inline-formula>\\n-th moment of the estimation error and show that they coincide for small values of \\n<inline-formula> <tex-math>$\\\\alpha $ </tex-math></inline-formula>\\n and for high values of \\n<inline-formula> <tex-math>$R_{\\\\mathrm {h}}$ </tex-math></inline-formula>\\n. The upper bound relies on a recently proposed channel-coding scheme that effectively conveys \\n<inline-formula> <tex-math>$R_{\\\\mathrm {h}}$ </tex-math></inline-formula>\\n bits essentially error-free and the rest of the rate—over the same AWGN channel without help, with the error-free bits being allocated to the most significant bits of the quantized parameter. We then concentrate on the setting with a total transmit energy constraint, for which we derive achievability results for both channel coding and parameter modulation for several scenarios: when the helper assists only the transmitter or only the receiver and knows the noise, and when the helper assists the transmitter and/or the receiver and knows both the noise and the message. In particular, for the message-informed helper that assists both the receiver and the transmitter, it is shown that the error probability in the channel-coding task decays doubly exponentially. Finally, we translate these results to those for continuous-time power-limited AWGN channels with unconstrained bandwidth. As a byproduct, we show that the capacity with a message-informed helper that is available only at the transmitter can exceed the sum of the capacity without help and the help rate \\n<inline-formula> <tex-math>$R_{\\\\mathrm {h}}$ </tex-math></inline-formula>\\n.\",\"PeriodicalId\":13494,\"journal\":{\"name\":\"IEEE Transactions on Information Theory\",\"volume\":\"70 9\",\"pages\":\"6189-6210\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Theory\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10583940/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10583940/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a description of limited rate
$R_{\mathrm {h}}$
to the transmitter and/or the receiver. We derive upper and lower bounds on the optimal achievable
$\alpha $
-th moment of the estimation error and show that they coincide for small values of
$\alpha $
and for high values of
$R_{\mathrm {h}}$
. The upper bound relies on a recently proposed channel-coding scheme that effectively conveys
$R_{\mathrm {h}}$
bits essentially error-free and the rest of the rate—over the same AWGN channel without help, with the error-free bits being allocated to the most significant bits of the quantized parameter. We then concentrate on the setting with a total transmit energy constraint, for which we derive achievability results for both channel coding and parameter modulation for several scenarios: when the helper assists only the transmitter or only the receiver and knows the noise, and when the helper assists the transmitter and/or the receiver and knows both the noise and the message. In particular, for the message-informed helper that assists both the receiver and the transmitter, it is shown that the error probability in the channel-coding task decays doubly exponentially. Finally, we translate these results to those for continuous-time power-limited AWGN channels with unconstrained bandwidth. As a byproduct, we show that the capacity with a message-informed helper that is available only at the transmitter can exceed the sum of the capacity without help and the help rate
$R_{\mathrm {h}}$
.
期刊介绍:
The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.