939 Hits in 2.2 sec

Log-logarithmic Time Pruned Polar Coding

Hsin-Po Wang, Iwan M. Duursma
2020 IEEE Transactions on Information Theory  
A pruned variant of polar coding is proposed for binary erasure channel (BEC). Fix any BEC.  ...  time complexity bC = O(log|log ε|) per information bit.  ...  This is the first time polar codes are tuned and proven to have bC as low as O(log log N ).  ... 
doi:10.1109/tit.2020.3041523 fatcat:ii3k5ibdabd7vjszqngut5lvm4

Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels [article]

Hsin-Po Wang, Iwan Duursma
2018 arXiv   pre-print
A pruned variant of polar coding is reinvented for all binary erasure channels.  ...  For small ε>0, we construct codes with block length ε^-5, code rate Capacity-ε, error probability ε, and encoding and decoding time complexity O(N|ε|) per block, equivalently O(|ε|) per information bit  ...  CONCLUDING REMARKS We propose a pruned variant of polar coding where the channel tree is pruned by closely looking at the Bhattacharyya parameters.  ... 
arXiv:1812.08106v1 fatcat:mfax67rzczdwff6c7xx5cgpjri

Table of contents

2021 IEEE Transactions on Information Theory  
Duursma Polar Codes' Simplicity, Random Codes' Durability 1478 H.-P. Wang and I. M. Duursma Log-Logarithmic Time Pruned Polar Coding 1509 R. Li and M.  ...  Zhao Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding 1559 L. Holzbaur, S. Puchinger, and A.  ... 
doi:10.1109/tit.2021.3057963 fatcat:5kq77cmhnrhq3l5ltrw26zelde

Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes [article]

Marco Mondelli, Seyyed Ali Hashemi, John Cioffi, Andrea Goldsmith
2020 arXiv   pre-print
This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang.  ...  Recently, a variant of polar codes with log-logarithmic time complexity per information bit has been introduced in [26] .  ...  This improves upon the logarithmic time complexity per information bit for SC decoding of standard polar codes.  ... 
arXiv:1909.04892v2 fatcat:dx2fizupsjggvil7frk6vkglom

Improved Successive Cancellation Decoding of Polar Codes

Kai Chen, Kai Niu, Jiaru Lin
2013 IEEE Transactions on Communications  
Unified descriptions of SC, SCL and SCS decoding algorithms are given as path searching procedures on the code tree of polar codes.  ...  codes.  ...  The time and space complexity of SCS are O (LN log N ) and O(DN ) respectively.  ... 
doi:10.1109/tcomm.2013.070213.120789 fatcat:klrh2afexbaankkues6rqmrqw4

Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes [article]

Seyyed Ali Hashemi, Marco Mondelli, Arman Fazeli, Alexander Vardy, John Cioffi, Andrea Goldsmith
2020 arXiv   pre-print
This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints.  ...  elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N^1-1/μ+N/Plog_2log_2N/P), where N is the block length of the code  ...  at each time step in a length N = 8 polar code.  ... 
arXiv:2012.13378v1 fatcat:v2ty5glqenfpfgdz7icpogsdtm

Enabling complexity-performance trade-offs for successive cancellation decoding of polar codes

Alexios Balatsoukas-Stimming, Georgios Karakonstantis, Andreas Burg
2014 2014 IEEE International Symposium on Information Theory  
Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest.  ...  In this paper, we propose a systematic method for enabling complexity-performance trade-offs by constructing polar codes based on an optimization problem which minimizes the complexity under a suitably  ...  We use log(·) to denote the binary logarithm. A.  ... 
doi:10.1109/isit.2014.6875380 dblp:conf/isit/Balatsoukas-StimmingKB14 fatcat:j2iq4fzwsjd6pan4ekg3thd5qu

List Viterbi Decoding of PAC Codes [article]

Mohammad Rowshan, Emanuele Viterbo
2020 arXiv   pre-print
Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a pre-coding step before the polar transform.  ...  The numerical results show that this concatenation improves the Hamming distance properties of polar codes.  ...  By employing LVA, the time complexity reduces to O(2 m 2L/2 m log(2L/2 m )) = O(2L log(2L/2 m )). VI.  ... 
arXiv:2007.05353v1 fatcat:t6er5rpy7fbihbvqmkzuaozkbm

A Joint Detection and Decoding Scheme for PC-SCMA System Based on Pruning Iteration

