Switch minimisation for a simple bidirectional network

Mitchell, C.J. and Wild, P.R.

(1988)

Mitchell, C.J. and Wild, P.R. (1988) Switch minimisation for a simple bidirectional network. Electronics Letters, 24 (20).

Our Full Text Deposits

Full text access: Open

Full Text - 411.62 KB

Links to Copies of this Item Held Elsewhere


Abstract

The letter describes a method generating a one-stage, one-sided switching network with the minimum number of switches for any required level of connectivity. The fact that the method generates optimal networks is established by proving appropriate lower bounds. This generalises recent work of Newbury.

Information about this Version

This is a Published version
This version's date is: 1988
This item is peer reviewed

Link to this Version

https://repository.royalholloway.ac.uk/items/0b4230ea-345a-8412-842d-53178c50ed22/1/

Item TypeJournal Article
TitleSwitch minimisation for a simple bidirectional network
AuthorsMitchell, C.J.
Wild, P.R.
Uncontrolled Keywordsswitches, switching circuits, networks, connectivity
DepartmentsFaculty of Science\Mathematics

Identifiers

Deposited by () on 23-Dec-2009 in Royal Holloway Research Online.Last modified on 23-Dec-2009

Notes

This paper is a postprint of a paper submitted to and accepted for publication in Electronics Papers and is subject to Institution of Engineering and Technology Copyright.


Details