Results 171 to 180 of about 11,140 (207)

Fast Multibit Decision Polar Decoder for Successive-Cancellation List Decoding

Journal of Signal Processing Systems, 2020
Successive-cancellation list (SCL) decoding for polar codes has the disadvantage of high latency owing to serial operations. To improve the latency, several algorithms with additional circuits have been proposed, but the area becomes larger. This paper proposes a fast multibit decision method having-high area efficiency based on the SCL decoding ...
Seo Lin Jeong, Jung Hyun Bae, Myung Hoon Sunwoo   +2 more
openaire   +1 more source

Permuted successive cancellation decoding for polar codes

2017 IEEE International Symposium on Information Theory (ISIT), 2017
Defined through a certain 2 × 2 matrix called Arikan's kernel, polar codes are known to achieve the symmetric capacity of binary-input discrete memoryless channels under the successive cancellation (SC) decoder. Yet, for short block-lengths, polar codes fail to deliver a compelling performance under the low complexity SC decoding scheme. Recent studies
Sarit Buzaglo, Arman Fazeli, Paul H. Siegel, Veeresh Taranalli, Alexander Vardy   +4 more
openaire   +1 more source

Design and implementation of successive cancellation decoder

2015 International Conference on Pervasive Computing (ICPC), 2015
Polar Codes, a coding scheme was introduced by Arikan to achieve the symmetric channel capacity. Encoder is constructed with the 32 block-length to transmit data through various channels like binary symmetric channel (BSC) and binary erasure channel (BEC), at decoder data is decoded successively. By channel polarization it gets recursively combined and
Sachin A. Desale, M.M. Jadhav
openaire   +1 more source

Joint List Polar Decoder with Successive Cancellation and Sphere Decoding

2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2018
For polar codes, both successive cancellation list (SCL) decoding and list sphere decoding (LSD) aim to balance performance and complexity. The same list structure but different decoding schedules of SCL and LSD can lead to a combination of both schemes.
Xiao Liang, Huayi Zhou, Zaichen Zhang, Xiaohu You, Chuan Zhang   +4 more
openaire   +1 more source

Threshold-Based Successive-Cancellation Decoding of Polar Codes

ICC 2020 - 2020 IEEE International Conference on Communications (ICC), 2020
This paper focuses on fast successive-cancellation (SC) decoding of polar codes. A threshold-based hard-decision-aided scheme is proposed to speed up the decoding process, especially when the communications channel has low noise. In addition, to eliminate the error-correction performance degradation caused by hard decisions, a backtracking strategy is ...
Zheng, Haotian, Hashemi, Seyyed Ali, Cao, Zizheng, Koonen, A.M.J., Cioffi, John, Goldsmith, Andrea   +5 more
openaire   +2 more sources

Successive cancellation decoding of Reed-Solomon codes

Problems of Information Transmission, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Hardness of Successive-Cancellation Decoding of Linear Codes

2020 IEEE International Symposium on Information Theory (ISIT), 2020
Successive-cancellation decoding has gained much renewed interest since the advent of polar coding a decade ago. For polar codes, successive-cancellation decoding can be accomplished in time O(n log n). However, the complexity of successive-cancellation decoding for other families of codes remains largely unexplored.
Arman Fazeli, Alexander Vardy, Hanwen Yao   +2 more
openaire   +1 more source

Low-Latency Successive-Cancellation Polar Decoder Architectures Using 2-Bit Decoding

IEEE Transactions on Circuits and Systems I: Regular Papers, 2014
Polar codes have emerged as important error correction codes due to their capacity-achieving property. Successive cancellation (SC) algorithm is viewed as a good candidate for hardware design of polar decoders due to its low complexity. However, for (n, k) polar codes, the long latency of SC algorithm of (2n-2) is a bottleneck for designing high ...
Bo Yuan, Keshab K. Parhi
openaire   +1 more source

Block successive cancellation decoding of polarization-based codes

2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2016
Linear codes constructed using a polarization transformation followed by short blocklength sub-codes are proposed. Decoding is realized by the successive cancellation algorithm combined with standard optimal or non-optimal decoding of the sub-codes. List successive cancellation decoding can also be used.
Dina Goldin, David Burshtein
openaire   +1 more source

Selective successive cancellation for decoding MIMO-OFDM transmission

2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004
A new iterative receiver based on Selective Successive Cancellation (SSC) is proposed for MIMO-OFDM systems. It improves the traditional successive cancellation (SC) method while having low complexity. The algorithm naturally interlaces the SC demodulation iterations with the decoding iterations.
null Xiangyang Zhuang, F.W. Vook
openaire   +1 more source