A High Throughput List Decoder Architecture for Polar Codes.

IEEE Transactions on Very Large Scale Integration (VLSI) Systems(2016)

引用 70|浏览74
暂无评分
摘要
While long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels when decoded by a low complexity successive-cancellation (SC) algorithm, the error performance of the SC algorithm is inferior for polar codes with finite block lengths. The cyclic redundancy check (CRC)-aided SC list (SCL) decoding algorithm has better error performance than the SC algorithm. Ho...
更多
查看译文
关键词
Throughput,Binary trees,Maximum likelihood decoding,Hardware,Reliability
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要