A signal processing method, apparatus, device, storage medium, and program product

By dividing the lower triangular matrix L into three submatrices and computing each element in parallel, the problems of low parallelism and low resource utilization in the hardware implementation of Cholesky decomposition are solved, thereby saving multiplier resources and improving hardware resource utilization.

CN123123077APending Publication Date: 2026-11-17PURPLE MOUNTAIN LAB
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611298934.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-08-25
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

Under limited computing resources, the existing hardware implementation of Cholesky decomposition suffers from low parallelism and low hardware resource utilization, especially in MIMO detection and MMSE filters, where it is difficult to optimize the multiplier usage strategy to reduce peak resource requirements.

Method used

By dividing the lower triangular matrix L into three independent submatrices and calculating each element within three clock cycles, a multiplier is used for staged parallel computation. This includes calculating off-diagonal elements, square terms, and diagonal elements in the first stage, and calculating the squares of off-diagonal elements and diagonal elements in the second stage, thereby improving the utilization rate of the multiplier.

Benefits of technology

It effectively reduces multiplier resource consumption and improves hardware resource utilization, especially in signal processing under limited resource environments.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123123077A_ABST
    Figure CN123123077A_ABST
Patent Text Reader

Abstract

This invention discloses a signal processing method, apparatus, device, storage medium, and program product. The elements in the lower triangular matrix L are determined according to the multiplier consumption as follows: In the first stage, for each column number n that satisfies the following conditions, each element is calculated according to the following three clock cycles: In the first clock cycle, the off-diagonal elements of the nth column of the lower triangular matrix L located in the first sub-lower triangular matrix are determined based on the diagonal elements; In the second clock cycle, the squares of the following elements are calculated in parallel: , and some elements of the nth column of the lower triangular matrix L located in the square matrix S; In the third clock cycle, the diagonal elements and the remaining elements of the nth column of the lower triangular matrix L located in the square matrix S are calculated in parallel; In the second stage, for the column number n that satisfies the conditions, the off-diagonal elements of the nth column, the squares of the off-diagonal elements of the (n+1)th row, and the diagonal elements of the (n+1)th column are calculated sequentially based on the diagonal elements.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of signal processing technology, and in particular to a signal processing method, apparatus, device, storage medium and program product. Background Technology

[0002] Cholesky decomposition, a mature matrix method, decomposes the positive definite matrix involved in Minimum Mean Square Error (MMSE) filtering into upper and lower triangular matrices, thus transforming the solution process into a series of forward and backward computational operations. This method offers significant advantages in numerical stability and deterministic computational complexity, and has therefore been widely applied in signal processing and numerical computation. However, existing optimization methods for Cholesky decomposition are mostly focused on software implementation, primarily targeting general-purpose processing architectures such as CPUs or GPUs. For implementations on dedicated hardware platforms, especially regarding efficient scheduling of computational units and reduction of peak resource requirements under limited computing resources, specific solutions are still lacking. Summary of the Invention

[0003] The present invention provides a signal processing method, apparatus, device, storage medium, and program product, which can not only save hardware resources, but also improve the utilization rate of hardware resources in the signal processing process.

[0004] In a first aspect, embodiments of the present invention provide a signal processing method, comprising: The matrix to be decomposed is determined based on the MIMO channel matrix; wherein, the matrix to be decomposed is subjected to Cholesky decomposition to obtain a lower triangular matrix L; the lower triangular matrix L can be divided into multiple sub-matrices, namely the first sub-lower triangular matrix located in the upper left corner. The square matrix S in the lower left and the second lower triangular sub-matrix in the lower right. The dimension of both the matrix to be decomposed and the lower triangular matrix L is N, and the first sub-lower triangular matrix... The dimension is k, where 1≤k≤N; The elements in the lower triangular matrix L are determined using a multiplier as follows: In the first stage, for elements satisfying... For each column of numbers n, each element is calculated according to the following three clock cycles: In the first clock cycle, based on the diagonal elements... Determine the nth column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. The off-diagonal elements; in the second clock cycle, the squares of the following elements are computed in parallel: And the nth column of the lower triangular matrix L that is located in the square matrix S; in the third clock cycle, the diagonal elements are computed in parallel. and the remaining elements in the nth column of the lower triangular matrix L that are located in the square matrix S; in the second stage, for those satisfying Given the number of columns n, calculate the off-diagonal elements in the nth column, the square of the off-diagonal elements in the (n+1)th row, and the diagonal elements in the (n+1)th column in sequence based on the diagonal elements. For the lower triangular matrix L and the received signal Perform forward operations to obtain the intermediate quantity u; A backward operation is performed on the lower triangular matrix L and the intermediate quantity u to obtain the estimated signal x; wherein both the intermediate quantity u and the estimated signal x are vectors of dimension N.

