Title: Column shifting algorithm to compute iteration bound of finite impulse response systems having inline delays

Authors: Jyotirmoy Pathak; Suman Lata Tripathi

Addresses: School of Electronics and Electrical Engineering, Lovely Professional University Phagwara, Punjab, India ' School of Electronics and Electrical Engineering, Lovely Professional University Phagwara, Punjab, India

Abstract: In this paper, a shifting algorithm has been proposed with reduced computational time leading to the reduction in inline delay elements. Due to the redundant idea of advanced sign preparing calculations, these calculations are depicted by iterative information flow diagrams where hubs and edges speak to calculations and correspondences separately. For all information flow charts, there exists a basic lower bound on the emphasis time frame alluded to as the cycle bound. The figuring of emphasis destined for advanced sign handling calculations portrayed by iterative information stream diagrams is a significant issue. Right now, the most normal created technique to register emphasis bound is examined and an alternative methodology known as segment components moving dependent on the longest way grid strategy is proposed. This methodology can be utilised on finite motivation reaction frameworks with inline postpone components. By utilising this technique, the calculation time can be decreased by over 60%. The proposed model is suitable for FIR system with significant improvement over the well-known longest path matrix (LPM) methods.

Keywords: iteration bound; column shifting algorithm; finite impulse response system; longest path matrix; LPM.

DOI: 10.1504/IJES.2021.120258

International Journal of Embedded Systems, 2021 Vol.14 No.5, pp.443 - 450

Received: 18 Apr 2020
Accepted: 08 Sep 2020
Published online: 13 Jan 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article