检索结果-内蒙古大学图书馆

Secure polar coding With REP and XOR coding

IEEE COMMUNICATIONS LETTERS 2017年第10期21卷 2126-2129页

作者： Kim, Il-Min Kim, Byoung-Hoon Ahn, Joon Kui Queens Univ Dept Elect & Comp Engn Kingston ON K7L 3N6 Canada LG Elect Seoul 06772 South Korea

In this letter, we study the secure data communication by polar coding. In polar coding, all bit-channels perfectly polarize when the codelength goes to infinity. With finite and practical codelength, however, many bit-channels do not perfectly polarize and this significantly degrades the secrecy rate. To address this issue, we propose to use repetition (REP) coding and exclusive-or (XOR) coding combined with polar coding. To make the proposed approach practical, we develop simple design methods for REP and XOR codings. Numerical results demonstrate that the proposed secure polar coding improves the secrecy rate and security gap considerably.

关键词： Grey bit-channels polar coding REP XOR

来源：评论

学校读者我要写书评

暂无评论

A Note on Some Inequalities Used in Channel polarization and polar coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第8期64卷 5767-5768页

作者： Jayram, T. S. Arikan, Erdal IBM Corp Almaden Res Ctr 650 Harry Rd San Jose CA 95120 USA Bilkent Univ Dept Elect Elect Engn TR-06800 Ankara Turkey

We give a unified treatment of some inequalities that are used in the proofs of channel polarization theorems involving a binary-input discrete memoryless channel.

关键词： Channel polarization polar coding Bhattacharyya parameter Jensen-Shannon divergence Hellinger distance

来源：评论

学校读者我要写书评

暂无评论

Improving NB-IoT performance in weak coverage areas with CBSTO polar coding and LMMSE channel estimation

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2024年第4期17卷 2384-2396页

作者： Bavani, G. Srinivasan, V. Prasanna Balasubadra, K. Raj, Velankanni Cyril Velammal Inst Technol Dept Elect & Elect Engn Panchetti 601204 Tamilnadu India RMD Engn Coll Dept Informat Technol Kavaraipettai Tamilnadu India Dr MGR Educ Res Inst Dept Comp Sci & Engn Maduravoyal Tamilnadu India

The Narrowband Internet of Things (NB-IoT) technology is considered as an attractive option for IoT applications due to its ability in offering better connectivity in weak coverage areas. However, current research on NB-IoT systems primarily focuses on improving its distribution network, while neglecting the importance of channel condition estimation. To overcome these shortcomings, this article proposes a joint channel coding as well as channel estimation approach that aims to enhance the reliability and efficiency of data transmission over wireless channels. The proposed concatenation technique incorporates both polar coded data transfer and channel estimation procedures, which increases the system's reliability and efficiency even under immoral radio coverage conditions. The system utilizes the crossover boosted sooty tern optimization (CBSTO) based polar coding algorithm to design polar code parameters, resulting in improved error correction performance. Additionally, DNN-based linear minimum mean square error (LMMSE) channel estimations are performed at receiver side to ensure accurate channel equalization and decoding of received data bits. The simulation experiment conducted to validate the proposed NB-IoT system demonstrates its improved error correction performance and high throughput compared to other methods. The proposed scheme could help enhance the efficiency and reliability of NB-IoT systems, particularly in weak coverage areas. This paper highlights the importance of considering channel condition estimation in the development of NB-IoT systems, which could have significant implications for the future of IoT applications.

关键词： Narrowband polar coding Crossover boosted sooty tern optimization Channel estimation Deep neural network Bit error rate Reliability

来源：评论

学校读者我要写书评

暂无评论

polar coding Techniques: Partial Order, Iterative Decoding, and Permuted Kernel

Polar Coding Techniques: Partial Order, Iterative Decoding, ...

引用

作者： Wu, Wei University of California San Diego

学位级别：Ph.D., Doctor of Philosophy

