Results 11 to 20 of about 823 (198)
The complexity of successive interference cancellation at the receiver’s end is a challenging issue in conventional non-orthogonal multiple access assisted massive wireless networks. The computational complexity of decoding increases exponentially
Vishaka Basnayake +4 more
doaj +1 more source
A Scalable Successive-Cancellation Decoder for Polar Codes [PDF]
Polar codes are the first error-correcting codes to provably achieve channel capacity, asymptotically in code length, with an explicit construction. However, under successive-cancellation decoding, polar codes require very long code lengths to compete with existing modern codes.
Alexandre J. Raymond, Warren J. Gross
openaire +4 more sources
Folded successive cancelation decoding of polar codes [PDF]
Polar codes are the first explicit class of codes that are provably capacity-achieving under the successive cancelation (SC) decoding. As a suboptimal decoder, SC has quasi-linear complexity N(1 + log N) in the code length N. In this paper, we propose a new non-binary SC decoder with reduced complexity N/2(1 + log N/2) based on the folding operation ...
Sinan Kahraman +2 more
openaire +1 more source
Wireless Covert Communication with Polarization Dirty Constellation
Wireless covert communication is an emerging communication technique that prevents eavesdroppers. This paper presents a novel approach to wireless covert communication based on polar codes with dirty constellation polarization.
Mingyu Hu, Sen Qiao, Xiaopeng Ji
doaj +1 more source
Low Power, Area Efficient Architecture for Successive Cancellation Decoder
Polar codes have recently emerged as an error-correcting code and have become popular owing to their capacity-achieving nature. Polar code based communication system primarily consists of two parts, including Polar Encoder and Decoder.
Sujanth Roy J, G Lakshminarayanan
doaj +1 more source
Neural-Network-Assisted Polar Code Decoding Schemes
The traditional fast successive-cancellation (SC) decoding algorithm can effectively reduce the decoding steps, but the decoding adopts a sub-optimal algorithm, so it cannot improve the bit error performance. In order to improve the bit error performance
Hengyan Liu +3 more
doaj +1 more source
Molecular Polar Belief Propagation Decoder and Successive Cancellation Decoder [PDF]
By constructing chemical reaction networks (CRNs), this paper proposes a method of synthesizing polar decoder using belief propagation (BP) algorithm and successive cancellation (SC) algorithm, respectively. Theoretical analysis and simulation results have validated the feasibility of the method. Reactions in the proposed design could be experimentally
Zhiwei Zhong +4 more
openaire +2 more sources
Distributed CRC scheme for low-complexity successive cancellation flip decoding of polar codes
In this paper, we propose a novel successive cancellation flip (SCF) decoding to reduce the computational complexity compared to the conventional SCF decoding by using distributed CRC bits.
Haseong Kim, Hyunjee Lee, Hosung Park
doaj +1 more source
Partitioned successive-cancellation list decoding of polar codes [PDF]
Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results. In this paper, a partitioned SCL algorithm is proposed to reduce the large memory requirements of the conventional
Seyyed Ali Hashemi +4 more
openaire +2 more sources
Multi-CRC Polar Codes and M-SCFlip-Based Decoding
A multi-cyclic redundancy check (Multi-CRC) polar code construction algorithm is proposed in this paper to solve the error propagation problem of successive cancellation decoding for polar codes.
Rui Guo, Kangni Chen, Huaping Liu
doaj +1 more source

