ترغب بنشر مسار تعليمي؟ اضغط هنا

Progressive Rate-Filling: A Framework for Agile Construction of Multilevel Polar-Coded Modulation

71   0   0.0 ( 0 )
 نشر من قبل Jincheng Dai
 تاريخ النشر 2020
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

In this letter, we propose a progressive rate-filling method as a framework to study agile construction of multilevel polar-coded modulation. We show that the bit indices within each component polar code can follow a fixed, precomputed ranking sequence, e.g., the Polar sequence in the 5G standard, while their allocated rates (i.e., the number of information bits of each component polar code) can be fast computed by exploiting the target sum-rate approximation and proper rate-filling methods. In particular, we develop two rate-filling strategies based on the capacity and the rate considering the finite block-length effect. The proposed construction methods can be performed independently of the actual channel condition with ${Oleft(mright)}$ ($m$ denotes the modulation order) complexity and robust to diverse modulation and coding schemes in the 5G standard, which is a desired feature for practical systems.



قيم البحث

اقرأ أيضاً

$2^m$-ary modulation creates $m$ bit channels which are neither independent nor identical, and this causes problems when applying polar coding because polar codes are designed for independent identical channels. Different from the existing multi-leve l coding (MLC) and bit-interleaved coded modulation (BICM) schemes, this paper provides a convolutional polar coded modulation (CPCM) method that preserves the low-complexity nature of BICM while offering improved spectral efficiency. Numerical results are given to show the good performance of the proposed method.
Multilevel coding (MLC) is a coded modulation technique which can achieve excellent performance over a range of communication channels. Polar codes have been shown to be quite compatible with communication systems using MLC, as the rate allocation of the component polar codes follows the natural polarization inherent in polar codes. MLC based techniques have not yet been studied in systems that use spatial modulation (SM). SM makes the polar code design difficult as the spatial bits actually select a channel index for transmission. To solve this problem, we propose a Monte Carlo based evaluation of the ergodic capacities for the individual bit levels under the capacity rule for a space-shift keying (SSK) system, where we also make use of a single antenna activation to approximate the transmission channel for the design of the multilevel polar code. Our simulation results show that the multilevel polar coded 16 $times$ 1 SSK system outperforms the corresponding system that uses bit-interleaved polar coded modulation by 2.9 dB at a bit-error rate (BER) of $10^{-4}$.
In this paper, code pairs based on trellis coded modulation are proposed over PSK signal sets for a two-user Gaussian multiple access channel. In order to provide unique decodability property to the receiver and to maximally enlarge the constellation constrained (CC) capacity region, a relative angle of rotation is introduced between the signal sets. Subsequently, the structure of the textit{sum alphabet} of two PSK signal sets is exploited to prove that Ungerboeck labelling on the trellis of each user maximizes the guaranteed minimum squared Euclidean distance, $d^{2}_{g, min}$ in the textit{sum trellis}. Hence, such a labelling scheme can be used systematically to construct trellis code pairs for a two-user GMAC to approach emph{any rate pair} within the capacity region.
We develop a low-complexity coding scheme to achieve covert communications over binary-input discrete memoryless channels (BI-DMCs). We circumvent the impossibility of covert communication with linear codes by introducing non-linearity through the us e of pulse position modulation (PPM) and multilevel coding (MLC). We show that the MLC-PPM scheme exhibits many appealing properties; in particular, the channel at a given index level remains stationary as the number of level increases, which allows one to use families of channel capacity- and channel resolvability-achieving codes to concretely instantiate the covert communication scheme.
79 - Kai Niu , Jincheng Dai , Kai Chen 2016
Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the corresponding code length is limited to the power of two. In this paper, we establish a systemati c framework to design the rate-compatible punctured polar (RCPP) codes with arbitrary code length. A new theoretic tool, called polar spectra, is proposed to count the number of paths on the code tree with the same number of zeros or ones respectively. Furthermore, a spectrum distance SD0 (SD1) and a joint spectrum distance (JSD) are presented as performance criteria to optimize the puncturing tables. For the capacity-zero puncturing mode (punctured bits are unknown to the decoder), we propose a quasi-uniform puncturing algorithm, analyze the number of equivalent puncturings and prove that this scheme can maximize SD1 and JSD. Similarly, for the capacity-one mode (punctured bits are known to the decoder), we also devise a reversal quasi-uniform puncturing scheme and prove that it has the maximum SD0 and JSD. Both schemes have a universal puncturing table without any exhausted search. These optimal RCPP codes outperform the performance of turbo codes in LTE wireless communication systems.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا