• DocumentCode
    3167927
  • Title

    Eliminating the fanout bottleneck in parallel long BCH encoders

  • Author

    Parhi, Keshab K.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN, USA
  • Volume
    5
  • fYear
    2004
  • fDate
    20-24 June 2004
  • Firstpage
    2611
  • Abstract
    Long BCH codes can achieve about 0.6 dB additional coding gain over Reed-Solomon codes with a similar code rate in long-haul optical communication systems. BCH encoders are conventionally implemented by a linear feedback shift register architecture. Encoders of long BCH codes may suffer from the effect of large fanout, which may reduce the achievable clock speed. The data rate requirement of optical applications require parallel implementations of the BCH encoders. In this paper, a novel scheme based on look-ahead computation and retiming is proposed to eliminate the effect of large fanout in parallel long BCH encoders. For a (2047, 1926) code, compared to the original parallel BCH encoder architecture, the modified architecture can achieve a speedup of 132%.
  • Keywords
    BCH codes; Reed-Solomon codes; binary sequences; feedback; optical communication; parallel architectures; Reed-Solomon codes; fanout bottleneck; linear feedback shift register architecture; long-haul optical communication systems; look-ahead computation; parallel long BCH encoders; Clocks; Computer architecture; Concurrent computing; Delay; Frequency; Linear feedback shift registers; Optical fiber communication; Parallel processing; Polynomials; Reed-Solomon codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2004 IEEE International Conference on
  • Print_ISBN
    0-7803-8533-0
  • Type

    conf

  • DOI
    10.1109/ICC.2004.1313004
  • Filename
    1313004