{'fraction_non_alphanumeric': 0.03419689119170984, 'fraction_numerical': 0.012435233160621761, 'mean_word_length': 4.396648044692737, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A fast Reed-Solomon Product-Code decoder without redundant computations

This paper presents a fast and low-power decoding scheme for Reed-Solomon Product-Code (RS-PC). To increase error correction capability of RS-PC, we need to repeat Reed-Solomon (RS) decoding several times for rows and columns. As the number of RS decodings increases, the execution time and the energy consumption also increase as well. In order to reduce unnecessary operations and memory accesses, we added two small memories to store data on whether the row or column is updated or not. In the next iteration, only the updated rows and columns are recalculated instead of the whole rows and columns. Based on the proposed scheme, we implemented a RS-PC decoder using UMC 0.25 /spl mu/m standard and memory cells. The working frequency is 133 MHz at 2.5 V. Experimental results show that the execution time is reduced by 48% in case of four iterations, and by 66% in case of six iterations.