[0005] Secondly, embodiments of the present invention also provide a signal processing apparatus, comprising: The matrix to be decomposed module is used to determine the matrix to be decomposed based on the multiple-input multiple-output (MIMO) channel matrix; wherein, the matrix to be decomposed is subjected to Cholesky decomposition to obtain a lower triangular matrix L; the lower triangular matrix L is decomposed into multiple sub-matrices, each of which is the first sub-lower triangular matrix located in the upper left corner. The square matrix S in the lower left and the second lower triangular sub-matrix in the lower right. The dimension of both the matrix to be decomposed and the lower triangular matrix L is N, and the first sub-lower triangular matrix... The dimension is k, where 1≤k≤N; The lower triangular matrix element determination module is used to determine each element in the lower triangular matrix L using a multiplier as follows: In the first stage, for elements that satisfy... For each column of numbers n, each element is calculated according to the following three clock cycles: In the first clock cycle, based on the diagonal elements... Determine the nth column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. The off-diagonal elements; in the second clock cycle, the squares of the following elements are computed in parallel: And the nth column of the lower triangular matrix L that is located in the square matrix S; in the third clock cycle, the diagonal elements are computed in parallel. and the remaining elements in the nth column of the lower triangular matrix L that are located in the square matrix S; in the second stage, for those satisfying Given the number of columns n, calculate the off-diagonal elements in the nth column, the square of the off-diagonal elements in the (n+1)th row, and the diagonal elements in the (n+1)th column in sequence based on the diagonal elements. The forward processing module is used to process the lower triangular matrix L and the received signal. Perform forward operations to obtain the intermediate quantity u; The backward operation module is used to perform backward operations on the lower triangular matrix L and the intermediate quantity u to obtain the estimated signal x; wherein, the intermediate quantity u and the estimated signal x are both vectors of dimension N.

[0006] Thirdly, embodiments of the present invention also provide an electronic device, the electronic device comprising: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the signal processing method described in the embodiments of the present invention.

[0007] Fourthly, embodiments of the present invention also provide a computer-readable storage medium storing computer instructions that are used to cause a processor to execute the signal processing method described in the embodiments of the present invention.

[0008] Fifthly, embodiments of the present invention also provide a computer program product, including a computer program that, when executed by a processor, implements the signal processing method described in the embodiments of the present invention.

[0009] This invention discloses a signal processing method, apparatus, device, storage medium, and program product. The method involves determining a matrix to be decomposed based on a Multiple-Input Multiple-Output (MIMO) channel matrix; wherein, the matrix to be decomposed is subjected to Cholesky decomposition to obtain a lower triangular matrix L; the lower triangular matrix L can be divided into multiple sub-matrices, with the first sub-lower triangular matrix located in the upper left corner being the first sub-lower triangular matrix. The square matrix S in the lower left and the second lower triangular sub-matrix in the lower right. The dimension of both the matrix to be decomposed and the lower triangular matrix L is N. The dimension is k, where 1 ≤ k ≤ N; the elements in the lower triangular matrix L are determined using a multiplier as follows: In the first stage, for elements satisfying... For each column of numbers n, each element is calculated according to the following three clock cycles: In the first clock cycle, based on the diagonal elements... Determine the nth column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. The off-diagonal elements; in the second clock cycle, the squares of the following elements are computed in parallel: And the nth column of the lower triangular matrix L that is located in the square matrix S; in the third clock cycle, the diagonal elements are computed in parallel. and the remaining elements in the nth column of the lower triangular matrix L that are also in the square matrix S; in the second stage, for those satisfying Given the column number n, calculate the off-diagonal elements of the nth column, the squares of the off-diagonal elements in the (n+1)th row, and the diagonal elements of the (n+1)th column in sequence based on the diagonal elements; for the lower triangular matrix L and the received signal... A forward operation is performed to obtain an intermediate quantity u; a backward operation is performed on the lower triangular matrix L and the intermediate quantity u to obtain an estimated signal x; wherein, both the intermediate quantity u and the estimated signal x are vectors of dimension N. The signal processing method provided in this embodiment of the invention determines each element in the lower triangular matrix L in two stages. In the first stage, each column is divided into three clock cycles to determine the corresponding element. The elements in the lower triangular matrix L are calculated according to the principle of balanced multiplier usage, which not only saves multiplier hardware resources but also improves the hardware resource utilization rate in the signal processing process. Attached Figure Description

[0010] Figure 1 This is a flowchart of a signal processing method according to Embodiment 1 of the present invention; Figure 2 This is a schematic diagram of the first stage calculation timing for determining the elements of the lower triangular matrix L in Embodiment 1 of the present invention; Figure 3 This is a comparison chart of the number of multipliers required for the proposed scheme under different block dimensions k and the traditional scheme, taking N=20 as an example in Embodiment 1 of the present invention. Figure 4a This is a comparison chart of the number of multipliers used in different schemes for forward and backward operations in Embodiment 1 of the present invention; Figure 4b This refers to the efficiency saving of the multiplier used in this scheme when performing forward and backward operations in Embodiment 1 of the present invention; Figure 5 This is a schematic diagram of the structure of a signal processing device according to Embodiment 2 of the present invention; Figure 6 This is a schematic diagram of the structure of an electronic device according to Embodiment 3 of the present invention. Detailed Implementation

[0011] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.

[0012] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0013] It is understood that before using the technical solutions disclosed in the various embodiments of this disclosure, users should be informed of the types, scope of use, and usage scenarios of the personal information involved in this disclosure in an appropriate manner in accordance with relevant laws and regulations, and user authorization should be obtained.

[0014] Minimum Mean Square Error (MMSE) filtering, as a classic linear estimation method, exhibits excellent overall performance in suppressing noise and interference and improving estimation accuracy. It is widely used in various fields such as wireless communication reception, channel equalization, multi-user detection, beamforming, and radar and sonar signal processing. In these applications, MMSE filtering typically boils down to solving a system of linear equations with positive definite coefficient matrices. Its computational complexity and numerical stability directly affect the system's real-time performance and implementation cost.

