速率匹配模式估计

Byoungjo Choi, S. Berber
{"title":"速率匹配模式估计","authors":"Byoungjo Choi, S. Berber","doi":"10.1109/ITNAC46935.2019.9077982","DOIUrl":null,"url":null,"abstract":"Rate matching in 3GPP standard is a process of getting the right amount of bits out of full-rate channel encoded bits, either by repetition or by puncturing, at the transmitter. The rate matching parameters may not be available at the receiver in various non-cooperative communication contexts, and the estimation of the rate matching pattern is required before any channel decoding attempt. A generic rate matching pattern estimation problem is formally formulated for repetitive rate matching. A set of ML estimators are derived based on the conditional probability of the observed bit-repetition index over a perfect channel as well as over BSC channel. Their performances are explored through simulations. It was found that the detection error rate of the proposed ML estimator was relatively high when very few bits are repeated, but was reduced by our ML estimator exploiting multiple observations.","PeriodicalId":407514,"journal":{"name":"2019 29th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rate Matching Pattern Estimation\",\"authors\":\"Byoungjo Choi, S. Berber\",\"doi\":\"10.1109/ITNAC46935.2019.9077982\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Rate matching in 3GPP standard is a process of getting the right amount of bits out of full-rate channel encoded bits, either by repetition or by puncturing, at the transmitter. The rate matching parameters may not be available at the receiver in various non-cooperative communication contexts, and the estimation of the rate matching pattern is required before any channel decoding attempt. A generic rate matching pattern estimation problem is formally formulated for repetitive rate matching. A set of ML estimators are derived based on the conditional probability of the observed bit-repetition index over a perfect channel as well as over BSC channel. Their performances are explored through simulations. It was found that the detection error rate of the proposed ML estimator was relatively high when very few bits are repeated, but was reduced by our ML estimator exploiting multiple observations.\",\"PeriodicalId\":407514,\"journal\":{\"name\":\"2019 29th International Telecommunication Networks and Applications Conference (ITNAC)\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 29th International Telecommunication Networks and Applications Conference (ITNAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITNAC46935.2019.9077982\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 29th International Telecommunication Networks and Applications Conference (ITNAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNAC46935.2019.9077982","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

3GPP标准中的速率匹配是一个从全速率信道编码比特中获得适当数量的比特的过程,通过重复或在发射机上进行穿刺。在各种非合作通信环境中,接收端可能无法获得速率匹配参数,并且需要在任何信道解码尝试之前对速率匹配模式进行估计。针对重复速率匹配问题,提出了一种通用的速率匹配模式估计问题。基于在完美信道和BSC信道上观察到的位重复索引的条件概率,导出了一组ML估计量。他们的表现是通过模拟来探索的。研究发现,当重复比特很少时,所提出的机器学习估计器的检测错误率相对较高,但我们的机器学习估计器利用多个观测值降低了错误率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Rate Matching Pattern Estimation
Rate matching in 3GPP standard is a process of getting the right amount of bits out of full-rate channel encoded bits, either by repetition or by puncturing, at the transmitter. The rate matching parameters may not be available at the receiver in various non-cooperative communication contexts, and the estimation of the rate matching pattern is required before any channel decoding attempt. A generic rate matching pattern estimation problem is formally formulated for repetitive rate matching. A set of ML estimators are derived based on the conditional probability of the observed bit-repetition index over a perfect channel as well as over BSC channel. Their performances are explored through simulations. It was found that the detection error rate of the proposed ML estimator was relatively high when very few bits are repeated, but was reduced by our ML estimator exploiting multiple observations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信