e successive cancellation (SC) decoding algorithm further
a kind of fast SC decoding algorithm based on simplified sequence repetition (SR) nodes
namely simplified sequence repetition node-based fast SC (SSRFSC)
was proposed to optimize decoding latency issues of SC decoding algorithm.Different types of extended class of generalized parity-check (EG-PC) nodes were decomposed
merged and simplified based on the type of SR source node and decoding complexity
and Rate-C node was trimmed using fast simplified successive cancellation (Fast-SSC) decoding.Experimental results show that the decoding latency of the proposed algorithm can be reduced by up to 28% compared to the latest simplified sequence repetition (SRFSC) decoding algorithm when achieving similar decoding performance (approximately 0.1dB performance loss at frame error rate of 10
-3
).Moreover
compared to the Fast-SSC decoding algorithm
the decoding latency of proposed algorithm can be reduced by up to 49%.
关键词
Keywords
references
ARIKAN E . Channel polarization:a method for constructing capacity-achieving codes [C ] // Proceedings of 2008 IEEE International Symposium on Information Theory . Piscataway:IEEE Press , 2008 : 1173 - 1177 .
3GPP TSG RAN WG1 . Chairman's notes of agenda item 7.1.5 channel coding and modulation [EB ] . 2016 .
GAMAGE H , RAJATHEVA N , LATVA-AHO M . Channel coding for enhanced mobile broadband communication in 5G systems [C ] // Proceedings of 2017 European Conference on Networks and Communications (EuCNC) . Piscataway:IEEE Press , 2017 : 1 - 6 .
NIU K , CHEN K , LIN J R , et al . Polar codes:primary concepts and practical decoding algorithms [J ] . IEEE Communications Magazine , 2014 , 52 ( 7 ): 192 - 203 .
ZHANG C , YUAN B , PARHI K K . Reduced-latency SC polar decoder architectures [C ] // Proceedings of 2012 IEEE International Conference on Communications (ICC) . Piscataway:IEEE Press , 2012 : 3471 - 3475 .
YUAN B , PARHI K K . Low-latency successive-cancellation polar decoder architectures using 2-bit decoding [J ] . IEEE Transactions on Circuits and Systems I:Regular Papers , 2014 , 61 ( 4 ): 1241 - 1254 .
YUAN B , PARHI K K . Reduced-latency LLR-based SC list decoder for polar codes [C ] // Proceedings of the 25th Great Lakes Symposium on VLSI . New York:ACM Press , 2015 : 107 - 110 .
YUAN B , PARHI K K . Low-latency successive-cancellation list decoders for polar codes with multibit decision [J ] . IEEE Transactions on Very Large Scale Integration (VLSI) Systems , 2015 , 23 ( 10 ): 2268 - 2280 .
HUSMANN C , NIKOLAOU P C , NIKITOPOULOS K . Reduced latency ML polar decoding via multiple sphere-decoding tree searches [J ] . IEEE Transactions on Vehicular Technology , 2018 , 67 ( 2 ): 1835 - 1839 .
ALAMDAR-YAZDI A , KSCHISCHANG F R . A simplified succes sive-cancellation decoder for polar codes [J ] . IEEE Communications Letters , 2011 , 15 ( 12 ): 1378 - 1380 .
SARKIS G , GIARD P , VARDY A , et al . Fast polar decoders:algorithm and implementation [J ] . IEEE Journal on Selected Areas in Communications , 2014 , 32 ( 5 ): 946 - 957 .
HANIF M , ARDAKANI M . Fast successive-cancellation decoding of polar codes:identification and decoding of new nodes [J ] . IEEE Communications Letters , 2017 , 21 ( 11 ): 2360 - 2363 .
CONDO C , BIOGLIO V , LAND I . Generalized fast decoding of polar codes [C ] // Proceedings of IEEE Global Communications Conference (GLOBECOM) . Piscataway:IEEE Press , 2019 : 1 - 6 .
GAMAGE H , RANASINGHE V , RAJATHEVA N , et al . Low latency decoder for short blocklength polar codes [C ] // Proceedings of 2020 European Conference on Networks and Communications (EuCNC) . Piscataway:IEEE Press , 2020 : 305 - 310 .
ZHENG H T , BALATSOUKAS-STIMMING A , CAO Z Z , et al . Implementation of a high-throughput fast-SSC polar decoder with sequence repetition node [C ] // Proceedings of 2020 IEEE Workshop on Signal Processing Systems (SiPS) . Piscataway:IEEE Press , 2020 : 1 - 6 .
ZHENG H T , HASHEMI S A , BALATSOUKAS-STIMMING A , , et al . Threshold-based fast successive-cancellation decoding of polar codes [J ] . IEEE Transactions on Communications , 2021 , 69 ( 6 ): 3541 - 3555 .