CN114978997B - Radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method - Google Patents

Radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method Download PDF

Info

Publication number
CN114978997B
CN114978997B CN202210894342.7A CN202210894342A CN114978997B CN 114978997 B CN114978997 B CN 114978997B CN 202210894342 A CN202210894342 A CN 202210894342A CN 114978997 B CN114978997 B CN 114978997B
Authority
CN
China
Prior art keywords
routing
stage
matrix
switching matrix
port number
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
CN202210894342.7A
Other languages
Chinese (zh)
Other versions
CN114978997A (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.)
Chengdu Acti Technology & Development Co ltd
Original Assignee
Chengdu Acti Technology & Development 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 Chengdu Acti Technology & Development Co ltd filed Critical Chengdu Acti Technology & Development Co ltd
Priority to CN202210894342.7A priority Critical patent/CN114978997B/en
Publication of CN114978997A publication Critical patent/CN114978997A/en
Application granted granted Critical
Publication of CN114978997B publication Critical patent/CN114978997B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing
    • H04L45/745Address table lookup; Address filtering
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/15Interconnection of switching modules
    • H04L49/1515Non-blocking multistage, e.g. Clos
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method, which comprises the following steps: s1, establishing a routing table; s2, establishing a memory table; s3: selecting response port number groups in the routing table according to the output port number; s4, searching in the grouped memory table, if the searching is successful, jumping to the step S6, and if the searching is failed, performing the step S5; s5, determining a search query direction according to the current routing state; s6, controlling the on-off of each switch according to the inquired routing control parameters; s7, updating the memory table. The invention establishes a routing state table and a short-time memory table, uses the current connection state as prior knowledge, adopts a memory search and update method to realize the quick selection of the routing, reduces the average calculation amount of table lookup search to 1/2N, consumes little calculation amount and realizes the quick selection of the switching matrix routing.

Description

Radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method
Technical Field
The invention relates to the technical field of data communication, in particular to a rapid routing method for a radio frequency intermediate frequency three-level CLOS non-blocking switching matrix.
Background
In satellite earth stations, short-wave and ultrashort-wave communication hubs, radio signal detection stations and radio monitoring stations with larger scale, in order to realize large-scale communication link distribution management and signal detection and control link distribution management, a radio frequency intermediate frequency switching matrix is widely applied to complete distribution and exchange among a transmitting-receiving antenna, a communication terminal, a detection post and a monitoring station, and a routing method is an important basis for developing efficient communication link distribution management and signal receiving link distribution management. Because the radio frequency intermediate frequency switching matrix is used for power distribution and switching of high frequency analog signals, each level of distribution and switching brings insertion loss, low noise amplifiers are needed to be adopted for compensation, and in order to reduce electromagnetic radiation and interference of a calculation control unit to an analog high frequency channel, a simple operation and control device is usually adopted in engineering to complete route selection control except for electromagnetic shielding measures.
In the fields of radio communication, radio detection and radio monitoring, two methods are generally adopted for routing the radio frequency intermediate frequency switching matrix in engineering implementation: firstly, a sequential search algorithm is used for establishing a routing table in all states and obtaining the on-off states of all switches through sequential search; secondly, various parallel routing algorithms proposed by the Graph Edge Coloring (Graph Edge-Coloring) problem in Graph theory are used, and an n-degree binary multiple Graph Edge Coloring method (Edge Coloring of binary Multigraphs of degree n) is usually used. The sequential search algorithm is simple, but the operation amount is large, the cost is high, and a control computer or a routing resolving function is usually required to be added in upper computer software in engineering implementation; and the quantity of control information between the radio frequency intermediate frequency switching matrix and the control computer or the upper computer is large, the transmission timeliness of control instructions is low, and the route switching speed is low. The parallel routing algorithm reduces the operation amount, but the algorithm is still more complex and has higher cost, and a single board computer or a DSP board or an FPGA board with an ARM core needs to be integrated in a switching matrix; and a special electromagnetic shielding design is also needed, so that the electromagnetic compatibility interference caused by high-speed digital signal processing such as a single-board computer or a DSP board or an FPGA board with an ARM core is reduced.
At present, in satellite earth stations, short-wave and ultrashort-wave communication hubs, radio signal detection stations and radio monitoring stations with larger scale, the routing of radio frequency intermediate frequency switching matrix equipment is dynamically controlled according to the change requirements of services, targets and objects, so that the purpose of quickly establishing suitable communication transceiving channels and signal detection and control channels is achievedThe time complexity of the waterline routing algorithm is reduced to
Figure GDA0003843024830000021
However, for the rf intermediate frequency three-stage CLOS non-blocking switching matrix, it is still relatively complicated to use a low-cost single chip to solve the routing algorithm.
Disclosure of Invention
Aiming at the problems, the invention provides a low-cost and rapid method for realizing the routing selection of the radio frequency intermediate frequency non-blocking switching matrix by utilizing routing prior knowledge and memory search table look-up, short-time memory is simulated, firstly, the memory list is inquired, the table look-up search calculation amount is averagely reduced to 1/2N, and the routing selection and control are completed by a single chip microcomputer.
The invention adopts the following technical scheme: a radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method comprises the following steps:
s1: establishing a routing table: the routing table is grouped according to the output port number, the input port numbers in the group are arranged from small to large, the routing table defines the control parameters of the module switch needed to be configured in the input stage T1, the intermediate stage T2 and the output stage T3, the control parameters of the routing table are arranged according to a matrix, and the routing table control parameter matrix of the C (n, m, r) non-blocking switching matrix is as follows, wherein C (n, m, r) represents the non-blocking switching matrix that the input port number and the output port number are n.r, r n x m input switching matrix modules are used for the input stage T1, r x n output switching matrix modules are used for the output stage T3, and m x r x r switching matrix modules are used for the intermediate stage T2:
Figure GDA0003843024830000031
wherein Z j For output port j, the routing list for all input ports is as follows:
Figure GDA0003843024830000032
wherein z is i,j Is output port j, connected to port jWhen the input port is I, the control parameters of the input stage, the intermediate stage and the output stage are as follows:
z i,j =[A 1,i,j ,A 2,i,j ,A 3,i,j ]
wherein A is 1,i,j =(a,T 1,a ),a=(1,2,...,r);
A 2,i,j =(b,T 2,b ),b=(1,2,...,r);
A 3,i,j =(c,T 3,c ),c=(1,2,...,r);
Wherein T is 1,a ,T 2,b ,T 3,c Respectively representing control parameters of an input stage number a sub-matrix, control parameters of a middle stage number b sub-matrix and control parameters of an output stage number c sub-matrix;
s2: establishing a memory table:
the depth of the memory table is selected to be 2 or 4 or 8 or 16, the depth of the memory table is selected to be 2 bit depth at the shallowest, the depth of the memory table is selected to be 16 bit depth at the deepest, the memory table is configured according to the scale of the switching matrix, the scale is less than 32 x 32, the scale is selected to be 2, 32 x 32 to 64 x 64, the scale is selected to be 4, 64 x 64 to 128 x 128, the scale is selected to be 8, the scale is greater than 128 x 128, and the depth of the memory table is selected to be 16;
s3: selecting a response port number packet Z in the routing table according to the output port number j j
S4: in the group Z j Memory meter M j Searching, if the searching is successful, jumping to the step S6, and if the searching is failed, performing the step S5;
s5: according to the current routing state, if the new input port number i is smaller than the input port number h of the current routing state, the search query direction is developed upwards, and if the new input port number is larger than the input port number h of the current routing state, the search query direction is developed downwards;
s6: according to the inquired route control parameter [ A ] 1,i,j ,A 2,i,j ,A 3,i,j ]Respectively controlling the on-off of each switch in the input stage matrix a, the intermediate stage matrix b and the output stage matrix c;
s7: and updating the memory table, wherein a first-in first-out mode is adopted, the routing state used last time is arranged at the first position, the routing state used last time is arranged at the second position, and the like, the routing state of the deepest position is forgotten, and the memory table is quitted.
The routing selection and control are completed by a simple low-cost singlechip.
The invention has the beneficial effects that: establishing a routing state table and a short-time memory table, using the current connection state as prior knowledge, adopting a memory search and update method to realize the quick selection of the routing, averagely reducing the table lookup search calculation amount to 1/2N, spending little calculation amount and realizing the quick selection of the switching matrix routing.
Drawings
To illustrate the technical solutions of the embodiments of the present invention more clearly, the drawings of the embodiments will be briefly introduced, and it is obvious that the drawings in the following description only relate to some embodiments of the present invention, and are not to limit the present invention.
FIG. 1 is a logic diagram of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the drawings of the embodiments of the present invention. It is to be understood that the embodiments described are only a few embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the described embodiments of the invention without inventive step, are within the scope of protection of the invention.
Unless defined otherwise, technical or scientific terms used herein shall have the ordinary meaning as understood by one of ordinary skill in the art to which this disclosure belongs. The use of the word "comprising" or "comprises", and the like, in this disclosure is intended to mean that the elements or items listed before that word, include the elements or items listed after that word, and their equivalents, without excluding other elements or items. "upper", "lower", "left", "right", and the like are used merely to indicate relative positional relationships, and when the absolute position of the object being described is changed, the relative positional relationships may also be changed accordingly.
The invention is further illustrated by the following examples in conjunction with the drawings.
A radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method comprises the following steps:
s1: establishing a routing table: the routing table is grouped according to the output port number, the input port numbers in the group are arranged from small to large, the routing table defines the control parameters of the module switch needed to be configured in the input stage T1, the intermediate stage T2 and the output stage T3, the control parameters of the routing table are arranged according to a matrix, and the routing table control parameter matrix of the C (n, m, r) non-blocking switching matrix is as follows, wherein C (n, m, r) represents the non-blocking switching matrix that the input port number and the output port number are n.r, r n x m input switching matrix modules are used for the input stage T1, r x n output switching matrix modules are used for the output stage T3, and m x r x r switching matrix modules are used for the intermediate stage T2:
Figure GDA0003843024830000051
wherein Z j For output port j, the routing list for all input ports is as follows:
Figure GDA0003843024830000052
wherein z is i,j When the output port is the output port of the number j and is connected to the input port of the number i, the control parameters of the input stage, the intermediate stage and the output stage are as follows:
z i ,j=[A 1,i,j ,A 2,i,j ,A 3,i,j ]
wherein A is 1,i,j =(a,T 1,a ),a=(1,2,...,r);
A 2,i,j =(b,T 2,b ),b=(1,2,...,r);
A 3,i,j =(c,T 3,c ),c=(1,2,...,r);
Wherein T is 1,a ,T 2,b ,T 3,c Control of sub-matrices representing input stage number a respectivelyParameters, control parameters of a middle-stage number b sub-matrix and control parameters of an output-stage number c sub-matrix;
s2: establishing a memory table:
the depth of the memory table is selected to be 2 or 4 or 8 or 16, the depth of the memory table is selected to be 2 bit depth at the shallowest, the depth of the memory table is selected to be 16 bit depth at the deepest, the memory table is configured according to the scale of the switching matrix, the scale is less than 32 x 32, the scale is selected to be 2, 32 x 32 to 64 x 64, the scale is selected to be 4, 64 x 64 to 128 x 128, the scale is selected to be 8, the scale is greater than 128 x 128, and the depth of the memory table is selected to be 16;
s3: selecting a response port number packet Z in the routing table according to the output port number j j
S4: in the group Z j Memory meter M j Searching, if the searching is successful, jumping to the step S6, and if the searching is failed, performing the step S5;
s5: according to the current routing state, if the new input port number i is smaller than the input port number h of the current routing state, the search query direction is developed upwards, and if the new input port number is larger than the input port number h of the current routing state, the search query direction is developed downwards;
s6: according to the inquired route control parameter [ A ] 1,i,j ,A 2,i,j ,A 3,i,j ]Respectively controlling the on-off of each switch in the input stage matrix a, the intermediate stage matrix b and the output stage matrix c;
s7: and updating the memory table, adopting a first-in first-out mode, arranging the routing state used last time at the first position, arranging the routing state used last time at the second position, and so on, forgetting the routing state of the deepest position, and exiting the memory table.
The routing selection and control are completed by a simple low-cost singlechip.
The invention utilizes the state that the radio frequency intermediate frequency three-level CLOS non-blocking switching matrix is not completely disconnected in actual use to establish routing tables from all input ports to output ports, and divides the routing tables into 2 levels, wherein the routing tables comprise 2 routes which are selected most recently for 2 times and are used as a first-level routing table, and the rest are used as a second-level routing table; when the route is changed, firstly inquiring in the memory list, and simultaneously automatically updating the memory list, if the inquiry is successful, obtaining the route configuration of the input stage, the intermediate stage and the output stage switching module; if the query fails, switching to a second-level routing table for searching, and performing branch query by using the port number and the current routing state to finally obtain the routing configuration of the input-level switching module, the intermediate-level switching module and the output-level switching module; and transmitting the routing of the three modules to the corresponding modules to realize the routing of the radio frequency intermediate frequency three-stage CLOS non-blocking switching matrix, as shown in FIG. 1.
Although the present invention has been described with reference to the preferred embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the scope of the present invention.

