Mitigating Blind Detection Through Protograph Based Interleaving for Turbo Codes

Stefan Weithoffer, Rami Klaimi, C. A. Nour
{"title":"Mitigating Blind Detection Through Protograph Based Interleaving for Turbo Codes","authors":"Stefan Weithoffer, Rami Klaimi, C. A. Nour","doi":"10.1109/MILCOM52596.2021.9652992","DOIUrl":null,"url":null,"abstract":"The complexity involved to blindly detect the channel code parameters in the case of their imperfect knowledge is generally measured in terms of the minimum number of frames that an eavesdropper needs to observe for successful detection, adding an additional layer of privacy. In this work, starting from a defined almost regular interleaver for Turbo codes, we propose methods to construct a larger set of distinct interleavers that increases the minimum number of observations by a factor equal to the size of the constructed set. Furthermore, the generated sets of interleavers can be described by defining only a small number of parameters and are shown to achieve a comparable error correcting performance to base interleavers. To validate the proposed implementation-friendly method, an application example for information frame sizes $\\mathrm{K}=128$ bits and $\\mathrm{K}=512$ bits is provided for the construction of two sets of 8192 interleavers, prohibitively increasing detection complexity by state-of-the-art methods.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM52596.2021.9652992","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The complexity involved to blindly detect the channel code parameters in the case of their imperfect knowledge is generally measured in terms of the minimum number of frames that an eavesdropper needs to observe for successful detection, adding an additional layer of privacy. In this work, starting from a defined almost regular interleaver for Turbo codes, we propose methods to construct a larger set of distinct interleavers that increases the minimum number of observations by a factor equal to the size of the constructed set. Furthermore, the generated sets of interleavers can be described by defining only a small number of parameters and are shown to achieve a comparable error correcting performance to base interleavers. To validate the proposed implementation-friendly method, an application example for information frame sizes $\mathrm{K}=128$ bits and $\mathrm{K}=512$ bits is provided for the construction of two sets of 8192 interleavers, prohibitively increasing detection complexity by state-of-the-art methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于原型交错的Turbo码抑制盲检测
在不完全了解信道码参数的情况下,盲目检测信道码参数所涉及的复杂性通常以窃听者成功检测所需观察的最小帧数来衡量,这增加了额外的隐私层。在这项工作中,我们从一个定义的几乎规则的Turbo代码交织器开始,提出了构建一个更大的不同交织器集的方法,该方法将最小观测数增加一个等于构建集大小的因子。此外,生成的交织器集可以通过仅定义少量参数来描述,并且显示出与基本交织器相当的纠错性能。为了验证所提出的实现友好的方法,提供了一个信息帧大小为$\mathrm{K}=128$ bits和$\mathrm{K}=512$ bits的应用示例,用于构建两组8192交织器,通过最先进的方法大幅增加了检测复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
RF-based Network Inference: Theoretical Foundations Security Threats Analysis of the Unmanned Aerial Vehicle System Using Distributed Ledgers For Command and Control – Concepts and Challenges DerechoDDS: Strongly Consistent Data Distribution for Mission-Critical Applications CUE: A Standalone Testbed for 5G Experimentation
×
引用
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