Two-Step Quantized Decoding for Block Markov Superposition Transmission of Fourier Transform Pair Codes

This paper presents a two-step quantized decoding algorithm for the block Markov superposition transmission (BMST) system with Fourier transform pair (FTP) codes. The proposed algorithm aims to strike a balance among storage efficiency, computational complexity, and performance. In the first step, low-bit quantized information is used for iterative decoding, reducing storage space and computational complexity. In the second step, high-bit quantized information is employed to enhance overall performance. The simulation results demonstrate that the BMST-FTP system with two-step quantized decoding achieves comparable performance to high-bit quantization while maintaining low storage space and computational complexity. The proposed system offers a practical solution for efficient and high-performance BMST-FTP applications in real-world scenarios.