Method for realizing any programmable electrical connection based on minimum sorting network

Abstract

The invention discloses a method for realizing any programmable electrical connection based on a minimum sorting network, and belongs to the technical field of electrical connection. According to the method, the problems of huge number of relays, complex system and high cost in a traditional full-connection matrix are solved by combining a minimum sorting network and a small number of relays. According to the specific scheme, the method comprises the following steps: sorting ports by using a minimum sorting network according to a connection requirement, so that the ports of the same connected group are adjacent; and arranging single-pole single-throw relays among the sorted port sequences, and realizing connection by controlling the states of the relays. According to the invention, the number of relays is significantly reduced, the complexity and energy consumption of the system are reduced, and the number of switching ports can be greatly increased. The method is suitable for testing equipment, a modularized electronic and electrical system, a power supply and distribution system, a programmable wire harness and other scenes requiring dynamic full exchange of ports.

Description

Technical Field

[0001] The present invention relates to the field of electrical connection technology, and specifically to a method for realizing programmable arbitrary connection between multiple electrical ports through a minimum sorting network. The method is suitable for scenarios such as test equipment, modular electronic and electrical systems, power supply and distribution systems, and programmable wiring harnesses that require dynamic full exchange of ports. Background Art

[0002] In the prior art, to achieve arbitrary connection of N electrical ports, a fully connected matrix (N×N relay array) is usually used, but there are the following problems:

[0003] 1. A large number of relays (O(N 2 For example, when N=11, 121 relays are required, while when N=20, 400 relays are required. This causes the full-sequencing network cost and module size to rise rapidly with the number of ports.

[0004] 2. The system is highly complex, and hardware design, maintenance, and debugging are difficult;

[0005] 3. High energy consumption and space occupancy are not conducive to miniaturization and energy saving.

[0006] Therefore, there is an urgent need for a technical solution that reduces the number of relays while ensuring flexible connection. Summary of the Invention

[0007] The present invention aims to solve the problems of excessive number of relays, high system complexity and high cost in traditional fully connected matrices.

[0008] To this end, the present invention adopts the following technical solution: a method for realizing programmable arbitrary electrical connection based on a minimum ordering network, wherein the minimum ordering network is composed of line sequence switches realized by double-pole double-throw relays, and the complexity relationship between the number of the minimum ordering network and the number of ports is at the O(NlogN) level, which is much smaller than the O(NlogN) complexity of the fully connected matrix. 2 )class.

[0009] Furthermore, the minimum sorting network selects to swap or not swap the line sequence for each switch by comparing the sorting numbers of the input ports; the line sequence switch includes two inputs, denoted as I1 and I2, which are directly connected to the input of the double-pole double-throw relay. The double-pole double-throw relay includes four outputs, denoted as O1, O2, O3, and O4. The switch finally outputs Y1 and Y2. O1 and O4 are connected to Y1, and O2 and O3 are connected to Y2. Controlling the state of the double-pole double-throw relay can control whether the input line sequence is maintained or swapped.

[0010] The method for realizing programmable arbitrary electrical connection comprises the following steps, including the following steps:

[0011] a. Analyze user-defined connection requirements and determine the ports and their connectivity groups that require electrical connections;

[0012] b. Sort the ports using the minimum sorting network to generate a sorted port sequence so that ports in the same connectivity group are adjacent or close in the sequence;

[0013] c. In the sorted port sequence, N-1 single-pole single-throw relays are set in sequence. By controlling the closing and opening of the relays, electrical connections within the connected group and isolation between groups are achieved;

[0014] d. Reconfigure the minimum sequencing network and adjust relay states when connection requirements change.

[0015] Furthermore, the minimum sorting network is generated by the following steps:

[0016] Step 1: Determine the input size and decompose the recursive subnetwork

[0017] 1.2 Receive the number n of elements to be sorted;

[0018] 1.2 If n≤1, return to an empty network directly; otherwise, divide the input sequence into two approximately equal subsequences

[0019] 1.3 Recursively generate or look up the table for each subsequence to obtain its corresponding minimum sorting network;

[0020] Step 2: Merge subnetworks

[0021] 2.1 Merge the two sorted subnetworks using the odd-even merging algorithm;

[0022] 2.2 For the merged network, traverse each comparator in the network and remove redundant operations that do not affect the sorting function;

[0023] 2.3 For the output network, verify the network's complete sorting ability by exhaustively enumerating all possible input permutations and 2^n binary sequences;

[0024] Step 3: Output the final network

[0025] 3.1 Output the minimum sorting network generated by step 2.3, whose number of comparators satisfies O(nlogn) complexity and is the known minimum value under the current scale.

[0026] Furthermore, the minimum sorting network is used to sort the N ports and generate a port sequence through the following steps:

[0027] Step 1: Set the sequence number of port 1 to 1, the sequence number of port N to N, and the sequence numbers of other ports are assigned sequence numbers between 2 and N-1 according to their grouping numbers: if the port is in the same group as port 1, its sequence number is 1; if the port is in the same group as port N, its sequence number is N; if the port is in the same group as both port 1 and port N, its sequence number is 1 or N;

[0028] Step 2: Use the minimum sorting network to sort according to the sorting number of each port.

[0029] Furthermore, in the port sorting step, the positions of the first and last ports are fixed, and only the order of the middle ports is adjusted.

[0030] Furthermore, the dynamic adjustment is achieved through a software or hardware controller.

[0031] Furthermore, the single-pole single-throw relay is arranged between adjacent ports and between the head and the tail, and its closed state is determined by the connectivity group requirements.

[0032] Furthermore, it is applicable to any number of ports where N≥2.

[0033] Furthermore, it is applied to scenarios such as test equipment, modular electronic and electrical systems, power supply and distribution systems, and programmable wiring harnesses that require dynamic full switching of ports.

[0034] The advantages of the present invention are: 1) the number of relays is significantly reduced (for example, when N=11, only 35 are required, while the traditional method requires 121);

