Results 161 to 170 of about 823 (198)

Successive Cancellation Heap Polar Decoding

2016 IEEE Global Communications Conference (GLOBECOM), 2016
In this paper, the successive cancellation (SC) heap polar decoding scheme is firstly proposed to reduce the complexity. Unlike SC list decoder which keeps $L$ same length paths, SC heap decoding stores different length paths in a heap and always decodes the global optimal path in the root.
Huayi Zhou 0002, Xiao Liang 0005, Chuan Zhang 0001, Shunqing Zhang, Xiaohu You 0001   +4 more
openaire   +1 more source

Neural Successive Cancellation Decoding of Polar Codes

2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2018
Neural network (NN) based decoders have appeared as potential candidates to replace successive cancellation (SC) based and belief propagation (BP) decoders for polar codes, due to their one-shot-decoding property. Partitioned NN (PNN) decoder has provided a solution to make use of multiple NN decoders which are connected with BP decoding, with the ...
Nghia Doan, Seyyed Ali Hashemi, Warren J. Gross   +2 more
openaire   +1 more source

A Simplified Successive-Cancellation Decoder for Polar Codes

IEEE Communications Letters, 2011
A modification is introduced of the successive-cancellation decoder for polar codes, in which local decoders for rate-one constituent codes are simplified. This modification reduces the decoding latency and algorithmic complexity of the conventional decoder, while preserving the bit and block error rate.
Amin Alamdar Yazdi, Frank R. Kschischang
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

Neural Successive Cancellation List Decoding of Polar Codes

2020 IEEE 31st Annual International Symposium on Personal, Indoor and Mobile Radio Communications, 2020
Neural Network Decoders (NNDs) have been recently considered and investigated as an alternative to the classical algorithms for decoding Polar Codes. In particular, a class of partitioned decoders has been proposed where modified Successive Cancellation (SC) or Belief Propagation (BP) algorithms exploit the neural network decoding of short sublocks ...
Negrini S., Tralli V.
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 0005, Huayi Zhou 0002, Zaichen Zhang, Xiaohu You 0001, Chuan Zhang 0001   +4 more
openaire   +1 more source

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

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 ...
Haotian Zheng, Seyyed Ali Hashemi, Zizheng Cao, Antonius M. J. Koonen, John M. Cioffi, Andrea Goldsmith   +5 more
openaire   +2 more sources

Generalized Schematic Successive Cancellation Decoding for Polar Codes

2021 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom), 2021
Recently, generalized polar codes were introduced to provide more code lengths and rates without the need for shortening or puncturing. However, as the size of the kernel matrix increases, computing the Log-Likelihood Ratio (LLR) functions in successive cancellation decoder for these codes becomes mathematically more complicated.
Karim El-Abbasy, Ramy Farouk Taki Eldin, Salwa El-Ramly, Bassant Abdelhamid   +3 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