Low-complexity architecture for Chase soft-decision Reed-Solomon decoding

Soft-decision decoding of Reed-Solomon (RS) codes can achieve good coding gain by using the probability information from the channel. Among various soft-decision algorithms, the Chase algorithm has moderate performance and rational complexity and hence is usually designed for hardware implementation...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Technical Papers of 2014 International Symposium on VLSI Design, Automation and Test s. 1 - 4
Hlavní autoři: Yung-Kuei Lu, Shen-Ming Chung, Shieh, Ming-Der
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2014
Témata:
Algorithm design and analysis
Clocks
Complexity theory
Computer architecture
Decoding
Hardware
Polynomials
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í:Soft-decision decoding of Reed-Solomon (RS) codes can achieve good coding gain by using the probability information from the channel. Among various soft-decision algorithms, the Chase algorithm has moderate performance and rational complexity and hence is usually designed for hardware implementation. Chase-type decoders, however, still have much higher complexity than that of conventional hard-decision decoders. This paper proposes a reduced-complexity Chase (RCC) algorithm and its corresponding high-speed VLSI architecture. With the developed fast and efficient decision-making scheme, the resulting hardware complexity is greatly reduced while keeping the error correction performance comparable to that of the Chase decoders. For a (255, 239) RS code, experimental results show that the proposed decoder design has at least 44.6% improvement in area-time complexity as compared to the related works.
DOI:10.1109/VLSI-DAT.2014.6834896