TY - GEN
T1 - Eliminating the fanout bottleneck in parallel long BCH encoders
AU - Parhi, Keshab K.
PY - 2004/3
Y1 - 2004/3
N2 - Long BCH codes can achieve about 0.6-dB additional coding gain over Reed-Solomon codes with 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%.
AB - Long BCH codes can achieve about 0.6-dB additional coding gain over Reed-Solomon codes with 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%.
UR - http://www.scopus.com/inward/record.url?scp=1942453871&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=1942453871&partnerID=8YFLogxK
U2 - 10.1109/TCSI.2004.823655
DO - 10.1109/TCSI.2004.823655
M3 - Conference contribution
AN - SCOPUS:1942453871
VL - 51
SP - 512
EP - 516
BT - IEEE Transactions on Circuits and Systems I: Regular Papers
ER -