BCH Based U-UV Codes and Its SCL Decoding
- 28 February 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 1286-1300
Abstract
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.Keywords
Funding Information
- National Natural Science Foundation of China (62071498)
- Natural Science Foundation of Guangdong Province
This publication has 47 references indexed in Scilit:
- Efficient error-correcting codes in the short blocklength regimePhysical Communication, 2019
- A Flip-Syndrome-List Polar Decoder Architecture for Ultra-Low-Latency CommunicationsIEEE Access, 2018
- Concatenations of polar codes with outer BCH codes and convolutional codes2014
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 12002
- Multilevel codes: theoretical concepts and practical design rulesIEEE Transactions on Information Theory, 1999
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- Soft-decision decoding of linear block codes based on ordered statisticsIEEE Transactions on Information Theory, 1995
- Bounds on the decoding error probability of binary linear codes via their spectraIEEE Transactions on Information Theory, 1994
- On a class of error correcting binary group codesInformation and Control, 1960
- Application of Boolean algebra to switching circuit design and to error detectionTransactions of the I.R.E. Professional Group on Electronic Computers, 1954