Constrained coding for the deep-space optical channel

We investigate methods of coding for a channel subject to a large dead-time constraint, i.e., a constraint on the minimum spacing between transmitted pulses, with the deep-space optical channel as the motivating example. Several constrained codes designed to satisfy the dead-time constraint are considered and compared on the basis of throughput, complexity, and decoded error-rate. The performance of an iteratively decoded serial concatenation of a modulation code with an outer code is evaluated and shown to provide significant gains over Reed-Solomon concatenated with Pulse Position Modulation.

[1]  P. A. Franaszek,et al.  Sequence-state coding for digital transmission , 1968 .

[2]  Meera Srinivasan,et al.  Laboratory characterization of silicon avalanche photodiodes (APD) for pulse position modulation (PPM) detection , 2001, SPIE LASE.

[3]  John V. Sandusky,et al.  Design of the optoelectronic receiver for deep-space optical communications , 2000, LASE.

[4]  D. Slepian.  Permutation Modulation , 1965, Encyclopedia of Wireless Networks.

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

[6]  F. Pollara,et al.  Capacity of PPM on Gaussian and Webb channels , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[7]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

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

[9]  H. H. Tan.  Capacity of a multimode direct detection optical communication channel , 1981 .

[10]  Dariush Divsalar,et al.  Capacity of Pulse-Position Modulation (PPM) on Gaussian and Webb Channels , 2000 .

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

[12]  B. Marcus.  Constrained Systems and Coding for Recording Channels, in Handbook of Coding Theory, v. Finite-state Modulation Codes for Data Storage, Ieee , 2000 .

[13]  Harry H. Tan.  A statistical model of the photomultiplier gain process with applications to optical pulse detection , 1982 .

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

[15]  James R. Lesh,et al.  Bandwidth Limitations on Noiseless Optical Channel Capacity , 1982, IEEE Trans. Commun..

[16]  Schouhamer Immink,et al.  Codes for mass data storage systems , 2004 .

[17]  Jian Luo,et al.  On the capacity of M-ary runlength-limited codes , 1995, IEEE Trans. Inf. Theory.

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

[19]  Brian H. Marcus,et al.  Finite-State Modulation Codes for Data Storage , 2004 .

[20]  Brian H. Marcus,et al.  Bounds on the number of states in encoder graphs for input-constrained channels , 1991, IEEE Trans. Inf. Theory.

[21]  R. G. Lipes.  Pulse-Position-Modulation Coding as Near-Optimum Utilization of Photon Counting Channel with Bandwidth and Power Constraints , 1980 .

[22]  Jan L. Fan,et al.  Constrained coding and soft iterative decoding , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

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

[24]  Steven W. McLaughlin,et al.  An enumerative method for runlength-limited codes: permutation codes , 1999, IEEE Trans. Inf. Theory.

[25]  Steven W. McLaughlin.  The construction of M-ary (d, {infty}) codes that achieve capacity and have the fewest number of encoder states , 1997, IEEE Trans. Inf. Theory.

[26]  Kees A. Schouhamer Immink.  A practical method for approaching the channel capacity of constrained channels , 1997, IEEE Trans. Inf. Theory.

[27]  Paul H. Siegel,et al.  Codes for Digital Recorders , 1998, IEEE Trans. Inf. Theory.

[28]  Paul Wagner,et al.  Combinatorial pulse position modulation for power-efficient free-space laser communications , 1993, Photonics West - Lasers and Applications in Science and Engineering.

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

[30]  J. Keil Wolf.  Permutation codes, (d,k) codes and magnetic recording , 1990 .