A Simplified Step-by-Step Decoding Algorithm for Parallel Decoding of Reed-Solomon Codes

A simplified parallel step-by-step decoding algorithm is proposed for decoding Reed-Solomon (RS) codes. It uses new method to calculate the determinants of the temporarily changed syndrome matrices, based on the property of these matrices determined in this paper. By using the proposed method, the c...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on communications Ročník 55; číslo 6; s. 1103 - 1109
Hlavní autoři: Liu, Xiaobei, Lu, Chao, Cheng, Tee Hiang, Koh, Soo Ngee
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.06.2007
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Applied sciences
Chaotic communication
Coding, codes
Communications Society
Computation
Computational complexity
Decoding
Delay
Determinants
Error correction codes
Exact sciences and technology
Galois fields
Information, signal and communications theory
Mathematical analysis
Matrices
Matrix methods
Polynomials
Reed-Solomon codes
Signal and communications theory
Signal processing
Telecommunications and information theory
Testing
Reed Solomon code
Parallel algorithm
Decoding
Computational complexity
ISSN:0090-6778, 1558-0857
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A simplified parallel step-by-step decoding algorithm is proposed for decoding Reed-Solomon (RS) codes. It uses new method to calculate the determinants of the temporarily changed syndrome matrices, based on the property of these matrices determined in this paper. By using the proposed method, the calculations of the determinants of the temporarily changed syndrome matrices become much simpler and thus the computational complexity of the step-by-step decoding algorithm is significantly reduced.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2007.898703