• DocumentCode
    1871348
  • Title

    Iterative decodable block codes for high-speed free space optical communication

  • Author

    Ren, Yongxiong ; Dang, Anhong ; Guo, Hong

  • Author_Institution
    Sch. of Electr. Eng. & Comput. Sci., Peking Univ., Beijing, China
  • fYear
    2009
  • fDate
    9-11 Sept. 2009
  • Firstpage
    220
  • Lastpage
    224
  • Abstract
    This paper investigates the performance of high-rate block codes in log-normal fading atmospheric channel based on the discussion of channel characteristics. Several block codes are under study, especially two kinds of iterative decoding codes with high code rate and low encoder/decoder complexity: hamming-based TPC codes and block circulant based LDPC codes. The code types selection and iterative decoding algorithms for the two codes are discussed. The performance of several codes under different turbulence strength are also reported. Both TPC and LDPC codes can achieve impressive coding gain based on theoretical analysis and extensive computer simulation. In term of superior property in coding gain, error floor effect and hardware implementation, we recommend TPCs as FEC scheme for FSO system.
  • Keywords
    Hamming codes; block codes; fading channels; iterative decoding; optical links; parity check codes; Hamming-based TPC codes; block circulant based LDPC codes; coding gain; computer simulation; error floor effect; high-speed free space optical communication; impressive coding gain; iterative decodable block codes; log-normal fading atmospheric channel; low encoder-decoder complexity; parity check codes; theoretical analysis; turbulence strength; Block codes; Computer errors; Computer simulation; Fading; Forward error correction; Hardware; Iterative algorithms; Iterative decoding; Optical fiber communication; Parity check codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Satellite and Space Communications, 2009. IWSSC 2009. International Workshop on
  • Conference_Location
    Tuscany
  • Print_ISBN
    978-1-4244-4384-0
  • Electronic_ISBN
    978-1-4244-3559-3
  • Type

    conf

  • DOI
    10.1109/IWSSC.2009.5286398
  • Filename
    5286398