2000 character limit reached
Shortened Polar Codes under Automorphism Ensemble Decoding (2403.00622v1)
Published 1 Mar 2024 in cs.IT and math.IT
Abstract: In this paper, we propose a low-latency decoding solution of shortened polar codes based on their automorphism groups. The automorphism group of shortened polar codes, designed according to two existing shortening patterns, are shown to be limited but non-empty, making the Automorphism Ensemble (AE) decoding of shortened polar codes possible. Extensive simulation results for shortened polar codes under AE are provided and are compared to the SC-List (SCL) algorithm. The block-error rate of shortened polar codes under AE matches or beats SCL while lowering the decoding latency.
- E. Arıkan, “Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051–3073, July 2009.
- “From polar to Reed-Muller codes: A technique to improve the finite-length performance,” IEEE Trans. Commun., vol. 62, no. 9, pp. 3084–3091, Aug. 2014.
- I. Tal and A. Vardy, “List decoding of polar codes,” IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2213–2226, Mar. 2015.
- “Design of polar codes in 5G new radio,” IEEE Commun. Surveys Tuts., vol. 23, no. 1, pp. 29–40, 2021.
- V. Miloslavskaya, “Shortened polar codes,” IEEE Trans. Inf. Theory, vol. 61, no. 9, pp. 4852–4865, Sept. 2015.
- “Low-complexity puncturing and shortening of polar codes,” in IEEE Wireless Commun. and Netw. Conf. Workshops (WCNCW), Mar. 2017.
- R. Wang and R. Liu, “A novel puncturing scheme for polar codes,” IEEE Commun. Lett., vol. 18, no. 12, pp. 2081–2084, Dec. 2014.
- “Automorphism ensemble decoding of Reed-Muller codes,” IEEE Trans. Commun., vol. 69, no. 10, pp. 6424–6438, July 2021.
- “Rate-compatible polar codes for automorphism ensemble decoding,” in International Symposium on Topics in Coding (ISTC), 2023, pp. 1–5.
- K. Ivanov and R. Urbanke, “On the efficiency of polar-like decoding for symmetric codes,” IEEE Trans. Commun., vol. 70, no. 1, pp. 163–170, Jan. 2022.
- M. Geiselhart et al., “On the automorphism group of polar codes,” in IEEE Int. Symp. on Inf. Theory (ISIT), July 2021.
- “Classification of automorphisms for the decoding of polar codes,” in IEEE Int. Conf. on Commun. (ICC), May 2022.
- “Polar codes for automorphism ensemble decoding,” in IEEE Inf. Theory Workshop (ITW), Oct. 2021.
- C. Kestel et al., “Automorphism ensemble polar code decoders for 6G URLLC,” in WSA & SCC, 2023.
- I. Reed, “A class of multiple-error-correcting codes and the decoding scheme,” Trans. IRE Prof. Group on Inf. Theory, vol. 4, no. 4, pp. 38–49, Sept. 1954.
- D. E. Muller, “Application of boolean algebra to switching circuit design and to error detection,” Trans. IRE Prof. Group on Inf. Theory, vol. EC-3, no. 3, pp. 6–12, Sept. 1954.
- C. Schürch, “A partial order for the synthesized channels of a polar code,” in IEEE Int. Symp. on Inf. Theory (ISIT), 2016, pp. 220–224.
- “Group properties of polar codes for automorphism ensemble decoding,” IEEE Trans. Inf. Theory, vol. 69, no. 6, pp. 3731–3747, 2023.
- The theory of error correcting codes, North-Holland Publishing Company, 1977.
- M. Geiselhart et al., “A polar subcode approach to belief propagation list decoding,” in IEEE Inf. Theory Workshop (ITW), Nov. 2022.
- “Dynamic frozen-function design for Reed-Muller codes with automorphism-based decoding,” IEEE Commun. Lett., vol. 99, no. 2, pp. 497–501, Feb. 2023.
- B. Yuan and K. Parhi, “Early stopping criteria for energy-efficient low-latency belief-propagation polar code decoders,” IEEE Trans. Signal Process., vol. 62, no. 24, pp. 6496–6506, Dec. 2014.
- “LLR-based successive cancellation list decoding of polar codes,” IEEE Trans. Signal Process., vol. 63, no. 19, pp. 5165–5179, Oct. 2015.