KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/kmitl/1

Browse

Settings

Subject: search.filters.subject.belief propagation

Search Results

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Improving Belief Propagation Decoding of Polar Codes using Bi-Directional Bit-Flipping Strategy
    (2022-07-01)
    Mitsungnern, Nuttawat
    ;
    Imtawil, Virasit
    ;
    Meesomboon, Anupap
    ;
    Khunkitti, Pirat
    ;
    Phakphisu, Watid
    It is difficult to achieve high throughput and low latency from the cyclic redundancy check (CRC-) aided successive cancellation list (CA-SCL) polar decoder employed in 5G new radio systems. To tackle this problem, the hardware-efficient belief propagation (BP) decoder has been extensively studied. Unfortunately, the performance of the BP decoding for polar codes is quite poor. To improve the performance of this decoder, a novel bi-directional bit-flipping (BF) strategy is proposed. The rule of generating the flip set based on the post log-likelihood ratio (LLR) is combined with the possibility of the two-way flipping. With the help of this idea, the decoding performance of BP decoder is identical to that of the CA-SCL decoder. Moreover, with the same complexity, our proposed BF strategy outperforms both the best known one-directional BF strategy and the previously found bi-directional BF strategy at BLER of 10<sup>-4</sup>.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Serial belief propagation for the high-rate LDPC decoders and performances in the bit patterned media systems with media noise
    (2011-01-01)
    Phakphisut, Watid
    ;
    Supnithi, Pornchai
    ;
    Sopon, Thanomsak
    ;
    Myint, Lin M.M.
    In this work, we propose to use the serial belief propagation or serial scheduling in the 2-D bit patterned media (BPM) system with media noise. The serial scheduling methods are applied to the random LDPC codes and quasi-cyclic LDPC (QC-LDPC) codes of high code rates. Both are constructed from the progress-edge growth (PEG) algorithm. We compare the performance of the LDPC codes using the serial belief propagation and the conventional belief propagation (BP) decoding. The simulation results show that the serial scheduling provides a faster convergence speed and a better bit error rate performance than the conventional BP in an AWGN channel. The serial belief propagation is also shown to offer the performance gains over the BP decoding for the BPM system with various media noise levels. © 2011 IEEE.