skip to main content
10.1145/3456415.3456439acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiccbnConference Proceedingsconference-collections
research-article

A Progressive PSS-SS-SCL Algorithm for Polar Codes

Authors Info & Claims
Published:06 June 2021Publication History

ABSTRACT

Path Splitting Selecting Strategy based on Search Set Successive Cancellation List (PSS-SS-SCL) Algorithm can effectively reduce the decoding complexity by reducing the number of unnecessary splits. In this paper, we reduces the number of bits in the critical set according to the depth of the Rate-1 node and set a decision threshold θ to reduce the complexity further and make the performance loss negligible. Simulation result shows that for L=2, P-PSS-SCL can achieve 35% reduction in complexity compared to PSS-SS-SCL decoding algorithm at Eb/N0=2.

References

  1. E. Arıkan, ‘‘Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels,’’ IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051–3073, Jul. 2009.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. I. Tal and A. Vardy, ‘‘List decoding of polar codes,’’ in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Aug. 2011, pp. 1–5.Google ScholarGoogle ScholarCross RefCross Ref
  3. K. Niu and K. Chen, ‘‘CRC-aided decoding of polar codes,’’ IEEE Commun. Lett., vol. 16, no. 10, pp. 1668–1671, Oct. 2012.Google ScholarGoogle ScholarCross RefCross Ref
  4. Z. Zhang, L. Zhang, X. Wang, C. Zhong and H. V. Poor, “A Split reduced Successive Cancellation List Decoder for Polar Codes,” IEEE Journal on Selected Areas in Communications, vol. 34, no. 2, pp. 292302, Feb. 2016.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Hashemi S A, Condo C, Gross W J. Fast simplified successivecancellation list decoding of polar codes [C]. In: 2017 IEEE Wireless Communications and Networking Conference Workshops(WCNCW), San Francisco, 2017. 1-6.Google ScholarGoogle Scholar
  6. Afisiadis O, Balatsoukas-Stimming A, Burg A. A low-complexity improved successive cancellation decoder for polar codes [C]. In: 2014 48th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, 2014. 2116-2120.Google ScholarGoogle Scholar
  7. C. Gao, R. Liu, B. Dai, and X. Han, “Path splitting selecting strategy-aided successive cancellation list algorithm for polar codes,” IEEE Communications Letters, vol. 23, no. 3, pp. 422–425, 2019.Google ScholarGoogle ScholarCross RefCross Ref
  8. Z. Zhang, K. Qin, L. Zhang, H. Zhang, and G. T. Chen, “Progressive bit-flipping decoding of polar codes over layered critical sets,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Dec. 2017, pp. 1–6.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Z. Zhang, K. Qin, L. Zhang, and G. T. Chen, ‘‘Progressive bit-flipping decoding of polar codes: A critical-set based tree search approach,’’ IEEE Access, vol. 6, pp. 57738–57750, 2018.Google ScholarGoogle ScholarCross RefCross Ref
  10. P. Trifonov, ‘‘Efficient design and decoding of polar codes,’’ IEEE Trans. Commun., vol. 60, no. 11, pp. 3221–3227, Nov. 2012.Google ScholarGoogle ScholarCross RefCross Ref
  11. P. Koopman and T. Chakravarty, “Cyclic redundancy code (CRC) polynomial selection for embedded networks,” in Proc. Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2004, pp. 145–154.Google ScholarGoogle ScholarCross RefCross Ref
  12. J. Li and H. Liu, "A Segmented CRC-Aided PSS-SS-SCL Algorithm for Polar Codes," 2020 Asia-Pacific International Symposium on Advanced Reliability and Maintenance Modeling (APARM), Vancouver, BC, Canada, 2020, pp. 1-4, doi: 10.1109/APARM49247.2020.9209430.Google ScholarGoogle ScholarCross RefCross Ref

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    ICCBN '21: Proceedings of the 2021 9th International Conference on Communications and Broadband Networking
    February 2021
    342 pages
    ISBN:9781450389174
    DOI:10.1145/3456415

    Copyright © 2021 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 6 June 2021

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited
  • Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format .

View HTML Format