Poster Open Access

Adaptive Quantization of the Polar Successive Cancellation Decoder

Ertuğrul, Yiğit; Arikan, Erdal


Citation Style Language JSON Export

{
  "publisher": "Zenodo", 
  "DOI": "10.5281/zenodo.3565299", 
  "author": [
    {
      "family": "Ertu\u011frul, Yi\u011fit"
    }, 
    {
      "family": "Arikan, Erdal"
    }
  ], 
  "issued": {
    "date-parts": [
      [
        2019, 
        12, 
        6
      ]
    ]
  }, 
  "abstract": "<p>Polar codes and its implementation challenges are an active study field&nbsp;since [1]. SC decoding algorithm is the well known polar decoding algortihm&nbsp;described in [1]. The chip area of the SC decoder is dominated by memory&nbsp;and register chains in the deeply-pipelined architecture [2]. An adaptive&nbsp;quantization technique is proposed to reduce the memory complexity of the&nbsp;polar SC decoder. Due to polarization of synthesized bit channels, some&nbsp;portion of the bits could be decoded by diminishing the log-likelihood ratios&#39;<br>\n(LLRs) bit precision with a negligible communications performance loss.&nbsp;Unlike standard SC decoding, which operates with constant bit precision&nbsp;throughout decoding, this method utilizes varying number of bits to&nbsp;represent LLRs among the levels of the decoder. Bit precision of each&nbsp;decoding level could be determined by a heuristic method. Another method&nbsp;is motivated by maximizing the mutual information between the levels of the&nbsp;decoder [3]. Adaptive quantization method reduces the memory complexity&nbsp;of the decoder proportional to coding rate.</p>", 
  "title": "Adaptive Quantization of the Polar Successive Cancellation Decoder", 
  "type": "graphic", 
  "id": "3565299"
}
59
54
views
downloads
All versions This version
Views 5959
Downloads 5454
Data volume 100.9 MB100.9 MB
Unique views 5555
Unique downloads 4747

Share

Cite as