diff options
| author | priyanka | 2015-06-24 15:03:17 +0530 |
|---|---|---|
| committer | priyanka | 2015-06-24 15:03:17 +0530 |
| commit | b1f5c3f8d6671b4331cef1dcebdf63b7a43a3a2b (patch) | |
| tree | ab291cffc65280e58ac82470ba63fbcca7805165 /116/CH5 | |
| download | Scilab-TBC-Uploads-b1f5c3f8d6671b4331cef1dcebdf63b7a43a3a2b.tar.gz Scilab-TBC-Uploads-b1f5c3f8d6671b4331cef1dcebdf63b7a43a3a2b.tar.bz2 Scilab-TBC-Uploads-b1f5c3f8d6671b4331cef1dcebdf63b7a43a3a2b.zip | |
initial commit / add all books
Diffstat (limited to '116/CH5')
| -rwxr-xr-x | 116/CH5/EX5.1/exa5_1.sce | 21 | ||||
| -rwxr-xr-x | 116/CH5/EX5.2/exa5_2.sce | 36 | ||||
| -rwxr-xr-x | 116/CH5/EX5.3/exa5_3.sce | 23 | ||||
| -rwxr-xr-x | 116/CH5/EX5.5/exa5_5.sce | 31 |
4 files changed, 111 insertions, 0 deletions
diff --git a/116/CH5/EX5.1/exa5_1.sce b/116/CH5/EX5.1/exa5_1.sce new file mode 100755 index 000000000..ab46c0d28 --- /dev/null +++ b/116/CH5/EX5.1/exa5_1.sce @@ -0,0 +1,21 @@ +//Caption:Program to find the idle path in a three stage 8192 line switch
+
+//Example 5.1
+
+//Page243
+
+//Refer to table 5.2 on page236
+
+disp('From the table, space expansion factor of 0.234 is 0.002. Hence the utilization of each interstage is given by')
+
+0.1/0.234
+
+p=1-[(1-0.427)^2]// probability that one of two links in series is busy
+
+disp('Therefore, the expected number of paths to be tested are,')
+
+Np=[1-(0.672)^15]/(1-0.672)
+
+//Result
+
+//Only 3 of the 15 paths should be tested before an idle path is found
\ No newline at end of file diff --git a/116/CH5/EX5.2/exa5_2.sce b/116/CH5/EX5.2/exa5_2.sce new file mode 100755 index 000000000..065ab7a3b --- /dev/null +++ b/116/CH5/EX5.2/exa5_2.sce @@ -0,0 +1,36 @@ +//Caption:Program to determine the implementaton complexity of the TS switch
+
+//Example 5.2
+
+//Page 253
+
+//Refer to figure 5.19 on page 252
+
+N=80//Number of links
+
+Nc=24//Number of control words
+
+Nb1=7//Number of bits per control word
+
+Nb2=5//Number of bits per control word
+
+disp('The number of crosspoints in the space stage is')
+
+Nx=N^2
+
+disp('The total number of memory bits for the space stage control store is')
+
+Nbx=N*Nc*Nb1
+
+disp('The total number of memory bits for the time stage is')
+
+Nbt=(N*Nc*8)+(N*Nc*Nb2)
+
+disp('Thus the implementation complexity is ')
+
+Cmplx=Nx+[(Nbx+Nbt)/100]
+
+//Result
+
+//Complexity is 6784 equivalent crosspoint.
+
\ No newline at end of file diff --git a/116/CH5/EX5.3/exa5_3.sce b/116/CH5/EX5.3/exa5_3.sce new file mode 100755 index 000000000..63592b8f8 --- /dev/null +++ b/116/CH5/EX5.3/exa5_3.sce @@ -0,0 +1,23 @@ +
+//Caption:Program to determine the implementaton complexity of a 2048 channel
+
+//Example 5.3
+
+//Page 256
+
+k=7//from equation 5.14 on page 256
+
+disp('Using the value of k')
+
+disp('Using the value of k, the number of crosspoint determined are')
+
+2*7*16
+
+disp('The number of bits of memory can be determined are')
+
+N=[2*7*128*4]+[7*128*8]+[7*128*7]
+
+//Result
+
+//The composite implementation complecity is 430 equivalent crosspoints.
+
\ No newline at end of file diff --git a/116/CH5/EX5.5/exa5_5.sce b/116/CH5/EX5.5/exa5_5.sce new file mode 100755 index 000000000..6385f0ade --- /dev/null +++ b/116/CH5/EX5.5/exa5_5.sce @@ -0,0 +1,31 @@ +
+//Caption:Program to determine the implementaton complexity of a 131,072 channel
+
+//Example 5.5
+
+//Page 261
+
+disp('The space switch can be designed bt take the first space stage. A value of 32 is chosen as a convenient binary number.')
+
+n=32//binary w.r.t (N/2)^2
+
+k=27//determined as a blocking probability of 0.0015
+
+//Refer equations 5.18 and 5.19
+
+Nx=[2*1024*27]+[27+(32^2)]
+
+Nx=[2*1024*27]+[27*(32^2)]
+
+Nbx=[2*27*128*32*5]+{27*128*32*5}
+
+Nbt=[2*1024*128*8]
+
+Nbtc=[2*1024*128*7]
+
+cmplx=[Nx+{(Nbx+Nbt+Nbtc)/100}]
+
+//Result
+
+//Complexity is 138,854 equivalent crosspoint.
+
\ No newline at end of file |