Speaker: Xiao Ma

Title: Block Markov Superposition Transmission: A Simple and Flexible Method for Constructing Good Codes

Abstract: Block Markov Superposition Transmission (BMST) codes are a class of spatially coupled codes contructured from short codes, where the generator matrices of the involved short codes (referred to as basic codes) are coupled. The encoding process of BMST can be as fast as that of the basic code, while the decoding process can be implemented as an iterative sliding-window decoding (SWD) algorithm with a tunable delay. More importantly, BMST codes have a simple lower bound relating to the transmission memory and the performance of the short code. Simulations as well as thresold analysis show that the lower bounds can be matched with a moderate decoding delay in the low bit-error-rate (BER) region, implying that the iterative SWD algorithm is near optimal. BMST codes can also admit a two-phase decoding (TPD) algorithm, whose performance in the low BER region can be upper-bound. It has been verified by simulation that the construction approach is applicable not only to binary phase-shift keying (BPSK) modulation but also to bit-interleaved coded modulation (BICM), spatial modulation, continuous phase modulation (CPM) and intensity modulation in visible light communications (VLC). In addition, BMST codes can be used to contruct good multiple-rate codes for wide region of code rates, e.g., BMST with Hadamard transform (HT) coset codes, BMST with time-sharing repetition and/or single-parity-check (RSPC) codes, BMST with time-sharing nonbinary repetition and/or uncoded transmission (RUN) codes, systematic BMST with punctured repetition codes.