polar codes are the first family of error-correcting codes that was proved to achieve the capacity of binary memoryless symmetric (BMS) channels with efficient encoding and decoding algorithms. They have been drawing increasing interests in both industrial and academic research, especially after being adopted by the 3rd generation partnership project (3GPP) group as the channel codes for the control channel of the 5th generation (5G) wireless systems. The main goal of this dissertation is to explore polar coding techniques, as well as improve the current state-of-the-art, thereby broadening the applications of polar codes. We begin by studying partial orders (POs) for the synthesized bit-channels of polar codes. We give an alternative proof of an existing PO for bit-channels with the same Hamming weight and use the underlying idea to extend the bit-channel ordering to some additional cases. The bit-channels with universal ordering positions for binary erasure channel (BEC), which are independent of the channel erasure probability, are verified for all of the code blocklengths. We also show the threshold behavior of the Bhattacharyya parameters of some bit-channels by approximating the threshold values. Then, we move on to the decoding algorithms and improved polar codes. Despite the impressive asymptotic behavior by channel polarization, empirical results indicate less impressive performance of the successive cancellation (SC) decoder for polar codes of short blocklengths, e.g., compared to low-density parity-check (LDPC) codes. We consider belief propagation list (BPL) decoding with a special family of factor-graph layer permutations called stable permutations (SPs) that preserve a specified information set when the corresponding bit permutations are applied to message bit indices. Then, we propose a new code construction methodology to interpolate between Reed-Muller (RM) and polar codes. The new family of hybrid RM-polar codes has superior performance under sever

关键词： polar coding Partial order Iterative decoding Permuted kernel

来源：评论

学校读者我要写书评

暂无评论

Hierarchical polar coding for Achieving Secrecy Over State-Dependent Wiretap Channels Without Any Instantaneous CSI

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第9期64卷 3609-3623页

作者： Si, Hongbo Koyluoglu, Onur Ozan Vishwanath, Sriram Univ Texas Austin Wireless Networking & Commun Grp Lab Informat Networks & Commun Austin TX 78712 USA Univ Arizona Dept Elect & Comp Engn Tucson AZ 85721 USA

This paper presents a polar coding scheme to achieve secrecy in block fading binary symmetric wiretap channels without the knowledge of instantaneous channel state information (CSI) at the transmitter. For this model, a coding scheme that hierarchically utilizes polar codes is presented. In particular, on the polarization of different binary symmetric channels over different fading blocks, each channel use is modeled as an appropriate binary erasure channel over fading blocks. polar codes are constructed for both coding over channel uses for each fading block and coding over fading blocks for certain channel uses. In order to guarantee security, random bits are introduced at appropriate places to exhaust the observations of the eavesdropper. It is shown that this coding scheme, without instantaneous CSI at the transmitter, is secrecy capacity achieving for the simultaneous fading scenario. For the independent fading case, the capacity is achieved when the fading realizations for the eavesdropper channel are always degraded with respect to the receiver. For the remaining cases, the gap between lower and upper bounds is analyzed. Remarkably, for the scenarios where the secrecy capacity is achieved, the results imply that the instantaneous CSI does not increase the secrecy capacity.

关键词： Fading channel information theoretic security polar coding wiretap channel

来源：评论

学校读者我要写书评

暂无评论

ON polar coding FOR FINITE BLOCKLENGTH SECRET KEY GENERATION OVER WIRELESS CHANNELS

ON POLAR CODING FOR FINITE BLOCKLENGTH SECRET KEY GENERATION...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Hentila, Henri Shkel, Yanina Y. Koivunen, Visa Poor, H. Vincent Aalto Univ Dept Signal Proc & Acoust Espoo Finland Ecole Polytech Fed Lausanne Sch Comp & Commun Sci Lausanne Switzerland Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

ISBN: (纸本)9781509066315

We consider the problem of secret key generation from correlated Gaussian random variables in the finite blocklength regime. Such keys could be used to encrypt communication in IoT networks, and have provable secrecy guarantees in contrast to classic cryptographic approaches. We investigate the performance of polar coding schemes for generating the secret key over short blocklengths. Our simulation results show that the proposed scheme achieves close to theoretical upper bounds at short blocklengths.

关键词： physical-layer security secret key generation AWGN finite blocklength polar coding

来源：评论

学校读者我要写书评

暂无评论

SECRET KEY GENERATION OVER WIRELESS CHANNELS USING SHORT BLOCKLENGTH MULTILEVEL SOURCE polar coding

