{'fraction_non_alphanumeric': 0.031932773109243695, 'fraction_numerical': 0.0, 'mean_word_length': 5.144329896907217, '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}}
SYSTOLIC IMPLEMENTATION OF SAMPLE-BY-SAMPLE CONJUGATE GRADIENT ALGORITHM

In this paper, we consider an efficient Conjugate Gradient (CG) algorithm that can be used when non-block processing or sample-by-sample update is of interest and compare its computational complexity with the conventional CG algorithm. We then review the VLSI implementation of the CG algorithms. Furthermore, for the hardware implementation of the sample-by-sample CG algorithm, a novel systolic array is proposed. With the aid of this systolic architecture, the time complexity of the algorithm will be reduced to O(N).