[0015] With the increasing dimensionality of signals and the growing demand for low latency and high throughput, the hardware implementation of MMSE filtering faces significant challenges. On one hand, the closed-form solution of MMSE filtering typically involves matrix inversion, an operation with high computational complexity and strong data dependency, making it unsuitable for direct implementation on resource-constrained hardware platforms. To address these challenges, some iterative numerical methods exist to approximate the MMSE solution, avoiding explicit matrix inversion. While these methods have relatively low single-step computational complexity, the number of iterations required for convergence depends on channel conditions and the received signal, making it difficult to precisely control the overall computational overhead and latency, resulting in insufficient stability in hardware implementation.

[0016] While software implementations of Cholesky decomposition employ some techniques, they primarily serve software computing platforms and do not consider the key challenges faced in hardware circuit design, particularly resource scheduling and timing dependencies. Cholesky decomposition inherently exhibits a high degree of serial data dependency, with the computation of each element relying on multiple intermediate results, making effective parallelism difficult to achieve. This seriality severely limits the reuse efficiency of critical computing resources (such as multipliers), further leading to a series of problems including high peak resource consumption, low hardware utilization, and increased power consumption.

[0017] Therefore, there are still significant technical gaps in the hardware implementation of Cholesky decomposition and MMSE solving. In particular, without changing the computational accuracy and total latency, how to arrange the computation order of each element to optimize the multiplier usage strategy and improve the utilization of hardware resources is a core issue that urgently needs to be addressed.

[0018] The scheme in this embodiment is applicable to, but not limited to, scenarios such as Multiple-Input Multiple-Output (MIMO) detection, multi-user detection, and channel equalization. It aims to solve the problems of low parallelism, inefficient use of hardware resources (especially multipliers), and low resource utilization in solving the lower triangular linear equation system caused by serial dependencies in Cholesky decomposition. It is particularly suitable for signal processing processes such as MMSE criterion filters in resource-constrained environments.

[0019] Example 1 Figure 1 This is a flowchart of a signal processing method provided in Embodiment 1 of the present invention. This embodiment can be applied to determining the elements in the lower triangular matrix L obtained after Cholesky decomposition. The method can be executed by a signal processing device, which can be implemented in hardware and / or software. Optionally, it can be implemented by an electronic device, such as a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), a mobile terminal, a PC, or a server.

[0020] Optionally, the solution in this embodiment is mainly aimed at hardware architecture, namely FPGA or dedicated ASIC chip design.

[0021] like Figure 1 As shown, the method specifically includes the following steps: S110, determine the matrix to be decomposed based on the multiple-input multiple-output (MIMO) channel matrix.

[0022] The matrix to be decomposed is subjected to Cholesky decomposition to obtain a lower triangular matrix L. The lower triangular matrix L is divided into multiple sub-matrices, the first sub-lower triangular matrix located in the upper left corner of the matrix. The square matrix S in the lower left and the second lower triangular sub-matrix in the lower right. The dimension of both the matrix to be decomposed and the lower triangular matrix L is N, and the first sub-lower triangular matrix... The dimension is k, where 1≤k≤N.

[0023] This embodiment uses the MIMO detection process in a MIMO system as an example for illustration. For a MIMO communication system, its received signal model can be written as: ,in, It is the MIMO channel matrix. It is receiving signals. It is sending a signal. The variance is Complex Gaussian noise. At the receiving end, the mixed received signal... Recovery of multi-stream signals The process is called MIMO detection. The MIMO detector under the MMSE criterion can be written in closed form as follows: .

[0024] Cholesky decomposition can decompose a positive definite matrix into a lower triangular matrix multiplied by its conjugate transpose, which can efficiently compute the MMSE detector to avoid matrix inversion: Let For a positive definite matrix, then Cholesky decomposition can be performed using a lower triangular matrix. To represent, and each lower triangular element of the matrix ,Right now Therefore, we have: .make Then, by first solving the following system of linear equations through forward computation, we obtain... : The estimated signal after detection is obtained by solving the following system of linear equations through backward computation. : Therefore, we have: .in, This is the matrix to be decomposed in this embodiment.

[0025] In the Cholesky decomposition process, the matrix... Each element has a strict data dependency: for off-diagonal elements The calculation depends on the first lines and Before the journey element and and the diagonal elements of that column. : ,in Let be the element in the i-th row and j-th column of the matrix A to be decomposed, where A is a known matrix. For the diagonal elements... First, we need to calculate the sum of squares of all elements to the left of the row, that is... Then, it can be obtained from the following formula: This serial dependency limits the parallel execution capability of traditional hardware architectures, making it difficult to fully utilize hardware resources.

[0026] There is a block-based computation method for Cholesky decomposition, which involves dividing the positive semidefinite matrix into blocks as follows: Then the corresponding decomposition matrix can also be written as This method will convert the complete lower triangular matrix. The block is divided into three independent sub-blocks: the lower triangular matrix located in the upper left corner. ,phalanx The lower triangular matrix located in the lower right corner In this way, the upper and lower left triangular matrices can be calculated separately first. , then calculate Finally, calculate , where calculation The calculation can be performed recursively, with the following steps: Step 1: Calculate the Cholesky decomposition of the top-left block: Step 2: Solve for the off-diagonal block matrix: Step 3: Update the lower sub-matrix: Step 4: [Regarding...] Recursively execute Cholesky decomposition: ;but However, this method is designed from the perspective of facilitating software computation, and it requires continuous recursive computation of the Cholesky decomposition, resulting in insufficient utilization of computational resources.

