Search
New Code
The C# OCR Library 2020.11
SentiVeillance SDK Trial 7.3.2020.11.30
VaxVoIP WebPhone SDK 4.0.6.0
SentiMask SDK Trial 2.0_193121
C# QR Code Generator 2020.12
How to Read Text from an Image in C# 2020.12
The .Net PDF Library 2020.12.3
fsMediaLibrary.NET 2019.11.0
Entity Developer 6.9.1112
OrgChart JS 7.5.40
LinqConnect 4.9.2096
SSIS Data Flow Components 1.15
IP2Location Geolocation Database Oct.2020
Luxand FaceSDK 7.2
dbForge Data Compare for PostgreSQL 3.3.6
Top Code
Uber Clone with Safety Measure Addons 2.0
Answers phpSoftPro 3.12
phpEnter 5.1.
Quick Maps For Dynamics CRM 3.1
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Apphitect Airbnb Clone Script 1.0
Deals and Discounts Website Script 1.0.2
Pro MLM 1
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
ICPennyBid Penny Auction Script 4.0
Code Listing by Farshad Merrikh bayat

Code 1-2 of 2   






This function solves the linear fractional-order differential equations (FODE) with constant coefficients. The short memory principle has not neen used here, so the length of input signal is limited to few hundred samples. The parameters of the FODE (in its standard form) are the inputs of this function and the output is the samples of the output signal versus time.



This function do the Euclid's algorithm. As a matter of fact, for two given polynomials n, m (which are the polynomials of the symbolic
variable "s") it gives two other polynomials x, y such that nx+my=1.