Two scripts are included here.
1. convsys.m - combines the state space representation of two systems connected in series.
[Ao,Bo,Co,Do]=convsys(A1,B1,C1,D1,A2,B2,C2,D2)
This algorithm gives the convolution of two state space representations
| A1 B1 | | A2 B2 |
u ==> | | ==> | | ==> y
| C1 D1 | | C2 D2 |
The algorithm also accepts state space objects as inputs and gives out a state space object as output.
2. sysfeedbk.m
[Ao,Bo,Co,Do]=convsys(A1,B1,C1,D1,A2,B2,C2,D2)
Gives the closed loop state space representation for two systems connected with negative feedback in the following manner.
| A1 B1 |
u ==> | | ==> y
+ o | C1 D1 | |
- | |
| | A2 B2 | |
|= | |= |
| C2 D2 |
The zip file also contains checkcompatibility.m , which checks the compatibility of matrix dimensions in the system and cleanss.m which can be used to clean a state space representation.
標(biāo)簽：
representation
included
combines
scripts
上傳時(shí)間：
2017-07-25
上傳用戶：semi1981
RSA ( Rivest Shamir Adleman )is crypthograph system that used to give a secret information and digital signature . Its security based on Integer Factorization Problem (IFP). RSA uses an asymetric key. RSA was created by Rivest, Shamir, and Adleman in 1977. Every user have a pair of key, public key and private key. Public key (e) . You may choose any number for e with these requirements, 1< e <Æ (n), where Æ (n)= (p-1) (q-1) ( p and q are first-rate), gcd (e,Æ (n))=1 (gcd= greatest common divisor). Private key (d). d=(1/e) mod(Æ (n)) Encyption (C) . C=Mª mod(n), a = e (public key), n=pq Descryption (D) . D=C° mod(n), o = d (private key
標(biāo)簽：
crypthograph
information
Adleman
Rivest
上傳時(shí)間：
2017-09-01
上傳用戶：chfanjiang