[0027] This invention first utilizes the temporal dependencies of Cholesky decomposition, employing matrix partitioning to improve the utilization of multiplier resources and reduce their resource requirements by designing the computation timing and appropriately selecting block sizes. This method also divides the complete lower triangular matrix L into three independent sub-blocks using the traditional partitioning method described above, but the computation order differs from previous partitioning methods. For specific analysis and implementation, please refer to the following embodiments.

[0028] In this embodiment, the first sub-lower triangular matrix The specific value of dimension k is the value corresponding to the minimum number of multipliers required to calculate the Cholesky process. The specific determination process will be described in the following embodiments and will not be introduced here.

[0029] S120, using a multiplier, determine the elements in the lower triangular matrix L as follows: In the first stage, for elements satisfying... For each column of numbers n, each element is calculated according to the following three clock cycles: In the first clock cycle, based on the diagonal elements... Determine the nth column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. The off-diagonal elements; in the second clock cycle, the squares of the following elements are computed in parallel: And the nth column of the lower triangular matrix L that is located in the square matrix S; in the third clock cycle, the diagonal elements are computed in parallel. and the remaining elements in the nth column of the lower triangular matrix L that are also in the square matrix S; in the second stage, for those satisfying Given the number of columns n, calculate the non-diagonal elements in the nth column, the square of the non-diagonal elements in the (n+1)th row, and the diagonal elements in the (n+1)th column in sequence based on the diagonal elements.

[0030] In the second clock cycle, the squares of the following elements are calculated in parallel: Its function is to calculate the next diagonal element in the third clock cycle. Make preparations.

[0031] In this embodiment, in the first stage, the elements corresponding to the lower triangular matrix L when the column numbers n=1, n=2, ..., n=k are calculated sequentially, and for each column number n, its corresponding element is calculated in the order of the three clock cycles mentioned above. Specifically, Figure 2 To determine the timing diagram of the elements of the lower triangular matrix L in the first stage, the formula is used in the first clock cycle. Calculate the nth column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. off-diagonal elements (which can be abbreviated as) ): , , ..., In the second clock cycle, the squares of the following elements are calculated in parallel: ,Right now: and using formulas Calculate the nth column of the lower triangular matrix L that contains elements within the square matrix S; this is... , , ..., The partial elements, where the number of partial elements is obtained by subtracting the number of multipliers used to compute the squared terms in parallel from the number of multipliers allocated in the second clock cycle. In the third clock cycle, using the formula... Calculate diagonal elements and using formulas Calculate the remaining elements in the nth column of the lower triangular matrix L that are also in the square matrix S. , , ..., The remaining elements, excluding those calculated in the second clock cycle, are included. In this embodiment, for column number n=1, the diagonal elements are calculated before the first clock cycle. .

[0032] For example, for a column number n=1, using the formula Calculate diagonal elements ,Right now In the first clock cycle, using the formula Calculate the first column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. off-diagonal elements , , ..., ,Right now: , , ..., In the second clock cycle, the squares of the following elements are calculated in parallel: ,Right now: And the elements in the first column of the lower triangular matrix L that are also in the square matrix S are... , , ..., The partial elements, where the number of partial elements is obtained by subtracting the number of multipliers used to compute the squared terms in parallel from the number of multipliers allocated in the second clock cycle. In the third clock cycle, using the formula... Calculate diagonal elements ,Right now And the remaining elements in the square matrix S that are in the first column of the lower triangular matrix L. For the number of columns n=2, in the first clock cycle, using the formula... Calculate the second column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. off-diagonal elements , , ..., In the second clock cycle, the squares of the following elements are calculated in parallel: , ,Right now: And the elements in the second column of the lower triangular matrix L that are located in the square matrix S are... , , ..., The partial elements, where the number of partial elements is obtained by subtracting the number of multipliers used to compute the squared terms in parallel from the number of multipliers allocated in the second clock cycle. In the third clock cycle, using the formula... Calculate diagonal elements And the remaining elements in the second column of the lower triangular matrix L that are also in the square matrix S. Similarly, the same process is followed for columns n=3, ..., n=k, which will not be repeated here.

[0033] Specifically, after calculating the relevant elements for columns n=1, n=2, ..., n=k, in the second stage, the calculation of the corresponding elements for each column n=k+1, n=k+2, ..., n=N-1 is performed according to the following process: Based on According to the formula Calculate the off-diagonal elements in the nth column of the lower triangular matrix L, and then calculate... Then calculate .

[0034] In this embodiment, for the first sub-lower triangular matrix The specific value of dimension k satisfies the condition that the number of multipliers required for the overall calculation of Cholesky is minimized.

[0035] Optionally, the following steps may also be included: determining the total number of multipliers required to execute the first stage based on the dimension N, the number of columns n, and the dimension k; where k = 1, 2, ..., N; and determining the k value corresponding to the minimum total number of multipliers as the final k value.

[0036] Specifically, for Calculate the nth column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. The number of multipliers required for off-diagonal elements is: Calculate the squared term. The required number of multipliers is: The number of multipliers required to multiply the nth column of the lower triangular matrix L that is also in the square matrix S is: Since the calculation of the square matrix S is not urgent, it is scheduled to be completed within the second and third clock cycles. Therefore, the calculation of the square terms... diagonal elements The three operations—namely, the operation on the nth column of the lower triangular matrix L and the operation on the element in the square matrix S—are all completed within these two cycles. The total number of multipliers required is: Since their sum is constant, then and The strategy for minimizing the maximum values ​​of both follows the following relationship: Therefore, for The number of multipliers required can be expressed as: .for The number of multipliers required to compute the nth column is: .definition and They are respectively In the interval and If the maximum value is found on the x-axis, then the total multiplier requirement is: In this embodiment, the total number of multipliers is calculated sequentially for k=1, k=2, ..., k=N. The final k value is determined by using the k value that minimizes the total number of multipliers.

