Results 151 to 160 of about 864 (198)

Weighted Sum-Rate Maximization and Task Completion Time Minimization for Multi-Tag MIMO Symbiotic Radio Networks. [PDF]

Sensors (Basel)
Suo L, Wang D, Zhou W, Peng X.
europepmc   +1 more source

A cyclic redundancy check aided encoding construction method for list sphere polar decoder. [PDF]

Sci Rep
Hu W, Chen H, Wang R, Guo Q, Dang S, Sun Y, Li X.   +6 more
europepmc   +1 more source

NOMA-MIMO in 5G network: a detailed survey on enhancing data rate. [PDF]

PeerJ Comput Sci
Halabouni M, Roslee M, Mitani S, Abuajwa O, Osman A, Binti Ali FZ, Waseem A.   +6 more
europepmc   +1 more source

Improved Successive Cancellation Decoding of Polar Codes [PDF]

IEEE Transactions on Communications, 2013
This paper is modified and submitted to IEEE Transactions on ...
Jiaru Lin, Kai Chen, Kai Niu
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Hardness of Successive-Cancellation Decoding of Linear Codes

2020 IEEE International Symposium on Information Theory (ISIT), 2020
Successive-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

Successive-Cancellation Decoding of Linear Source Code [PDF]

2019 IEEE Information Theory Workshop (ITW), 2019
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.
Jun Muramatsu
exaly   +4 more sources

Interleaved successive cancellation polar decoders

2014 IEEE International Symposium on Circuits and Systems (ISCAS), 2014
Polar 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   +2 more sources

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

Weight Distributions for Successive Cancellation Decoding of Polar Codes [PDF]

IEEE Transactions on Communications, 2020
15 pages, 2 figures, 2 ...
Nikita Polyanskii, Mars Davletshin
exaly   +3 more sources

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   +2 more sources