Low Complexity Soft-Decision Sequential Decoding Using Hybrid Permutation for Reed-Solomon Codes
We present a soft-decision decoding method for Reed-Solomon codes (RS codes) using both cyclic and squaring permutations. These permutations are used to provide a convenient sequence which is predicted to have relatively low complex error pattern with respect to a modified Fano sequential algorithm. In order to preserve bit-level soft-decision values, each sequence of those permutation groups must keep equal weight distribution in symbol and bit level. Trellis construction is based on Wolf’s method and a binary systematic parity check matrix of RS codes is used for bit-level decoding. In simulation results, it is shown that a hybrid of those two permutations can be used for low complexity decoding approaching maximum likelihood performance.
Unable to display preview. Download preview PDF.
- 6.Shin, S.: Trellis decoding of Reed-Solomon codes. Ph.D. Thesis, (1994)Google Scholar
- 7.Matis, K.R. and Modestino, J.W.: Reduced-search soft-decision trellis decoding of linear block codes. IEEE Trans. Inform. Theory. 39 (1991) 440–444Google Scholar
- 8.Vardy, A. and Be’ery, Y.: Bit level soft-decision decoding of Reed-Solomon codes. IEEE Trans. Inform. Theory. IT-28 (1982) 349–355Google Scholar
- 9.Oh, M. and Sweeney, P.: Bit-level soft decision sequential decoding for RS codes. WCC’99. (1999) 111–120Google Scholar