Low complexity parallel Chien search architecture for RS decoder
暂无分享,去创建一个
[1] Keshab K. Parhi,et al. Low-complexity modified Mastrovito multipliers over finite fields GF(2/sup M/) , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).
[2] Christof Paar,et al. Optimized arithmetic for Reed-Solomon encoders , 1997, Proceedings of IEEE International Symposium on Information Theory.
[3] Tong Zhang,et al. Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials , 2001, IEEE Trans. Computers.
[4] Hanho Lee. High-speed VLSI architecture for parallel Reed-Solomon decoder , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..
[5] Hsie-Chia Chang,et al. A low-power Reed-Solomon decoder for STM-16 optical communications , 2002, Proceedings. IEEE Asia-Pacific Conference on ASIC,.
[6] Hanho Lee. An area-efficient Euclidean algorithm block for Reed-Solomon decoder , 2003, IEEE Computer Society Annual Symposium on VLSI, 2003. Proceedings..
[7] Keshab K. Parhi,et al. Small area parallel Chien search architectures for long BCH codes , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[8] Zhang Qian-ling,et al. Design of a high performance Reed-Solomon decoder with switch box control logic [HDTV] , 2001, ASICON 2001. 2001 4th International Conference on ASIC Proceedings (Cat. No.01TH8549).