{'fraction_non_alphanumeric': 0.01717557251908397, 'fraction_numerical': 0.0028625954198473282, 'mean_word_length': 4.926553672316384, '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}}
Modified non-restoring division algorithm with improved delay profile and error correction

This paper focuses on improving the performance of non-restoring division by reducing the delay and finding a correct quotient quickly. Although the non-restoring division algorithm is the fastest and has less complexity than other radix-2 digit recurrent division algorithms, there are still some possibilities to enhance its performance. To improve its performance, two new approaches are proposed here. For the first proposed approach, a non-restoring divider with a modified algorithm is presented. The new algorithm changes the order of the flowchart, which reduces one unit delay of the multiplexer per iteration. Secondly, a new method to find a correct quotient is presented and it removes an error that the quotient is always odd number after a digit conversion from a digit converter from the quotient with digits 1 and -1 to a conventional binary number. The new logic to generate the LSB of the quotient quickly is also explained in this paper.