Fast, efficient Fermat number transform used to compute F'(x) analogous to computation of syndrome in conventional decoding scheme. Eliminates polynomial multiplications and reduces number of multiplications in reconstruction of F'(x) to n log (n). Euclidean algorithm used to evaluate F(x) directly, without going through intermediate steps of solving error-locator and error-evaluator polynomials. Algorithm suitable for implementation in very-large-scale integrated circuits.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Fast Transform Decoding Of Nonsystematic Reed-Solomon Codes


    Beteiligte:
    Truong, Trieu-Kie (Autor:in) / Cheung, Kar-Ming (Autor:in) / Shiozaki, A. (Autor:in) / Reed, Irving S. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    01.04.1992



    Medientyp :

    Sonstige


    Format :

    Keine Angabe


    Sprache :

    Englisch






    Fast Reed-Solomon Decoder

    Liu, K. Y. | NTRS | 1986



    Soft Decoding of Reed-Solomon Codes: Applications to the DVB-RCS standard

    Martinez, A. / Colzi, E. / American Institute of Aeronautics and Astronautics et al. | British Library Conference Proceedings | 2001