FPGA based a realization of BCH step-by-step decoding
碩士 === 大葉大學 === 電信工程學系碩士班 === 94 === In general, an algebraic decoder is with high hardware complexity or a conventional step-by-step decoder is with long decoding delay, and both of them are not efficient for a cyclic code in terms of decoding complexity. In order to overcome this difficulty, a mod...
Main Authors: | Wen Cheng Chou, 周文政 |
---|---|
Other Authors: | Ta Hsiang Hu |
Format: | Others |
Language: | zh-TW |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/50936397035222526195 |
Similar Items
-
On Step-by-Step Complete Decoding of Triple-Error-Correcting Binary BCH Code
by: Chien-Wei Hsiao, et al.
Published: (2004) -
Research and implementation of the step-by-step decoding algorithm for Golay code based on FPGA
by: Wei-Jui Cheng, et al.
Published: (2010) -
Design of decoders beyond BCH bound for BCH codes
by: 黃素雅
Published: (1992) -
Some aspects of BCH decoding
by: el-Guebaly, Samy
Published: (2012) -
Study of Parallel Encoder and Decoder of BCH
by: Jung-Yu Chen, et al.
Published: (2010)