Claims (2)

1. A radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method is characterized by comprising the following steps:
s1: establishing a routing table: the routing table is grouped according to the output port number, the input port numbers in the group are arranged from small to large, the routing table defines the control parameters of the module switch needed to be configured in the input stage T1, the intermediate stage T2 and the output stage T3, the control parameters of the routing table are arranged according to a matrix, and the routing table control parameter matrix of the C (n, m, r) non-blocking switching matrix is as follows, wherein C (n, m, r) represents the non-blocking switching matrix that the input port number and the output port number are n.r, the input stage T1 is provided with r n x m input switching matrix modules, the output stage T3 is provided with r x n output switching matrix modules, and the intermediate stage T2 is provided with m x r switching matrix modules:
Figure FDA0003843024820000011
wherein Z j For output port j, the routing list for all input ports is as follows:
Figure FDA0003843024820000012
wherein z is i,j When the output port is the output port of the number j and is connected to the input port of the number i, the control parameters of the input stage, the intermediate stage and the output stage are as follows:
z i,j =[A 1,i,j ,A 2,i,j ,A 3,i,j ]
wherein A is 1,i,j =(a,T 1,a ),a=(1,2,...,r);
A 2,i,j =(b,T 2,b ),b=(1,2,...,r);
A 3,i,j =(c,T 3,c ),c=(1,2,...,r);
Wherein T is 1,a ,T 2,b ,T 3,c Respectively representing control parameters of an input stage number a sub-matrix, control parameters of a middle stage number b sub-matrix and control parameters of an output stage number c sub-matrix;
s2: establishing a memory table:
the depth of the memory table is selected to be 2 or 4 or 8 or 16, the depth of the memory table is selected to be 2 bit depth at the shallowest, the depth of the memory table is selected to be 16 bit depth at the deepest, the memory table is configured according to the scale of the switching matrix, the scale is less than 32 x 32, the scale is selected to be 2, 32 x 32 to 64 x 64, the scale is selected to be 4, 64 x 64 to 128 x 128, the scale is selected to be 8, the scale is greater than 128 x 128, and the depth of the memory table is selected to be 16;
s3: according to the output port number j, selecting a response port number group Z in the routing table j
S4: in the group Z j Memory meter M j Searching, if the searching is successful, jumping to the step S6, and if the searching is failed, performing the step S5;
s5: according to the current routing state, if the new input port number i is smaller than the input port number h of the current routing state, the search query direction is developed upwards, and if the new input port number i is larger than the input port number h of the current routing state, the search query direction is developed downwards;
s6: according to the inquired route control parameter [ A ] 1,i,j ,A 2,i,j ,A 3,i,j ]Respectively controlling the on-off of each switch in the input stage matrix a, the intermediate stage matrix b and the output stage matrix c;
s7: and updating the memory table, wherein a first-in first-out mode is adopted, the routing state used last time is arranged at the first position, the routing state used last time is arranged at the second position, and the like, the routing state of the deepest position is forgotten, and the memory table is quitted.
2. The method as claimed in claim 1, wherein the routing is performed by a single chip.
CN202210894342.7A 2022-07-28 2022-07-28 Radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method Active CN114978997B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210894342.7A CN114978997B (en) 2022-07-28 2022-07-28 Radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210894342.7A CN114978997B (en) 2022-07-28 2022-07-28 Radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method