[0037] In this embodiment, by adjusting the dimension k, the multiplier resources can be optimally configured. For example... Figure 3 As shown, when the matrix L has a dimension N = 20 and the selected dimension k = 16, the total number of multipliers required by the system is minimized to only 56. Compared with the 90 multipliers required without the segmentation scheme, the multiplier resource consumption is reduced by 37.78%, effectively reducing the hardware implementation complexity.

[0038] Optionally, the process may also include the following steps: determining the number of first multipliers required to perform the operations within the second clock cycle of the first phase based on the dimension N, the number of columns n, and the dimension k; and determining the number of second multipliers required to compute the squares of the following elements in parallel within the second clock cycle of the first phase based on the number of columns n: The number of elements in the nth column of the lower triangular matrix L that are located in the square matrix S is determined based on the number of the first multiplier and the number of the second multiplier in the first stage.

[0039] In this embodiment, once the specific value of k is determined, the number of multipliers required for the second and third clock cycles in the first stage can be determined according to the following formula: That is, the number of the first multipliers. For the nth column, the number of multipliers required to compute the squares of the following elements in parallel during the second clock cycle of the first stage is determined based on the column number n: The first multiplier is subtracted from the second multiplier to obtain the number of multipliers used to calculate the elements in the nth column of the lower triangular matrix L that lie within the square matrix S. This is the number of elements in the nth column of the lower triangular matrix L that lie within the square matrix S. After determining this number of elements, a corresponding number of elements are arbitrarily selected from the nth column of the lower triangular matrix L that lie within the square matrix S for calculation. For example, assuming N=20, then k=16. For the n=3rd column, the number of multipliers required for the second clock cycle in the first stage is... The following elements are computed in parallel: The number of multipliers required to square the term is 3. Therefore, the number of multipliers used to calculate the element in the 3rd column of the lower triangular matrix L that is also in the square matrix S is 3, which means that the number of elements in the 3rd column of the lower triangular matrix L that is also in the square matrix S is 3.

[0040] S130, regarding the lower triangular matrix L and the received signal Perform forward operations to obtain the intermediate quantity u.

[0041] Here, the intermediate quantity u is a vector of dimension N. This relates to the lower triangular matrix L and the received signal. Performing a forward operation can be understood as solving the following system of equations: ,in Then the formula for calculating each element in u can be expressed as: .

[0042] Optionally, for the lower triangular matrix L and The process of performing forward operations to obtain the intermediate quantity u can be as follows: after each calculation is completed At that time, the multiplication set Merging Sets ,in, If n≠1, then from the set The system removes a maximum of a first number of elements according to a first preset priority, and then uses a multiplier to perform the multiplication operation on the removed elements.

[0043] The first preset priority is related to the row and column numbers of L; the first preset priority with the smallest row number is the highest; or, if the row numbers are equal, the first preset priority with the smallest column number is the highest. The first quantity is determined as follows: the number of multipliers and the number of clock cycles required for the forward operation are determined according to the dimension N; the first quantity is determined based on the number of multipliers and the number of clock cycles.

[0044] Specifically, as can be seen from the formula above, there is a dependency between elements during the forward operation. Taking N=6 as an example... The formulas for calculating each element are as follows: ; ; ; ; ; .

[0045] As can be seen from the above formula, the calculation of each element in u depends on the previous element and requires calculating the product of the previous element and the elements in L. Therefore, after calculating the previous element of u, the product of the previous element of u and the elements in L needs to be calculated in the next clock cycle, and only then can the next element of u be calculated in the following clock cycle. The total number of multipliers required to calculate u is: Calculated in this way, except and All multiplication operations other than the multiplication itself need to be performed in the first place. If the calculation is completed within a clock cycle, its computational resources are distributed to achieve balanced utilization of the multipliers. Theoretically, the minimum number of multipliers consumed per clock cycle should be: . That is, the first quantity.

[0046] Specifically, initialize an empty set. After each calculation is completed At that time, Merging Sets Besides in calculation and When it's time to shoot, every time from Most selected element Calculate and remove it from the set. The priority rule for selecting elements is: select... Most hits individual and middle Minimum element, if If they are the same, choose the one with the most. individual and The smallest element. Furthermore, as mentioned earlier, the calculation... Multiplications with the previous element as a factor need to be calculated, so a multiplication is performed every clock cycle. The elements. Performing the above operations ensures that the calculation is completed within the theoretically minimum multiplier resources consumed in each clock cycle. Taking a 6th-order calculation as an example, the clock cycles for the calculation are marked with circled numbers above the variables as follows: .

[0047] As can be seen from the above formula, completing... The calculation requires 11 clock cycles, with each clock cycle performing the corresponding multiplication operation.

[0048] S140, perform backward operations on the lower triangular matrix L and the intermediate quantity u to obtain the estimated signal x.

[0049] Here, the estimated signals x are all vectors of dimension N. Performing backward operations on the lower triangular matrix L and the intermediate quantity u can be understood as: performing backward operations on the system of equations... Perform the calculation. The formula for calculating each element in x can be expressed as: . It is a matrix The element in the i-th row and j-th column.

