Reduced-Complexity Multiplicity Assignment Algorithm and Architecture for Low-Complexity Chase Decoder of Reed-Solomon Codes

A reduced-complexity multiplicity assignment (RCMA) algorithm for low-complexity chase (LCC) is proposed for decoding Reed-Solomon (RS) codes. The properties of bit-level received voltages over an additive white Gaussian noise (AWGN) channel with binary modulation are explored. By using the properti...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 19; číslo 11; s. 1865 - 1868
Hlavní autoři: Peng, Xingru, Zhang, Wei, Ji, Wenjie, Liang, Zhibin, Liu, Yanyan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.11.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
algebraic Softdecision
Algorithm design and analysis
Algorithms
Clocks
Codes
Complexity theory
Computation
Decoders
Decoding
Gaussian
Hardware
High speed
Interpolation
low-complexity chase
Modulation
multiplicity assignment
Probability
Reed-Solomon (RS) codes
VLSI
Voltage
Reed-Solomon (RS) codes
low-complexity chase
multiplicity assignment
VLSI
algebraic soft-decision
ISSN:1089-7798, 1558-2558
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 reduced-complexity multiplicity assignment (RCMA) algorithm for low-complexity chase (LCC) is proposed for decoding Reed-Solomon (RS) codes. The properties of bit-level received voltages over an additive white Gaussian noise (AWGN) channel with binary modulation are explored. By using the properties, the hard-decision, secondary hard-decision, and unreliable positions can be easily determined, and hence, significantly reduce the computational complexity. Compared with the original multiplicity assignment (MA) algorithm, the RCMA eliminates n 2 log 2 n multiplication operations and reduces the number of comparison operations from 2n 2 to n log 2 n, where n is the code length of an RS code. Moreover, a hardware design for RCMA is proposed and applied in the unified syndrome computation (USC) based LCC decoder. Implementation results show the throughput of the proposed decoder can reach a Gbps order, which meets the requirements of high-speed communications.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2015.2477495