A GCA data processing optimization method
By splitting the one-dimensional data into two-dimensional arrays and applying a gain compression algorithm, the GCA channel data processing is optimized, which solves the problem of device overload and data points limitations, and improves measurement efficiency and accuracy.
Patent Information
- Application Number
- CN202410896577.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-05
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2044-07-05
AI Technical Summary
The existing GCA channel data processing modes have problems such as equipment overload and data points during measurement, which affects measurement accuracy and efficiency.
A GCA data processing optimization method is adopted to split the one-dimensional raw data into a one-dimensional linear gain array and one-dimensional scan data, splice it into a two-dimensional array, and use the gain compression algorithm to obtain the characteristic parameters of the gain compression to the specified value, reducing the Equipment overload, improving data update speed and measurement accuracy.
It improves the efficiency of calculating gain compression characteristic parameters, reduces equipment overload, and improves the accuracy of parameter testing and data update speed.
Smart Images

Figure CN118427029B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of data processing, and in particular to a GCA data processing optimization method. Background Art
[0002] GCA channel data acquisition mode, including two 2D scanning modes:
[0003] Scan power at each frequency point: Scan from the starting power to the ending power at each frequency point in sequence, according to GCA settings->calculate the number of excitation points of frequency point * power point;
[0004] Each power scanning frequency: At each power level, the frequency is scanned from the start frequency to the end frequency in sequence, and the gain, input and output power of each measurement are stored. According to GCA settings-> calculate the power point * frequency point number of excitation points;
[0005] 1) Gain measurement is measured over the specified full frequency band and power range;
[0006] 2) Although it is a two-dimensional scan in concept, it is still a one-dimensional scan in hardware, so the number of points that can be measured is limited;
[0007] 3) After all the data is collected, the compression point is searched, usually by interpolating between the two measurement points closest to the target value.
[0008] Power scanning mode at each frequency point: When the maximum power is input, it may cause the device to overload and affect the measurement. The vector network analyzer provides a compression analysis function that can select a frequency to observe all power scanning information and reach the highest power level at the first frequency point. This may cause the device to heat up prematurely and affect the compression result. Summary of the invention
[0009] The present invention provides a GCA data processing optimization method to solve the problems of the prior art.
[0010] In a first aspect, the present invention provides a GCA data processing optimization method, comprising:
[0011] Issue incentives, record incentive points, retrieve data to obtain one-dimensional raw data;
[0012] Split into a one-dimensional linear gain array and one-dimensional scan data, spliced into a two-dimensional array, and then processed into a one-dimensional gain compression array;
[0013] The two-dimensional array data is updated according to the updated data excitation point number, and then the data of the corresponding position in the one-dimensional gain array is correspondingly calculated;
[0014] Based on all the power data at a complete frequency point, a gain compression algorithm is used to obtain characteristic parameters (including input power, output power and other parameters) when the gain is compressed to a specified value;
[0015] Get the characteristic parameters when the gain of all frequency points is compressed to the specified value, and display the relevant traces.
[0016] Furthermore, the recording of the number of excitation points and retrieving the data to obtain the one-dimensional original data includes:
[0017] When scanning power at each frequency point to obtain data, M frequency points are scanned under linear input power, arranged in sequence, power scanning is started at each frequency point, a data index is constructed, and written into a circular buffer.
[0018] Furthermore, the recording of the number of excitation points and retrieving the data to obtain the one-dimensional original data includes:
[0019] When taking data at each power scanning frequency, N power points are scanned under linear input power, arranged sequentially, and frequency scanning is started at each power point to construct data and write them into the circular buffer.
[0020] Furthermore, the splitting into a one-dimensional linear gain array and a one-dimensional scanning data, splicing into a two-dimensional array, and then processing into a one-dimensional gain compression array includes:
[0021] Set the frequency scan points M and power scan points N, and all the measurement points M*(N+1), that is, the total length of a complete frame of raw data;
[0022] Initialize the linear power one-dimensional array LinearMeasData, that is, the data of M frequency points under the linear input power in the one-dimensional original data, which is used as the reference value for the calculation of the gain compression algorithm;
[0023] Initialize the data CompMeasData measured at all frequency points and power points. CompMeasData is a two-dimensional array used to calculate the data array of gain compression;
[0024] Create a location variable to record the last measurement point and assign an initial value: LastMeasLocation=0;
[0025] Create a location variable to record the current measurement points and assign an initial value of MeasLocation = 0. The value range of MeasLocation is 0- M* (N+1);
[0026] Update the data in the one-dimensional array and the two-dimensional array according to LastMeasLocation and MeasLocation;
[0027] When MeasLocation = M*(N+1), it needs to be reset to zero to start data splicing for the next frame, where * represents the product sign.
[0028] Furthermore, the real-time updated part of the one-dimensional original data is synchronously updated to the linear gain data and the data at the corresponding position in the two-dimensional array. The judgment when updating the linear gain array and the two-dimensional array is as follows:
[0029] Among them, the one-dimensional raw data array includes M data under linear power and M*N data under scanning all frequency points and power points.
[0030] The currently collected data points and the last data point are both scanned data under linear power, that is, LastMeasLocation and MeasLocation are both located in the first M data in the one-dimensional original array. The data is put into the one-dimensional array LinearMeasData of the linear input power scan;
[0031] The currently collected data point is within the data range of the two-dimensional scan, but the last data point number is still the data under the linear power scan, that is, LastMeasLocation is located in the first M data in the one-dimensional original array, and after MeasLocation is located at the M+1th data position, the data with the position from LastMeasLocation to M is put into the one-dimensional array LinearMeasData of the linear power scan; the currently collected data point position Measlocation is processed, and the frequency point position CurrFreqLoc and CurrPwrLoc power point of the two-dimensional array corresponding to the data point are calculated (that is, the row and column index of the two-dimensional array corresponding to the current data point), and the data with the position from (M+1) to MeasLocation in the one-dimensional original data is updated to the range of the corresponding CurrFreqLoc and CurrPwrLoc information in the two-dimensional array;
[0032] The current and previous data points are both within the range of the two-dimensional scan data, that is, after LastMeasLocation and MeasLocation are both located at the M+1th data position, calculate the corresponding frequency point position LastFreqLoc and power point position LastPwrLoc of the previous two-dimensional array and the current frequency point position CurrFreqLoc and power point position CurrPwrLoc, and update the data at the corresponding positions in the two-dimensional array: from the LastPwrLoc column of the LastFreqLoc row to the CurrPwrLoc column of the CurrFreqLoc row.
[0033] Further, when calculating the power point position and frequency point position (whether calculated according to LastMeasLocation or MeasLocation, which is uniformly referred to as DataLocation in this feature), it includes the basic settings of the gain compression measurement mode: the number of power points, denoted as PwrCnt; the number of frequency points, that is, the number of scanned points under linear power, denoted as FreqCnt; the acquisition mode: scanning power under each frequency point or scanning frequency under each power point.
[0034] When the data point position is within the linear power scanning range, the frequency point position FreqLoc of the two-dimensional array = 0, and the power point position PwrLoc of the two-dimensional array = 0;
[0035] When the data point position is outside the linear power scanning range, the remaining data length: dataCnt = DataLocation - FreqCnt,
[0036] According to different data acquisition modes, the methods for calculating FreqLoc and PwrLoc are different. Determine whether the acquisition mode is scanning power under each frequency point:
[0037] If so, FreqLoc = data length / the set number of power points, PwrLoc = data length % the set number of power points;
[0038] If not, FreqLoc = data length / the set number of frequency points, PwrLoc = data length % the set number of frequency points.
[0039] Further, when taking data by scanning power under each frequency point, input LastFreqLoc, CurrFreqLoc, LastPwrLoc, and CurrPwrLoc, and the process of updating the two-dimensional array is as follows:
[0040] For the data under the same frequency point, initially set the power point position Index = the previous power position LastPwrLoc;
[0041] When LastPwrLoc < the current power point position CurrPwrLoc, the current power point position is CurrPwrLoc;
[0042] Update the data of FreqCnt + the current frequency point * the number of power points + Index in the one-dimensional original data to the position of the CurrFreqLoc frequency point and the Index in the two-dimensional array, and Index++, where Index++ means moving to the next position point, and then judge again whether LastPwrLoc < CurrPwrLoc; perform the same operation until the data of CurrPwrLoc is updated completely.
[0043] For data at different frequency points, the initial setting is: the frequency point position Index = the previous frequency position LastFreqLoc. When LastFreqLoc < CurrFreqLoc, it is divided into two cases to judge the position of the previous frequency at i = LastFreqLoc:
[0044] If so, update the data of the power points remaining in the row where the previous frequency point LastFreqLoc is located in the two-dimensional array, that is, the data corresponding to the latter part of the power points under the previous frequency point position. Among them, the data of the power points remaining in the row where the LastFreqLoc is located is the data corresponding to the power points in the range from LastPwrLoc to PwrCnt.
[0045] If not, that is, the power of the rows where the previous and current frequency point positions are located has not been fully updated;
[0046] Judge whether the position of Index = CurrFreqLoc. If so, update the data of the power points in the row where the current frequency point CurrFreqLoc is located, that is, in the CurrFreqLoc row, the data under the power points from the beginning 1 to CurrPwrLoc, that is, the data corresponding to the previous part of the power values under the current frequency point; if not, then scan all the power points under a single frequency point Index, and the range of Index is: LastFreqLoc < Index < CurrFreqLoc, and update the data of all the power points in the Index row. All the power points in the Index row are from 1 to N power points, and N = PwrCnt.
[0047] Furthermore, when issuing the excitation, an additional excitation for frequency scanning under linear power needs to be added as the reference gain for calculating the gain compression; the total number of excitation points is M + M * N.
[0048] Furthermore, for the method of calculating the compression value using the gain compression algorithm, it includes:
[0049] Directly find the index of the value closest to the target gain in the data, or find the two values closest to the target value and then perform interpolation to obtain the index of the closest value, and then obtain the characteristic parameters when the gain compression occurs to the specified value.
[0050] Furthermore, the adapted selection of gain compression algorithms includes: compression with linear gain as the reference, compression with maximum gain as the reference, fallback compression, or X - Y compression, and compression with the saturation point as the reference.
[0051] The present invention provides a GCA data processing optimization method, which improves the efficiency of calculating gain compression characteristic parameters, increases data update speed, selects a suitable acquisition method, reduces equipment overload, and improves the accuracy of parameter testing by splicing and processing into a two-dimensional array. BRIEF DESCRIPTION OF THE DRAWINGS
[0052] The drawings described herein are used to provide a further understanding of the embodiments of the present invention, constitute a part of the present invention, and do not constitute a limitation of the embodiments of the present invention. In the drawings:
[0053] Figure 1 A general flow chart of a GCA data processing optimization method provided for an exemplary embodiment of the present invention.
[0054] Figure 2 A schematic diagram of the composition of a one-dimensional original data array in a GCA data processing optimization method provided by an exemplary embodiment of the present invention.
[0055] Figure 3 A schematic diagram of a flow chart of obtaining a one-dimensional linear gain array and a two-dimensional array in a GCA data processing optimization method provided by an exemplary embodiment of the present invention.
[0056] Figure 4 A schematic diagram of a flow chart of updating a one-dimensional linear gain array and a two-dimensional array in a GCA data processing optimization method provided by an exemplary embodiment of the present invention.
[0057] Figure 5 A schematic diagram of a flow chart of calculating power points and frequency points corresponding to currently updated data in a GCA data processing optimization method provided by an exemplary embodiment of the present invention.
[0058] Figure 6 A schematic diagram of a flow chart of updating a two-dimensional array in a GCA data processing optimization method provided by an exemplary embodiment of the present invention.
[0059] Figure 7 A schematic diagram of a two-dimensional array of updating different power points at the same frequency point in a frequency scanning mode in a GCA data processing optimization method provided by an exemplary embodiment of the present invention.
[0060] Figure 8 A schematic diagram of updating data at different frequency points and different power points into a two-dimensional array in a frequency scanning mode in a GCA data processing optimization method provided by an exemplary embodiment of the present invention. DETAILED DESCRIPTION
[0061] Here, exemplary embodiments will be described in detail, and examples thereof are shown in the accompanying drawings. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present invention.
[0062] The specific application scenario of the present invention is GCA channel data processing.
[0063] GCA: Gain Compression for Amplifiers, amplifier gain compression application;
[0064] The technical concept of the present invention:
[0065] Regarding the gain compression parameter curve, taking the input power curve when the characteristic parameter is gain compression as an example, the horizontal axis of the curve always shows the frequency value, and the vertical axis represents the input power when the gain is compressed, that is, the input power value of the specified compression value is found by measuring and calculating the power scanning curve at this frequency;
[0066] Regardless of the acquisition mode, the measured data is ultimately converted into a one-dimensional scan array, with the horizontal direction representing the frequency value and the vertical direction representing the power value. Each element represents: at a certain frequency point, the characteristic parameter of the gain compressed to a specified value.
[0067] The data collected by the data acquisition thread of the system software, that is, continuous one-dimensional data, is filled and spliced based on different data acquisition modes, scanning frequency at each power point or scanning power at each frequency, and finally forming a two-dimensional data table;
[0068] Search for the index value of the gain compressed to the specified value in each row of the two-dimensional data table. There are many ways to search, and users can choose the appropriate search method based on the actual measured amplifier characteristics;
[0069] Because the data acquisition thread continuously writes data into the circular buffer, and the data is not collected together as a whole frame, the reading thread will read it back if there is data at the bottom layer. The data processing thread also processes the data in real time and displays each point, instead of waiting for a complete frame of data to calculate. This causes the interface data to refresh very slowly.
[0070] Therefore, in order to ensure the real-time performance of the data, the gain compression parameter trace means: each frequency point corresponds to the power when the gain is compressed to the specified value. Therefore, when processing data, the two-dimensional data table is filled with the value of a complete frequency point (that is, the value of all power points), and the power value at a frequency point is obtained according to the corresponding gain compression algorithm, and the trace display data is updated.
[0071] The one-dimensional original data obtained from the data acquisition thread has a random number of data points updated each time. It is necessary to update the data at the corresponding position in the two-dimensional array according to the actual number of data points. Then, for all power data at a complete frequency point, the characteristic parameters (input power, input power, etc.) of the specified gain compression value at the corresponding frequency point are obtained according to the gain compression algorithm.
[0072] The specific algorithm flow from converting one-dimensional raw data into two-dimensional data is as follows Figure 1 shown.
[0073] The present invention provides a GCA data processing optimization method, which aims to solve the above technical problems in the prior art.
[0074] The technical solution of the present invention and how the technical solution of the present invention solves the above-mentioned technical problems are described in detail below with specific embodiments. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present invention will be described below in conjunction with the accompanying drawings.
[0075] Embodiment 1: The present invention provides a GCA data processing optimization method, such as Figure 1 As shown, including:
[0076] Get one-dimensional raw data, and when sending stimulus, record the number of stimulus points and retrieve data; when using each frequency point to scan power and get data, scan M frequency points under linear input power, arrange them in sequence, start power scanning at each frequency point, build data, and write to the circular buffer. When using each power scanning frequency to get data, scan M frequency points under linear input power, arrange them in sequence, start frequency scanning at each power point, build data, and write to the circular buffer.
[0077] Processing into a two-dimensional array includes: splitting into a linear gain array and a two-dimensional array, such as Figure 2 As shown; the creation process includes Figure 3 Steps shown:
[0078] Initialize the linear power one-dimensional array LinearMeasData, that is, the data of M frequency points under the linear input power in the one-dimensional original data, which is used as the reference value for the calculation of the gain compression algorithm;
[0079] Initialize the data CompMeasData measured at all frequency points and power points. CompMeasData is a two-dimensional array used to calculate the data array of gain compression;
[0080] Create a location variable to record the last measurement point and assign an initial value: LastMeasLocation=0;
[0081] Create a location variable to record the current measurement points and assign an initial value of MeasLocation = 0. The value range of MeasLocation is 0- M* (N+1);
[0082] Update the data in the one-dimensional array and the two-dimensional array according to LastMeasLocation and MeasLocation;
[0083] When MeasLocation = M*(N+1), it needs to be reset to zero to start data splicing for the next frame, where * represents the product sign.
[0084] The real-time updated part of the one-dimensional original data is synchronously updated to the linear gain data and the data at the corresponding position in the two-dimensional array, such as Figure 4 The judgment when updating the linear gain array and the two-dimensional array is as follows:
[0085] Among them, the one-dimensional raw data array includes M data under linear power and M*N data under scanning all frequency points and power points.
[0086] The currently collected data points and the last data point are both scanned data under linear power, that is, LastMeasLocation and MeasLocation are both located in the first M data in the one-dimensional original array. The data is put into the one-dimensional array LinearMeasData of the linear input power scan;
[0087] The currently collected data point is within the data range of the two-dimensional scan, but the last data point number is still the data under the linear power scan, that is, LastMeasLocation is located in the first M data in the one-dimensional original array, and after MeasLocation is located at the M+1th data position, the data with the position from LastMeasLocation to M is put into the one-dimensional array LinearMeasData of the linear power scan; the currently collected data point position Measlocation is processed, and the frequency point position CurrFreqLoc and CurrPwrLoc power point of the two-dimensional array corresponding to the data point are calculated (that is, the row and column index of the two-dimensional array corresponding to the current data point), and the data with the position from (M+1) to MeasLocation in the one-dimensional original data is updated to the range of the corresponding CurrFreqLoc and CurrPwrLoc information in the two-dimensional array;
[0088] The current and previous data points are both within the range of the two-dimensional scan data, that is, after LastMeasLocation and MeasLocation are both located at the M+1th data position, calculate the corresponding frequency point position LastFreqLoc and power point position LastPwrLoc of the previous two-dimensional array and the current frequency point position CurrFreqLoc and power point position CurrPwrLoc, and update the data at the corresponding positions in the two-dimensional array: from the LastPwrLoc column of the LastFreqLoc row to the CurrPwrLoc column of the CurrFreqLoc row.
[0089] According to all the power data at a complete frequency point, a gain compression algorithm is used to calculate a two-dimensional array to obtain the power value corresponding to the specified value of the frequency point gain compression, wherein, when calculating the power point position and the frequency point position (whether calculated according to LastMeasLocation or MeasLocation, in this feature, they are collectively referred to as DataLocation), as shown in FIG5, including the basic settings of the gain compression measurement mode: the number of power points, denoted as: PwrCnt; the number of frequency points, that is, the number of scanning points under linear power, denoted as FreqCnt; the acquisition mode: scanning power at each frequency point or scanning frequency at each power point.
[0090] When the data point position is within the linear power scanning range, the frequency point position of the two-dimensional array FreqLoc=0, and the frequency point position of the two-dimensional array PwrLoc=0;
[0091] When the data point position is outside the linear power sweep range, the remaining data length: dataCnt = DataLocation-FreqCnt,
[0092] Depending on the data collection mode, the calculation methods of FreqLoc and PwrLoc are different, such as Figure 5 Determine whether the acquisition mode is scanning power at each frequency point:
[0093] If yes, FreqLoc=data length / set power points, PwrLoc=data length%set power points;
[0094] If not, FreqLoc = data length / set frequency points, PwrLoc = data length%set frequency points.
[0095] Obtain the characteristic parameters of the corresponding gain compression at the corresponding frequency point and display them as traces.
[0096] Embodiment 2, on the basis of embodiment 1, as Figure 6 , Figure 7 As shown, Figure 7Among them, the elements of each row and column represent the data measured at a certain power value under a certain frequency. When taking data by scanning power at each frequency point, input LastFreqLoc, CurrFreqLoc, LastPwrLoc, and CurrPwrLoc. Figure 7 Among them, the ellipsis omits the English letters pwrCnt, curr, etc. after P. In the first row, it is an arithmetic sequence. Omit P5, P6, indicating that the calculation is up to the current Pcurr. Figure 8 Similarly, those skilled in the art can observe this figure and understand the conclusion of the present invention in the frequency sweep mode. The process of updating the two-dimensional array is as follows:
[0097] For the data at the same frequency point, initially set the power point position Index = the previous power position LastPwrLoc;
[0098] When LastPwrLoc < the current power point position CurrPwrLoc, the current power point position is CurrPwrLoc;
[0099] Update the data of FreqCnt + the current frequency point * the number of power points + Index in the one-dimensional raw data to the position of the Index-th in the two-dimensional array at the CurrFreqLoc frequency point, and Index++, where Index++ means moving to the next position point. Then, judge again whether LastPwrLoc < CurrPwrLoc; perform the same operation until the data of CurrPwrLoc is updated completely.
[0100] For the data at different frequency points, initially set: the frequency point position Index = the previous frequency position LastFreqLoc. When LastFreqLoc < CurrFreqLoc, it is divided into two cases. Judge i = the position of the previous frequency of LastFreqLoc:
[0101] If so, when updating the two-dimensional array, update the data of the remaining power points in the row where the previous frequency point LastFreqLoc is located, that is, the data corresponding to the latter part of the power points under the previous frequency point position. Among them, the data of the remaining power points in the row where the LastFreqLoc is located is the data corresponding to the power points in the range from LastPwrLoc to PwrCnt.
[0102] If not, that is, the power of the rows where the previous and current frequency point positions are located has not been updated completely;
[0103] Judge whether the position of the Index-th = CurrFreqLoc, as Figure 8As shown, if so, update the data of the power points in the row where CurrFreqLoc is located when updating the current frequency point, that is, in the CurrFreqLoc row, the data from the start 1 to the power points under CurrPwrLoc, that is, the data corresponding to the previous part of the power values under the current frequency point; if not, then scan all the power points under a single frequency point Index, where the range of Index is: LastFreqLoc < Index < CurrFreqLoc, and update all the power point data in the Index row. All the power points in the Index row, that is, from 1 to N power points, where N = PwrCnt.
[0104] When issuing the excitation, it is necessary to additionally add the excitation for frequency scanning under linear power as the reference gain for calculating the gain compression; the total number of excitation points is M + M * N.
[0105] Embodiment 3: For the method of calculating the characteristic parameters when the gain compression occurs to a specified value by using the gain compression algorithm, it includes:
[0106] Directly find the index of the value closest to the target gain in the data, or by finding the two values closest to the target value and then performing interpolation to obtain the index of the closest value, and further obtain the characteristic parameters when the gain compression occurs to the specified value. The adaptable selection of the gain compression algorithm includes: compression with linear gain as the reference, compression with maximum gain as the reference, fallback compression, or X - Y compression, and compression with the saturation point as the reference.
[0107] In several embodiments provided by the present invention, it should be understood that the disclosed method can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the modules is only a logical function division. In actual implementation, there may be other division methods. For example, multiple modules or components can be combined or integrated into another device, or some features can be ignored or not executed.
[0108] The modules described as separate components may or may not be physically separated. The components shown as modules may or may not be physical modules, that is, they can be located in one place or distributed to multiple network modules. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0109] In addition, in each embodiment of the present invention, the functional modules can be integrated in a processing module, or each module can exist physically alone, or two or more modules can be integrated in one module. The above - integrated modules can be implemented in the form of hardware or in the form of a combination of hardware and software functional modules.
[0110] It should be understood that the present invention is not limited to the exact construction that has been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present invention is limited only by the appended claims.
[0111] Those skilled in the art will appreciate that the embodiments of the present invention may be provided as methods or devices. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects.
[0112] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.
[0113] The above are only embodiments of the present invention and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent substitution, improvement, etc. made within the spirit and principle of the present invention should be included in the scope of the claims of the present invention.
[0114] Those skilled in the art will readily appreciate other embodiments of the present invention after considering the specification and practicing the invention disclosed herein. The present invention is intended to cover any variations, uses or adaptations of the present invention that follow the general principles of the present invention and include common knowledge or customary techniques in the art that are not disclosed by the present invention. The description and examples are to be considered exemplary only, and the true scope and spirit of the present invention is indicated by the claims above.
[0115] It should be understood that the present invention is not limited to the exact construction that has been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present invention is limited only by the appended claims.
Claims
1. A GCA data processing optimization method, characterized in that: include: Issue incentives, record incentive points, retrieve data to obtain one-dimensional raw data; Split into a one-dimensional linear gain array and one-dimensional scan data, splice into a two-dimensional array, and then process into a one-dimensional gain compression array; set the frequency scan points M and the power scan points N, all the measurement points M*(N+1), that is, measure the total length of a complete frame of raw data; Initialize the linear power one-dimensional array LinearMeasData, that is, the data of M frequency points under the linear input power in the one-dimensional original data, which is used as the reference value for the calculation of the gain compression algorithm. LinearMeasData is a one-dimensional array; Initialize the data CompMeasData measured at all frequency points and power points. CompMeasData is a two-dimensional array used to calculate the data array of gain compression; Create a location variable to record the last measurement point and assign an initial value: LastMeasLocation=0; Create a location variable to record the current measurement points and assign an initial value of MeasLocation = 0. The value range of MeasLocation is 0-M*(N+1); Update the data in the one-dimensional array and the two-dimensional array according to LastMeasLocation and MeasLocation; update the real-time updated part of the one-dimensional original data to the linear gain data and the data at the corresponding position in the two-dimensional array synchronously. The judgment when updating the linear gain array and the two-dimensional array is as follows: Among them, the one-dimensional raw data array includes M data under linear power and M*N data under scanning all frequency points and power points. The currently collected data points and the last data point are both scanned data under linear power, that is, LastMeasLocation and MeasLocation are both located in the first M data in the one-dimensional original array. The data is put into the one-dimensional array LinearMeasData of the linear input power scan; The currently collected data point is within the data range of the two-dimensional scan, but the last data point number is still the data under the linear power scan, that is, LastMeasLocation is located in the first M data in the one-dimensional original array, and after MeasLocation is located at the M+1th data position, the data with the position from LastMeasLocation to M is put into the one-dimensional array LinearMeasData of the linear power scan; the currently collected data point position Measlocation is processed, and the frequency point position CurrFreqLoc and CurrPwrLoc power point of the two-dimensional array corresponding to the data point are calculated, that is, the row and column index of the two-dimensional array corresponding to the current data point, and the data with the position from (M+1) to MeasLocation in the one-dimensional original data is updated to the range of the corresponding CurrFreqLoc and CurrPwrLoc information in the two-dimensional array; The current and last data points are both within the range of the two-dimensional scan data, that is, after LastMeasLocation and MeasLocation are both located at the M+1th data position, respectively calculate the last frequency point position LastFreqLoc and power point position LastPwrLoc corresponding to the two-dimensional array and the current frequency point position CurrFreqLoc and power point position CurrPwrLoc, and update the data at the corresponding positions in the two-dimensional array: from the LastPwrLoc column of the LastFreqLoc row to the CurrPwrLoc column of the CurrFreqLoc row; When MeasLocation = M*(N+1), it needs to be reset to zero to start data splicing for the next frame, where * represents the product symbol; The two-dimensional array data is updated according to the updated data excitation point number, and then the data of the corresponding position in the one-dimensional gain array is correspondingly calculated; Based on all power data at a complete frequency point, a gain compression algorithm is used to obtain a characteristic parameter value when a specified gain compression value occurs; Get the characteristic parameter values when the gain compression value occurs at all frequencies, and display the relevant traces.
2. A GCA data processing optimization method according to claim 1, characterized in that: The recording of the number of excitation points and retrieving the data to obtain the one-dimensional original data include: When scanning power at each frequency point to obtain data, scan M frequency points under linear input power, arrange them sequentially, start power scanning at each frequency point, construct data, and write them into the circular buffer.
3. A GCA data processing optimization method according to claim 1, characterized in that: The recording of the number of excitation points and retrieving the data to obtain the one-dimensional original data include: When taking data at each power scanning frequency, N power points are scanned under linear input power, arranged sequentially, and frequency scanning is started at each power point to construct data and write them into the circular buffer.
4. A GCA data processing optimization method according to claim 3, characterized in that: in, When calculating the power point position and frequency point position, the basic settings of the gain compression measurement mode are included: the number of power points, recorded as: PwrCnt; the number of frequency points, that is, the number of points scanned under linear power, recorded as FreqCnt; the acquisition mode: scanning power at each frequency point or scanning frequency at each power point; When the data point position is within the linear power scanning range, the frequency point position of the two-dimensional array FreqLoc=0, and the frequency point position of the two-dimensional array PwrLoc=0; When the data point position is outside the linear power sweep range, the remaining data length: dataCnt = DataLocation-FreqCnt, Depending on the data acquisition mode, the calculation method of FreqLoc and PwrLoc is different. Determine whether the acquisition mode is to scan the power at each frequency point: If yes, FreqLoc=data length / set power points, PwrLoc=data length%set power points; If not, FreqLoc = data length / set frequency points, PwrLoc = data length%set frequency points.
5. A GCA data processing optimization method according to claim 4, characterized in that: When taking the scanned power data at each frequency point, input LastFreqLoc, CurrFreqLoc, LastPwrLoc, and CurrPwrLoc, and the process of updating the two-dimensional array is as follows: For the data at the same frequency point, initially set the power point position Index = the previous power position LastPwrLoc; When LastPwrLoc < the current power point position CurrPwrLoc, the current power point position is CurrPwrLoc; Update the data of FreqCnt + the current frequency point * the number of power points + Index in the one-dimensional raw data to the position of the Index-th in the two-dimensional array at the CurrFreqLoc-th frequency point. And Index++, where Index++ means moving to the next position point. Then, judge again whether LastPwrLoc < CurrPwrLoc; perform the same operation until the data of CurrPwrLoc is updated completely; For the data at different frequency points, initially set: the frequency point position Index = the previous frequency position LastFreqLoc. When LastFreqLoc < CurrFreqLoc, it is divided into two cases, and judge i = the position of the previous frequency LastFreqLoc: If so, update the data of the remaining power points in the row corresponding to the previous frequency point LastFreqLoc in the two-dimensional array, that is, the data corresponding to the latter part of the power points at the previous frequency point position. Among them, the data of the remaining power points in the row corresponding to LastFreqLoc is the data corresponding to the power points in the range from LastPwrLoc to PwrCnt; If not, that is, the power of the rows corresponding to the previous and current frequency point positions has not been updated completely; Judge whether the position of the Index-th = CurrFreqLoc. If so, update the data of the power points in the row corresponding to the current frequency point CurrFreqLoc when updating the current frequency point, that is, in the CurrFreqLoc row, the data of the power points from the beginning 1 to CurrPwrLoc, that is, the data corresponding to the previous part of the power values at the current frequency point. If not, then scan all the power points at a single frequency point Index, and update all the power point data in the Index row. All the power points in the Index row are from 1 to N power points, where N = PwrCnt, and LastFreqLoc < Index < CurrFreqLoc.
6. A GCA data processing optimization method according to claim 5, characterized in that: When sending the excitation, it is necessary to additionally add the excitation of frequency scanning under linear power as the reference gain for calculating the gain compression; the total number of excitation points is M + M * N.
7. A GCA data processing optimization method according to claim 5, characterized in that: For the method of calculating the characteristic parameters when the gain compression reaches a specified value by using the gain compression algorithm, it includes: Directly find the index of the value closest to the target gain in the data, or find the two values closest to the target value, and then perform interpolation to obtain the index of the closest value, and further obtain the characteristic parameters when the gain compression reaches the specified value.
8. A GCA data processing optimization method according to claim 7, characterized in that: The adaptive selection gain compression algorithm includes: compression based on linear gain, compression based on maximum gain, back-off compression or XY compression, and compression based on saturation point.
