Open AccessBlock Markov superposition transmission of convolutional codes with minimum shift keying signalling
Author(s) -
Liu Xiying,
Liang Chulong,
Ma Xiao
Publication year - 2015
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2014.0751
Subject(s) - algorithm , computer science , mathematics , convolutional code , markov chain , transmission (telecommunications) , exit chart , code (set theory) , decoding methods , statistics , block code , telecommunications , concatenated error correction code , programming language , set (abstract data type)
In this study, the authors’ present a scheme, denoted as BMST‐MSK, which combines the block Markov superposition transmission (BMST) with the minimum shift keying (MSK) signalling. The BMST‐MSK can be implemented in two forms – the BMST with recursive MSK (BMST‐RMSK) and the BMST with non‐recursive MSK (BMST‐NRMSK). The BMST‐MSK admits a sliding‐window decoding/demodulation algorithm, where two schedules with or without iterative processing between the BMST and MSK (referred to as outer iteration) are discussed. To analyse the asymptotic performance of BMST‐MSK, the authors’ first assume a genie‐aided decoder and then derive the union bound for the equivalent genie‐aided system. Numerical results show that the performances of the BMST‐MSK match well with the derived lower bounds in the low error rate regions. From simulations, the authors’ found that the outer iterations can provide performance improvement for the BMST‐RMSK, but not for the BMST‐NRMSK. Taking a (2,1,2) convolutional code with input length of 10 000 bits as the basic code, the BMST‐NRMSK achieves a bit‐error‐rate of 10 −5 at E b / N 0 = 0.45 dB over additive white Gaussian noise channels, which is away from the Shannon limit about 0.25 dB.