[0050] Optionally, the method for obtaining the estimated signal x by performing backward operations on the lower triangular matrix L and the intermediate quantity u can be: after each calculation... At that time, the multiplication set Merging Sets ,in, If n ≠ N, then from the set The system removes a maximum of the first number of elements according to the second preset priority, and then uses a multiplier to perform the multiplication operation on the removed elements.

[0051] The second preset priority is related to the row and column numbers of L, with the second preset priority having the largest row number; or, if the row numbers are equal, the second preset priority having the largest column number. The first quantity is determined as follows: the number of multipliers and clock cycles required for the forward or backward operation are determined based on the dimension N; the first quantity is determined based on the number of multipliers and clock cycles. The specific process for determining the first quantity is described in the embodiment of the forward operation above, and will not be repeated here.

[0052] Specifically, as can be seen from the formula above, there is a dependency between elements during the backward operation. Taking N=6 as an example... The formulas for calculating each element are as follows: ; ; ; ; ; .

[0053] Specifically, initialize an empty set. After each calculation is completed At that time, Merging Sets Besides in calculation and When it's time to shoot, every time from Most selected element Calculate and remove it from the set. The priority rule for selecting elements is: select... Most hits individual and middle Maximum element, if If they are the same, choose the one with the most. individual and The largest element. Furthermore, as mentioned earlier, the calculation... Multiplications with the previous element as a factor need to be calculated, so a multiplication is performed every clock cycle. The elements. Performing the above operations ensures that the computation is completed within each clock cycle using no more than the theoretically minimum multiplier resources.

[0054] Compared to traditional methods, this application, when calculations are required... or If the product resources are calculated only in the previous cycle, then the maximum number of multipliers required in each cycle is: The number of multipliers required by the scheme in this application is reduced compared to the traditional scheme by: When the matrix dimension is large enough and N gradually increases, the multiplier efficiency of the proposed solution approaches 75%. .

[0055] The technical solution of this embodiment determines the matrix to be decomposed based on the multiple-input multiple-output (MIMO) channel matrix; wherein, the matrix to be decomposed is subjected to Cholesky decomposition to obtain a lower triangular matrix L; the lower triangular matrix L includes multiple block matrices, each of which is the first sub-lower triangular matrix located in the upper left corner. The square matrix S in the lower left and the second lower triangular sub-matrix in the lower right. The dimension of both the matrix to be decomposed and the lower triangular matrix L is N. The dimension is k, where 1 ≤ k ≤ N; the elements in the lower triangular matrix L are determined using a multiplier as follows: In the first stage, for elements satisfying... For each column of numbers n, each element is calculated according to the following three clock cycles: In the first clock cycle, based on the diagonal elements... Determine the nth column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. The off-diagonal elements; in the second clock cycle, the squares of the following elements are computed in parallel: And the nth column of the lower triangular matrix L that is located in the square matrix S; in the third clock cycle, the diagonal elements are computed in parallel. and the remaining elements in the nth column of the lower triangular matrix L that are also in the square matrix S; in the second stage, for those satisfying Given the column number n, calculate the off-diagonal elements of the nth column, the squares of the off-diagonal elements in the (n+1)th row, and the diagonal elements of the (n+1)th column in sequence based on the diagonal elements; for the lower triangular matrix L and the received signal... A forward operation is performed to obtain the intermediate quantity u; a backward operation is performed on the lower triangular matrix L and the intermediate quantity u to obtain the estimated signal x; where both the intermediate quantity u and the estimated signal x are vectors of dimension N. This not only saves multiplier hardware resources but also improves the utilization rate of hardware resources in the signal processing process.

[0056] For example, Figure 4a This is a comparison chart showing the number of multipliers used in different schemes for forward and backward operations. Figure 4b This refers to the efficiency savings achieved by using the multiplier in this scheme when performing forward and backward operations. As can be seen from the figure, the signal processing method provided by this embodiment of the invention determines each element in the lower triangular matrix L in two stages, and determines the corresponding elements in three clock cycles in the first stage. This not only saves multiplier hardware resources but also improves the utilization rate of hardware resources in the signal processing process.

[0057] Example 2 Figure 5 This is a schematic diagram of the structure of a signal processing device provided in Embodiment 2 of the present invention, as shown below. Figure 5 As shown, the device includes: The matrix to be decomposed module 310 is used to determine the matrix to be decomposed based on the multiple-input multiple-output (MIMO) channel matrix; wherein, the matrix to be decomposed is subjected to Cholesky decomposition to obtain a lower triangular matrix L; the lower triangular matrix L is decomposed into multiple sub-matrices, which are respectively the first sub-lower triangular matrix located in the upper left corner. The square matrix S in the lower left and the second lower triangular sub-matrix in the lower right. The dimension of both the matrix to be decomposed and the lower triangular matrix L is N, and the first sub-lower triangular matrix... The dimension is k, where 1≤k≤N; The lower triangular matrix element determination module 320 is used to determine each element in the lower triangular matrix L using a multiplier in the following manner: In the first stage, for elements that satisfy... For each column of numbers n, each element is calculated according to the following three clock cycles: In the first clock cycle, based on the diagonal elements... Determine the nth column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. The off-diagonal elements; in the second clock cycle, the squares of the following elements are computed in parallel: And the nth column of the lower triangular matrix L that is located in the square matrix S; in the third clock cycle, the diagonal elements are computed in parallel. and the remaining elements in the nth column of the lower triangular matrix L that are located in the square matrix S; in the second stage, for those satisfying Given the number of columns n, calculate the off-diagonal elements in the nth column, the square of the off-diagonal elements in the (n+1)th row, and the diagonal elements in the (n+1)th column in sequence based on the diagonal elements. Forward processing module 330 is used to process the lower triangular matrix L and the received signal. Perform forward operations to obtain the intermediate quantity u; The backward operation module 340 is used to perform backward operations on the lower triangular matrix L and the intermediate quantity u to obtain the estimated signal x; wherein, the intermediate quantity u and the estimated signal x are both vectors of dimension N.

