Results 161 to 170 of about 864 (198)
Some of the next articles are maybe not open access.
A Simplified Successive-Cancellation Decoder for Polar Codes
IEEE Communications Letters, 2011A 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 +2 more sources
Permuted successive cancellation decoding for polar codes
2017 IEEE International Symposium on Information Theory (ISIT), 2017Defined 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 +4 more
openaire +2 more sources
Neural Successive Cancellation List Decoding of Polar Codes
2020 IEEE 31st Annual International Symposium on Personal, Indoor and Mobile Radio Communications, 2020Neural 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 +2 more sources
Fast Multibit Decision Polar Decoder for Successive-Cancellation List Decoding
Journal of Signal Processing Systems, 2020Successive-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 +2 more
openaire +2 more sources
Joint List Polar Decoder with Successive Cancellation and Sphere Decoding
2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2018For 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 +4 more
openaire +2 more sources
Threshold-Based Successive-Cancellation Decoding of Polar Codes
ICC 2020 - 2020 IEEE International Conference on Communications (ICC), 2020This 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 +5 more
openaire +3 more sources
Successive cancellation decoding of Reed-Solomon codes
Problems of Information Transmission, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Design and implementation of successive cancellation decoder
2015 International Conference on Pervasive Computing (ICPC), 2015Polar 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
Bounds on the List Size of Successive Cancellation List Decoding
2020 International Conference on Signal Processing and Communications (SPCOM), 2020Successive cancellation list decoding of polar codes provides very good performance for short to moderate block lengths. However, the list size required to approach the performance of maximum-likelihood decoding is still not well understood theoretically.
Mustafa Cemil Coskun, Henry D. Pfister
openaire +1 more source
Neural Successive Cancellation Flip Decoding of Polar Codes
Journal of Signal Processing Systems, 2020Dynamic successive cancellation flip (DSCF) decoding of polar codes is a powerful algorithm that can achieve the error correction performance of successive cancellation list (SCL) decoding, with an average complexity that is close to that of successive cancellation (SC) decoding at practical signal-to-noise ratio (SNR) regimes.
Nghia Doan +4 more
openaire +2 more sources