|
|
马上注册，结交更多好友，享用更多功能，让你轻松玩转社区。
您需要 登录 才可以下载或查看，没有账号？注册
x
Abstract—The Chien search process is the most complex block
in the decoding of Bose–Chaudhuri–Hochquenghem (BCH) codes.
Since the BCH codes conduct the bit-by-bit error correction, they
often need a parallel implementation for high throughput applications.
The parallel implementation obviously needs much increased
hardware. In this paper, we propose a strength reduced architecture
for the parallel Chien search process. The proposed method
transforms the expensive modulo- 􀀀 multiplications into shift
operations, by which not only the hardware for multiplications but
also that for additions are much reduced. One example shows that
the hardware complexity is reduced by 90% in the implementation
of binary BCH (8191, 7684, 39) code with the parallel factor of 64.
Consequently, it is possible to achieve a speedup of 64 with only 13
times of the hardware complexity when compared with the serial
processing.
Strength-Reduced Parallel Chien Search.pdf
(247.36 KB, 下载次数: 138 )
|
|
/1 
eetop公众号
创芯大讲堂
创芯人才网
发表于 2011-1-6 22:15:25
