Novel Scheme of Orthogonal Convolutional Coding and Non-Iterative Decoding for Mobile Satellite Communication Systems

Iterative decoding of orthogonal convolutional code is widely used for its excellent performance. However, the iterations lead to high complexity and long decoding delay, which is unsuitable for low- rate voice service in mobile satellite communications with on-board processing. In this paper, a novel scheme of orthogonal convolutional coding as well as an associated non-iterative joint decoding algorithm based on factor graph are proposed. Due to its non-iterative nature, this novel scheme has low decoding complexity and short latency, which indicates its potential on-board use in the low-rate satellite voice service, or other kinds of services with a high bit error rate (BER) tolerance and a tight delay requirement. Simulation results demonstrate the efficacy of the proposed novel coding scheme and non-iterative decoding algorithm in both AWGN and Rician channels.

[1]  Erik G. Ström,et al.  Soft demodulation algorithms for orthogonally modulated and convolutionally coded DS-CDMA systems , 2010, IEEE Transactions on Communications.

[2]  J. Hagenauer Forward error correcting for CDMA systems , 1996, Proceedings of ISSSTA'95 International Symposium on Spread Spectrum Techniques and Applications.

[3]  S. Stenholm Information, Physics and Computation, by Marc Mézard and Andrea Montanari , 2010 .

[4]  Pei Xiao,et al.  Comparison of different soft demodulation and decoding algorithms in coded M-ary orthogonal DS-CDMA systems , 2005, Second IFIP International Conference on Wireless and Optical Communications Networks, 2005. WOCN 2005..

[5]  Wayne E. Stark,et al.  Algorithm for joint decoding of turbo codes and M-ary orthogonal modulation , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[6]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[7]  Andrew J. Viterbi,et al.  Very Low Rate Convolutional Codes for Maximum Theoretical Performance of Spread-Spectrum Multiple-Access Channels , 1990, IEEE J. Sel. Areas Commun..

[8]  Frank R. Kschischang Codes defined on graphs , 2003, IEEE Commun. Mag..

[9]  Henk Wymeersch,et al.  Iterative Receiver Design , 2007 .

[10]  H.-A. Loeliger,et al.  An introduction to factor graphs , 2004, IEEE Signal Process. Mag..

[11]  X. Jin Factor graphs and the Sum-Product Algorithm , 2002 .

[12]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

[13]  Joachim Hagenauer,et al.  Soft-in/soft-out Hadamard despreader for iterative decoding in the IS-95(A) system , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.