CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Soft Analysis of Discreet System Function Introducing Recursive Method

by Barun Das, Soumyendu Bhattacharjee, Aniruddha Ghosh, Biswarup Neogi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 72 - Number 14
Year of Publication: 2013
Authors: Barun Das, Soumyendu Bhattacharjee, Aniruddha Ghosh, Biswarup Neogi
10.5120/12559-8229

Barun Das, Soumyendu Bhattacharjee, Aniruddha Ghosh, Biswarup Neogi . Soft Analysis of Discreet System Function Introducing Recursive Method. International Journal of Computer Applications. 72, 14 ( June 2013), 1-3. DOI=10.5120/12559-8229

@article{ 10.5120/12559-8229,
author = { Barun Das, Soumyendu Bhattacharjee, Aniruddha Ghosh, Biswarup Neogi },
title = { Soft Analysis of Discreet System Function Introducing Recursive Method },
journal = { International Journal of Computer Applications },
issue_date = { June 2013 },
volume = { 72 },
number = { 14 },
month = { June },
year = { 2013 },
issn = { 0975-8887 },
pages = { 1-3 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume72/number14/12559-8229/ },
doi = { 10.5120/12559-8229 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:37:52.737983+05:30
%A Barun Das
%A Soumyendu Bhattacharjee
%A Aniruddha Ghosh
%A Biswarup Neogi
%T Soft Analysis of Discreet System Function Introducing Recursive Method
%J International Journal of Computer Applications
%@ 0975-8887
%V 72
%N 14
%P 1-3
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A major advantage of discrete domain analysis is the reduction of characteristic roots from infinite to finite numbers and consequent simplicity in the analysis and design of the controller. In this paper a new algorithm is proposed towards the sample data control and also analysis the time complexity is find out. The algorithm has order of n2 time complexity.

References
  1. Jonh R. Ragazzini,Gene F. Franklin: "SAMPLE-DATA CONTROL SYSTEMS"McGraw-hill book company,inc. NEW YORW,1958.
  2. Li-Sheng Hu , Yong-Yan Cao, Hui-He Shao "Robust and Nonlinear Control" International Journal [ DOI: 10. 1002/rnc. 632 ] Volume 12, Issue 5, pages 447–464, 30 April 2002.
  3. Ilia G. Polushin , Horacio J. Marquez"Multirate versions of sampled-data stabilization of nonlinear systems" science direct, accepted 16 January 2004,Canada.
  4. Okuyama, Y " Robust stabilization and PID control for nonlinear discretized systems on a grid pattern" American Control Conference, IEEE Sponsored,2008 , Tokushima.
  5. E. I Jury, Theory and Application of z-Transformation Method New York: Willey; 1946.
  6. B. D. O Anderson, E. I. Jury and Mansour, "Schwarz matrix properties for Continues and discrete time systems,"Int. J. Contr,Vol. 33, pp,1-16,1976.
  7. B. Neogi, R. Darbar, S. Mandal, B. Gorai, S. Ghosh, A. Das &D. N. Tibarewala, "Optimal Design of Prosthetic Limb Control System with Paraplegia and Fatigue Condition" accepted in International Conference on Emerging Applications of Information Technology IEEE Sponsored CSI, Kolkata.
  8. Sw ti Banerjee, Soumyendu Bhattacharjee , Avishek Nag, Sreya Bhattacharya, Dr. Biswarup Neogi" DISCRETE DOMAIN ANALYSIS OF DEXTEROUS
  9. HAND MODEL BY SIMULATION ASPECT" 2nd International Conference On Computer, Communication,
  10. Control and Information Technolog,2011, science direct,Kolkata.
  11. ]Thomas H. Cormen, Charles E. Leiserson:" Introduction to Algorithms" McGraw-Hill Osborne, Second Edition.
  12. Dexter C. Kozen:" The Design and Analysis of Algorithms", Springer
Index Terms

Computer Science
Information Sciences

Keywords

Sample Data Control Time Complexity Space Complexity Discreet Domain System Recursive Method

Powered by PhDFocusTM