随机编码边界鞍点逼近的复积分方法

2014 11th International Symposium on Wireless Communications Systems (ISWCS) Pub Date : 2014-10-23 DOI:10.1109/ISWCS.2014.6933428

Alfonso Martinez, J. Scarlett, M. Dalai, A. G. Fàbregas

{"title":"随机编码边界鞍点逼近的复积分方法","authors":"Alfonso Martinez, J. Scarlett, M. Dalai, A. G. Fàbregas","doi":"10.1109/ISWCS.2014.6933428","DOIUrl":null,"url":null,"abstract":"This paper derives a saddlepoint approximation for the random-coding bound to the error probability of channel coding by using complex-integration techniques. The approximation is given by a sum of two terms: one with Gallager's exponent, and a second one with Arimoto's strong converse exponent (above capacity) or the sphere-packing exponent (below the critical rate).","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":"356 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A complex-integration approach to the saddlepoint approximation for random-coding bounds\",\"authors\":\"Alfonso Martinez, J. Scarlett, M. Dalai, A. G. Fàbregas\",\"doi\":\"10.1109/ISWCS.2014.6933428\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper derives a saddlepoint approximation for the random-coding bound to the error probability of channel coding by using complex-integration techniques. The approximation is given by a sum of two terms: one with Gallager's exponent, and a second one with Arimoto's strong converse exponent (above capacity) or the sphere-packing exponent (below the critical rate).\",\"PeriodicalId\":431852,\"journal\":{\"name\":\"2014 11th International Symposium on Wireless Communications Systems (ISWCS)\",\"volume\":\"356 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 11th International Symposium on Wireless Communications Systems (ISWCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWCS.2014.6933428\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2014.6933428","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

本文利用复积分技术导出了随机编码与信道编码误差概率绑定的鞍点近似。近似由两项的和给出:一项具有Gallager指数，另一项具有Arimoto强逆指数(高于容量)或球填充指数(低于临界速率)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A complex-integration approach to the saddlepoint approximation for random-coding bounds

This paper derives a saddlepoint approximation for the random-coding bound to the error probability of channel coding by using complex-integration techniques. The approximation is given by a sum of two terms: one with Gallager's exponent, and a second one with Arimoto's strong converse exponent (above capacity) or the sphere-packing exponent (below the critical rate).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2014 11th International Symposium on Wireless Communications Systems (ISWCS)

自引率

0.00%

发文量