---
_id: '10364'
abstract:
- lang: eng
  text: 'This paper characterizes the latency of the simplified successive-cancellation
    (SSC) decoding scheme for polar codes under hardware resource constraints. In
    particular, when the number of processing elements P that can perform SSC decoding
    operations in parallel is limited, as is the case in practice, the latency of
    SSC decoding is O(N1-1/μ + N/P log2 log2 N/P), where N is the block length of
    the code and μ is the scaling exponent of the channel. Three direct consequences
    of this bound are presented. First, in a fully-parallel implementation where P
    = N/2, the latency of SSC decoding is O(N1-1/μ), which is sublinear in the block
    length. This recovers a result from our earlier work. Second, in a fully-serial
    implementation where P = 1, the latency of SSC decoding scales as O(N log2 log2
    N). The multiplicative constant is also calculated: we show that the latency of
    SSC decoding when P = 1 is given by (2 + o(1))N log2 log2 N. Third, in a semi-parallel
    implementation, the smallest P that gives the same latency as that of the fully-parallel
    implementation is P = N1/μ. The tightness of our bound on SSC decoding latency
    and the applicability of the foregoing results is validated through extensive
    simulations.'
acknowledgement: "S. A. Hashemi is supported by a Postdoctoral Fellowship from the
  Natural Sciences and\r\nEngineering Research Council of Canada (NSERC) and by Huawei.
  M. Mondelli is partially\r\nsupported by the 2019 Lopez-Loreta Prize. A. Fazeli
  and A. Vardy were supported in part by\r\nthe National Science Foundation under
  Grant CCF-1764104."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Seyyed Ali
  full_name: Hashemi, Seyyed Ali
  last_name: Hashemi
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Arman
  full_name: Fazeli, Arman
  last_name: Fazeli
- first_name: Alexander
  full_name: Vardy, Alexander
  last_name: Vardy
- first_name: John
  full_name: Cioffi, John
  last_name: Cioffi
- first_name: Andrea
  full_name: Goldsmith, Andrea
  last_name: Goldsmith
citation:
  ama: Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism
    versus latency in simplified successive-cancellation decoding of polar codes.
    <i>IEEE Transactions on Wireless Communications</i>. 2022;21(6):3909-3920. doi:<a
    href="https://doi.org/10.1109/TWC.2021.3125626">10.1109/TWC.2021.3125626</a>
  apa: Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., &#38; Goldsmith,
    A. (2022). Parallelism versus latency in simplified successive-cancellation decoding
    of polar codes. <i>IEEE Transactions on Wireless Communications</i>. Institute
    of Electrical and Electronics Engineers. <a href="https://doi.org/10.1109/TWC.2021.3125626">https://doi.org/10.1109/TWC.2021.3125626</a>
  chicago: Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John
    Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation
    Decoding of Polar Codes.” <i>IEEE Transactions on Wireless Communications</i>.
    Institute of Electrical and Electronics Engineers, 2022. <a href="https://doi.org/10.1109/TWC.2021.3125626">https://doi.org/10.1109/TWC.2021.3125626</a>.
  ieee: S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith,
    “Parallelism versus latency in simplified successive-cancellation decoding of
    polar codes,” <i>IEEE Transactions on Wireless Communications</i>, vol. 21, no.
    6. Institute of Electrical and Electronics Engineers, pp. 3909–3920, 2022.
  ista: Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2022. Parallelism
    versus latency in simplified successive-cancellation decoding of polar codes.
    IEEE Transactions on Wireless Communications. 21(6), 3909–3920.
  mla: Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation
    Decoding of Polar Codes.” <i>IEEE Transactions on Wireless Communications</i>,
    vol. 21, no. 6, Institute of Electrical and Electronics Engineers, 2022, pp. 3909–20,
    doi:<a href="https://doi.org/10.1109/TWC.2021.3125626">10.1109/TWC.2021.3125626</a>.
  short: S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith,
    IEEE Transactions on Wireless Communications 21 (2022) 3909–3920.
date_created: 2021-11-28T23:01:29Z
date_published: 2022-06-01T00:00:00Z
date_updated: 2024-09-10T13:03:18Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/TWC.2021.3125626
external_id:
  arxiv:
  - '2012.13378'
  isi:
  - '000809406400028'
intvolume: '        21'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2012.13378
month: '06'
oa: 1
oa_version: Preprint
page: 3909-3920
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
  name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: IEEE Transactions on Wireless Communications
publication_identifier:
  eissn:
  - 1558-2248
  issn:
  - 1536-1276
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
  record:
  - id: '10053'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Parallelism versus latency in simplified successive-cancellation decoding of
  polar codes
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 21
year: '2022'
...