Referenced Items are not available for this document.
The first soft-decision decoding algorithm for algebraic-geometric codes is presented. This algorithm is developed based on the Koetter-Vardy algorithm, which was proposed for the decoding of Reed-Solomon codes. The interpolation process is modified by redefining the zero condition of a trivariate polynomial and introducing complexity reducing methods. Simulation results show that 0.7 and 1.7-dB performance improvements over the hard-decision decoding bound can be achieved in AWGN and quasi-static Rayleigh fading channels, respectively.
Published in:
Electronics Letters
(Volume:45
,
Issue:
25
)
Date of Publication: December 3 2009
- Page(s):
- 1334 - 1336
- ISSN :
- 0013-5194
- INSPEC Accession Number:
- 11006149
- Digital Object Identifier :
- 10.1049/el.2009.0940
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 15 December 2009
- Issue Date :
- December 3 2009
- Sponsored by :
- Institution of Engineering and Technology
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
