Iterative Decoding Algorithms for a Class of Non-Binary Two-Step Majority-Logic Decodable Cyclic Codes

This paper presents two iterative decoding algorithms for a class of non-binary two-step majority-logic (NB-TS-MLG) decodable cyclic codes. A partial parallel decoding scheme is also introduced to provide a balanced trade-off between decoding speed and storage requirements. Unlike non-binary one-ste...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications Jg. 62; H. 6; S. 1779 - 1789
Hauptverfasser: Chang, Hsiu-Chi, Chang, Hsie-Chia
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.06.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Applied sciences
Balancing
Codes
Coding, codes
Complexity theory
Decoding
Degradation
Exact sciences and technology
Gain
Geometry
Information, signal and communications theory
Iterative decoding
Matrix decomposition
Maximum likelihood decoding
Niobium
Noise levels
Signal and communications theory
Telecommunications and information theory
Tradeoffs
Vectors
cyclic codes
majority-logic decoding
Extended min-sum algorithm
non-binary LDPC codes
Reed Solomon code
Performance evaluation
Cyclic code
Majority logic
Tanner graph
Algorithm
Binary code
Iterative decoding
Simulation
Coding
Error correcting code
Parity check codes
Soft decision
Parity check
ISSN:0090-6778, 1558-0857
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents two iterative decoding algorithms for a class of non-binary two-step majority-logic (NB-TS-MLG) decodable cyclic codes. A partial parallel decoding scheme is also introduced to provide a balanced trade-off between decoding speed and storage requirements. Unlike non-binary one-step MLG decodable cyclic codes, the Tanner graphs of which are 4-cycle-free, NB-TS-MLG decodable cyclic codes contain a large number of short cycles of length 4, which tend to degrade decoding performance. The proposed algorithms utilize the orthogonal structure of the parity-check matrices of the codes to resolve the degrading effects of the short cycles of length 4. Simulation results demonstrate that the NB-TS-MLG decodable cyclic codes decoded with the proposed algorithms offer coding gains as much as 2.5 dB over Reed-Solomon codes of the same lengths and rates decoded with either hard-decision or algebraic soft decision decoding.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2014.2320508