Successive cancellation list polar decoder using log-likelihood ratios

Bo Yuan; Keshab K. Parhi

doi:10.1109/ACSSC.2014.7094505

Successive cancellation list polar decoder using log-likelihood ratios

Bo Yuan, Keshab K. Parhi

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

31 Scopus citations

Abstract

Successive cancellation list (SCL) decoding algorithm is a powerful method that can help polar codes achieve excellent error-correcting performance. However, the current SCL algorithm and decoders are based on likelihood or log-likelihood forms, which render high hardware complexity. In this paper, we propose a log-likelihood-ratio (LLR)-based SCL (LLR-SCL) decoding algorithm, which only needs half the computation and storage complexity than the conventional one. Then, based on the proposed algorithm, we develop low-complexity VLSI architectures for LLR-SCL decoders. Analysis results show that the proposed LLR-SCL decoder achieves 50% reduction in hardware and 98% improvement in hardware efficiency.

Original language	English (US)
Title of host publication	Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers
Editors	Michael B. Matthews
Publisher	IEEE Computer Society
Pages	548-552
Number of pages	5
ISBN (Electronic)	9781479982974
DOIs	https://doi.org/10.1109/ACSSC.2014.7094505
State	Published - Apr 24 2015
Event	48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States Duration: Nov 2 2014 → Nov 5 2014

Publication series

Name	Conference Record - Asilomar Conference on Signals, Systems and Computers
Volume	2015-April
ISSN (Print)	1058-6393

Other

Other	48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Country/Territory	United States
City	Pacific Grove
Period	11/2/14 → 11/5/14

Keywords

Log-likelihood ratio (LLR)
Low-complexity
Polar codes
Successive cancellation list (SCL)
VLSI

Publisher link

10.1109/ACSSC.2014.7094505

Find It

Find It at U of M Libraries

Cite this

Yuan, B., & Parhi, K. K. (2015). Successive cancellation list polar decoder using log-likelihood ratios. In M. B. Matthews (Ed.), Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers (pp. 548-552). Article 7094505 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2015-April). IEEE Computer Society. https://doi.org/10.1109/ACSSC.2014.7094505

Successive cancellation list polar decoder using log-likelihood ratios. / Yuan, Bo; Parhi, Keshab K.
Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers. ed. / Michael B. Matthews. IEEE Computer Society, 2015. p. 548-552 7094505 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2015-April).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Yuan, B & Parhi, KK 2015, Successive cancellation list polar decoder using log-likelihood ratios. in MB Matthews (ed.), Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers., 7094505, Conference Record - Asilomar Conference on Signals, Systems and Computers, vol. 2015-April, IEEE Computer Society, pp. 548-552, 48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, United States, 11/2/14. https://doi.org/10.1109/ACSSC.2014.7094505

@inproceedings{67e87a97c9434050b1d37714acd1f638,

title = "Successive cancellation list polar decoder using log-likelihood ratios",

abstract = "Successive cancellation list (SCL) decoding algorithm is a powerful method that can help polar codes achieve excellent error-correcting performance. However, the current SCL algorithm and decoders are based on likelihood or log-likelihood forms, which render high hardware complexity. In this paper, we propose a log-likelihood-ratio (LLR)-based SCL (LLR-SCL) decoding algorithm, which only needs half the computation and storage complexity than the conventional one. Then, based on the proposed algorithm, we develop low-complexity VLSI architectures for LLR-SCL decoders. Analysis results show that the proposed LLR-SCL decoder achieves 50% reduction in hardware and 98% improvement in hardware efficiency.",

keywords = "Log-likelihood ratio (LLR), Low-complexity, Polar codes, Successive cancellation list (SCL), VLSI",

author = "Bo Yuan and Parhi, {Keshab K.}",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 ; Conference date: 02-11-2014 Through 05-11-2014",

year = "2015",

month = apr,

day = "24",

doi = "10.1109/ACSSC.2014.7094505",

language = "English (US)",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

publisher = "IEEE Computer Society",

pages = "548--552",

editor = "Matthews, {Michael B.}",

booktitle = "Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers",

}

TY - GEN

T1 - Successive cancellation list polar decoder using log-likelihood ratios

AU - Yuan, Bo

AU - Parhi, Keshab K.

PY - 2015/4/24

Y1 - 2015/4/24

N2 - Successive cancellation list (SCL) decoding algorithm is a powerful method that can help polar codes achieve excellent error-correcting performance. However, the current SCL algorithm and decoders are based on likelihood or log-likelihood forms, which render high hardware complexity. In this paper, we propose a log-likelihood-ratio (LLR)-based SCL (LLR-SCL) decoding algorithm, which only needs half the computation and storage complexity than the conventional one. Then, based on the proposed algorithm, we develop low-complexity VLSI architectures for LLR-SCL decoders. Analysis results show that the proposed LLR-SCL decoder achieves 50% reduction in hardware and 98% improvement in hardware efficiency.

AB - Successive cancellation list (SCL) decoding algorithm is a powerful method that can help polar codes achieve excellent error-correcting performance. However, the current SCL algorithm and decoders are based on likelihood or log-likelihood forms, which render high hardware complexity. In this paper, we propose a log-likelihood-ratio (LLR)-based SCL (LLR-SCL) decoding algorithm, which only needs half the computation and storage complexity than the conventional one. Then, based on the proposed algorithm, we develop low-complexity VLSI architectures for LLR-SCL decoders. Analysis results show that the proposed LLR-SCL decoder achieves 50% reduction in hardware and 98% improvement in hardware efficiency.

KW - Log-likelihood ratio (LLR)

KW - Low-complexity

KW - Polar codes

KW - Successive cancellation list (SCL)

KW - VLSI

UR - http://www.scopus.com/inward/record.url?scp=84940538392&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940538392&partnerID=8YFLogxK

U2 - 10.1109/ACSSC.2014.7094505

DO - 10.1109/ACSSC.2014.7094505

M3 - Conference contribution

AN - SCOPUS:84940538392

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 548

EP - 552

BT - Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers

A2 - Matthews, Michael B.

PB - IEEE Computer Society

T2 - 48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015

Y2 - 2 November 2014 through 5 November 2014

ER -

Successive cancellation list polar decoder using log-likelihood ratios

Abstract

Publication series

Other

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this