Binary tree switching network

• US 5,212,587 A
• Filed: 12/27/1990
• Issued: 05/18/1993
• Est. Priority Date: 07/08/1988
• Status: Expired due to Fees

• Current Assignee: British Telecommunications PLC (BT Group PLC)
• Original Assignee: British Telecommunications PLC (BT Group PLC)
• Inventors: Healey, Peter
• Primary Examiner(s): NOT, DEFINED
• Application Number:
  US07/623,810
• Time in Patent Office: 873 Days
• Field of Search: 350/380, 350/382, 350/383, 371/37.1, 371/37.2, 370/4, 370/58.1, 370/60, 370/60.1, 395/22, 395/24, 359/298, 359/301, 359/303, 365/63, 365/64
• US Class Current: 359/301
• CPC Class Codes: G02F 1/31 Digital deflection, i.e. optical switchingG02F1/33 takes precedence
• CPC Class Codes: G06F 11/10 Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's

Abstract

A binary tree switching network in which the switching states are configured to switch an input signal from a selected input to an output by means of a control code set having a minimum Hamming distance (d) greater than one which eliminates cross-talk of order (d-1) and less. Such a network may be used for switching optical signals by means of optical beam deflector stages, each having a variable polarization rotator and a polarization sensitive deflector. Elimination of first order cross-talk is readily achieved by a modification stage arranged to receive a single input from the preceding stages and to pass it to the output.

Claims

1. A binary tree switching network comprising a plurality of first ports and a second port including two or more switching stages, the switching stages being configured to switch the first ports to the second port by means of a control code set wherein to reduce cross-talk each control code has a predetermined minimum Hamming distance between all of the other control codes in the set greater than 1.

2. A network according to claim 1 in which each stage comprises an optical beam deflector.

3. A network according to claim 1 wherein the first ports are inputs, and the second port is an output.

4. A network according to claim 1 wherein the first ports are outputs, and the second port is an input.

5. A binary tree switching network for reducing crosstalk comprising:

a plurality of first ports and a second port including two or more switching stages, the switching stages being configured to switch the first ports to the second port by means of a control code set wherein each control code has a minimum Hamming distance between all of the other control codes in the set greater than 1, wherein each stage includes an optical beam deflector including a variable polarisation rotator and a polarisation sensitive deflector.

6. A network according to claim 5 in which one of the stages is a modification stage smaller than the other stages for receiving a single input from the preceding stages and to pass said input signal to the output.

7. A switching network comprising a plurality of first ports and a second port with two or more switching stages between the first ports and the second port, said switching stages configured to selectively enable signal paths through the switching network from the first ports to the second port based on binary control codes associated with each path, the binary digits of each control code corresponding to the state of each switch in the path, wherein those paths are selected whose corresponding control codes differ from all other control codes by two or more digits wherein the selected signal paths minimize cross-talk between signals on selected and unselected switching configurations.

8. The switching network of claim 7 wherein the network is a cross-point switch in control codes of the selected paths have a minimum Hamming distance d greater than 1 such that input ports for unselected paths are at least d-1 open cross-points from the selected path.