Paper Info
Title
Obtaining extra coding gain for short codes by block Markov superposition transmission
Abstract
In this paper, we present a new approach, called block Markov superposition transmission (BMST), to construct from short codes a class of convolutional codes with large constraint length. The BMST is very similar to superposition block Markov encoding (SBME), which has been widely used to prove multiuser coding theorems. We also present an iterative sliding-window decoding algorithm for the proposed transmission scheme. The extra coding gain obtained by BMST can be bounded in terms of the Markov order and with the help of the input-output weight enumerating function (IOWEF) of the BMST system, which can be computed from that of the short code by performing a trellis-based algorithm. Numerical results verify our analysis and show that an extra coding gain of 6.4 dB at bit-error rate (BER) 10-5 can be obtained by BMST of the [7, 4] Hamming code.
Year
DOI
Venue
2013
10.1109/ISIT.2013.6620587
ISIT
Keywords
Field
DocType
block markov superposition transmission,bmst system,multiuser coding theorems,input-output weight enumerating function,iterative sliding-window decoding algorithm,encoding,ber,constraint length,block codes,superposition block markov encoding,iowef,markov order,bit-error rate,hamming codes,sbme,trellis-based algorithm,transmission scheme,iterative decoding,short codes,error statistics,markov processes,extra coding gain,convolutional codes,hamming code,trellis codes,gain,bit error rate,decoding
Discrete mathematics,Hamming code,Combinatorics,Coding gain,Markov process,Convolutional code,Short Code,Computer science,Block code,Markov chain,Decoding methods
Conference
Volume
Issue
ISSN
null
null
2157-8095
Citations 
PageRank 
References 
19
0.93
19
Authors
4
Name
Order
Citations
PageRank
Xiao Ma148764.77
Chulong Liang210312.50
Kechao Huang3605.65
Qiutao Zhuang4443.56