21 January 2022 in npj Quantum Information
In this paper, we propose a design rule of rate-compatible punctured multi-edge type low-density parity-check (MET-LDPC) code ensembles with degree-one variable nodes for the information reconciliation (IR) of continuous-variable quantum key distribution (CV-QKD) systems. In addition to the rate compatibility, the design rule effectively resolves the high error-floor issue which has been known as a technical challenge of MET-LDPC codes at low rates. Thus, the proposed design rule allows one to implement rate-compatible MET-LDPC codes with good performances both in the threshold and low-error-rate regions. The rate compatibility and the improved error-rate performances significantly enhance the efficiency of IR for CV-QKD systems. The performance improvements are confirmed by comparing complexities and secret key rates of IR schemes with MET-LDPC codes whose ensembles are optimized with the proposed and existing design rules. In particular, the SNR range of positive secrecy rate increases by 1.44 times, and the maximum secret key rate improves by 2.10 times as compared to the existing design rules. The comparisons clearly show that an IR scheme can achieve drastic performance improvements in terms of both the complexity and secret key rate by employing rate-compatible MET-LDPC codes constructed with code ensembles optimized with the proposed design rule.
13 January 2020 in IEEE Transactions on Vehicular Technology
In this work, we consider a secure precoding optimization problem for the artificial noise (AN) scheme in multiple-input single-output (MISO) wiretap channels. In [4], it was proved that the generalized AN scheme which allows some portion of AN signal to be injected to the legitimate receiver's channel is the optimal precoding scheme for MISO wiretap channels. However, the optimality is valid only under some ideal assumptions such as perfect channel estimation and spatially uncorrelated channels. To break through this limitation, in this paper, we propose a novel deep neural network (DNN)-based secure precoding scheme, called the deep AN scheme. To the best of the authors’ knowledge, the deep AN scheme is the first secure precoding scheme which exploits a DNN to jointly design and optimize the precoders for the information signal and the AN signal. From the numerical experiments, it is demonstrated that the proposed deep AN scheme outperforms the generalized AN scheme under various practical wireless environments.
22 November 2017 in IEEE Transactions on Vehicular Technology
This work considers the artificial noise (AN) scheme, proposed by Goel and Negi for securing wireless communications over multiple-input multiple-output multi-antenna eavesdropper (MIMOME) channels. In this work, we develop a lower bound on the ergodic secrecy rate of the artificial noise scheme and derive an analytic expression of the bound without assuming any asymptotes for system parameters. Thus, the derived bound explicitly elucidates how the system parameters exert influence on the secrecy rate in various cases to some of which the previous work cannot be applied. It will also be shown that the bound is tight over wide combinations of system parameters, and a normalized difference between the bound and secrecy rate vanishes with a growing number of antennas at the transmitter. The derived bound is analytically so amenable that it enables one to not only extend the results of the previous work but also explore untouched aspects of the AN scheme. The bound answers an intriguing question: when is the AN signal beneficial? Besides, it makes possible to study a new important system parameter called the minimum required transmit power for a certain target secrecy rate, which has never been touched before.
19 January 2022 in IEEE Communications Letters
In this work, we propose a novel puncturing scheme for rate-compatible polar codes of finite lengths. By analyzing the log-likelihood ratio (LLR) message propagation from the channel outputs to the information bits, we show that there exist certain paths, called direct paths through which the reliabilities of LLR values at the information bits are strongly influenced by the channel outputs. For each information bit, we define a metric called reliability score which measures the reliability of LLR value at the information bit built up through the direct paths. Then, we propose a rate-compatible puncturing scheme which decides punctured bits in such a way as to maximize the minimum reliability score. Simulation results show that the proposed puncturing scheme significantly outperforms existing schemes in terms of error-rate performance.
10 June 2013 in IEEE Transactions on Communications
Energy delay tradeoff (EDT) is a fundamental tradeoff that plays a crucial role in understanding the energy efficiency of various transmission schemes. In particular, for hybrid automatic repeat request (HARQ) protocols, the EDT can be well defined. In this paper, in order to understand the EDT for a wireless multiuser system, we consider various downlink transmission schemes where the HARQ with incremental redundancy (HARQ-IR) protocol is employed for reliable transmissions to users. For a given total power, the impact of different transmission schemes in conjunction with power allocation on EDT is extensively studied. Among the transmission schemes, it is shown that the threshold-based transmission (TBT) scheme efficiently lowers the minimum energy per bit (EB) in spite of limited prior channel state information (CSI) feedback. The study is further extended to a more plausible scenario where users have different channel statistics. In doing so, we consider a proportional fairness scheduling based on relative channel gain that can be easily accommodated in the proposed TBT scheme, and study its EDT behaviors. Performance evaluations show that the schemes incorporating proportional fairness achieve good EDT performances while guaranteeing the fairness among users.
8 March 2022 in IEEE Transactions on Communications
In the low-error rate regime, message-passing (MP) decoding for low-density parity-check (LDPC) codes is known to have performance degradation due to trapping sets (TSs), which often limits the use of LDPC codes for applications with low target error rates like storage devices. This work proposes a novel deep-learning based decoding algorithm which is tailored for breaking TSs. In particular, when MP decoding fails due to TSs, there exist pairs of unsatisfied check nodes (CNs) which are connected through paths only with error variable nodes (VNs), i.e., VNs with erroneous hard-decision results. The proposed algorithm efficiently identifies the paths with error VNs between unsatisfied CNs with the aid of deep-learning techniques. Then, the decoding failures are resolved by repeating the MP decoding after re-initializing the channel outputs for the error VNs in the identified paths. In addition, by analyzing the behaviors of the deep-learning based algorithm, we propose a low-complexity algorithm, called adaptive-error-path (AEP) detector. Simulation results show that the proposed algorithms efficiently break the TSs and significantly improve the error-floor performance in the low error-rate regime.