Strong Converse, Feedback Channel Capacity and Hypothesis Testing
dc.contributor.author | Chen, Po-Ning | en_US |
dc.contributor.author | Alajaji, Fady | en_US |
dc.contributor.department | ISR | en_US |
dc.date.accessioned | 2007-05-23T09:57:03Z | |
dc.date.available | 2007-05-23T09:57:03Z | |
dc.date.issued | 1994 | en_US |
dc.description.abstract | In light of recent results by Verdu ad Han on channel capacity, we examine three problems: the strong converse condition to the channel coding theorem, the capacity of arbitrary channels with feedback and the Neyman-Pearson hypothesis testing type-II error exponent. It is first remarked that the strong converse condition holds if and only is the sequence of normalized channel information densities converges in probability to a constant. Examples illustrating this condition are also provided. A general formula for the capacity of arbitrary channels with output feedback is then obtained. Finally, a general expression for the Neyman-Pearson type-II exponent based on arbitrary observations subject to a constant bound on the type-I error probability is derived. | en_US |
dc.format.extent | 589786 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/1903/5538 | |
dc.language.iso | en_US | en_US |
dc.relation.ispartofseries | ISR; TR 1994-65 | en_US |
dc.subject | detection | en_US |
dc.subject | information theory | en_US |
dc.subject | channel capacity | en_US |
dc.subject | strong converse | en_US |
dc.subject | feedback | en_US |
dc.subject | Neyman-Pearson hypothesis testing | en_US |
dc.subject | Intelligent Signal Processing | en_US |
dc.subject | Communications Systems | en_US |
dc.title | Strong Converse, Feedback Channel Capacity and Hypothesis Testing | en_US |
dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1