BCH Based U-UV Codes and Its SCL Decoding

IEEE TRANSACTIONS ON SIGNAL PROCESSING(2024)

引用 0|浏览9
暂无评分
摘要
U-UV codes are constructed by a number of component codes in the (U | U +V) recursive structure, where the U codes and V codes are component codes. This construction is known as the Plotkin construction and the U-UV codes are also known as the generalized concatenated codes with inner polar codes. This paper proposes U-UV codes with primitive BCH component codes as a pursuit of designing competent short-to-medium length codes for future ultra low-latency communications. The U-UV code design considers both the finite length rate of the subchannels and the equal error probability rule, yielding a good performing U-UV code that is designed for a targeted transmission rate. The successive cancellation list (SCL) decoding and its complexity reduction variant are proposed to maximize the code's performance. Their decoding complexity and latency are analyzed. Decoding performance of the U-UV codes is further studied, showing that SCL decoding of the U-UV codes can approach its approximated maximum likelihood (ML) decoding bound. They can outperform other competent short-to-medium length codes, including polar codes, BCH codes and tail-biting convolutional (TBC) codes.
更多
查看译文
关键词
Codes,Maximum likelihood decoding,Polar codes,Complexity theory,Encoding,Systematics,Generators,Generalized concatenated codes,Plotkin construction,successive cancellation list decoding,U-UV codes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要