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

Explain in detail about real time processing, Explain in detail about Real ...

Explain in detail about Real time (transaction) processing When booking seats on a flight, for illustration, real time (transaction) processing would be used. Response to a que

What is paging unit, Paging Unit Paging mechanism functions with 4K -...

Paging Unit Paging mechanism functions with 4K - byte memory pages or with a new extension available to Pentium with 4M byte-memory pages. In the Pentium, with the new 4M-byt

Define cache line, Define cache line. Cache block is used to refer to a...

Define cache line. Cache block is used to refer to a set of contiguous address location of some size. Cache block is also referred to as cache line.

What do you mean by supercomputers, Q. What do you mean by Supercomputers? ...

Q. What do you mean by Supercomputers? The upper end of state of art mainframe machine is supercomputers. These are among the fastest machines in terms of processing speed and

What is vertical organization and horizontal organization, What is vertical...

What is vertical organization and horizontal organization? Highly encoded schemes that use compact codes to state only a small number of control functions in every microinstruc

Emerging cloud computing technology, A chart illustrating the differences a...

A chart illustrating the differences among the new cloud-based technologies (Workday) and the traditional . a. The new cloud-based solutions benefit Workday from every facet wh

Define syntax of mpi_scan function, Q. Define syntax of MPI_Scan  function...

Q. Define syntax of MPI_Scan  function? MPI_Scan (Sendaddr,, Receiveaddr , count, datatype, op, comm): It merges the partial values in p final results that are received in

How many address bits are needed to show a 32 K memory, How many address bi...

How many address bits are required to represent a 32 K memory ? Ans. 32K = 25 x 210 = 215, Hence 15 address bits are needed; Only 16 bits can address this.

Optimum solution based on constraint problems, Optimum solution based on co...

Optimum solution based on constraint problems: Whether depending on what solver you are using so there constraints are often expressed as relationships between variables as e.

Spmd model for programming, Q. SPMD model for programming? A normal ass...

Q. SPMD model for programming? A normal assumption was that it must be possible and not too hard to capture the SPMD model for programming MIMD computers in data parallel langu

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