A Weighted Sum Based Construction of PAC Codes
- 22 September 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (1) , 28-31
Abstract
The polarization-adjusted convolutional (PAC) codes concatenate an outer convolutional transform with an inner polar transform to improve the error-correction performance of polar codes. In the short-to-medium codeword length regime, it can approach the normal approximation (NA) bound. However, its optimal rate-profile remains unknown. This paper proposes a new construction for PAC codes based on a weighted sum (WS) metric, which considers both the cutoff rates and the utilizations of the polarized subchannels. In comparison with the existing Reed-Muller (RM) rate-profiles, it can yield a flexible rate. By adjusting the design signal-to-noise ratio (SNR), an appropriate tradeoff between the decoding performance and complexity can be achieved. Simulation results show the designed codes can outperform the ones that are designed by the existing techniques.Keywords
Funding Information
- National Natural Science Foundation of China (62071498, 61873290, 61972431)
- Key Project of the NSFC-Guangdong Province Joint Program, China (U2001204)
- Science and Technology Program of Guangzhou, China (202002030470)
This publication has 12 references indexed in Scilit:
- List Viterbi Decoding of PAC CodesIEEE Transactions on Vehicular Technology, 2021
- Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List DecodingIEEE Transactions on Vehicular Technology, 2021
- Design of Short Polar Codes for SCL DecodingIEEE Transactions on Communications, 2020
- Polar SubcodesIEEE Journal on Selected Areas in Communications, 2015
- List Decoding of Polar CodesIEEE Transactions on Information Theory, 2015
- CRC-Aided Decoding of Polar CodesIEEE Communications Letters, 2012
- Efficient Design and Decoding of Polar CodesIEEE Transactions on Communications, 2012
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009
- Information Theory and Reliable Communication1972
- A heuristic discussion of probabilistic decodingIEEE Transactions on Information Theory, 1963