Publications (2)

Publication Number Publication Date
CN114978997A CN114978997A (en) 2022-08-30
CN114978997B true CN114978997B (en) 2022-10-21

Family

ID=82968550

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210894342.7A Active CN114978997B (en) 2022-07-28 2022-07-28 Radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method

Country Status (1)

Country Link
CN (1) CN114978997B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101119503A (en) * 2007-09-10 2008-02-06 华为技术有限公司 Method for selecting routing in CLOS switch network and routing select device
CN101277547A (en) * 2008-03-18 2008-10-01 天津光电通信技术有限公司 Large-scale strict non-blockage light-crossing connection matrix structure and control method thereof
CN102185772A (en) * 2011-05-05 2011-09-14 北京交通大学 Method for routing data centre network system
CN204681483U (en) * 2015-05-29 2015-09-30 成都爱科特科技发展有限公司 A kind of L frequency range 128 × 64 matrix switch system
CN109510786A (en) * 2019-01-22 2019-03-22 伍星霖 A kind of route control method and switching equipment

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9634960B2 (en) * 2006-12-14 2017-04-25 Maged E. Beshai Petabits-per-second packet switch employing cyclically interconnected switch units
CN101227394B (en) * 2008-02-18 2011-07-13 中兴通讯股份有限公司 High-capacity non-jam route matrix
CN101309222B (en) * 2008-06-19 2012-05-23 华为技术有限公司 Method, apparatus and system for regulating network routing
CN101778044B (en) * 2010-01-20 2011-12-21 中国人民解放军国防科学技术大学 Switched network system structure with adjustable throughput rate
US9253118B2 (en) * 2012-05-30 2016-02-02 Thinklogical, Inc. Matrix router and method of switching
CN102740177B (en) * 2012-07-17 2014-08-27 上海汇珏网络通信设备有限公司 Non-blocking expandable multistage photoswitch array and working method thereof
CN112350962A (en) * 2020-11-25 2021-02-09 中国电子科技集团公司第五十四研究所 Plane full-switching matrix

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101119503A (en) * 2007-09-10 2008-02-06 华为技术有限公司 Method for selecting routing in CLOS switch network and routing select device
CN101277547A (en) * 2008-03-18 2008-10-01 天津光电通信技术有限公司 Large-scale strict non-blockage light-crossing connection matrix structure and control method thereof
CN102185772A (en) * 2011-05-05 2011-09-14 北京交通大学 Method for routing data centre network system
CN204681483U (en) * 2015-05-29 2015-09-30 成都爱科特科技发展有限公司 A kind of L frequency range 128 × 64 matrix switch system
CN109510786A (en) * 2019-01-22 2019-03-22 伍星霖 A kind of route control method and switching equipment

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Non-blocking asymmetrical three-stage multirate switching networks;W. Kabacinski;《IEEE Xplore》;20020806;全文 *
可重排非阻塞三级 Clos 网络控制算法;曾峰;《百度学术》;19991231;全文 *
基于CPCI结构变频器的电源设计;韩周安;《CNKI中国知网》;20140930;全文 *
硅基Ka波段全射频相控阵发射机研究与设计;黄勇;《CNKI中国知网》;20171115;全文 *

