2000 character limit reached
Block Orthogonal Sparse Superposition Codes for $ \sf{L}^3 $ Communications: Low Error Rate, Low Latency, and Low Power Consumption
Published 23 Mar 2024 in cs.IT, eess.SP, and math.IT | (2403.15692v1)
Abstract: Block orthogonal sparse superposition (BOSS) code is a class of joint coded modulation methods, which can closely achieve the finite-blocklength capacity with a low-complexity decoder at a few coding rates under Gaussian channels. However, for fading channels, the code performance degrades considerably because coded symbols experience different channel fading effects. In this paper, we put forth novel joint demodulation and decoding methods for BOSS codes under fading channels. For a fast fading channel, we present a minimum mean square error approximate maximum a posteriori (MMSE-A-MAP) algorithm for the joint demodulation and decoding when channel state information is available at the receiver (CSIR). We also propose a joint demodulation and decoding method without using CSIR for a block fading channel scenario. We refer to this as the non-coherent sphere decoding (NSD) algorithm. Simulation results demonstrate that BOSS codes with MMSE-A-MAP decoding outperform CRC-aided polar codes, while NSD decoding achieves comparable performance to quasi-maximum likelihood decoding with significantly reduced complexity. Both decoding algorithms are suitable for parallelization, satisfying low-latency constraints. Additionally, real-time simulations on a software-defined radio testbed validate the feasibility of using BOSS codes for low-power transmission.
- D. Han, B. Lee, S. Lee, and N. Lee, “MMSE-A-MAP decoder for block orthogonal sparse superposition codes in fading channels,” in Proc. IEEE Int. Conf. Commun. (ICC), 2022, pp. 2477–2482.
- B. Lee, D. Han, and N. Lee, “Demo: Real-time implementation of block orthogonal sparse superposition codes,” in Proc. IEEE Int. Conf. Commun. Workshops (ICC Workshops), 2022, pp. 1–2.
- F. Boccardi, R. W. Heath, A. Lozano, T. L. Marzetta, and P. Popovski, “Five disruptive technology directions for 5G,” IEEE Commun. Mag., vol. 52, no. 2, pp. 74–80, 2014.
- C. Yue, V. Miloslavskaya, M. Shirvanimoghaddam, B. Vucetic, and Y. Li, “Efficient decoders for short block length codes in 6G URLLC,” IEEE Commun. Mag., vol. 61, no. 4, pp. 84–90, 2023.
- G. P. Fettweis, “The tactile internet: Applications and challenges,” IEEE Veh. Technol. Mag., vol. 9, no. 1, pp. 64–70, 2014.
- X. Ge, “Ultra-reliable low-latency communications in autonomous vehicular networks,” IEEE Trans. Veh. Technol., vol. 68, no. 5, pp. 5005–5016, 2019.
- M. Luvisotto, Z. Pang, and D. Dzung, “Ultra high performance wireless control for critical applications: Challenges and directions,” IEEE Trans. Ind. Informat., vol. 13, no. 3, pp. 1448–1459, 2017.
- E. Calvanese Strinati, S. Barbarossa, J. L. Gonzalez-Jimenez, D. Ktenas, N. Cassiau, L. Maret, and C. Dehos, “6G: The next frontier: From holographic messaging to artificial intelligence using subterahertz and visible light communication,” IEEE Veh. Technol. Mag., vol. 14, no. 3, pp. 42–50, 2019.
- H. Tataria, M. Shafi, A. F. Molisch, M. Dohler, H. Sjöland, and F. Tufvesson, “6G wireless systems: Vision, requirements, challenges, insights, and opportunities,” Proc. IEEE, vol. 109, no. 7, pp. 1166–1199, 2021.
- ITU-R, “Recommendation ITU-R M.2160-0: Framework and overall objectives of the future development of IMT for 2030 and beyond,” International Telecommunication Union-Radiocommunication Sector, Tech. Rep., Sep. 2023.
- M. Shirvanimoghaddam, M. S. Mohammadi, R. Abbas, A. Minja, C. Yue, B. Matuz, G. Han, Z. Lin, W. Liu, Y. Li, S. Johnson, and B. Vucetic, “Short block-length codes for ultra-reliable low latency communications,” IEEE Commun. Mag., vol. 57, no. 2, pp. 130–137, 2019.
- RP-234058, “New SID: Study on solutions for Ambient IoT in NR,” 3GPP TSG RAN Meeting 102, Edinburgh, UK, Dec. 11th-15th 2023.
- RP-231542, “Rel-19 study on Ambient IoT,” 3GPP TSG RAN Meeting 101, Bangalore, India, Sep. 11th-15th 2023.
- RP-231774, “Discussion on study of Ambient IoT in Rel-19,” 3GPP TSG RAN Meeting 101, Bangalore, India, Sep. 11th-15th 2023.
- RP-231854, “Ambient IoT consideration in Rel-19,” 3GPP TSG RAN Meeting 101, Bangalore, India, Sep. 11th-15th 2023.
- RP-232160, “Views on rel-19 Ambient IoT,” 3GPP TSG RAN Meeting 101, Bangalore, India, Sep. 11th-15th 2023.
- A. Joseph and A. R. Barron, “Least squares superposition codes of moderate ditionary size are reliable at rates up to capacity,” IEEE Trans. Inf. Theory, vol. 58, no. 5, pp. 2541–2557, 2012.
- E. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489–509, 2006.
- A. Joseph and A. R. Barron, “Fast sparse superposition codes have near exponential error probability for R<𝒞𝑅𝒞{R}<\mathcal{C}italic_R < caligraphic_C,” IEEE Trans. Inf. Theory, vol. 60, no. 2, pp. 919–942, 2014.
- J. Barbier and F. Krzakala, “Approximate message-passing decoder and capacity achieving sparse superposition codes,” IEEE Trans. Inf. Theory, vol. 63, no. 8, pp. 4894–4927, 2017.
- C. Rush, A. Greig, and R. Venkataramanan, “Capacity-achieving sparse superposition codes via approximate message passing decoding,” IEEE Trans. Inf. Theory, vol. 63, no. 3, pp. 1476–1500, 2017.
- J. Barbier, M. Dia, and N. Macris, “Universal sparse superposition codes with spatial coupling and GAMP decoding,” IEEE Trans. Inf. Theory, vol. 65, no. 9, pp. 5618–5642, 2019.
- A. Greig and R. Venkataramanan, “Techniques for improving the finite length performance of sparse superposition codes,” IEEE Trans. Commun., vol. 66, no. 3, pp. 905–917, 2018.
- H. Cao and P. O. Vontobel, “Using list decoding to improve the finite-length performance of sparse regression codes,” IEEE Trans. Commun., vol. 69, no. 7, pp. 4282–4293, 2021.
- K. Hsieh and R. Venkataramanan, “Modulated sparse superposition codes for the complex AWGN channel,” IEEE Trans. Inf. Theory, vol. 67, no. 7, pp. 4385–4404, 2021.
- J. Park, J. Choi, W. Shin, and N. Lee, “Block orthogonal sparse superposition codes,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), 2021, pp. 1–5.
- D. Han, J. Park, Y. Lee, H. V. Poor, and N. Lee, “Block orthogonal sparse superposition codes for ultra-reliable low-latency communications,” IEEE Trans. Commun., vol. 71, no. 12, pp. 6884–6897, 2023.
- 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, 2009.
- ——, “From sequential decoding to channel polarization and back again,” 2019.
- Y. Polyanskiy, H. V. Poor, and S. Verdú, “Channel coding rate in the finite blocklength regime,” IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2307–2359, 2010.
- D. Kam, S. Yun, J. Choe, Z. Zhang, N. Lee, and Y. Lee, “2.8 A 21.9ns 15.7 Gbps/mm² (128,15) BOSS FEC decoder for 5G/6G URLLC applications,” in Proc. IEEE Int. Solid-State Circuits Conf. (ISSCC), vol. 67, 2024, pp. 50–52.
- 3GPP, “NR; Multiplexing and channel coding,” 3rd Generation Partnership Project (3GPP), Technical Specification (TS) 38.212, 04 2022, version 17.1.0.
- I. Tal and A. Vardy, “List decoding of polar codes,” IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2213–2226, 2015.
- H. Yao, A. Fazeli, and A. Vardy, “List decoding of Arıkan’s PAC codes,” Entropy, vol. 23, no. 7, p. 841, 2021.
- G. Choi and N. Lee, “Deep polar codes,” IEEE Trans. Commun., pp. 1–1, 2024.
- T. Schmidl and D. Cox, “Robust frequency and timing synchronization for OFDM,” IEEE Trans. Commun., vol. 45, no. 12, pp. 1613–1621, 1997.
- H. Lee, G. Choi, Y. Lee, and N. Lee, “Block orthogonal sparse superposition LDPC codes for URLLC,” submitted to IEEE Commun. Lett.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.