---
res:
  bibo_abstract:
  - This work analyzes the latency of the simplified successive cancellation (SSC)
    decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It
    is shown that, unlike conventional successive cancellation decoding, where latency
    is linear in the block length, the latency of SSC decoding is sublinear. More
    specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block
    length and µ is the scaling exponent of the channel, which captures the speed
    of convergence of the rate to capacity. Numerical results demonstrate the tightness
    of the bound and show that most of the latency reduction arises from the parallel
    decoding of subcodes of rate 0 and 1.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Marco
      foaf_name: Mondelli, Marco
      foaf_surname: Mondelli
      foaf_workInfoHomepage: http://www.librecat.org/personId=27EB676C-8706-11E9-9510-7717E6697425
    orcid: 0000-0002-3242-7020
  - foaf_Person:
      foaf_givenName: Seyyed Ali
      foaf_name: Hashemi, Seyyed Ali
      foaf_surname: Hashemi
  - foaf_Person:
      foaf_givenName: John
      foaf_name: Cioffi, John
      foaf_surname: Cioffi
  - foaf_Person:
      foaf_givenName: Andrea
      foaf_name: Goldsmith, Andrea
      foaf_surname: Goldsmith
  bibo_doi: 10.1109/ISIT44484.2020.9174141
  bibo_volume: 2020-June
  dct_date: 2020^xs_gYear
  dct_identifier:
  - UT:000714963400069
  dct_isPartOf:
  - http://id.crossref.org/issn/2157-8095
  - http://id.crossref.org/issn/9781728164328
  dct_language: eng
  dct_publisher: IEEE@
  dct_title: Simplified successive cancellation decoding of polar codes has sublinear
    latency@
...