SECRET KEY GENERATION OVER WIRELESS CHANNELS USING SHORT BLO...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Hentila, Henri Shkel, Yanina Y. Koivunen, Visa Aalto Univ Dept Signal Proc & Acoust Espoo Finland Ecole Polytech Fed Lausanne Sch Comp & Commun Sci Lausanne Switzerland

ISBN: (纸本)9781728176055

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short block-length regime. Inspired by the state-of-the-art performance provided by polar codes in the short blocklength regime for channel coding, we propose an explicit protocol based on polar codes for generating the secret keys. This protocol differs from previously proposed key generation protocols based on polar coding in two main ways: (i) we consider a Gaussian source for the key generation;(ii) we focus on the short block-length regime. Simulation results show that the proposed protocol performs well even for very short blocklengths, especially if one can relax the BER requirements for the generated keys. They also demonstrate that the polar code based protocol outperforms a similar one using LDPC codes in place of polar codes, and that this advantage grows the shorter the blocklength becomes.

关键词： secret key generation Gaussian source model short blocklength polar coding multilevel coding

来源：评论

学校读者我要写书评

暂无评论

A polar coding Scheme for Achieving Secrecy of Fading Wiretap Channels in UAV Communications

A Polar Coding Scheme for Achieving Secrecy of Fading Wireta...

引用

IEEE/CIC International Conference on Communications in China (ICCC)

作者： Yang, Dongli Huang, Jingxuan Liu, Xiaodong Sun, Ce Fei, Zesong Beijing Inst Technol Sch Informat & Elect Beijing 100081 Peoples R China Beijing Inst Technol Jiaxing Yangtze River Delta Grad Sch Jiaxing 314000 Peoples R China

ISBN: (数字)9781665484800

ISBN: (纸本)9781665484800

The high maneuverability of the unmanned aerial vehicle (UAV), facilitating fast and flexible deployment of communication infrastructures, brings potentially valuable opportunities to the future wireless communication industry. Nevertheless, UAV communication networks are faced with severe security challenges since air to ground (A2G) communications are more vulnerable to eavesdropping attacks than terrestrial communications. To solve the problem, we propose a coding scheme that hierarchically utilizes polar codes in order to address channel multi-state variation for UAV wiretap channels, without the instantaneous channel state information (CSI) known at the transmitter. The theoretical analysis and simulation results show that the scheme achieves the security capacity of the channel and meets the conditions of reliability and security.

关键词： UAV communication physical layer security polar coding wiretap channel secrecy capacity

来源：评论

学校读者我要写书评

暂无评论

Design of superposition polar coding for binary-input less-noisy broadcast channels

引用

ICT EXPRESS 2017年第3期3卷 111-114页

作者： Choi, Sungik Chung, Sae-Young Korea Adv Inst Sci & Technol Sch Elect Engn 335 Gwahangno Daejeon 305701 South Korea

In this study, we design a superposition polar code that can achieve the capacity region of binary-input less-noisy broadcast channels asymptotically. Simulation results show that a better rate region is achievable by superposition polar coding than by time sharing between two point-to-point channel polar codes. (C) 2016 The Korean Institute of Communications Information Sciences. Publishing Services by Elsevier B.V.

关键词： Broadcast channel Superposition coding polar coding

来源：评论

学校读者我要写书评

暂无评论

Secret and private rates on degraded wire-tap channels via polar coding

Secret and private rates on degraded wire-tap channels via p...

引用

2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010

作者： Hof, Eran Shamai, Shlomo Technion - Israel Institute of Technology Haifa 32000 Israel

ISBN: (纸本)9781424486809

A secrecy coding scheme is provided for degraded wire-tap channels via the method of channel polarization. It is shown that the entire rate-equivocation region is achievable via the provided scheme. The key element in the provided scheme is the utilization of the noisy bits, which are required to achieve the secrecy constraint, to provided private non-secure rate for the legitimate user. © 2010 IEEE.

关键词： channel coding channel coding channel polarization degraded wire-tap channel polar coding private rate rate-equivocation region secrecy coding secret rate telecommunication security

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：