EXIT Function Aided Design of Iteratively Decodable Codes for the Poisson PPM Channel

This paper presents and compares two iterative coded modulation techniques for deep-space optical communications using pulse-position modulation (PPM). The first code, denoted by SCPPM, consists of the serial concatenation of an outer convolutional code, an interleaver, a bit accumulator, and PPM. The second code, denoted by LDPC-PPM, consists of the serial concatenation of an LDPC code and PPM. We employ Extrinsic Information Transfer (EXIT) charts for their analysis and design. Under conditions typical of a communications link from Mars to Earth, SCPPM is 1 dB away from capacity, while LDPC-PPM is 1.4 dB away from capacity, at a Bit Error Rate (BER) of approximately 10-5. However, LDPC-PPM lends itself naturally to low latency parallel processing in contrast to SCPPM.

[1]  Jon Hamkins,et al.  Deep-Space Optical Communications Downlink Budget: Modulation and Coding , 2003 .

[2]  S. Shamai,et al.  Capacity of a pulse amplitude modulated direct detection photon channel , 1990 .

[3]  Jon Hamkins.  Performance of Binary Turbo-Coded 256-ary Pulse-Position Modulation , 1999 .

[4]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[5]  Robert J. McEliece,et al.  Practical codes for photon communication , 1981, IEEE Trans. Inf. Theory.

[6]  Hamid Hemmati,et al.  Deep space optical communications , 2006 .

[7]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[8]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[9]  Richard J. Barron.  Binary shaping for low-duty-cycle communications , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[10]  Kamran Kiasaleh,et al.  Turbo-coded optical PPM communication systems , 1998 .

[11]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[12]  Shlomo Shamai,et al.  Efficient Communication Over the Discrete-Time Memoryless Rayleigh Fading Channel with Turbo Coding/Decoding , 2000, Eur. Trans. Telecommun..

[13]  Stephan ten Brink,et al.  Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.

[14]  T. Ohtsuki,et al.  BER performance of turbo-coded PPM CDMA systems on optical fiber , 2000, Journal of Lightwave Technology.

[15]  J. L. Massey,et al.  Capacity, Cutoff Rate, and Coding for a Direct-Detection Optical Channel , 1981, IEEE Trans. Commun..

[16]  Jon Hamkins,et al.  Coded Modulation for the Deep-Space Optical Channel: Serially Concatenated Pulse-Position Modulation , 2005 .

[17]  S. Brink.  Convergence of iterative decoding , 1999 .

[18]  Aaron D. Wyner,et al.  Capacity and error-exponent for the direct detection photon channel-Part II , 1988, IEEE Trans. Inf. Theory.

[19]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[20]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[21]  J. H. Yuen,et al.  PPM demodulation for Reed-Solomon decoding for the optical space channel , 1982 .

[22]  Robert J. McEliece,et al.  Coding for Optical Channels With Photon-Counting , 1979 .

[23]  Jon Hamkins,et al.  Constrained coding for the deep-space optical channel , 2002, SPIE LASE.

[24]  D.M. Boroson,et al.  Overview of the Mars laser communications demonstration project , 2005, Digest of the LEOS Summer Topical Meetings, 2005..

[25]  Jin Young Kim,et al.  Turbo-coded optical direct-detection CDMA system with PPM modulation , 2001 .

[26]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[27]  Sergio Benedetto,et al.  A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes , 1996 .

[28]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[29]  Samuel Dolinar,et al.  Methodologies for designing LDPC codes using protographs and circulants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[30]  Dariush Divsalar,et al.  Constructing LDPC codes from simple loop-free encoding modules , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[31]  A. Biswas,et al.  Deep-Space Optical Communications Downlink Budget from Mars: System Parameters , 2003 .

[32]  J. Pierce,et al.  Optical Channels: Practical Limits with Photon Counting , 1978, IEEE Trans. Commun..