On the bit-error rate of product accumulate codes in optical fiber communications

作     者：Li, J Cai, Y Narayanan, KR Lucero, A Pilipetskii, A Georghiades, CN 

作者机构：Lehigh Univ Dept Elect & Comp Engn Bethlehem PA 18015 USA Texas A&M Univ Dept Elect Engn College Stn TX 77843 USA Tyco Telecommun Eatontown NJ 07724 USA 

出 版 物：《JOURNAL OF LIGHTWAVE TECHNOLOGY》 (J Lightwave Technol)

年 卷 期：2004年第22卷第2期

页      面：640-646页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 0702[理学-物理学] 

基　　金：Chinese Academy of Science Striving Scholarship National Science Foundation 

主　　题：amplified spontaneous emission (ASE) noise forward-error correction (FEC) iterative decoding message passing decoding optical fiber communication serially concatenated codes union bounds 

摘      要：Product accumulate (PA) codes were proposed as a class of high-rate low-complexity, capacity-approaching codes on additive white Gaussian noise (AWGN) channels. In this paper, we investigate the performance of the PA codes on intensity modulated optical fiber channels where the amplified spontaneous emission (ASE) noise dominates all other noise sources. We consider binary ON-OFF keying (OOK) modulation and iterative soft-decision message-passing decoding for the PA codes. Three channel models for the ASE noise dominated channel are investigated: asymmetric chi-square, asymmetric Gaussian, and symmetric Gaussian channels (i.e., AWGN). At low signal-to-noise ratios (SNRs), due to the lack of tight bounds, code performance is evaluated using simulations of typical PA coding schemes. For high SNRs that are beyond simulation capabilities, we derive the pairwise error probability of the three channels and explore an average upper bound on the bit-error rate over the ensemble of PA codes. We show that AWGN channels, although fundamentally different from chi-square channels, can serve as a reference to approximate the performance of high-rate PA codes.