Also Published As

Publication number Publication date
CN114978997A (en) 2022-08-30

Similar Documents

Publication Publication Date Title
CN102273141B (en) Reduce the propagation of the message flooding in computer network
RU2419976C2 (en) System of multiplex transmission of data with many inputs and outputs and method of signals separation
Liu et al. A 1.1-Gb/s 115-pJ/bit Configurable MIMO Detector Using 0.13-$\mu\hbox {m} $ CMOS Technology
US5323386A (en) Expandable high speed serial data switch
CN102281192B (en) The cell processing method and processing device of exchange network chip
KR101422980B1 (en) Transmitter and transmission method
CN102065014A (en) Data cell processing method and device
CA2220393C (en) Data transmission system with a low peak-to-average power ratio based on distorting small amplitude signals
CN101783688B (en) Design method of 64-bit parallel multi-mode CRC code generation circuit
CN106936519A (en) A kind of signal calibration method, device and signal processing system
CN109495150A (en) A kind of millimetre-wave attenuator codebook design method
CN114978997B (en) Radio frequency intermediate frequency three-level CLOS non-blocking switching matrix route rapid selection method
CN109709851B (en) High-speed generation device and method for complex modulation signal
CN107018113A (en) The method of emitter, receiver and signal transacting
CN112672300B (en) Power consumption data vine type transmission optimization method for medium and low voltage switch cabinet
CN101557281A (en) Multiple-input multiple-output wireless communication data detector
CN106656879B (en) A kind of high-speed and High-order variable-step self-adaptive equalization methods
US5396628A (en) Method of and apparatus for data distribution of processing load
CN103986670A (en) Method for obtaining performance of optical switch chip
CN109660473B (en) Spherical decoding detection method and device and computer readable storage medium
CN108111446A (en) A kind of receiver equalization module and equalization methods
CN110995330B (en) Antenna selection method based on grouping and EDAS algorithm
CN113726879A (en) Hybrid data center network structure VHCN based on VLC link
CN109547056A (en) Multisystem mixing platform
CN114124640A (en) Signal compensation processing method and device

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