{'fraction_non_alphanumeric': 0.009594882729211088, 'fraction_numerical': 0.0031982942430703624, 'mean_word_length': 4.556213017751479, '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}}
Efficient design of different forms of FIR filter

Although a number of efficient and high-level design algorithms have been put forward for the realization of FIR filter using the least number of arithmetic operations, but they do not take into account the low-level implementation issues which can exactly make a difference to the area and delay in designing of FIR filter. In this paper, at first, we have presented the delay efficient addition and multiplication architectures that are used in designing of the filter operation. Here We have used an algorithm for the multiplication that reduces the bit width and then an efficient parallel adder is been used that implements the two form of FIR filter with very less amount of delay considering the cost of each operation too. The paper presents two different types of FIR filter with 8 and 16 tap among which one of the form is good for the speed and the other is good for the area.