Explain operation of time multiplexed space switching, Computer Engineering

Assignment Help:

With a neat diagram explain operation of time multiplexed space switching.

Time division switches, an inlet or an outlet corresponded to a particular subscriber line with one speech sample appearing each 125 µs on the line. These switches are used in local exchanges. We here consider switches which are needed in transit exchanges. Now, the inlets and outlets are trunks that carry time division multiplexed data streams. We call such switches time multiplexed switches. A time multiplexed time division space switch is demonstrated in figure. There are N incoming trunks and N outgoing trunks, all carrying a time division multiplexed stream of M samples per frame. All frames are of 125-µs time duration. In individual frame time, a total of MN speech samples have to be switched. Individual sample duration, 125/M microseconds, is typically referred to as a time slot. N-samples are switched, in one time slot. Figure demonstrates an output-controlled switch. The output of this is cyclically scanned. There is a 1-to-M relationship among the outlets and the control memory locations that is there are M locations in the control memory consequent to each outlet.

2023_Time Multiplexing Space Switch.png

FIG - Time Multiplexing Space Switch

The control memory has MN words. When we view the control memory like M blocks of N words each, a location address may be given in a two dimensional form,(i,j),here i is the block address and j is the word inside the block. We have 1< i < M and 1< j < N. The block addresses i match to the time slot i and the word address j to the outlet j. The first N locations of the control memory correspond to the first time slot, the subsequent N locations, that is locations N + 1 to 2N while addressed linearly, or locations (2,1) to (2,N) while addressed in a two dimensional form, correspond to the time slot 2etc. Thus, if the location (i,j) hold an inlet address k, this implies that inlet k is related to the outlet j in the time slot i. The number of trunks which can be supported on this switch is specified by N =125/ Mt, here t is the switching time containing memory access time per inlet-outlet pair.


Related Discussions:- Explain operation of time multiplexed space switching

How codes represent data for scientific calculations?, Q. How codes represe...

Q. How codes represent data for scientific calculations? How codes are in fact used to represent data for scientific calculations? The computer is a discrete digital device

Define hit ratio, Define Hit ratio. The performance of cache memory is ...

Define Hit ratio. The performance of cache memory is frequently measured in terms of quantity called hit ratio. Hit-Find a word in cache. Miss-Word is not found in cache.

Explain working of direct memory access, Q. Explain working of Direct Memor...

Q. Explain working of Direct Memory Access? In both programmed I/O and interrupt-driven processor is busy with executing input/output instructions and I/O transfer rate is limi

Difference among java beans & servlets, Java bean is a reusable component, ...

Java bean is a reusable component, where as the servlet is the java program which extends the server capability.

Micro programmed control and hardwired control, Explain micro programmed co...

Explain micro programmed control. Ans: A micro programmed control unit is made around storage till is called a control store where all the control signals are stored in a prog

Convert a JK flipflop to T type flipflop, With the help of a suitable diagr...

With the help of a suitable diagram, explain how do you convert a JK flipflop to T type flipflop. Ans. As here flip flop is JK flip flop and it is required to convert JK in T.

Implementation using 8 to 1 multiplexer, Implement the following function u...

Implement the following function using 8 to 1 multiplexer Y(A, B, C, D) = ∑(0,1,2,5,9,11,13,15) Ans. We will obtain three variables B,C and D at selection lines and also A as i

Simplify the expressions by using boolean postulates, Simplify the given ex...

Simplify the given expressions using Boolean postulates Y = (A + B)(A‾ + C)(B + C) Ans. Y = (A + B)(A‾ + C)(B + C) = (A A‾ + AC + B A‾ + BC) (B + C) = (AC + B A‾ + BC) (B + C)

Branding choices, Develop a web traffic plan - suppose that there is no/min...

Develop a web traffic plan - suppose that there is no/minimal advertising budget so you will require to look at branding choices & site design, word-of-mouth and publicity as your

Incorporate exception handling, Assignment (to be published later) will req...

Assignment (to be published later) will require you to extend the menu-driven application developed in Assignment 2B, to incorporate the recording details of the doctors who will b

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd