{'fraction_non_alphanumeric': 0.014150943396226415, 'fraction_numerical': 0.0, 'mean_word_length': 5.530769230769231, '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}}
Computing the Eigen Decomposition of a Symmetric Matrix in Fixed-point Arithmetic

Since a number of signal processing algorithms requiring the EVD of a symmetric matrix are implemented on fixedpoint DSPs, there is considerable interest in matrix diagonalization algorithms that can be implemented in fixed-point arithmetic. We propose modifications to the Jacobi Cyclic Row algorithm that favor a fixed-point implementation. We then compare the eigenvalues and eigenvectors obtained from the Jacobi Algorithm implemented in fixed-point arithmetic to ones obtained from a floating point algorithm. For the matrices considered, we find that the EVD obtained from the fixedpoint implementation matches closely a floating-point implementation of the EVD decomposition. We also give an estimate of computational complexity of the fixed point algorithm.