CN116528093B - Photoelectric communication module wavelength switching optimization method based on linear direct drive - Google Patents

Photoelectric communication module wavelength switching optimization method based on linear direct drive Download PDF

Info

Publication number
CN116528093B
CN116528093B CN202310756644.2A CN202310756644A CN116528093B CN 116528093 B CN116528093 B CN 116528093B CN 202310756644 A CN202310756644 A CN 202310756644A CN 116528093 B CN116528093 B CN 116528093B
Authority
CN
China
Prior art keywords
wavelength
switching
steps
complexity
path
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202310756644.2A
Other languages
Chinese (zh)
Other versions
CN116528093A (en
Inventor
王峻岭
高国祥
许广俊
陈享郭
彭德军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SHENZHEN OPWAY COMMUNICATION CO Ltd
Original Assignee
SHENZHEN OPWAY COMMUNICATION CO Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by SHENZHEN OPWAY COMMUNICATION CO Ltd filed Critical SHENZHEN OPWAY COMMUNICATION CO Ltd
Priority to CN202310756644.2A priority Critical patent/CN116528093B/en
Publication of CN116528093A publication Critical patent/CN116528093A/en
Application granted granted Critical
Publication of CN116528093B publication Critical patent/CN116528093B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0005—Switch and router aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0005—Switch and router aspects
    • H04Q2011/0007—Construction
    • H04Q2011/0011—Construction using wavelength conversion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q2011/0079—Operation or maintenance aspects
    • H04Q2011/0083—Testing; Monitoring
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mechanical Light Control Or Optical Switches (AREA)

Abstract

The invention discloses a wavelength switching optimization method of a photoelectric communication module based on linear direct drive, and relates to the technical field of photoelectric communication. In the process of wavelength switching optimization, the loss of a switching path is evaluated by defining a matrix and weights, and the complexity of the path is calculated using a complexity calculation model. The method comprises the following steps: wavelength switching is carried out on the position of a linear direct-drive motor driving light path; selecting a target wavelength of the next switching according to the switching loss and the weight; generating a switching path according to the recorded position information; the complexity of the switching paths is calculated and the lowest switching path is selected as the template switching path. By the method, efficient and reliable wavelength switching of the photoelectric communication module can be realized, and the performance and efficiency of a communication system are improved.

Description

Photoelectric communication module wavelength switching optimization method based on linear direct drive
Technical Field
The invention relates to the technical field of photoelectric communication, in particular to a wavelength switching optimization method of a photoelectric communication module based on linear direct drive.
Background
With the rapid development of the photoelectric communication technology, more and more application scenes put higher requirements on efficient and reliable photoelectric communication modules. The photoelectric communication module needs to be capable of realizing multi-wavelength switching in practical application, and keeps lower loss in the switching process so as to improve the performance and efficiency of a communication system. However, in current optoelectronic communication modules, wavelength switching optimization still faces some challenges and problems.
In conventional opto-electronic communication modules, wavelength switching is performed using a mechanically driven approach, such as a rotating optical filter or waveguide switch. These mechanically driven approaches often present some problems. First, mechanically driven components are susceptible to mechanical wear, vibration, and temperature changes, resulting in performance instability and reduced reliability. Secondly, the mechanical driving mode often requires larger volume and power consumption, which is unfavorable for integration and energy saving.
In order to overcome the problems in the conventional optical-electrical communication module, some improved techniques have been proposed. For example, a linear direct drive motor is introduced as a drive method for wavelength switching. The linear direct-drive motor has the advantages of small volume, low power consumption, quick response and the like, and can better meet the requirements of the photoelectric communication module. In addition, a wavelength switching optimization method of the photoelectric communication module based on linear direct drive is also provided, the method utilizes a matrix and weights to evaluate the loss of different switching paths, and the switching path with the lowest complexity is optimized and selected so as to improve the wavelength switching efficiency.
However, despite the improved techniques described above, the prior art still has some problems and challenges. Firstly, in the wavelength switching optimization method in the prior art, factors such as frequency offset, power variation, time offset and the like among wavelengths are not fully considered when switching loss is calculated, so that accuracy and reliability of the switching loss are poor. Secondly, the complexity calculation model in the prior art may not be flexible enough for different application scenes and requirements, and cannot be fully adapted to various complicated photoelectric communication systems.
Disclosure of Invention
The invention aims to provide a linear direct drive-based photoelectric communication module wavelength switching optimization method, which can realize efficient and reliable photoelectric communication module wavelength switching and improve the performance and efficiency of a communication system.
In order to solve the technical problems, the invention provides a wavelength switching optimization method of an optoelectronic communication module based on linear direct drive,
a photoelectric communication module wavelength switching optimization method based on linear direct drive comprises the following steps:
step S1: connecting a linear direct-drive motor with a photoelectric communication module; the optoelectronic communication module includes: laser, optical fiber and photoelectric probeA measuring device; the laser can provideOptical signal output at individual wavelengths, respectively noted asThe method comprises the steps of carrying out a first treatment on the surface of the The wavelength range which can be detected by the photoelectric detector is suitable for the laser, and the received optical signal can be converted into an electric signal;
step S2: the method for optimizing wavelength switching specifically comprises the following steps: define aMatrix of->Wherein->Representing the slave wavelength +.>Switch to wavelength +.>Switching loss of (2); define a length of +.>Array of->Wherein->Indicating the selection wavelength +.>Weights of (2); initializing the current wavelength to +.>And recording the initial position; the following steps are repeated until all wavelengths are selected: for the current wavelength +.>Calculate and select the next wavelength +.>Total loss of->The method comprises the steps of carrying out a first treatment on the surface of the Select the one with the smallest total loss->Wavelength +.>As the target wavelength for the next switch; driving the linear direct-drive motor to drive the light path position from +.>Switch to->The method comprises the steps of carrying out a first treatment on the surface of the Updating the current wavelength to +.>And recording the position information; after all wavelength switching is completed, the linear direct-drive motor is adjusted to an initial position according to the recorded position information;
step S3: when the step S2 is used for wavelength switching optimization, the recorded position information is connected according to the time sequence to generate a switching path; when wavelength switching optimization is performedAfter a second time, will get->The complexity of the switching paths is calculated respectively, and the switching path with the lowest complexity is selected as the template switching path;
step S4: when the wavelength switching optimization is performed again, the wavelength switching optimization is performed directly based on the template switching path; wavelength switch optimization execution based on template switch pathAnd (2) after the second time, clearing the template switching path, and returning to the step (S2).
Further, the total lossThe calculation of (2) uses the following formula:the method comprises the steps of carrying out a first treatment on the surface of the Wherein (1)>Representing the slave wavelength +.>Switch to wavelength +.>Switching loss of (2); />Indicating wavelength +.>To->Offset of (i.e.)>；/>Representing wavelength +.>To->Power variation of (i.e.)>Wherein->And->Wavelength +.>And->Is a power of an optical signal of (a);representing wavelength +.>To->Time offset of (a), i.e.)>Wherein->And->Wavelength +.>And->Is set to be a switching time of (a); /> And->Are all weight coefficients for balancing the importance of different loss factors, wherein +.>The value range is 0.3-0.5; />The value range is 0.2-0.4; />The value range is 0.3-0.4.
Further, the switching lossCalculated using the following formula:the method comprises the steps of carrying out a first treatment on the surface of the Wherein (1)>Indicating wavelength +.>To->Frequency offset of (i.e.)>Wherein is the speed of light; />Representing the inertial loss of the linear direct drive motor.
Further, the inertial lossCalculated using the following formula: />The method comprises the steps of carrying out a first treatment on the surface of the Wherein (1)>Is the rotational inertia of the linear direct-drive motor; />Is the angular velocity of a linear direct drive motor.
Further, the method for calculating the complexity of the switching path in step S3 includes:
step S3.1: for each switching path, the recorded position information is recorded in a matrixWherein the position information is a matrix +.>Is represented as a node, and the connection line between the nodes is represented as an edge, thereby forming a directed graph or undirected graph +.>The method comprises the steps of carrying out a first treatment on the surface of the Wherein->Is node set, ++>Is a collection of edges; step S3.2: if a directed graph or undirected graph +.>If there is no negative side, calculating path complexity using the first complexity calculation model>The method comprises the steps of carrying out a first treatment on the surface of the Step S3.3: if a directed graph or undirected graph +.>If there is a negative weight in the path complexity is calculated using the second complexity calculation model +.>The method comprises the steps of carrying out a first treatment on the surface of the Step S3.4: if a directed graph or undirected graph +.>If there is no negative loop, calculating path complexity using a third complexity calculation model>。
Further, the calculating path complexity using the first complexity calculation modelThe method specifically comprises the following steps:
step A1: an execution process comprising: setting a distance arrayInitializing distance array->For storing a directed graph or undirected graph->Shortest distance from the starting node to each node; initializing a priority minimum heap queue->For selecting the node closest to the starting node; the distance of the start node is set to 0 and inserted into +.>In (a) and (b); repeating the following steps until->Is empty: from->The node closest to the start node is popped up in>Traversing->Is->If pass->A shorter distance reach +.>Update->If->Is updated, will->Insert->In (a) and (b); obtaining the shortest distance from the initial node to each node;
step A2: a complexity calculation process comprising: the initialization process requiresTime of (2); in the iterative process, each node is inserted and popped up to one priority queue at most, so the total time complexity of the insertion and popping operation isThe method comprises the steps of carrying out a first treatment on the surface of the For each node, all its neighbors are traversed, each neighbor is visited at most once, thus there is a total of +.>Traversing the operation for the second time; in each traversal operation, if pass +.>A shorter distance reach +.>Then an update operation is required to be performed with a temporal complexity of +.>The method comprises the steps of carrying out a first treatment on the surface of the Thus, the path complexity is calculated>The method comprises the following steps: />。
Further, the calculating path complexity using the second complexity calculation modelThe method specifically comprises the following steps:
step B1: an execution process comprising: setting the distance of the initial node to 0, and setting the distances of other nodes to infinity; repeatingThe method comprises the following steps: for each edge->If->Update->The value of +.>The method comprises the steps of carrying out a first treatment on the surface of the Checking whether a negative weight loop exists; if at->In the iteration, there are still edges that can be relaxed, then the instruction directed or undirected graph +.>A negative weight loop exists in the system; />Representing slave node->To node->Is the weight of the edge of (2);
step B2: a complexity calculation process comprising: in each iteration, all edges E need to be traversed, and each edge is subjected to relaxation operation; the time complexity of each iteration isThe method comprises the steps of carrying out a first treatment on the surface of the Since V-1 iterations are repeated, the path complexity is calculated>The method comprises the following steps: />。
Further, the calculating path complexity using the third complexity calculation modelThe method specifically comprises the following steps:
step C1: creating a two-dimensional arrayFor storing a directed graph or undirected graph->The shortest path distance between the pair of middle vertices; will->Initializing an array to be the direct distance between two vertexes in the graph, and if no direct edge exists, setting the distance to be infinity; for each vertex k, the following steps are performed in a loop: obtaining a pair of vertices->And->If (3)Update->The value of +.>The method comprises the steps of carrying out a first treatment on the surface of the Obtaining the shortest path distance between each pair of vertexes;
step C2: a complexity calculation process comprising: in the iterative process, triple nested loops need to be executed to respectively traverse the vertexesTop>And vertex->The method comprises the steps of carrying out a first treatment on the surface of the For each vertex pair->It is necessary to check whether there is a vertex +>So as to pass through the vertex->Shorter path distances may be obtained; directed or undirected graph->There is->A plurality of vertices; for each vertex pair->Need to be performed +.>Iteration number, i.e. each vertex will be taken as +>Performing one iteration; thus, the total number of iterations is +.>The method comprises the steps of carrying out a first treatment on the surface of the In each iteration, a comparison and update operation of constant time is required to be performed; thus, the path complexity is calculated>The method comprises the following steps:。
the optimization method for the wavelength switching of the photoelectric communication module based on the linear direct drive has the following beneficial effects: firstly, the method adopts a linear direct-drive motor as a wavelength switching driving mode, and has remarkable advantages compared with a traditional mechanical driving mode. The linear direct-drive motor has the characteristics of small volume, low power consumption and quick response, and can realize wavelength switching operation more flexibly and efficiently. Compared with the traditional mechanical driving mode, the linear direct-drive motor is not influenced by factors such as mechanical abrasion, vibration, temperature change and the like, has higher stability and reliability, and can provide more stable and reliable wavelength switching performance.
Secondly, the method evaluates the loss of the switching path by introducing a matrix and weights, and adopts an improved complexity calculation model, thereby improving the accuracy and reliability of the complexity of the switching path. Conventional switching loss calculation methods typically consider only a few simple factors, such as distance or number of edges. When the method of the invention calculates the switching loss, factors such as frequency offset, power variation, time offset and the like among wavelengths are considered, and the importance of different loss factors is balanced through the weight coefficient, so that the advantages and disadvantages of the switching path are more comprehensively evaluated. Therefore, the switching path with the minimum comprehensive loss is selected, so that the signal loss in the wavelength switching process can be obviously reduced, and the performance and the efficiency of the photoelectric communication system are improved.
In addition, the method introduces the concept of switching path complexity and provides different complexity calculation models to evaluate the complexity of the path. And constructing a directed graph or an undirected graph by recording the position information, and selecting different calculation models to calculate the complexity of the path according to whether negative weight edges and negative weight loops exist. The flexibility enables the method to adapt to different application scenes and requirements, and a proper complexity calculation model is selected according to actual conditions, so that the complexity of a switching path is estimated more accurately. By selecting the switching path with the lowest complexity as the template switching path, the efficiency and the accuracy of wavelength switching can be improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required to be used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only embodiments of the present invention, and that other drawings can be obtained according to the provided drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic flow chart of a method for optimizing wavelength switching of an optoelectronic communication module based on linear direct drive according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Example 1
Referring to fig. 1, the method for optimizing wavelength switching of an optoelectronic communication module based on linear direct drive includes:
step S1: connecting a linear direct-drive motor with a photoelectric communication module; the optoelectronic communication module includes: the device comprises a laser, an optical fiber and a photoelectric detector; the laser can provideOptical signal output at individual wavelengths, respectively noted asThe method comprises the steps of carrying out a first treatment on the surface of the The wavelength range which can be detected by the photoelectric detector is suitable for the laser, and the received optical signal can be converted into an electric signal; step S2: the method for optimizing wavelength switching specifically comprises the following steps: define a +.>Matrix of->Wherein->Representing the slave wavelength +.>Switch to wavelength +.>Switching loss of (2); define a length of +.>Array of->Wherein->Indicating the selection wavelength +.>Weights of (2); initializing the current wavelength to +.>And recording the initial position; the following steps are repeated until all wavelengths are selected: for the current wavelength +.>Calculate and select nextWavelength->Total loss of->The method comprises the steps of carrying out a first treatment on the surface of the Selecting the minimum total lossWavelength +.>As the target wavelength for the next switch; driving the linear direct-drive motor to drive the light path position from +.>Switch to->The method comprises the steps of carrying out a first treatment on the surface of the Updating the current wavelength to +.>And recording the position information; after all wavelength switching is completed, the linear direct-drive motor is adjusted to an initial position according to the recorded position information;
step S3: when the step S2 is used for wavelength switching optimization, the recorded position information is connected according to the time sequence to generate a switching path; when wavelength switching optimization is performedAfter a second time, will get->The complexity of the switching paths is calculated respectively, and the switching path with the lowest complexity is selected as the template switching path;
step S4: when the wavelength switching optimization is performed again, the wavelength switching optimization is performed directly based on the template switching path; wavelength switch optimization execution based on template switch pathAfter the next timeAnd (3) clearing the template switching path, and returning to the step S2 again.
In particular, the wavelength switching optimization principle consists in selecting the optimal wavelength switching path by calculating the switching loss and weight. Switching loss matrixThe element in (a) represents the loss of switching from one wavelength to another, which may be due to factors such as optical element characteristics, optical fiber transmission loss, etc. By calculating the total loss of each wavelength switch +.>The target wavelength with the smallest total loss can be selected for switching. Weight array->Can be used to adjust the importance of different wavelengths to take into account the needs or priorities of particular wavelengths in wavelength switching optimization. The switching path generation and complexity evaluation are performed by step S2, in which step S2 the recorded position information is concatenated to generate the switching path. This switching path reflects the time sequence of wavelength switching and the specific switching procedure. The number of times according to wavelength switching optimization>Multiple switching paths may be generated. To select the best switching path as the template switching path, the complexity of each path may be calculated. The complexity evaluation may consider the number of handovers, the handover distance, the time overhead, etc. to determine the optimal handover path. In step S4, the wavelength switching optimization is performed based on the template switching path, so that computing resources and time can be saved. The template switch path can be seen as an empirical summary of the past optimization process, with lower complexity and better performance. By directly using the template switching path, the repeated calculation and optimization processes can be avoided, and the wavelength switching efficiency is improved.
Example 2.
On the basis of the above embodiment, the totalLoss ofThe calculation of (2) uses the following formula:wherein (1)>Representing the slave wavelength +.>Switch to wavelength +.>Switching loss of (2); />Indicating wavelength +.>To->Offset of (i.e.)>；/>Representing wavelength +.>To->Power variation of (i.e.)>Wherein->And->Wavelength +.>And->Is a power of an optical signal of (a);representing wavelength +.>To->Time offset of (a), i.e.)>Wherein->And->Wavelength +.>And->Is set to be a switching time of (a); /> And->Are all weight coefficients for balancing the importance of different loss factors, wherein +.>The value range is 0.3-0.5; />The value range is 0.2-0.4; />The value range is 0.3-0.4.
Wherein, the liquid crystal display device comprises a liquid crystal display device,: this is from wavelength->Switch to wavelength +.>Is not limited, and is not limited. The switching loss reflects the energy loss of the optical signal during switching and can be caused by factors such as optical elements, optical fiber transmission, and the like. This section represents the contribution of the switching loss to the total loss.
This part takes into account the influence of wavelength shift on the total loss. />Indicating wavelength +.>To->I.e. the difference between the wavelengths. />Square representing wavelength shift and optical signal power +.>Is a ratio of (2). By multiplying by a coefficient->The weight of the wavelength shift to the total loss can be adjusted.
: this part takes into account the effect of power variations on the total loss. />Indicating wavelength +.>To->I.e. the difference between the powers of the optical signals. />Representing the square of the power change and the switching time +.>Is a ratio of (2). By multiplying by a coefficient->The weight of the power variation on the total loss can be adjusted.
This part takes into account the effect of the time offset on the total loss. />Indicating wavelength +.>To->I.e. the difference between the switching times. />Represents the square of the time shift and the wavelength shift +.>Is a ratio of (2). By multiplying by a coefficient->The weight of the time offset on the total loss can be adjusted.
The value range of the weight coefficient is determined according to specific application scenes and requirements. In practical application, the system can be adjusted according to the system requirements, performance indexes and experimental results. Different weight coefficient selections may have different effects on the wavelength switching result, so that reasonable selection and adjustment are required according to practical situations.
Example 3
On the basis of the above embodiment, the switching lossCalculated using the following formula:wherein (1)>Indicating wavelength +.>To->Frequency offset of (a), i.e.Wherein->Is the speed of light; />Representing the inertial loss of the linear direct drive motor.
Specifically, the formula calculates the switching loss based on the frequency offset and the time offset between wavelengths. Frequency offsetRepresenting the frequency difference between two wavelengths, which is defined by the difference between the wavelengthsThe ratio of the difference and the speed of light is calculated. First item in switching loss->Is based on a frequency offset calculation that represents the optical signal energy loss due to wavelength switching. As the frequency offset increases, the switching loss increases accordingly.
Second itemThe effect of the product of the frequency offset and the time offset on the switching loss is taken into account. The exponential function in this term represents the inertial losses during switching, wherein +.>Is an inertial loss parameter of the linear direct drive motor. When the product of the frequency offset and the time offset is large, the value of the exponential function gradually approaches 1, indicating that the switching loss gradually increases.
Example 4
On the basis of the above embodiment, the inertial lossCalculated using the following formula:the method comprises the steps of carrying out a first treatment on the surface of the Wherein (1)>Is the rotational inertia of the linear direct-drive motor; />Is the angular velocity of a linear direct drive motor.
The inertial loss is an energy loss generated in the rotation process required by the linear direct-drive motor when the wavelength is switched.
In the formulaRepresenting the magnitude of the inertial loss. Moment of inertia->Describes the degree of inertia of the linear direct drive motor to the rotational movement, whereas the angular velocity +.>The speed at which a linear direct drive motor rotates is described. By multiplying by->The magnitude of the inertial loss can be calculated.
The rotational inertia and angular velocity of a linear direct drive motor are key factors affecting inertial losses. The larger the moment of inertia and the higher the angular velocity, the larger the inertial loss. Therefore, in the wavelength switching optimization process, reasonable selection and adjustment of the design and parameters of the linear direct-drive motor are required to reduce the influence of inertial loss.
Inertial lossThe calculation formula of (2) provides a method for calculating the energy loss generated by the linear direct-drive motor in the wavelength switching process. The formula is based on the rotational inertia and the angular velocity, and the magnitude of the inertial loss is calculated in a product mode, so that the energy loss calculation in the wavelength switching optimization process is further refined.
Example 5.
On the basis of the above embodiment, the method for calculating the complexity of the switching path in step S3 includes:
step S3.1: for each switching path, the recorded position information is recorded in a matrixWherein the position information is a matrix +.>Is represented as a node, and the connection line between the nodes is represented as an edge, thereby forming a directed graph or undirected graph +.>The method comprises the steps of carrying out a first treatment on the surface of the Wherein->Is node set, ++>A collection of edges; step S3.2: if there is a directed graph or an undirected graphIf there is no negative side, calculating path complexity using the first complexity calculation model>The method comprises the steps of carrying out a first treatment on the surface of the Step S3.3: if a directed graph or undirected graph +.>If there is a negative weight in the path complexity is calculated using the second complexity calculation model +.>The method comprises the steps of carrying out a first treatment on the surface of the Step S3.4: if a directed graph or undirected graph +.>If there is no negative loop, calculating path complexity using a third complexity calculation model>。
Example 6.
On the basis of the above embodiment, the calculating path complexity using the first complexity calculation modelThe method specifically comprises the following steps:
step A1: an execution process comprising: setting a distance arrayInitializing distance array->For storing a directed graph or undirected graph->Shortest distance from the starting node to each node; initializing a priority minimum heap queue->For selecting the node closest to the starting node; the distance of the start node is set to 0 and inserted into +.>In (a) and (b); repeating the following steps until->Is empty: from->The node closest to the start node is popped up in>Traversing->Is->If pass->A shorter distance reach +.>Update->If->Is updated, will->Insert->In (a) and (b); obtaining the shortest distance from the initial node to each node;
step A2: a complexity calculation process comprising: the initialization process requiresTime of (2); in the iterative process, each node is inserted and popped up to one priority queue at most, so the total time complexity of the insertion and popping operation isThe method comprises the steps of carrying out a first treatment on the surface of the For each node, all its neighbors are traversed, each neighbor is visited at most once, thus there is a total of +.>Traversing the operation for the second time; in each traversal operation, if pass +.>A shorter distance reach +.>Then an update operation is required to be performed with a temporal complexity of +.>The method comprises the steps of carrying out a first treatment on the surface of the Thus, the path complexity is calculated>The method comprises the following steps: />。
Example 7.
On the basis of the above embodiment, the calculating path complexity using the second complexity calculation modelThe method specifically comprises the following steps:
step B1: an execution process comprising: setting the distance of the initial node to 0 and the distances of other nodes to infinity; repeatingThe method comprises the following steps: for each edge->If->Update->The value of +.>The method comprises the steps of carrying out a first treatment on the surface of the Checking whether a negative weight loop exists; if at->In the iteration, there are still edges that can be relaxed, then the instruction directed or undirected graph +.>A negative weight loop exists in the system; />Representing slave node->To node->Is the weight of the edge of (2);
step B2: a complexity calculation process comprising: in each iteration, all edges E need to be traversed, and each edge is subjected to relaxation operation; the time complexity of each iteration isThe method comprises the steps of carrying out a first treatment on the surface of the Since V-1 iterations are repeated, the path complexity is calculated>The method comprises the following steps: />。
Example 8.
On the basis of the above embodiment, the calculating path complexity using the third complexity calculation modelThe method specifically comprises the following steps:
step C1: creating a two-dimensional arrayFor storing a directed graph or undirected graph->The shortest path distance between the pair of middle vertices; will->Initializing an array to be the direct distance between two vertexes in the graph, and if no direct edge exists, setting the distance to be infinity; for each vertex k, the following steps are performed in a loop: obtaining a pair of vertices->And->If (3)Update->The value of +.>The method comprises the steps of carrying out a first treatment on the surface of the Obtaining the shortest path distance between each pair of vertexes;
step C2: a complexity calculation process comprising: in the iterative process, triple nested loops need to be executed to respectively traverse the vertexesTop>And vertex->The method comprises the steps of carrying out a first treatment on the surface of the For each vertex pair->It is necessary to check whether there is a vertex +>So as to pass through the vertex->Shorter path distances may be obtained; directed or undirected graph->There is->A plurality of vertices; for each vertex pair->Need to be performed +.>Iteration number, i.e. each vertex will be taken as +>Performing one iteration; thus, the total number of iterations is +.>The method comprises the steps of carrying out a first treatment on the surface of the In each iteration, a comparison and update operation of constant time is required to be performed; thus, the path complexity is calculated>The method comprises the following steps:。
the foregoing has outlined the more detailed description of the invention. The principles and embodiments of the present invention have been described herein with reference to specific examples, the description of which is intended only to facilitate an understanding of the method of the present invention and its core ideas. It should be noted that it will be apparent to those skilled in the art that various modifications and adaptations of the invention can be made without departing from the principles of the invention and these modifications and adaptations are intended to be within the scope of the invention as defined in the following claims.