[0035] 2) Reduce system complexity, energy consumption and space occupancy;

[0036] 3) Supports dynamic configuration and is suitable for flexible connection scenarios. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 : Schematic diagram of using double-pole double-throw relays to realize switching network and using single-pole single-throw relays to realize adjacency when N=8.

[0038] Figure 2 : Schematic diagram of double-pole double-throw relay realizing line sequence exchange. DETAILED DESCRIPTION

[0039] like Figure 1 As shown in the figure, taking the case where the number of terminal ports N=8 as an example, the connected ports are denoted as Pn. Assume that the connection requirements are: P0-P2-P4 are connected, P1-P3-P6 are connected, and P5-P7 are connected.

[0040] 1. Build a minimum switching network

[0041] For N=8, the first and last P_0 and P_7 are fixed. It is known that the optimal switching network of 6 elements consists of 12 double-pole double-throw relays (the specific structure can refer to the standard 6-element sequencing network design).

[0042] 2. Port sorting

[0043] By adjusting the switching network, the ports are sorted. The sorted ports are called PortSorted (PS):

[0044] PS0===P0, PS1=P2, PS2=P4, PS3=P3, PS4=P1, PS5=P6, PS6=P5, PS7===P7.

[0045] Thus, ports of the same connectivity group are adjacent in the sequence.

[0046] 3. Connection Implementation

[0047] Between PS0 and PS7, a single-pole single-throw relay is set between every two adjacent ones, and a single-pole single-throw relay is set between PS7 and PS0, with a total of N=8 single-pole single-throw relays.

[0048] Close PS0-PS1 and PS1-PS2 to achieve P0-P2-P4 connectivity;

[0049] Close PS3-PS4, PS4-PS5, and achieve P1-P3-P6 connectivity;

[0050] Close PS6-PS7 to achieve connectivity between P5-P7;

[0051] Disconnect other relays (such as PS2-PS3, PS5-PS6) to isolate different connection groups.

