Browse > Article

Efficient VLSI Architecture for Factorization in Soft-Decision Reed-Solomon List Decoding  

Lee, Sung-Man (Department of Information, Communication, and Electronic Engineering, The Catholic University of Korea)
Park, Tae-Guen (Department of Information, Communication, and Electronic Engineering, The Catholic University of Korea)
Publication Information
Abstract
Reed-Solomon (RS) codes are the most widely used error correcting codes in digital communications and data storage. Recently, Sudan found algorithm of list decoder for RS codes. List decoder has larger decoding radius than conventional hard-decision decoding algorithms and return more than one candidate polynomial. But, the algorithm includes interpolation and factorization step that demand massive computations. In this paper, an efficient architecture and processing schedule are proposed. The architecture consists of R-MAC, memories, and control unit. The R-MAC computes both of RC and PU steps that are main part of the factorization algorithm. The proposed architecture can achieve higher hardware utilization efficiency (HUE) and throughput by using efficient processing schedule and memory architecture. Also, the architecture can be designed flexibly with scalability for various applications. We design and synthesize our architecture using Dongbu-Anam $0.18{\mu}m$ standard cell library and the maximum clock frequency is 330MHz.
Keywords
Reed-Solomon codes; soft-decision list decoder; factorization; VLSI architecture;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Koetter and A. Vardy, "Algebraic soft-ecision decoding of Reed-Solomon codes," IEEE Trans. Inf. Theory, vol. 49, no. 11, pp. 2809-2825, Nov. 2003.   DOI   ScienceOn
2 R. Koetter and A. Vardy, "A Complexity Reducing Transformation in Algebraic List Decoding of Reed-Solomon Codes," IEEE ITW2003, pp. 10-13, Paris, France, Mar. 2003.
3 Z. Wang and J. Ma, "High-speed interpolation architecture for soft-decision decoding of Reed-Solomon codes," IEEE Trans. VLSI systems, vol. 14, no. 9, pp. 937-950, Sep. 2006.   DOI
4 W. J. Gross, F. R. Kschischang, and P. Gulak, "Architecture and implementation of an interpolation processor for soft-decision Reed- solomon decoding," IEEE Trans. VLSI systems, vol. 15, no. 3, pp. 309-318, Mar. 2007.   DOI
5 W. J. Gross, F. R. Kschischang, R. Koetter, and P. Gulak, "Applications of algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Commun., vol. 54, no. 7, pp. 1224-1234, Jul. 2006.   DOI
6 I. S. Reed and G. Solomon, "Polynomial codes over certain finite fields," SIAM Journal of Applied Mathematics, vol. 8, pp. 300-304, 1960.   DOI   ScienceOn
7 R. M. Roth and G. Ruckenstein, "Efficient decoding of Reed-Solomon codes beyond half the minimum distance," IEEE Trans. Inform. Theory, vol. 46, pp.246-258, 2000.   DOI   ScienceOn
8 X. Zhang and K. Parhi, "Fast factorization architecture in soft decision Reed-Solomon decoding," IEEE Trans. VLSI. Syst., vol. 13, no. 4, pp. 413-426, April. 2005.   DOI
9 J. Ma, A. Vardy, and Z. Wang, "Low-latency factorization arhitecture for algebraic soft- decision decoding of Reed-Solomon codes," IEEE Trans. VLSI. Syst., vol. 15, no. 11, pp. 1225-1238, Nov. 2007.   DOI
10 X. Zhang, "Further exploring the strength of prediction in the factorization of soft-decision Reed-Solomon decoding," IEEE Trans. VLSI. Syst., vol. 15, no. 7, pp. 811-820, July. 2007.   DOI
11 A. Ahmed, R. Koetter, and N. Shanbhag, "VLSI architectures for soft-decision decoding of Reed-Solomon codes," in Proc. ICC, 2004, pp. 2584-2590.
12 R. E. Blahut, Theory and practice of Error Control Codes, Addison-Wesley, Reading MA, 1983.
13 M. Sudan, "Decoding of Reed-solomon codes beyond the error correction bound," J. complexity, vol. 12, pp. 180-193, 1997.
14 V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic- geometric codes," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 1755-1764, Sep. 1999.
15 W. J. Gross, F. R. Kschischang, R. Koetter, and P. Gulak, "Simulation results for algebraic soft-decision decoding of Reed-Solomon codes," in Proc. 21st Biennial symp. Commun., pp. 356-360, 2002.