{"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}
引用次数: 0
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.