Block Markov Superposition Transmission with Bit-Interleaved Coded Modulation

Liang, Chulong; Huang, Kechao; Ma, Xiao; Bai, Baoming

doi:10.1109/lcomm.2014.013114.132651

Cited by 19 publications

(16 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Actually, this effectiveness has also been confirmed in the scenario where the high-order modulation is implemented over either AWGN channels or fast Rayleigh fading channels[31].…”

mentioning

confidence: 71%

Spatial Coupling of Generator Matrices: A General Approach to Design Good Codes at a Target BER

Liang

Zhuang

et al. 2014

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

For any given short code (referred to as the basic code), block Markov superposition transmission (BMST) provides a simple way to obtain predictable extra coding gain by spatially coupling the generator matrix of the basic code. This paper presents a systematic design methodology for BMST systems to approach the channel capacity at any given target bit error rate (BER) of interest. To simplify the design, we choose the basic code as the Cartesian product of a short block code. The encoding memory is then inferred from the genie-aided lower bound according to the performance gap of the short block code to the corresponding Shannon limit at the target BER. In addition to the sliding-window decoding algorithm, we propose to perform one more phase decoding to remove residual (rare) errors. A new technique that assumes a noisy genie is proposed to upper bound the performance. Under some mild assumptions, these genie-aided bounds can be used to predict the performance of the proposed two-phase decoding algorithm in the extremely low BER region. Using the Cartesian product of a repetition code as the basic code, we construct a BMST system with an encoding memory 30 whose performance at the BER of 10 −15 can be predicted within 1 dB away from the Shannon limit over the binary-input additive white Gaussian noise channel.Index Terms-Big convolutional codes, block Markov superposition transmission (BMST), capacity-approaching codes, genieaided bounds, spatial coupling, two-phase decoding (TPD).

show abstract

“…Actually, this effectiveness has also been confirmed in the scenario where the high-order modulation is implemented over either AWGN channels or fast Rayleigh fading channels[31].…”

mentioning

confidence: 71%

Spatial Coupling of Generator Matrices: A General Approach to Design Good Codes at a Target BER

Liang

Zhuang

et al. 2014

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Similar to the analyses in [12,13], for a given time t, if all the transmitted data g( e )(O :::; R :::; L -1, R cJ t) but g (t) are known to the receiver, the BMST system is reduced to an equivalent system similar to that in Fig. 3 of [13], where the only difference is that the high-order mapping 'P is replaced by the signal mapping. Let P = !Cenie (r) and P = !mvlsT-oFDM (r) be the performance functions of the equivalent system and the BMST-OFDM system, respectively, where p is the bit-error-rate (BER) and I � -:fz in dB.…”

Section: B Genie-aided Lower Boundmentioning

confidence: 77%

“…Let 'f! [71" k] be a binary linear code of length 71, and dimension k, which is referred to as the basic code [12,13]. We assume that n = lvlcN B for some positive integer B.…”

Section: A Encoding/decoding Algorithmmentioning

confidence: 99%

“…2 for reference. The decoding algorithm is essentially the same as Algo rithm 2 [13]. The difference is the existence of the iterative process between the decoding of BMST and the demapping after the equalization.…”

Section: A Encoding/decoding Algorithmmentioning

confidence: 99%

“…Recently, a coding scheme called block Markov super position transmission (BMST) [12][13][14] was proposed. The performance of the BMST codes can be predicted by a simple genie-aided bound [14], and the design of BMST codes is flexible in the sense that any code of any rate with fast encoding algorithm and efficient soft-in soft-out (SISO) decoding algorithm can be taken as the basic code [14].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Block Markov superposition transmission for high-speed railway wireless communication systems

Wang

Zhang

2015

2015 International Workshop on High Mobility Wireless Communications (HMWC)

Self Cite

View full text Add to dashboard Cite

Ahstract-The focus of this paper is coded orthogonal frequen cy division multiplexing (OFDM) system for high-speed railway wireless communication based on block Markov superposition transmission (BMST). The effect of Doppler spreading destroys the orthogonality among subcarriers, resulting in intercarrier interference (leI) in the OFDM systems. In order to mitigate the leI and get the soft information easily, we present a simple soft output algorithm based on zero forcing (ZF) equalization, and the soft information is given to the soft-in soft-out (SISO) demapper. We combine the OFDM system with BMST code, which can be easily designed for any given code rate with a predictable performance lower bound. Based on the iterative sliding-window decoding algorithm, BMST scheme outperforms the convolutional code (eC) scheme in the OFDM system for quadrature phase-shift keying (QPSK) and 16-quadrature ampli tude modulation (QAM). Numerical results show that the BMST OFDM system performs well over doubly selective channels. IndexTerms-Block Markov superposition transmis sion (BMST), doubly selective channels, high-speed railway, iterative sliding-window decoding, orthogonal frequency division multiplexing (OFDM), zero forcing equalization.

show abstract