Yongxing Zhang, Wenping Ge, Pengju Zhang, Mengyao Gao, Gecheng Zhang
2020 Symmetry  
Polar coding and sparse code multiple access (SCMA) are key technologies for 5G mobile communication, the joint design of them has a great significance to improve the overall performance of the transmitter-receiver  ...  In this paper, we firstly propose a pruning iterative joint detection and decoding algorithm (PI-JDD) based on the confidence stability of resource nodes.  ...  decoding deviation by locking the correct codes timely.  ... 
doi:10.3390/sym12101624 fatcat:7hehcn3jsrabpaot37klnhsxr4

Complexity-Adjustable SC Decoding of Polar Codes for Energy Consumption Reduction [article]

Haotian Zheng, Bin Chen, Luis F. Abanto-Leon, Zizheng Cao, Ton Koonen
2019 arXiv   pre-print
In addition, a logarithmic likelihood ratio (LLR)-threshold based path extension scheme is designed to further reduce the memory consumption of stack decoding.  ...  Numerical simulation results show that without affecting the error correction performance, the proposed ELSCS decoding algorithm provides a flexible tradeoff between time complexity and computational complexity  ...  , J., Fan, Y., Xia, C., Tsui, C.Y., Jin, J., Chen, K., et al.: ‘Low- complexity list successive-cancellation decoding of polar codes using list pruning’.  ... 
arXiv:1912.07649v1 fatcat:7axwp3yvana3hde7kmm7xq42xm

Rate-Compatible Punctured Polar Codes: Optimal Construction Based on Polar Spectra [article]

Kai Niu, Jincheng Dai, Kai Chen, Jiaru Lin, Q. T. Zhang, Athanasios V. Vasilakos
2017 arXiv   pre-print
Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels.  ...  In this paper, we establish a systematic framework to design the rate-compatible punctured polar (RCPP) codes with arbitrary code length.  ...  Throughout this paper, log means "logarithm to base 2", and ln stands for the natural logarithm. B.  ... 
arXiv:1612.01352v2 fatcat:cfgfhlz46jhk3g3dlsbafa55re

CRC-aided Logarithmic Stack Decoding of Polar Codes for Ultra Reliable Low Latency Communication in 3GPP New Radio

Luping Xiang, Zeynep B. Kaykac Egilmez, Robert G. Maunder, Lajos Hanzo
2019 IEEE Access  
In addition, we propose a pair of techniques for further improving the performance of the Log-SCS polar decoder.  ...  This paper provides a detailed tutorial on the Cyclic Redundancy Check (CRC)-aided logarithmic successive cancellation stack (Log-SCS) algorithm.  ...  code graph, one at a time in sequential order from top to bottom.  ... 
doi:10.1109/access.2019.2901596 fatcat:qtdj7sjpfjhntom3otje443cd4

A Split-Reduced Successive Cancellation List Decoder for Polar Codes

Zhaoyang Zhang, Liang Zhang, Xianbin Wang, Caijun Zhong, H. Vincent Poor
2016 IEEE Journal on Selected Areas in Communications  
This paper focuses on low complexity successive cancellation list (SCL) decoding of polar codes.  ...  counter value larger than a predefined threshold ω is deemed to be the correct path, which will survive at the decoding stage, while other paths with counter value smaller than the threshold will be pruned  ...  for polar codes.  ... 
doi:10.1109/jsac.2015.2504321 fatcat:xdefhmuzznccvp5qqir6ymvvme

An Efficient List Decoder Architecture for Polar Codes [article]

Jun Lin, Zhiyuan Yan
2014 arXiv   pre-print
However, for polar codes with short and moderate code length, the decoding performance of the SC algorithm is inferior.  ...  An efficient path pruning unit suitable for large list size is also proposed.  ...  POLAR CODES AND ITS CA-SCL ALGORITHM A.  ... 
arXiv:1409.4744v2 fatcat:p5yc2rpujzhu5cxeoracle6aaa

Reduced Latency ML Polar Decoding via Multiple Sphere-Decoding Tree Searches

Chistopher Husmann, Panagiotis Chatzi Nikolaou, Konstantinos Nikitopoulos
2018 IEEE Transactions on Vehicular Technology  
Sphere decoding (SD) has been proposed as an efficient way to perform maximum-likelihood (ML) decoding of Polar codes.  ...  For Polar codes of 128 block size, both realizations can provide a latency reduction of up to four orders of magnitude compared to state-of-the-art Polar sphere decoders.  ...  With F = 1 0 1 1 , the N ×N matrix F ⊗n is the n-fold Kronecker power of F with n = log 2 N and F ⊗n = F ⊗ F ⊗(n−1) . Then, the generator matrix of a (N,K) polar code is G N = F ⊗n .  ... 
doi:10.1109/tvt.2017.2761262 fatcat:5o3y2q4tavampcpt7n3rmh65fq
« Previous Showing results 1 — 15 out of 939 results