Telecommunications JBCardenas © 1982 JBC © 1982~2006 v 3.01 HW1 due before Q3 © jbc Max group size 4, with XX is remainder modulo 6 of sum of equivalent number of 1 st letter of members’ surnames. Ex: Dense and Easy = 3. Package as a mini-thesis or mini-design. Problem: Determine the smallest number of transceivers system-wide, to provide mobile service while meeting the requirements stated below. Source: JBC 43-HW10THE Xx = (2 digits remainder mod 6 of sum of equivalent number of 1 st letters of members surnames)/100

Telecommunications JBCardenas © 1982 JBC © 1982~2006 v 3.01 HW2 Due before Q4 © jbc Switch Problem, 3 max per group, submit anytime before Q4 Jose B. Cardenas, C.P.M. EE, ECE HOMEWORK1 Given: Suppose a unidirectional or non-folded symmetrical 3 stages grid-coordinate switching matrix or network is used to provide full availability to 25 + X telephone subscribers. Find: Design or draw the 3-stages network with the minimum number of cross- points. Use one page only letter size paper. Fill up the table below. Fill up the following table, and draw the switching network schematic for each option # of switches Size of each Switch# of Crosspoints Stage 1______ x ________ Stage 2______ x ________ Stage 3______ x ________ Total ____ This equivalent full crossbar has 900 crosspoints X is computed remainder modulo 11 of equivalent decimal number of sum of 1 st letters of your surnames, example letter P results to 30 subscribers. 30 inlets 30 outlets

Telecommunications JBCardenas © 1982 JBC © 1982~2006 v 3.01 HW3 due before Q4 © jbc Given the 6 stations network on the right and E1 total requirements between stations, below: SDH Capacity, maximum group size D E F B A C Link 4 is a ring. One fiber per section source: JBC 10-T040621B Find: 1.The smallest STM rate per link or ring. 2.The number of E1 terminations per station. Jose B. Cardenas, C.P.M. EE, ECE 10 E1s STM-4 30 E1s ADM Note:Number of E1 trunks for link A-F is integer average of equivalent number of 1 st letters of your surname names, e.g.: for C, results to an E1 requirement of 03. Example: A and B = 30 E1s.

Telecommunications JBCardenas © 1982 JBC © 1982~2006 v 3.01 HW4 due before Finals © jbc A B C D E Given: Link A-B serves as final route for 1 st order high usage routes A-E, A-D and A- C. The offered random erlang traffic and link capacities in VF 4Khz analog lines are as follows: 1 st order high usage routes AC, AD and AE overflow to AB Capacity Dimensioning Problem, individual submission S AE = 20 trunks A C = 14 erlangs Jose B. Cardenas, C.P.M. EE, ECE Find: 1.Compute total mean traffic A B for link A-B 2.Dimension the link A-B for carried traffic, or compute S AB 3.Compute mean traffic B C of route B-C 4.Dimension the trunks B-C for carried traffic or compute S BC The allowed blocking rate in both routes A-B and B-C is not to exceed 1%. S BC ABAB source: JBC THE BCBC PROVIDE A SOLUTION OUTLINE! Note: Trunks from A to D is equivalent sum of numbers of equivalent digits of 1 st letters of your surname and first name, e.g.: for J & C, VF trunks = 13.