6 accepted papers
Although belief propagation (BP) decoders are efficient and provide significant performance for classical low-density parity-check (LDPC) codes, they will suffer a degradation in performance for quantum LDPC (QLDPC) codes due to the limitations in the quantum field. In this paper, we propose a poste…
In order to minimize the decoding period and the response time for Polar Codes, an early termination (ET) scheme based on additional check points (ACPs) is proposed in this work. For conventional ET schemes based on distributed parity-check (PC) bits, ET can only be triggered when the decoding proce…
This paper presents hardware-friendly LDPC decoding schedules for 5G hybrid automatic repeat request (HARQ) applications. Since there are built-in punctured blocks in the parity check matrix (PCM), a scheduling technique is proposed that allows the punctured nodes to be efficiently recovered. For HA…
In Asian countries, seals are widely used for authenticating the identity of a person or organization. Therefore, the ability to efficiently verify whether a seal is either genuine or forged is important. We propose an effective method of verification based on Hough transformation to approximate the…
In previous studies, a very sparse low-density parity-check (LDPC) code was designed for triple-level cell (TLC) NAND flash using non-Gray mapping, which is able to achieve comparable error-rate performance to the conventional Gray mapping-based scheme. Although a sparse LDPC code can be of benefit…
By using stochastic computation, a fully-parallel low-density parity-check (LDPC) decoder can be implemented using a lower wire complexity. In order to enhance the decoder performance, probability tracers, such as up/down counters, are added at each edge between variable nodes and check nodes, as de…