Polar codes have attracted the attention of academia and industry alike in the past decade, such that the 5th generation wireless systems (5G) standardization process of the 3rd generation partnership project (3GPP) chose polar codes as a channel coding scheme. In this tutorial, we provide a description of the encoding process of polar codes adopted by the 5G standard. We illustrate the struggles of designing a family of polar codes able to satisfy the demands of 5G systems, with particular attention to rate flexibility and low decoding latency. The result of these efforts is an elaborate framework that applies novel coding techniques to provide a solid channel code for NR requirements.
11 November 2020 in IEEE Wireless Communications Letters
We introduce a modulation for unsourced massive random access whereby the transmitted symbols are rank-1 tensors constructed from Grassmannian sub-constellations. The use of a low-rank tensor structure, together with tensor decomposition in order to separate the users at the receiver, allows a convenient uncoupling between multi-user separation and single-user demapping. The proposed signaling scheme is designed for the block fading channel and multiple-antenna settings, and is shown to perform well in comparison to state-of-the-art approaches.
4 December 2017 in IEEE Transactions on Vehicular Technology
We examine the secrecy performance of three artificial-noise-aided secure transmission schemes, namely, the partially-adaptive, fully-adaptive, and on-off schemes. To this end, we provide new analysis to facilitate the optimization of the fraction $\phi$ of the transmit power allocated to the useful signal and redundancy rate $R_{\mathbf E}$. Surprisingly, our examination indicates that the partially-adaptive scheme, in which only the codeword rate $R_{\mathbf B}$ varies with the instantaneous channel gains, significantly outperforms the on-off scheme, in which both $R_{\mathbf B}$ and $R_{\mathbf{E}}$ vary. This performance gain can be characterized in terms of a higher average secrecy rate, subject to an upper bound on the secrecy outage probability. Furthermore, our results also demonstrate that the partially-adaptive scheme can achieve almost the same secrecy performance as the fully-adaptive scheme, which is of a much higher complexity, where $\phi$, $R_{\mathbf{B}}$, and $R_{\mathbf{E}}$ all vary with the instantaneous channel gains.
1 July 2020 in IEEE Transactions on Communications
In this paper, we propose a new polar code construction by employing kernels of different sizes in the Kronecker product of the transformation matrix, thus generalizing the original construction by Arikan. These multi-kernel polar codes allow for more flexibility in terms of the code length and for various new design principles. Next to the common reliability design, we provide a design to maximize the minimal distance and a hybrid design combining reliability and distance properties. Numerical results demonstrate the advantage of multi-kernel polar codes under the new design principles compared to punctured and shortened Arikan polar codes.
5 February 2013 in IEEE Transactions on Communications
This paper addresses the design of irregular repeat accumulate (IRA) codes for coded physical-layer network coding (PNC) for the binary-input Gaussian two-way relay channel, assuming perfect synchronization and equal received power at the relay. The design is based on a nontrivial extension of EXIT-chart based design. Specifically, we analyze the components of the IRA-PNC scheme and propose an approach to model the soft information exchanged between these components. Then, we develop upper and lower bounds on the extrinsic information transfer functions to characterize the iterative process of computing the network-coded information. Based on that, we construct optimized IRA codes to minimize the computation error at the relay. The optimized IRA-PNC has considerable performance improvement over the existing regular RA coded PNC. For a rate 3/4 code, as an example, we observed improvements of 2.6 dB, and the optimized IRA-PNC scheme is only about 1.7 dB away from the capacity upper bound of the Gaussian two-way relay channel.
10 December 2012 in IEEE Transactions on Information Theory
This paper determines the range of feasible values of standard error exponents for binary-input memoryless symmetric channels of fixed capacity C and shows that extremes are attained by the binary symmetric and the binary erasure channel. The proof technique also provides analogous extremes for other quantities related to Gallager's E0 function, such as the cutoff rate, the Bhattacharyya parameter, and the channel dispersion.