Presentado por: Jorge Neira

Implementation complexity problem set

1- Determine the implementation complexity of the TS switch shown in the figure, where the
number of TDM input lines is N = 120. Assume each input line contains a single T1 signal (24
channels). Furthermore, assume a one stage matrix is used for the space stage.
Time stage Space stage

1 TSM 1
NxN
2 TSM 2

N TSM N

Control
store

2
N x =120 =14400

N Bx =( 120 )( 24 ) (7)=20160

N BT =( 120 ) ( 24 ) ( 8 ) +(120)(24)(5)=37440
N Bx + N Bt
complexity =N x + =14976
100

2- Determine the implementation complexity of the TS switch of exercise 1, if groups of 4 input

links are combined into higher level multiplexed signals before being switched, forming 30
input links with 96 channels (time slots) per link.

2
N x =30 =900

N Bx =( 30 ) (96) ( log 2 (30 ) )=14400

N BT =( 30 ) ( 96 ) ( 5 ) +(30)( 96)(7)=34560
N Bx + N Bt
complexity =N x + =1390
100

3- Consider the STS switch in the figure, in which N = 80 primary TDM signals of the European
hierarchy (30 voice channels). Assume a value of β (spatial expansion coefficient) of 1.2. (a)
Calculate the number of TSM modules required. (b) Calculate the complexity of the switch,
 if it is assumed output-associated control in the first stage and in the time stage, and input-
associated control in the third stage.

Time Space
Space stage stage Space stage
TSM
1 1
TSM
Nxk kxN

TSM
N N

N=80 ;β =1.2; Chanels=30

k
β= ;→ k =96
n
N x =96 x 80=7680

N Bx =2 ¿

N BT =( 30 ) ( 96 ) ( 5 ) +(30)( 96)(7)=34560
N Bx + N Bt
complexity =N x + =8429
100

4- Design the TST switch shown in the figure with N = 80 primary TDM signals of the American
hierarchy (24 channels). The temporary expansion coefficient α must be 0.75. (a) Calculate
the number of temporary switch modules. (b) Calculate the complexity of the switch,
assuming output associated control in the first and the second stages, and input associated
control in the third stage.
Time stage Space stage Time stage
1 TSM TSM 1
NxN
2 TSM TSM 2

TSM TSM
N 2 N

5- How many bits of memory are needed in a TSI circuit for a 512-channel signal with 9 bits per
time slot?
 N=1 ; Chanels=120
NBt=( 1 ) ( 120 ) ( 9 ) + ( 1 )( 120 ) ( log 2(120) )=1920 bits

6- Determine the implementation complexity of a 2048-channel TST switch with 16 TDM links
and 128 channels per link. Assume output associated control in both first and third stages.

N=16 ;Chanels=128
Nx=16∗16=256 ;
NBx= (16 )( 128 ) ( log 2 16 ) ¿=8192 bits

NBt=2 [( 16 ) ( 128 ) ( 8 ) + ( 16 ) ( 128 ) ( log 2(128) ) ]=61440 bits

( NBx ) +(NBt ) ( 8192 ) +(61440)

C=( Nx ) + → (256 ) + =952.32 bits
100 100

7- Determine the number of cross points N X and the total number of memory bits N B required
for a TST switch defined as follows: number of lines is 32, single stage space switch, number
of channels per frame is 30, and time expansion α = 1.2. Assume output associated control
in first stage and input associated control in third stage.

N=32; α =1.2 ; Chanels=30

L
α= ; → L=38.4
N
Nx=32∗32=1024
NBx= (32 ) ( 38.4 ) ( log 2 32 ) ¿=6144

NBt=2 [ ( 32 )( 30 )( 8 )+ ( 32 ) ( 38.4 ) ( 5 ) ] =27648

( NBx ) +( NBt ) ( 6144 ) +(27648)

C=( Nx ) + =( 1024 ) + =1362 bits
100 100

8- Consider the digital TSSST switch shown in the figure in which N = 128 incoming digital
signals with 24 channels per frame (time slots). Time expansion (α) is 2 and space expansion
β is 1.5. Calculate the complexity of this switch assuming output associated control in all
stages.
Space stage Space stage Space stage Output time
Input time
1 2 3 stage
stage
c l c
l
c TSM c c TSM c
nxk N/n x N/n kxn
TSM TSM
 TSM TSM
nxk N/n x N/n kxn
TSM TSM

N
c

N=128 ; α=2 ; β=1.5 ; Chanels=24

L=( 24 ) ( 2 )=48 ; n=
√ 128
2
=8; k=( 1.5 ) ( 8 ) =12

Nx=2 Nk +k ( )
N 2
n
=2 (128 )( 12 ) + ( 12 )( )
128 2
8
=6144

# de bits de memoria para control N Bx =N B 1 + N B + N B 2 3

N B 1=( 16 ) ( 12 )( 64 ) ( log 2 8 )=36864 bits N B =( 12 )( 16 )( 64 ) ( log 2 16 )=49152bits

2

3
N B =( 16 ) ( 8 ) (64 ) ( log 2 12 ) =32768 bits

NBx=118784
Etapa de tiempo (1):
NBt 1=( 128 ) (32 )( 8 ) + ( 128 )( 64 )( 5 ) =73728 bits
Etapa de tiempo (2):
NBt 2=( 128 ) ( 64 ) ( 8 ) + ( 128 ) ( 32 )( 6 )=90112 bits

NBt=NBt 1+ NBt 2=163840bits

( NBx ) +( NBt ) ( 32768 )+(163840)
C=( Nx ) + → ( 6144 ) + =8110.08 bits
100 100

9- Draw the equivalent diagram of the multi-stage digital network shown in the figure,
composed only of spatial matrices. Assume time multiplexed links with 3 timeslots per link.
Highlight the path followed by the interval whose content is A, throughout the network.
 T1 A T5 A
S1
T2 T6

A A T7
T3
S2
T4 T8