scholarly journals Chip Architecture for Data Sorting Using Recursive Algorithm

2010 ◽  
Vol 1 (1) ◽  
pp. 93-102
Author(s):  
Megha Agarwal ◽  
Indra Gupta
Keyword(s):  
Recursive Algorithm ◽  
Recursive Call ◽  
Control Sequence ◽  
Numeric Data ◽  
Data Sorting

“This paper suggests a way to implement recursive algorithm on hardware with an example of sorting of numeric data. Every recursive call/return needs a mechanism to store/restore parameters, local variables and return addresses respectively. Also a control sequence is needed to control the flow of execution as in case of recursive call and recursive return. The number of states required for the execution of a recursion in hardware can be reduced compared with software. This paper describes all the details that are required to implement recursive algorithm in hardware. For implementation, all the entities are designed using VHDL and are synthesized, configured on Spartan-2 XC2S200-5PQ208. “

Transforming Recursion to Iteration in Programming

2011 ◽  
pp. 3784-3788
Author(s):  
Athanasios Tsadiras
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Recursive Algorithm ◽  
The Other ◽  
Recursive Call ◽  
Recursive Procedure ◽  
Memory Space ◽  
Space Efficiency ◽  
Recursive Programs ◽  
Number Of Iterations

The main advantage of a Recursive Algorithm (an algorithm defined in terms of itself) is that it can be easily described and easily implemented in a programming language (van Breughel, 1997). On the other hand, the efficiency of such an algorithm is relatively low because for every recursive call not yet terminated, a number of data should be maintained in a stack, causing time delays and requiring higher memory space (Rohl, 1984). Solving the same problem iteratively instead of recursively can improve time and space efficiency. For example, to solve a problem that involves N recursive procedure calls, it will require stack space linear to N. On the contrary, using iteration, the program will need a constant amount of space, independent of the number of iterations. There are programming languages, such as Prolog, that do not possess built-in iterative structures and so recursion should be used instead. Nevertheless, there are ways to write recursive programs that have similar behaviour with that of the corresponding iterative programs.

LMI-based hybrid temporal-spatial differential control design for a class of Euler-Bernoulli beam system

2021 ◽  
pp. 095440622110036
Author(s):  
Jiaqi Zhong ◽  
Xiaolei Chen ◽  
Yupeng Yuan ◽  
Jiajia Tan
Keyword(s):  
Vibration Suppression ◽  
Direct Method ◽  
Recursive Algorithm ◽  
Linear Matrix ◽  
Bernoulli Beam ◽  
Hybrid Controller ◽  
Beam System ◽  
Active Vibration ◽  
Differential Control ◽  
Euler Bernoulli Beam

This paper addresses the problem of active vibration suppression for a class of Euler-Bernoulli beam system. The objective of this paper is to design a hybrid temporal-spatial differential controller, which is involved with the in-domain and boundary actuators, such that the closed-loop system is stable. The Lyapunov’s direct method is employed to derive the sufficient condition, which not only can guarantee the stabilization of system, but also can improve the spatial cooperation of actuators. In the framework of the linear matrix inequalities (LMIs) technology, the gain matrices of hybrid controller can obtained by developing a recursive algorithm. Finally, the effectiveness of the proposed methodology is demonstrated by applying a numerical simulation.

Sign in / Sign up

Export Citation Format

Share Document