Paper Info
Title
Rate Matching and Piecewise Sequence Adaptation for Polar Codes with Reed-Solomon Kernels
Abstract
The paper studies rate matching for polar codes with Reed-Solomon (RS) kernels. A low-complexity rate matching scheme, referred to as smallest index puncturing, is put forward with validity proof. To resolve the dramatically increased complexity of reliability sequence generation due to rate matching, a piecewise sequence adaptation method is designed. The method significantly cuts down the computation complexity while keeping a negligible performance loss. Simulation results demonstrate the performance gain of the 4-dimension RS kernel over the original binary 2-by-2 kernel under rate matching, and verify the efficacy of the proposed piecewise method.
Year
DOI
Venue
2018
10.1109/WCSP.2018.8555566
2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)
Keywords
Field
DocType
Reed-Solomon kernel,rate matching,piecewise method,computation complexity,piecewise sequence adaptation method,reliability sequence generation,low-complexity rate matching scheme,Reed-Solomon kernels,polar codes
Kernel (linear algebra),Computer science,Algorithm,Real-time computing,Reed–Solomon error correction,Polar,Decoding methods,Piecewise,Puncturing,Encoding (memory),Binary number
Conference
ISSN
ISBN
Citations 
2325-3746
978-1-5386-6120-8
0
PageRank 
References 
Authors
0.34
5
4
Name
Order
Citations
PageRank
Ran Zhang11379.77
Hamid Saber200.34
Yiqun Ge3104.64
Wuxian Shi411.73