Explain space switching, Computer Engineering

Assignment Help:

Explain Space Switching.

Space Switches: Connections can be made in between outgoing and incoming PCM highways by a cross point matrix of the form demonstrated in figure. However, various channels of an incoming PCM frame may require to be switched by various cross points in order to reach various destinations. Therefore, the cross point is a two-input AND gate. One input is linked to the incoming PCM highway and another to a connection store which produce a pulse at the needed instant. A group of cross points gates can be implemented like an integrated circuit, for illustration using a multiplexer chip.

879_Space Switch.png

FIG - Space Switch.

Figure demonstrates a space switch with k incoming and m outgoing PCM highways, all carrying n channels. The connections store for every column of cross points is a memory along with an address location for every time-slot that stores the number of the cross points to be operated in which time slot. This number is written in the address by the controlling processor so as to setup the connection. The numbers are read out cyclically, into synchronism along with the incoming PCM frame. In every time slot, the number stored at the equivalent store address is read out and decoding logic converts it in a pulse or a single lead to function the relevant cross point.

Because a cross point can make a diverse connection in each of the n time-slots, this is corresponding to n cross points in a space division network. The total space switch is therefore equivalent to n separate k x m switches in a space division switching network.


Related Discussions:- Explain space switching

Define immediate addressing mode with example, Q. Define Immediate Addressi...

Q. Define Immediate Addressing Mode with example? Immediate Addressing Mode An immediate operand can be a constant expression like a character, a number or an arithmetic e

Stack and queue, Describe queue? Ans:  It is a type of data structure ...

Describe queue? Ans:  It is a type of data structure in which the data are stored in and retrieved on a First in first out (FIFO) basis. It grows in the direction of increasin

To show - hide the ssi document in the page, Step 1: Click on Edit Step ...

Step 1: Click on Edit Step 2: Select reference Step 3: Select Translation Step 4: Click on SSI Step 5: For showing the SSI file; choose one of the following options:

How can you pass a struct by reference in e, How can you pass a struct by r...

How can you pass a struct by reference in e?   The question is phrased in a tricky way because passing by reference is the default and only possible way to pass structs in e. I

The complexity of adding two matrices, T he complexity of adding two matric...

T he complexity of adding two matrices of order m*n is mn

Name some multimedia applications, Illustrate what are the Multimedia appli...

Illustrate what are the Multimedia applications Multimedia comprise the use of a computer to present: - Text - Video - Graphics - Sound - Animation In an inte

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

Procedures relating to the deployment of the server, Edith & Associates is ...

Edith & Associates is a modern law firm. They have an Internet Link that is an ADSL 8MB links from JJNET. The server they are to deploy will the main service giving  server and wil

What are threaded binary trees, What are threaded binary trees? A Threa...

What are threaded binary trees? A Threaded Binary Tree is a binary tree in which each node that does not have a right child has a THREAD (in real sense, a link) to its INORDER

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