Claims (8)

1. The wavelength switching optimization method of the photoelectric communication module based on linear direct drive is characterized by comprising the following steps of:
step S1: connecting a linear direct-drive motor with a photoelectric communication module; the optoelectronic communication module includes: the device comprises a laser, an optical fiber and a photoelectric detector; the laser can provideOptical signal output at individual wavelengths, respectively noted asThe method comprises the steps of carrying out a first treatment on the surface of the The wavelength range which can be detected by the photoelectric detector is suitable for the laser, and the received optical signal can be converted into an electric signal; step S2: the method for optimizing wavelength switching specifically comprises the following steps: define a +.>Matrix of->Wherein->Representing the slave wavelength +.>Switch to wavelength +.>Switching loss of (2); define a length of +.>Array of->Wherein->Indicating the selection wavelength +.>Weights of (2); initializing the current wavelength to +.>And recording the initial position; the following steps are repeated until all wavelengths are selected: for the current wavelength +.>Calculate and select the next wavelength +.>Total loss of->The method comprises the steps of carrying out a first treatment on the surface of the Selecting the minimum total lossWavelength +.>As the target wavelength for the next switch; driving the linear direct-drive motor to drive the light path position from +.>Switch to->The method comprises the steps of carrying out a first treatment on the surface of the Updating the current wavelength to +.>And recording the position information; after all wavelength switching is completed, the linear direct-drive motor is adjusted to an initial position according to the recorded position information; step S3: when the step S2 is used for wavelength switching optimization, the recorded position information is connected according to the time sequence to generate a switching path; when wavelength switching optimization is performed +.>After a second time, will get->The complexity of the switching paths is calculated respectively, and the switching path with the lowest complexity is selected as the template switching path; step S4: when the wavelength switching optimization is performed again, the wavelength switching optimization is performed directly based on the template switching path; wavelength switching optimization execution based on template switching path>And (2) after the second time, clearing the template switching path, and returning to the step (S2).
2. The optimization method for wavelength switching of an optoelectronic communication module based on linear direct drive as set forth in claim 1, wherein the total loss is as followsThe calculation of (2) uses the following formula:wherein (1)>Representing the slave wavelength +.>HandoverTo wavelength->Switching loss of (2); />Indicating wavelength +.>To->Offset of (i.e.)>；/>Representing wavelengthTo->Power variation of (i.e.)> Wherein->And->Wavelength +.>And->Is a power of an optical signal of (a); />Representing wavelength +.>To->Time offset of (a), i.e.)> Wherein->And->Wavelength +.>And->Is set to be a switching time of (a); /> And->Are all weight coefficients for balancing the importance of different loss factors, wherein +.>The value range is 0.3-0.5;the value range is 0.2-0.4; />The value range is 0.3-0.4.
3. The optimization method for wavelength switching of an optoelectronic communication module based on linear direct drive as set forth in claim 2, wherein the switching loss isCalculated using the following formula: />Wherein (1)>Indicating wavelength +.>To->Frequency offset of (i.e.)>Wherein->Is the speed of light; />Representing the inertial loss of the linear direct drive motor.
4. The optimization method for wavelength switching of an optoelectronic communication module based on linear direct drive as set forth in claim 3, wherein the inertial lossCalculated using the following formula: />The method comprises the steps of carrying out a first treatment on the surface of the Wherein (1)>Is the rotational inertia of the linear direct-drive motor; />Is the angular velocity of a linear direct drive motor.
5. The method for optimizing wavelength switching of an optoelectronic communication module based on linear direct drive as set forth in claim 1, wherein the method for calculating the complexity of the switching path in step S3 includes: step S3.1: for each switching path, the recorded position information is recorded in a matrixWherein the position information is a matrix +.>Is represented as a node, and the connection line between the nodes is represented as an edge, thereby forming a directed graph or undirected graph +.> The method comprises the steps of carrying out a first treatment on the surface of the Wherein->Is node set, ++>Is a collection of edges; step S3.2: if a directed graph or undirected graph +.> If there is no negative side, calculating path complexity using the first complexity calculation model>The method comprises the steps of carrying out a first treatment on the surface of the Step S3.3: if a directed graph or undirected graph +.> If there is a negative weight in the path complexity is calculated using the second complexity calculation model +.>The method comprises the steps of carrying out a first treatment on the surface of the Step S3.4: if a directed graph or undirected graph +.> Without a negative-weight loop, then use a third complexComplexity of calculating path of complexity calculation model>。
6. The method for optimizing wavelength switching of a linear direct drive based optical-electrical communication module as claimed in claim 5, wherein the path complexity is calculated using a first complexity calculation modelThe method specifically comprises the following steps: step A1: an execution process comprising: setting a distance array->Initializing distance array->For storing a directed graph or undirected graph-> Shortest distance from the starting node to each node; initializing a priority minimum heap queue->For selecting the node closest to the starting node; the distance of the start node is set to 0 and inserted into +.>In (a) and (b); repeating the following steps until->Is empty: from->The node closest to the start node is popped up in>Traversing->Is->If pass->A shorter distance reach +.>Update->If->Is updated, will->Insert->In (a) and (b); obtaining the shortest distance from the initial node to each node; step A2: a complexity calculation process comprising: the initialization process needs->Time of (2); in the iterative process, each node is inserted and popped up to one priority queue at most, so the total time complexity of the insertion and popping operation is +.>The method comprises the steps of carrying out a first treatment on the surface of the For each sectionA point, traversing all its neighbor nodes, each of which is accessed at most once, thus having a total of +.>Traversing the operation for the second time; in each traversal operation, if pass +.>A shorter distance reach +.>Then an update operation is required to be performed with a temporal complexity of +.>The method comprises the steps of carrying out a first treatment on the surface of the Thus, the path complexity is calculated>The method comprises the following steps: />。
7. The method for optimizing wavelength switching of a photovoltaic module based on linear direct drive as claimed in claim 6, wherein the path complexity is calculated using a second complexity calculation modelThe method specifically comprises the following steps: step B1: an execution process comprising: setting the distance of the initial node to 0 and the distances of other nodes to infinity; repeat-> The method comprises the following steps: for each edgeIf-> Update->The value of +.> The method comprises the steps of carrying out a first treatment on the surface of the Checking whether a negative weight loop exists; if at->In the iteration, there are still edges that can be relaxed, then the instruction directed or undirected graph +.> A negative weight loop exists in the system; />Representing slave node->To node->Is the weight of the edge of (2); step B2: a complexity calculation process comprising: in each iteration, all edges E need to be traversed, and each edge is subjected to relaxation operation; the temporal complexity of each iteration is +.>The method comprises the steps of carrying out a first treatment on the surface of the Since V-1 iterations are repeated, the path complexity is calculated>The method comprises the following steps:。
8. the method for optimizing wavelength switching of an optoelectronic communications module based on linear direct drive as set forth in claim 7, wherein the path complexity is calculated using a third complexity calculation modelThe method specifically comprises the following steps: step C1: creating a two-dimensional arrayFor storing a directed graph or undirected graph-> The shortest path distance between the pair of middle vertices; will->Initializing an array to be the direct distance between two vertexes in the graph, and if no direct edge exists, setting the distance to be infinity; for each of the vertices k,the following steps are circularly executed: obtaining a pair of vertices->And->If->Update->The value of +.> The method comprises the steps of carrying out a first treatment on the surface of the Obtaining the shortest path distance between each pair of vertexes;
step C2: a complexity calculation process comprising: in the iterative process, triple nested loops need to be executed to respectively traverse the vertexesTop>And vertex->The method comprises the steps of carrying out a first treatment on the surface of the For each vertex pair->It is necessary to check whether there is a vertex +>So as to pass through the vertex->Shorter path distances may be obtained; directed or undirected graph->There is->A plurality of vertices; for each vertex pair->Need to be performed +.>Iteration number, i.e. each vertex will be taken as +>Performing one iteration; thus, the total number of iterations is +.>The method comprises the steps of carrying out a first treatment on the surface of the In each iteration, a comparison and update operation of constant time is required to be performed; thus, the path complexity is calculated>The method comprises the following steps: />。
CN202310756644.2A 2023-06-26 2023-06-26 Photoelectric communication module wavelength switching optimization method based on linear direct drive Active CN116528093B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310756644.2A CN116528093B (en) 2023-06-26 2023-06-26 Photoelectric communication module wavelength switching optimization method based on linear direct drive

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310756644.2A CN116528093B (en) 2023-06-26 2023-06-26 Photoelectric communication module wavelength switching optimization method based on linear direct drive

