Results 51 to 60 of about 5,289 (159)

Low-Latency SC Decoder Architectures for Polar Codes

open access: yesCoRR, 2011
Nowadays polar codes are becoming one of the most favorable capacity achieving error correction codes for their low encoding and decoding complexity. However, due to the large code length required by practical applications, the few existing successive cancellation (SC) decoder implementations still suffer from not only the high hardware cost but also ...
Chuan Zhang 0001   +2 more
openaire   +2 more sources

Improved Adaptive Successive Cancellation List Decoding of Polar Codes

open access: yesEntropy, 2019
Although the adaptive successive cancellation list (AD-SCL) algorithm and the segmented-CRC adaptive successive cancellation list (SCAD-SCL) algorithm based on the cyclic redundancy check (CRC) can greatly reduce the computational complexity of the ...
Xiumin Wang   +5 more
doaj   +1 more source

A Flexible Polar Decoding Architecture With Adjustable Latency and Reliability

open access: yesIEEE Open Journal of the Communications Society
Future mobile and wireless communications should support various applications with their own reliability and latency requirements. Polar codes, adopted in the 5G standard, are capacity achieving as the codeword length increases even with low complexity ...
Shintaro Fujiwara, Hideki Ochiai
doaj   +1 more source

A Low-Complexity Belief Propagation Based Decoding Scheme for Polar Codes - Decodability Detection and Early Stopping Prediction

open access: yesIEEE Access, 2019
In the 5G communication systems, polar code has been adapted as the control channel coding solution in the enhanced mobile broadband (eMBB) scenario. Although different decoding schemes, including belief propagation (BP) and successive cancellation (SC ...
Yaohan Wang   +4 more
doaj   +1 more source

Network polar coded cooperation with joint SC decoding

open access: yesElectronics Letters, 2015
A network polar coded‐cooperative (NPCC) scheme with joint successive cancellation (SC) decoding at the destination is proposed. Plotkin's construction is employed to build polar codes; however, the proposed construction is opposite to the conventional method where two short codes jointly construct a longer length code. In the proposed construction the
Saqib Ejaz   +2 more
openaire   +1 more source

Complexity-Constrained D-SCFlip Decoding

open access: yesIEEE Open Journal of the Communications Society
Dynamic successive cancellation flip (D-SCFlip) decoding has emerged as a low-complexity alternative to successive cancellation list (SCL) decoding for polar codes, bridging the performance gap between conventional successive cancellation (SC) and SCL ...
Anna Fominykh   +3 more
doaj   +1 more source

Impact of Integer Quantization on Polar-Coding Over 4096-QAM OFDM Systems

open access: yesIEEE Access
Polar codes are fundamental to the control channels of fifth-generation (5G) systems. Owing to their excellent block error rate (BLER) performance, polar coding is considered a strong candidate for sixth-generation (6G) networks.
Wittawad Pimsri   +4 more
doaj   +1 more source

All-Integer Quantization for Low-Complexity Min-Sum Successive Cancellation Polar Decoder

open access: yesApplied Sciences
It is widely acknowledged in communication theory that polar codes have been proven to achieve channel capacity across a range of communication channels.
Wittawad Pimsri   +3 more
doaj   +1 more source

Simplified Early Stopping Criterion for Belief-Propagation Polar Code Decoder Based on Frozen Bits

open access: yesIEEE Access, 2019
Polar codes were first proposed by E. Arıkan in 2009 and have received significant attention in recent years. Successive-cancellation (SC) and belief-propagation (BP) decoding algorithms have been applied by some researchers to polar codes ...
Yongli Yan, Xuanxuan Zhang, Bin Wu
doaj   +1 more source

Hardware Architecture for List SC Decoding of Polar Codes

open access: yes, 2013
We present a hardware architecture and algorithmic improvements for list SC decoding of polar codes. More specifically, we show how to completely avoid copying of the likelihoods, which is algorithmically the most cumbersome part of list SC decoding. The hardware architecture was synthesized for a blocklength of N = 1024 bits and list sizes L = 2, 4 ...
Balatsoukas-Stimming, A.   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy