{'fraction_non_alphanumeric': 0.014285714285714285, 'fraction_numerical': 0.004081632653061225, 'mean_word_length': 4.987804878048781, '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}}
On testing of static neighborhood pattern sensitive faults

This paper presents a novel scheme to test for static neighborhood pattern sensitive faults in semiconductor memories. The scheme improves the number of read operations from 18N in a classic algorithm considerably depending on the memory word length. Modifications to the original algorithm are minor, and the required built-in test hardware is minim al. The use of the Lempel-Ziv algorithm as an error detection tool is explored.