Paper Info
Title
Achievable rates and forward-backward decoding algorithms for the Gaussian relay channels under the one-code constraint
Abstract
This paper is concerned with the Gaussian relay channel (GRC) under the one-code constraint, where the source and the relay utilize the same code to send message. An advantage of such one-code constraint is that the error propagation resulting from re-encoding can be mitigated as the relay can forward directly the decoded “codeword” to the destination. The maximal achievable rate of the considered GRC is derived using the technique of superposition block Markov encoding based on the single code. Moreover, the forward-backward (FB) decoding strategies over the sliding window are developed both at the destination and at the relay. When LDPC codes are applied to the GRC system, a practical FB message passing decoding algorithm is presented. Simulation results show that the decoding performance can be improved as the window length increases and a small length (no greater than 4) is good enough for the FB decoding, and that re-encoding at relay may degrade the decoding performance at the destination.
Year
DOI
Venue
2014
10.1109/ICC.2014.6883639
ICC
Keywords
Field
DocType
relay networks (telecommunication),forward-backward decoding,sliding window,error propagation,gaussian channels,ldpc codes,fb message passing decoding,maximal achievable rate,superposition block markov encoding,gaussian relay channels,window length,parity check codes,markov processes,grc,decoding,one-code constraint,encoding,signal to noise ratio,protocols
Sequential decoding,Berlekamp–Welch algorithm,Sliding window protocol,Computer science,Low-density parity-check code,Algorithm,Code word,Decoding methods,List decoding,Relay
Conference
ISSN
Citations 
PageRank 
1550-3607
1
0.37
References 
Authors
10
3
Name
Order
Citations
PageRank
Xiujie Huang1285.53
Haiqiang Chen210.70
Xiao Ma348764.77