Abstract
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[1]. 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[2] and a binary systematic parity check matrix of RS codes is used for bit-level decoding[9]. In simulation results, it is shown that a hybrid of those two permutations can be used for low complexity decoding approaching maximum likelihood performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fano, R.: A Heuristic Discussion of Probabilistic Decoding. IEEE Trans. Inform. Theory. IT-9. (1963) 64–74
Wolf, J.K.: Efficient maximum likelihood decoding of linear block codes using a trellis. IEEE Trans. Inform. Theory. IT-20 (1978) 76–80
Reed, I.S. and Solomon, G.: Polynomial codes over certain finite fields,“ SIAM Journal on Applied Mathematics. 8 (1960) 300–304
Forney, G.D.: Generalized minimum distance decoding. IEEE Trans. Inform. Theory, IT-12 (1966) 125–131
Chase, D.: A class of algorithm for decoding clock codes with channel measurement information. IEEE Trans. Inform. Theory. IT-18 (1972) 170–182
Shin, S.: Trellis decoding of Reed-Solomon codes. Ph.D. Thesis, (1994)
Matis, K.R. and Modestino, J.W.: Reduced-search soft-decision trellis decoding of linear block codes. IEEE Trans. Inform. Theory. 39 (1991) 440–444
Vardy, A. and Be’ery, Y.: Bit level soft-decision decoding of Reed-Solomon codes. IEEE Trans. Inform. Theory. IT-28 (1982) 349–355
Oh, M. and Sweeney, P.: Bit-level soft decision sequential decoding for RS codes. WCC’99. (1999) 111–120
Jacob, I. and Berlekamp, E..: A lower bound to the distribution of communication for Sequential Decoding. EEE Trans. Inform. Theory. IT-13 (1967) 167–174
Savage, J.: The distribution of the sequential decoding computational time. IEEE Trans. Inform. Theory. IT-12 (1966) 143–147
Anderson, J.: Sequential decoding based on an error criterion. IEEE Trans. Inform. Theory. 40 (1994) 546–554
Martin, I., Honary, B., and Farrell, P.G.: Modified minimum weight decoding for RS codes. ELECTRONICS LETTERS. 31 (1995) 713–714.
Pei, D., Wang, C., and Omura, J.: Normal basis of finite field GF(2 m). IEEE Trans. Inform. Theory. IT-32 (1986) 285–287
Perlis, S.: Normal basis of cyclic fields of prime-power degree. Duke Math. J. 9 (1942) 507–517
Oh, M, and Sweeney, P.: Squaring permutation sequential decoding on normal basis for RS codes. ELECTRONICS LETTERS. 35 (1999) 1325–1326
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oh, Ms., Sweeney, P. (1999). Low Complexity Soft-Decision Sequential Decoding Using Hybrid Permutation for Reed-Solomon Codes. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_18
Download citation
DOI: https://doi.org/10.1007/3-540-46665-7_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66887-9
Online ISBN: 978-3-540-46665-9
eBook Packages: Springer Book Archive