[0058] Optionally, it also includes: a dimension k determination module, used for: The total number of multipliers required to execute the first stage is determined based on the dimension N, the number of columns n, and the dimension k; where k = 1, 2, ..., N; The k value corresponding to the minimum total number of multipliers is determined as the final k value.

[0059] Optionally, it also includes: a multiplier number determination module, used for: The number of first multipliers required to perform the operations in the second clock cycle of the first phase is determined based on the dimension N, the number of columns n, and the dimension k. Based on the column number n, the number of second multipliers required to compute the squares of the following elements in parallel during the second clock cycle of the first phase is determined: ; The number of elements in the nth column of the lower triangular matrix L and located in the square matrix S is determined based on the first multiplier number and the second multiplier number.

[0060] Optionally, the forward computation module 330 is also used for: Each calculation completed At that time, the multiplication set Merging Sets ,in, ; If n≠1, then from the set The first preset priority is used to remove a maximum of a first number of elements, and a multiplier is used to perform the multiplication operation of the removed elements; wherein, the first preset priority is related to the row number and column number of L; the first preset priority with the smallest row number is the highest; or, if the row numbers are equal, the first preset priority with the smallest column number is the highest.

[0061] Optionally, the backward operation module 340 is also used for: Each calculation completed At that time, the multiplication set Merging Sets ,in, ; If n ≠ N, then from the set The first number of elements are removed according to the second preset priority, and the multiplication operation of the removed elements is performed by a multiplier. The second preset priority is related to the row number and column number of L, and the second preset priority with the largest row number is the highest; or, if the row numbers are equal, the second preset priority with the largest column number is the highest.

[0062] Optionally, it also includes: a first quantity determination module, used for: The number of multipliers and clock cycles required for forward or backward operations are determined based on the dimension N. The first quantity is determined based on the number of multipliers and the number of clock cycles.

[0063] The above-described apparatus can execute the methods provided in all the foregoing embodiments of the present invention, and has the corresponding functional modules and beneficial effects for executing the above methods. Technical details not described in detail in this embodiment can be found in the methods provided in all the foregoing embodiments of the present invention.

[0064] Example 3 Figure 6 A schematic diagram of an electronic device 10 that can be used to implement embodiments of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components, connections and relationships between components, and their functions shown herein are merely illustrative and are not intended to limit the implementation of the invention described and / or claimed herein.

[0065] like Figure 6As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12 or a random access memory (RAM) 13, communicatively connected to the at least one processor 11. The memory stores computer programs executable by the at least one processor. The processor 11 can perform various appropriate actions and processes based on the computer program stored in the ROM 12 or loaded from storage unit 18 into the RAM 13. The RAM 13 can also store various programs and data required for the operation of the electronic device 10. The processor 11, ROM 12, and RAM 13 are interconnected via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0066] Multiple components in electronic device 10 are connected to I / O interface 15, including: input unit 16, such as keyboard, mouse, etc.; output unit 17, such as various types of displays, speakers, etc.; storage unit 18, such as disk, optical disk, etc.; and communication unit 19, such as network card, modem, wireless transceiver, etc. Communication unit 19 allows electronic device 10 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0067] Processor 11 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. Processor 11 performs the various methods and processes described above, such as signal processing methods.

[0068] In some embodiments, the signal processing method may be implemented as a computer program tangibly contained in a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or mounted on electronic device 10 via ROM 12 and / or communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the signal processing method described above may be performed. Alternatively, in other embodiments, processor 11 may be configured to perform the signal processing method by any other suitable means (e.g., by means of firmware).

[0069] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), system-on-a-chip (SoCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0070] Computer programs used to implement the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when executed by the processor, the computer programs cause the functions / operations specified in the flowcharts and / or block diagrams to be performed. The computer programs may be executed entirely on a machine, partially on a machine, or as a standalone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0071] In the context of this invention, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0072] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device for displaying information to the user (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor); and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0073] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or middleware components (e.g., application servers), or frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), blockchain networks, and the Internet.

[0074] A computing system can include clients and servers. Clients and servers are generally located far apart and typically interact via communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or cloud host, which is a hosting product within the cloud computing service system to address the shortcomings of traditional physical hosts and VPS services, such as high management difficulty and weak business scalability.

[0075] This invention also provides a computer program product, including a computer program that, when executed by a processor, implements the signal processing method provided in any embodiment of this application.

[0076] In implementing the computer program product, computer program code for performing the operations of this invention can be written in one or more programming languages ​​or a combination thereof. Programming languages ​​include object-oriented programming languages ​​such as Java, Smalltalk, and C++, as well as conventional procedural programming languages ​​such as C or similar languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0077] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this invention can be achieved, and this is not limited herein.

[0078] The specific embodiments described above do not constitute a limitation on the scope of protection of this invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this invention should be included within the scope of protection of this invention.

Claims

