Improved Successive Cancellation Decoding of Polar Codes

As improved versions of successive cancellation (SC) decoding algorithm, successive cancellation list (SCL) decoding and successive cancellation stack (SCS) decoding are used to improve the finite-length performance of polar codes. Unified descriptions of SC, SCL and SCS decoding algorithms are given as path searching procedures on the code tree of polar codes. Combining the ideas of SCL and SCS, a new decoding algorithm named successive cancellation hybrid (SCH) is proposed, which can achieve a better trade-off between computational complexity and space complexity. Further, to reduce the complexity, a pruning technique is proposed to avoid unnecessary path searching operations. Performance and complexity analysis based on simulations show that, with proper configurations, all the three improved successive cancellation (ISC) decoding algorithms can have a performance very close to that of maximum-likelihood (ML) decoding with acceptable complexity. Moreover, with the help of the proposed pruning technique, the complexities of ISC decoders can be very close to that of SC decoder in the moderate and high signal-to-noise ratio (SNR) regime.Comment: This paper is modified and submitted to IEEE Transactions on Communication

高齢者における認知症及び介護サービス利用状況と要介護度悪化との関連

京都大学0048新制・課程博士博士(社会健康医学)甲第19275号社医博第66号新制||社医||9(附属図書館)32277京都大学大学院医学研究科社会健康医学系専攻(主査)教授 古川 壽亮, 教授 佐藤 俊哉, 教授 髙橋 良輔学位規則第4条第1項該当Doctor of Public HealthKyoto UniversityDFA