Publications (2)

Publication Number Publication Date
CN116528093A CN116528093A (en) 2023-08-01
CN116528093B true CN116528093B (en) 2023-08-29

Family

ID=87397906

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310756644.2A Active CN116528093B (en) 2023-06-26 2023-06-26 Photoelectric communication module wavelength switching optimization method based on linear direct drive

Country Status (1)

Country Link
CN (1) CN116528093B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2386352A1 (en) * 2002-05-28 2003-11-28 De-Gui Sun Nxn optical matrix switch using modified cross-connect of 1xn switches
CN110515380A (en) * 2019-08-22 2019-11-29 北京交通大学 Shortest path planning method based on turning weight constraints
CN114726434A (en) * 2022-03-18 2022-07-08 电子科技大学 Millisecond-level rapid path finding method suitable for large-scale optical network
CN114944882A (en) * 2022-05-16 2022-08-26 烽火通信科技股份有限公司 Wave cutting method and system under non-fixed channel interval mixed transmission

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2386352A1 (en) * 2002-05-28 2003-11-28 De-Gui Sun Nxn optical matrix switch using modified cross-connect of 1xn switches
CN110515380A (en) * 2019-08-22 2019-11-29 北京交通大学 Shortest path planning method based on turning weight constraints
CN114726434A (en) * 2022-03-18 2022-07-08 电子科技大学 Millisecond-level rapid path finding method suitable for large-scale optical network
CN114944882A (en) * 2022-05-16 2022-08-26 烽火通信科技股份有限公司 Wave cutting method and system under non-fixed channel interval mixed transmission

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
频率间隔可切换多波长随机光纤激光器;杨茜，周泽中，张祖兴;光子学报;第51卷(第12期);全文 *