[0052] According to the description of the above specific embodiment (N=8), in accordance with the technical solution of this patent application, only 12 double-pole double-throw relays and 8 single-pole single-throw relays, a total of 35, are used to achieve complex connection requirements, which is 68% less than the traditional method (64 relays), significantly reducing hardware costs and system complexity.

Claims

1. A method for realizing programmable arbitrary electrical connection based on a minimum sorting network, characterized in that: The minimum sorting network is composed of line sequence switches implemented by double-pole double-throw relays, and the complexity relationship between the number of line sequence switches and the number of ports is at the O(NlogN) level.

2. The method according to claim 1, characterized in that The line sequence switch contains 2 inputs, denoted as X1 and X2, which are directly connected to the input of the double-pole double-throw relay. The double-pole double-throw relay contains 4 outputs, denoted as O1, O2, O3, and O4. The switch finally outputs Y1 and Y2. O1 and O4 are connected to Y1, and O2 and O3 are connected to Y2. By controlling the state of the double-pole double-throw relay, the input line sequence can be controlled to maintain X1 and Y1 connected, X2 and Y2 connected, or to swap, that is, X1 and Y2 connected, X2 and Y1 connected.

3. The method according to claim 1, characterized in that The method for realizing programmable arbitrary electrical connection comprises the following steps: a. Analyze user-defined connection requirements and determine the ports and their connectivity groups that require electrical connections; b. Sort the ports using the minimum sorting network to generate a sorted port sequence so that ports in the same connectivity group are adjacent or close in the sequence; c. In the sorted port sequence, N-1 single-pole single-throw relays are set in sequence. By controlling the closing and opening of the relays, electrical connections within the connected group and isolation between groups are achieved; d. Reconfigure the minimum sequencing network and adjust relay states when connection requirements change.

4. The method according to claim 1, wherein Generate a minimal sorting network by following these steps: Step 1: Determine the input size and decompose the recursive subnetwork 1.1 Receive the number n of elements to be sorted; 1.2 If n≤1, return to the empty network directly; otherwise, divide the input sequence into two approximately equal subsequences ( and ); 1.3 Recursively generate or look up the table for each subsequence to obtain its corresponding minimum sorting network; Step 2: Merge subnetworks 2.1 Merge the two sorted subnetworks using the odd-even merging algorithm; 2.2 For the merged network, traverse each comparator in the network and remove redundant operations that do not affect the sorting function; 2.3 For the output network, verify the network's complete sorting ability by exhaustively enumerating all possible input permutations and 2^n binary sequences; Step 3: Output the final network 3.1 Output the minimum sorting network generated by step 2.3, whose number of comparators satisfies O(nlogn) complexity and is the known minimum value under the current scale.

5. The method according to claim 4, characterized in that Use the minimum sorting network to sort N ports and generate a port sequence by following these steps: Step 1: Set the sequence number of port 1 to 1, the sequence number of port N to N, and the sequence numbers of other ports are assigned sequence numbers between 2 and N-1 according to their grouping numbers: if the port is in the same group as port 1, its sequence number is 1; if the port is in the same group as port N, its sequence number is N; if the port is in the same group as both port 1 and port N, its sequence number is 1 or N; Step 2: Use the minimum sorting network to sort according to the sorting number of each port.

6. The method according to claim 5, characterized in that In the port sorting step, the positions of the first and last ports are fixed, and only the order of the middle ports is adjusted.

7. The method according to claim 3, characterized in that The dynamic adjustment is achieved through a software or hardware controller.

8. The method according to claim 1, characterized in that The single-pole single-throw relay is arranged between adjacent ports and between the head and the tail, and its closed state is determined by the connection group requirements.

9. The method according to claim 1, characterized in that Applicable to any number of ports N ≥ 2.

10. The method according to claim 1, characterized in that It is used in scenarios such as test equipment, modular electronic and electrical systems, power supply and distribution systems, and programmable wiring harnesses where dynamic full switching of ports is required.

Images