1. A signal processing method, characterized by, include: Determine a matrix to be decomposed based on a multiple-input multiple-output (MIMO) channel matrix; wherein Cholesky decomposition is performed on the matrix to be decomposed to obtain a lower triangular matrix L; the lower triangular matrix L is divided into multiple sub-matrices, which are a first sub-lower triangular matrix in the upper left corner , a square matrix S in the lower left corner, and a second sub-lower triangular matrix in the lower right corner ; the dimensions of the matrix to be decomposed and the lower triangular matrix L are both N, and the dimension of the first sub-lower triangular matrix is k, where 1≤k≤N; The elements in the lower triangular matrix L are determined using a multiplier as follows: In the first stage, for elements satisfying... For each column of numbers n, each element is calculated according to the following three clock cycles: In the first clock cycle, based on the diagonal elements... Determine the nth column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. The off-diagonal elements; in the second clock cycle, the squares of the following elements are computed in parallel: And the nth column of the lower triangular matrix L that is located in the square matrix S; in the third clock cycle, the diagonal elements are computed in parallel. and the remaining elements in the nth column of the lower triangular matrix L that are located in the square matrix S; in the second stage, for those satisfying Given the number of columns n, calculate the non-diagonal elements in the nth column, the square of the non-diagonal elements in the (n+1)th row, and the diagonal elements in the (n+1)th column in sequence based on the diagonal elements. For the lower triangular matrix L and the received signal Perform forward operations to obtain the intermediate quantity u; A backward operation is performed on the lower triangular matrix L and the intermediate quantity u to obtain the estimated signal x; wherein, both the intermediate quantity u and the estimated signal x are vectors of dimension N.

2. The method according to claim 1, characterized in that, Also includes: The total number of multipliers required to execute the first stage is determined based on the dimension N, the number of columns n, and the dimension k; where k = 1, 2, ..., N; The k value corresponding to the minimum total number of multipliers is determined as the final k value.

3. The method according to claim 1, characterized in that, Also includes: The number of first multipliers required to perform the operations in the second clock cycle of the first phase is determined based on the dimension N, the number of columns n, and the dimension k. Based on the column number n, the number of second multipliers required to compute the squares of the following elements in parallel during the second clock cycle of the first phase is determined: ; The number of elements in the nth column of the lower triangular matrix L and located in the square matrix S is determined based on the first multiplier number and the second multiplier number.

4. The method according to claim 1, characterized in that, For the lower triangular matrix L and the received signal Perform forward operations to obtain intermediate quantities u, including: Each calculation completed At that time, the multiplication set Merging Sets ,in, ; If n≠1, then from the set The first preset priority is used to remove a maximum of a first number of elements, and a multiplier is used to perform the multiplication operation of the removed elements; wherein, the first preset priority is related to the row number and column number of L; the first preset priority with the smallest row number is the highest; or, if the row numbers are equal, the first preset priority with the smallest column number is the highest.

5. The method according to claim 1, characterized in that, Performing backward operations on the lower triangular matrix L and the intermediate quantity u to obtain the estimated signal x includes: Each calculation completed At that time, the multiplication set Merging Sets ,in, ; If n ≠ N, then from the set The first number of elements are removed according to the second preset priority, and the multiplication operation of the removed elements is performed by a multiplier. The second preset priority is related to the row number and column number of L, and the second preset priority with the largest row number is the highest; or, if the row numbers are equal, the second preset priority with the largest column number is the highest.

6. The method according to claim 4 or 5, characterized in that, The method for determining the first quantity is as follows: The number of multipliers and clock cycles required for forward or backward operations are determined based on the dimension N. The first quantity is determined based on the number of multipliers and the number of clock cycles.

7. A signal processing apparatus, characterized in that, include: The matrix to be decomposed module is used to determine the matrix to be decomposed based on the multiple-input multiple-output (MIMO) channel matrix; wherein, the matrix to be decomposed is subjected to Cholesky decomposition to obtain a lower triangular matrix L; the lower triangular matrix L is decomposed into multiple sub-matrices, each of which is the first sub-lower triangular matrix located in the upper left corner. The square matrix S in the lower left and the second lower triangular sub-matrix in the lower right. The dimension of both the matrix to be decomposed and the lower triangular matrix L is N, and the first sub-lower triangular matrix... The dimension is k, where 1≤k≤N; The lower triangular matrix element determination module is used to determine each element in the lower triangular matrix L using a multiplier as follows: In the first stage, for elements that satisfy... For each column of numbers n, each element is calculated according to the following three clock cycles: In the first clock cycle, based on the diagonal elements... Determine the nth column of the lower triangular matrix L that is located in the first sub-lower triangular matrix. The off-diagonal elements; in the second clock cycle, the squares of the following elements are computed in parallel: And the nth column of the lower triangular matrix L that is located in the square matrix S; in the third clock cycle, the diagonal elements are computed in parallel. and the remaining elements in the nth column of the lower triangular matrix L that are located in the square matrix S; in the second stage, for those satisfying Given the number of columns n, calculate the non-diagonal elements in the nth column, the square of the non-diagonal elements in the (n+1)th row, and the diagonal elements in the (n+1)th column in sequence based on the diagonal elements. The forward processing module is used to process the lower triangular matrix L and the received signal. Perform forward operations to obtain the intermediate quantity u; The backward operation module is used to perform backward operations on the lower triangular matrix L and the intermediate quantity u to obtain the estimated signal x; wherein, the intermediate quantity u and the estimated signal x are both vectors of dimension N.

8. An electronic device, characterized in that, The electronic device includes: At least one processor; and a memory communicatively connected to said at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the signal processing method according to any one of claims 1-6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that cause a processor to execute the signal processing method according to any one of claims 1-6.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the signal processing method as described in any one of claims 1-6.