خط مشی دسترسیدرباره ما
ثبت نامثبت نام
راهنماراهنما
فارسی
ورودورود
صفحه اصلیصفحه اصلی
جستجوی مدارک
تمام متن
منابع دیجیتالی
رکورد قبلیرکورد بعدی
Document Type : Latin Dissertation
Language of Document : English
Record Number : 150005
Doc. No : ET21797
Main Entry : Jason Bellorado
Title Proper : Low-Complexity Soft Decoding Algorithms for Reed-Solomon Codes
Note : This document is digital این مدرک بصورت الکترونیکی می باشد
Abstract : Two approaches to soft decoding of Reed-Solomon Codes (of block length n) arepresented. The first procedure is an algebraic, Chase-type, technique which firstproduces a set of test-vectors that are equivalent on all except q << n coordinatepositions. The similarity of the test-vectors is utilized to reduce the complexity ofinterpolation, the process of constructing a set of polynomials that obey constraintsimposed by each test-vector. By first considering the equivalent indices, a polyno-mial common to all test-vectors is constructed. The required set of polynomials isthen produced by interpolating the final q dissimilar indices utilizing a binary-treestructure.In the factorization step, a candidate message is extracted from each interpola-..tested for theQ1 PC1 bus cardBoth these projects mere sofixare des elopment efforts tonards contributing to dlfferentaspects of Roboucs and lZ1echatronics projects m the Controls and Roboucs Group..
Subject : Electericl tess
: برق
electronic file name : TL44982.pdf
Title and statement of responsibility and : Low-Complexity Soft Decoding Algorithms for Reed-Solomon Codes [Thesis]
 
 
 
(در صورت عدم وضوح تصویر اینجا را کلیک نمایید)