Also Published As

Publication number Publication date
CN116528093A (en) 2023-08-01

Similar Documents

Publication Publication Date Title
JP7362727B2 (en) Photonic processing devices and methods
Al-Qadasi et al. Scaling up silicon photonic-based accelerators: Challenges and opportunities
Siegman et al. Modes in unstable optical resonators and lens waveguides
CN109283612B (en) A kind of hollow antiresonance optical fiber and its design method based on nested support ring
CN113325514B (en) Design method of tapered waveguide region of optical power beam splitter and optical power beam splitter
CN110554006B (en) Multi-mode measurement method based on self-interference micro-ring resonant cavity optical sensor
CN112180592B (en) Rapid optimization method for optical reverse design
CN116528093B (en) Photoelectric communication module wavelength switching optimization method based on linear direct drive
CN117354652B (en) High-speed multimode optical module performance optimization method based on variation self-encoder
Gu et al. Efficient on-chip learning for optical neural networks through power-aware sparse zeroth-order optimization
CN109186643A (en) A kind of accurate sensor-based system and method for sensing based on reflection function resonance filter
Ahmed et al. Fast estimation of feedback parameters for a self-mixing interferometric displacement sensor
Mehrabian et al. A design methodology for post-moore’s law accelerators: the case of a photonic neuromorphic processor
CN104462735A (en) Method for simulating coaxially-packaged TOSA temperature distribution
CN116859518A (en) Fano resonance micro-ring resonant cavity, system and method for realizing negative weight
CN113673677B (en) Method, equipment and medium for realizing nonlinear activation function RELU
US20200004056A1 (en) Methods and apparatus for optical polarization control
KR102187793B1 (en) Method for maximum wind energy extraction of variable speed wind turbines using previewed wind speed
CN103955575A (en) Design method of micro loop optical switch chip
Castelletto et al. Two-photon mode preparation and matching efficiency: definition, measurement, and optimization
CN117784333B (en) Optical fiber nutation coupling method, system, equipment and storage medium
CN110008574A (en) Temperature parameter and pressure parameter acquisition methods, device, equipment and storage medium
US11226502B1 (en) Photonic integrated circuits for generating high-brightness squeezed light
CN220419605U (en) 6dB optical waveguide power divider system
Shang et al. Design and polarization characterization of diffraction grating for spectral beam combining

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant