Results 171 to 180 of about 11,243 (215)
Joint Iterative Decoding Design of Cooperative Downlink SCMA Systems. [PDF]
Cheng H, Zhang M, Su R.
europepmc +1 more source
Intelligent Omni-Surface-Assisted Cooperative Hybrid Non-Orthogonal Multiple Access: Enhancing Spectral Efficiency Under Imperfect Successive Interference Cancellation and Hardware Distortions. [PDF]
John Kennedy HS, Kumaravelu VB.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Hardness of Successive-Cancellation Decoding of Linear Codes
2020 IEEE International Symposium on Information Theory (ISIT), 2020Successive-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
exaly +2 more sources
Interleaved successive cancellation polar decoders
2014 IEEE International Symposium on Circuits and Systems (ISCAS), 2014Polar codes are among the most promising error correction codes due to their ability to achieve the symmetric capacities of the binary-input discrete memoryless channels (B-DMCs). However, how to design successive cancellation (SC) decoders which can maximize the hardware utilization efficiency is still challenging due to the inherent serial nature of ...
Chuan Zhang 0001, Keshab K. Parhi
openaire +1 more source
Successive Cancellation Heap Polar Decoding
2016 IEEE Global Communications Conference (GLOBECOM), 2016In 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 +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), 2018Neural 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 +2 more
openaire +1 more source
Successive-Cancellation Decoding of Linear Source Code [PDF]
This paper investigates the error probability of several decoding methods for a source code with decoder side information, where the decoding methods are: 1) symbol-wise maximum a posteriori decoding, 2) successive-cancellation decoding, and 3) stochastic successive-cancellation decoding.
exaly +3 more sources
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 +1 more source
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 +1 more source
Weight Distributions for Successive Cancellation Decoding of Polar Codes [PDF]
15 pages, 2 figures, 2 ...
Mars, Nikita Polyanskii
exaly +3 more sources

