Toggle Main Menu Toggle Search

Open Access padlockePrints

Interpolation based progressive algebraic chase decoding of Reed-Solomon codes

Lookup NU author(s): Dr Martin Johnston


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


This paper proposes an interpolation based progressive algebraic Chase decoding (PACD) algorithm for Reed-Solomon (RS) codes. Based on the received information, 2. (eta > 0) interpolation test-vectors are constructed. They are ordered using a reliability function, assessing their potential of yielding the intended message. The decoding is performed progressively granting priority to decode the test-vectors that are more likely to yield the intended message, and it will be terminated once the intended message is found. In the proposal, the decoding of a later test-vector utilizes the interpolation information that is generated during the decoding of the earlier ones. It results in the binary tree that represents the evolution of the interpolated polynomial sets growing in a depth-first-search manner. The PACD algorithm has the advantage of adapting its decoding computation to the channel condition, leveraging the average decoding complexity. This channel dependent feature will be validated by our simulation results which show that the PACD algorithm is less complex than various interpolation based algebraic decoding algorithms. We will also demonstrate that it can achieve a high RS decoding performance.

Publication metadata

Author(s): Zhao JC, Chen L, Ma X, Johnston M

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 2016 IEEE International Conference on Communications (ICC)

Year of Conference: 2016

Online publication date: 14/07/2016

Acceptance date: 01/01/1900

Publisher: Institute of Electrical and Electronics Engineers


DOI: 10.1109/ICC.2016.7511110

Library holdings: Search Newcastle University Library for this item

ISBN: 9781479966646