Polar code is an emerging error-correcting code. The blind detection and identification of polar codes are less studied. This letter proposes an algorithm to determine whether a bitstream is encoded with polar codes. Also, the proposed algorithm identifies the frame synchronization, code block length, rate, and the frozen-bit locations of the polar code by calculating the proposed parity check conformity of the soft-output sequence. Our method has lower computational complexity than the general methods because it does not need a decoding process. Simulation results also indicate that our algorithm performs well under low SNR.
The identification of low-density parity-check (LDPC) codes with higher rate over a candidate set is more difficult than that of LDPC encoders with lower rate. For the given soft information on a received sequence, we present a method to compute the average Taylor polynomial of the syndrome posterior probability according to the parity-checks of the candidates. Simulation results show that the proposed method performs as well as the existing works when dealing with lower rate encoders. Meanwhile, our method outperforms the existing works in higher rate encoders identification, with the gain being about 0.5 dB.
In this study, we examine a length preserving geodesic curvature difference flow for smooth strictly horocyclically convex simple closed curves in the hyperbolic plane . Given an initial curve and a target curve of the same hyperbolic length, we evolve by a normal speed given by the difference of the reciprocals of geodesic curvatures evaluated at points with the same outward unit normal, together with a time-dependent scalar term chosen to preserve the hyperbolic length. Using Leichtweiβ’s hyperbolic support function and Howe’s curvature formula, the flow is reformulated as a quasilinear uniformly parabolic equation on with a nonlocal term . We prove short-time existence, uniqueness, and preservation of strict horocyclic convexity. Linearizing the support function equation at the target support function yields a uniformly elliptic operator whose kernel contains the infinitesimal isometry directions. Under a spectral gap assumption on a normalized slice transverse to the isometry orbit, we prove global existence and exponential convergence for initial data sufficiently close to the target curve. In the last section, this assumption is verified explicitly when the target curve is a geodesic circle.
30 September 2021 in KSII Transactions on Internet and Information Systems