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

Convolutional Polar Coded Modulation

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




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

$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-level 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.

قيم البحث

اقرأ أيضاً

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 sequen ce, 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.
A polar-coded transmission (PCT) scheme with joint channel estimation and decoding is proposed for channels with unknown channel state information (CSI). The CSI is estimated via successive cancellation (SC) decoding and the constraints imposed by th e frozen bits. SC list decoding with an outer code improves performance, including resolving a phase ambiguity when using quadrature phase-shift keying (QPSK) and Gray labeling. Simulations with 5G polar codes and QPSK show gains of up to $2$~dB at a frame error rate (FER) of $10^{-4}$ over pilot-assisted transmission for various non-coherent models. Moreover, PCT performs within a few tenths of a dB to a coherent receiver with perfect CSI. For Rayleigh block-fading channels, PCT outperforms an FER upper bound based on random coding and within one dB of a lower bound.
Non-orthogonal multiple access (NOMA) is one of the key techniques to address the high spectral efficiency and massive connectivity requirements for the fifth generation (5G) wireless system. To efficiently realize NOMA, we propose a joint design fra mework combining the polar coding and the NOMA transmission, which deeply mines the generalized polarization effect among the users. In this polar coded NOMA (PC-NOMA) framework, the original NOMA channel is decomposed into multiple bit polarized channels by using a three-stage channel transform, that is, user$to$signal$to$bit partitions. Specifically, for the first-stage channel transform, we design two schemes, namely sequential user partition (SUP) and parallel user partition (PUP). For the SUP, a joint successive cancellation detecting and decoding scheme is developed, and a search algorithm is proposed to schedule the NOMA detecting order which improves the system performance by enhanced polarization among the user synthesized channels. The worst-goes-first idea is employed in the scheduling strategy, and its theoretic performance is analyzed by using the polarization principle. For the PUP, a corresponding parallel detecting scheme is exploited to reduce the latency. The block error ratio performances over the additive white Gaussian noise channel and the Rayleigh fading channel indicate that the proposed PC-NOMA obviously outperforms the state-of-the-art turbo coded NOMA scheme due to the advantages of joint design between the polar coding and NOMA.
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 we present a block coded modulation scheme for a 2 x 2 MIMO system over slow fading channels, where the inner code is the Golden Code. The scheme is based on a set partitioning of the Golden Code using two-sided ideals whose norm is a p ower of two. In this case, a lower bound for the minimum determinant is given by the minimum Hamming distance. The description of the ring structure of the quotients suggests further optimization in order to improve the overall distribution of determinants. Performance simulations show that the GC-RS schemes achieve a significant gain over the uncoded Golden Code.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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