具有最大似然解码的稳健标量量化的盒中青蛙索引码

Ilju Na, D. Neuhoff
{"title":"具有最大似然解码的稳健标量量化的盒中青蛙索引码","authors":"Ilju Na, D. Neuhoff","doi":"10.1109/ISIT.2004.1365464","DOIUrl":null,"url":null,"abstract":"The performance of frog-in-the box (FIB) code index assignments is numerically investigated when maximum likelihood (ML) decoding is used in place of optimal MMSE decoding. Specifically, the reproduction levels are chosen to be those that would be used for a noiseless channel, and the decoder simply maps the channel output to a level whose index codeword is closest to the channel output.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Frog-in-the-box index codes with maximum likelihood decoding for robust scalar quantization\",\"authors\":\"Ilju Na, D. Neuhoff\",\"doi\":\"10.1109/ISIT.2004.1365464\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance of frog-in-the box (FIB) code index assignments is numerically investigated when maximum likelihood (ML) decoding is used in place of optimal MMSE decoding. Specifically, the reproduction levels are chosen to be those that would be used for a noiseless channel, and the decoder simply maps the channel output to a level whose index codeword is closest to the channel output.\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2004.1365464\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

当使用最大似然(ML)解码代替最佳MMSE解码时,对盒中蛙(FIB)代码索引分配的性能进行了数值研究。具体来说,再现级别被选择为将用于无噪声通道的级别,解码器只是将通道输出映射到索引码字最接近通道输出的级别。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Frog-in-the-box index codes with maximum likelihood decoding for robust scalar quantization
The performance of frog-in-the box (FIB) code index assignments is numerically investigated when maximum likelihood (ML) decoding is used in place of optimal MMSE decoding. Specifically, the reproduction levels are chosen to be those that would be used for a noiseless channel, and the decoder simply maps the channel output to a level whose index codeword is closest to the channel output.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A new optimal double periodical construction of one target two-dimensional arrays Distributed power and admission control for time-varying wireless networks Optimal Bregman prediction and Jensen's equality Permutation codes: achieving the diversity-multiplexing tradeoff Subtree decomposition for network coding
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1