{'fraction_non_alphanumeric': 0.011916583912611719, 'fraction_numerical': 0.006951340615690168, 'mean_word_length': 5.109090909090909, '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}}
High Speed Most Significant Bit First Truncated Multiplier

This paper proposes a high-speed MSB first multiplier which works efficiently when successive inputs show gradual change which is usually the case for analog signals sampled at a high rate. When the speed of execution of various processes in digital signal processing units is considered, the easiest way to improve it is to use efficient and fast multiplier units. The proposed multiplier computes only one or two partial products when the successive inputs are similar as compared to eleven partial products in the conventional multiplier. The output truncation length can be controlled depending upon the application. The no. of clock cycles needed for multiplication in a conventional MSB first multiplier and the proposed highspeed multiplier are compared through FPGA Implementation. An average decrease of 14.7% in no. of clock cycles is observed when simulations are done for 1400 ECG ambulatory recordings from MIT BIH Arhythmia Database.