Low Complexity Decoding Algorithms for Rate Compatible Modulation

Rate compatible modulation (RCM) has high spectrum efficiency and achieves seamless and blind rate adaptation in wide range of channel conditions. However, due to many convolution operations at symbol nodes, the belief propagation decoding algorithm of RCM has a high level of computational complexity. In this paper, we investigate the low complexity algorithms for fast decoding of RCM. Instead of computing the outgoing messages at symbol nodes via multi-level convolutions, we first design a novel two-level computing structure (2L-RCM) for symbol nodes in the probability-domain, each level is composed of one set of multiplications followed by one set of additions. Based on 2L-RCM, we derive Log-2L-RCM decoding algorithm in the log-domain, which converts the multiplications and additions of 2L-RCM into additions and Jacobian logarithms, respectively. Furthermore, we propose some approximate algorithms to reduce the complexity of Jacobian logarithms. In particular, the improved Max-Log-RCM (IMax-Log-RCM) algorithm obtains good performance-complexity trade-off. The simulation results and the numerical analyses show that IMax-Log-RCM achieves only 0.3-dB worse decoding performance than the original decoding algorithm with much fewer additions.

[1]  Jung-Fu Cheng,et al.  Linearly approximated log-MAP algorithms for turbo decoding , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[2]  Robert D. Nowak,et al.  Signal Reconstruction From Noisy Random Projections , 2006, IEEE Transactions on Information Theory.

[3]  P. Glenn Gulak,et al.  Simplified MAP Algorithm Suitable for Implementation of Turbo Decoders , 1998 .

[4]  Branka Vucetic,et al.  Near-Capacity Adaptive Analog Fountain Codes for Wireless Channels , 2013, IEEE Communications Letters.

[5]  Min Wang,et al.  Efficient coding modulation and seamless rate adaptation for visible light communications , 2015, IEEE Wireless Communications.

[6]  Feng Wu,et al.  Compressive Coded Modulation for Seamless Rate Adaptation , 2013, IEEE Transactions on Wireless Communications.

[7]  Dennis Goeckel,et al.  Adaptive coding for time-varying channels using outdated fading estimates , 1999, IEEE Trans. Commun..

[8]  Yan Dong,et al.  FPGA-based implementation of binary input compressive sensing decoder , 2014, 2014 3rd Mediterranean Conference on Embedded Computing (MECO).

[9]  Norihiko Morinaga,et al.  Adaptive modulation system with variable coding rate concatenated code for high quality multi-media communication systems , 1996, Proceedings of Vehicular Technology Conference - VTC.

[10]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[11]  Xiao Ma,et al.  Superposition Coded Modulation With Peak-Power Limitation , 2009, IEEE Transactions on Information Theory.

[12]  Yan Dong,et al.  An Efficient Rate Compatible Modulation With Variable Weight Sets , 2018, IEEE Access.

[13]  Hao Wang,et al.  Improved Log-MAP decoding algorithm for turbo-like codes , 2006, IEEE Communications Letters.

[14]  Devavrat Shah,et al.  Spinal codes , 2012, CCRV.

[15]  Shu Wang,et al.  Log-likelihood ratio algorithm for rate compatible modulation , 2013, 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013).

[16]  Shu Wang,et al.  A low-complexity rate compatible modulation via variable weight sets , 2014, 2014 IEEE Global Communications Conference.

[17]  Yan Dong,et al.  A Parallel Belief Propagation Decoding Algorithm for Rate Compatible Modulation , 2017, IEEE Communications Letters.

[18]  Martin J. Wainwright,et al.  Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$ -Constrained Quadratic Programming (Lasso) , 2009, IEEE Transactions on Information Theory.

[19]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[20]  Feng Wu,et al.  Fast Decoding and Hardware Design for Binary-Input Compressive Sensing , 2012, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

[21]  Branka Vucetic,et al.  Probabilistic Rateless Multiple Access for Machine-to-Machine Communication , 2015, IEEE Transactions on Wireless Communications.

[22]  Hsiao-Hwa Chen,et al.  Arithmetic-BICM for Seamless Rate Adaptation for Wireless Communication Systems , 2016, IEEE Systems Journal.

[23]  Richard G. Baraniuk,et al.  Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.

[24]  Henk Wymeersch,et al.  Log-domain decoding of LDPC codes over GF(q) , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[25]  E.J. Candes.  Compressive Sampling , 2022 .

[26]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[27]  Feng Wu,et al.  Seamless rate adaptation for wireless networking , 2011, MSWiM '11.

[28]  Ajay Dholakia,et al.  Efficient implementations of the sum-product algorithm for decoding LDPC codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[29]  Sachin Katti,et al.  Strider: automatic rate adaptation and collision handling , 2011, SIGCOMM.

[30]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[31]  Vahid Tarokh,et al.  Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling , 2009, IEEE Transactions on Signal Processing.