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

Which important terminal required between dte and pstn, An important termin...

An important terminal that is required between DTE and PSTN is (A)  Server                                      (B) MODEM (C)  Relay

Some of the advantages of b2b, Some of the advantages of B2B are: i) En...

Some of the advantages of B2B are: i) Enhanced customer satisfaction Code ii) Enhanced inventory system iii) Simple and cost effective marketing iv) Coordination among

Explain frame filtering, Write notes on Frame Filtering Techniques. Fr...

Write notes on Frame Filtering Techniques. Frame filtering: The most valuable function performed through bridges is frame filtering. A bridge doesn't forward a frame unles

Usability test of website, For this part of your assessment you are require...

For this part of your assessment you are required to prepare and conduct a usability test of the website that you have chosen to review from Part A . You must design the script,c

Where telephone traffic is measured, Telephone Traffic is measured in ...

Telephone Traffic is measured in (A)  Seconds.  (B)  Hours. (C)  Erlang       (D)  Pulses per minute. Ans: Telephone Traffic is measured in Erlang.

What is cache coherency, Cache coherence refers to the integrity of data st...

Cache coherence refers to the integrity of data stored in local caches of a shared resource. Cache coherence is a special case of memory coherence. When clients in a system, mainly

Transport protocol you use to call a web service soap, What is the transpor...

What is the transport protocol you use to call a Web service SOAP? Http is preferred for Soap whereas tcp for binary i.e. HTTP is used in web services and tcp works well in rem

What is a heap, What is a heap? A complete binary tree, every of whose ...

What is a heap? A complete binary tree, every of whose elements contains a value that is  greater than or equal to the value of every of its children is known a Heap

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