Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/248291
Title: Efficient Algebraic Soft-Decision Decoding of Reed-Solomon Codes
Authors: Jun Ma
Year: 2008
Abstract: Algebraic soft-decision decoding of Reed-Solomon codes delivers promisinggain over conventional hard-decision decoding. The major computational stepsin algebraic soft-decoding (as well as Sudan-type list-decoding) are bivariatepolynomial interpolation and factorization. In this thesis, we present techniquesfrom both algorithmic and VLSI architectural level that greatly reduce the
URI: http://localhost/handle/Hannan/248291
Appears in Collections:Thesis

Files in This Item:
File SizeFormat 
TL75732.pdf1.03 MBAdobe PDF
Title: Efficient Algebraic Soft-Decision Decoding of Reed-Solomon Codes
Authors: Jun Ma
Year: 2008
Abstract: Algebraic soft-decision decoding of Reed-Solomon codes delivers promisinggain over conventional hard-decision decoding. The major computational stepsin algebraic soft-decoding (as well as Sudan-type list-decoding) are bivariatepolynomial interpolation and factorization. In this thesis, we present techniquesfrom both algorithmic and VLSI architectural level that greatly reduce the
URI: http://localhost/handle/Hannan/248291
Appears in Collections:Thesis

Files in This Item:
File SizeFormat 
TL75732.pdf1.03 MBAdobe PDF
Title: Efficient Algebraic Soft-Decision Decoding of Reed-Solomon Codes
Authors: Jun Ma
Year: 2008
Abstract: Algebraic soft-decision decoding of Reed-Solomon codes delivers promisinggain over conventional hard-decision decoding. The major computational stepsin algebraic soft-decoding (as well as Sudan-type list-decoding) are bivariatepolynomial interpolation and factorization. In this thesis, we present techniquesfrom both algorithmic and VLSI architectural level that greatly reduce the
URI: http://localhost/handle/Hannan/248291
Appears in Collections:Thesis

Files in This Item:
File SizeFormat 
TL75732.pdf1.03 MBAdobe PDF