Low-frequency underwater acoustic channel estimation method and system based on compressed sensing
Through the cluster sparse adaptive segmented weak orthogonal matching tracking algorithm, the channel estimation process is optimized, and the channel estimation accuracy and stability problems caused by mode interference between low-frequency hydroacoustic channels are solved, thereby improving the efficiency and performance of the communication system.
Patent Information
- Application Number
- CN202411133583.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-19
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2044-08-19
AI Technical Summary
Intermodal interference of low-frequency hydroacoustic channels leads to reduced reconstruction accuracy and stability of channel estimation. Traditional OMP algorithms have redundant iteration and inefficient reconstruction in atomic selection strategy, which reduces the demodulation efficiency of communication systems.
采用簇稀疏度自适应分段弱正交匹配追踪算法,通过自适应步长调整和原子簇选择,优化信道估计流程,利用信道的簇稀疏特性进行信道冲激响应的精确定位和优选。
It improves the accuracy and stability of channel estimation, reduces redundant calculations, improves the overall efficiency and performance of the communication system, effectively suppresses intermodal interference, and improves the data transmission efficiency and reliability in low-frequency hydroacoustic channels.
Smart Images

Figure CN119030830A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of underwater acoustic communication, and in particular relates to a low-frequency underwater acoustic channel estimation method based on compressed sensing and a system thereof. Background Art
[0002] As a core component of marine information transmission, underwater acoustic communication technology plays an irreplaceable role in the fields of marine environmental monitoring and resource exploration. The inherent characteristics of underwater acoustic channels, especially the inter-symbol interference (ISI) problem caused by limited bandwidth resources and significant delay spread, greatly affect the reliability of communication. Orthogonal frequency division multiplexing (OFDM) technology has become the preferred solution to these problems in the field of underwater acoustic communication because of its excellent anti-ISI capability and efficient spectrum utilization. However, the excellent performance of OFDM systems is highly dependent on accurate channel state information (CSI), which means that high-precision channel estimation is essential. Although traditional channel estimation methods such as least squares estimation (LS) and minimum mean square error estimation (MMSE) show certain advantages in computational complexity, their significant disadvantage is that they require a large number of pilot signals, which will undoubtedly occupy precious bandwidth resources and reduce the spectrum utilization of the system. Studies have shown that low-frequency underwater acoustic channels have cluster sparse characteristics. This feature enables the channel estimation algorithm based on compressed sensing (CS) to maintain accurate channel estimation while greatly reducing the number of pilots, greatly improving spectrum efficiency. Among them, the orthogonal matching pursuit (OMP) algorithm has become one of the most widely used channel estimation algorithms in underwater acoustic communications due to its relatively low computational complexity and good reconstruction performance.
[0003] In summary, the existing technologies have the following defects: 1) The inter-modal interference presented by the low-frequency underwater acoustic channel will cause the channel to have cluster sparse characteristics, while the OMP algorithm is based on the conventional sparsity assumption, which does not match the characteristics of the low-frequency underwater acoustic channel, making it difficult for the algorithm to effectively separate and suppress the interference between modes, and the reconstruction accuracy and stability of the channel estimation are also reduced. 2) The OMP algorithm adopts a fixed strategy when selecting the optimal atom. This setting easily leads to redundant iterations and inefficient reconstruction, which not only increases the number of unnecessary iterations, but also reduces the demodulation efficiency of the communication system. Summary of the invention
[0004] The present invention provides a low-frequency underwater acoustic channel estimation method based on compressed sensing, which is used to solve the problem that it is difficult to effectively separate and suppress interference between modes, the reconstruction accuracy and stability of channel estimation are reduced, and the demodulation efficiency of the communication system is also reduced.
[0005] The present invention provides a low-frequency underwater acoustic channel estimation system based on compressed sensing, which is used to implement a low-frequency underwater acoustic channel estimation method based on compressed sensing.
[0006] The present invention is achieved through the following technical solutions:
[0007] A method for estimating a low-frequency underwater acoustic channel based on compressed sensing, the method comprising the following steps:
[0008] Step 1: Generate OFDM signal;
[0009] Step 2: The OFDM signal in step 1 passes through a low-frequency underwater acoustic channel to obtain a pilot signal;
[0010] Step 3: Based on the pilot signal in step 2 and the constructed measurement matrix, estimate the cluster sparse channel;
[0011] Step 4: Based on the estimation of the cluster sparse channel in step 3, the cluster sparse low-frequency underwater acoustic channel is estimated by cluster sparsity adaptive piecewise weak orthogonal matching pursuit algorithm.
[0012] Furthermore, the step 1 is specifically that the channel impulse response is modeled as:
[0013]
[0014] Where h(t) is the low-frequency underwater acoustic channel, L is the total number of tap delays in the discrete-time system model, and h i
[0015] is the complex gain of the ith path, δ is the unit pulse function, τ i is the delay of the i-th path, t is the delay component, and i is the path component;
[0016] Assume that the OFDM system has N subcarriers. The input bit stream data is mapped by QAM, and then a pilot sequence of length P is inserted, followed by an N-point inverse fast Fourier transform. At this time, an OFDM symbol
[0017] The number is represented as:
[0018]
[0019] Among them, x(k) is the OFDM symbol, N is the number of subcarriers, s(k) is the signal after inverse fast Fourier transform, k is the subcarrier index, and l is the index of the signal sample.
[0020] Furthermore, the step 2 is specifically as follows: an OFDM symbol x(k) passes through the low-frequency underwater acoustic channel h(τ)
[0021] After that, the received signal is obtained:
[0022] y(k)=x(k)*h(k)+n(k) (3)
[0023] Where h(k) is the time domain channel impulse response after discretization of h(τ); n(k) is complex additive Gaussian white noise;
[0024] The received signal model is expressed as:
[0025]
[0026] The signal model (4) is changed to a matrix-vector form:
[0027] y=XWh+n (5)
[0028] Where X is a diagonal matrix with elements X(k) (0≤k≤N-1) on the main diagonal, X(k) represents the information data and pilot data in each OFDM symbol, W consists of the first L columns of the N×N dimensional normalized FFT matrix, in
[0029] 0≤l≤L-1 is the channel length, h=[h0,h1,…,h L-1 ] T is the time domain channel impulse response sampling value with cluster sparsity K, n is the complex additive Gaussian white noise that is independent and identically distributed in the frequency domain;
[0030] It is necessary to use known pilot symbols for channel estimation, and the received pilot signal is expressed as:
[0031] y P =X P W P h+n P (6)
[0032] Among them, the number of pilots is P, y P =Sy is the P×1-dimensional received pilot vector, the S matrix is composed of P rows corresponding to the pilot positions selected from the N×N-dimensional identity matrix, N is the total number of subcarriers in the system, X P =SXS T is a P×P dimensional diagonal matrix, W P =SW is a P×L dimensional matrix, n P is the frequency domain noise vector.
[0033] Furthermore, the step 3 is specifically that the measurement matrix is:
[0034] Φ=X P W P (7)
[0035] Where Φ is a P×L dimensional measurement matrix;
[0036] For formula (7), it is expressed as minimizing the l0 norm optimization problem:
[0037]
[0038] Among them, ||h||0 represents the number of non-zero elements in h, is the estimated channel of h;
[0039] It becomes a minimization l1 norm optimization problem:
[0040]
[0041] Here, ||h||1 represents the l1 norm of h.
[0042] Further, the step 4 includes the following steps:
[0043] Step 4.1: Initialize each parameter, where the number of iterations t = 0 and the initial support set Initial residual r (0) =y P , the step size of the cluster Δk, the size of the initial cluster Threshold δ = 10 -6 , maximum number of iterations T, noise power ε;
[0044] Step 4.2: At the tth iteration, calculate the residual r (t-1) The inner product with all atoms in the measurement matrix Φ and take the absolute value;
[0045] Step 4.3: Selection of atomic clusters;
[0046] Step 4.4: Support set Ω t Updates;
[0047] Step 4.5: Channel Estimation Updates;
[0048] Step 4.6: Residual r (t) Updates;
[0049] Step 4.7: Adaptive cluster sparsity and step size adjustment;
[0050] Step 4.8: Determine the iteration termination condition;
[0051] Step 4.9: Output the final channel impulse response estimate.
[0052] Furthermore, in step 4.2: in the tth iteration, the residual r is calculated (t-1) The inner product with all atoms in the measurement matrix Φ and take the absolute value:
[0053]
[0054] Step 4.3: Cluster selection: selection and residual r(t-1) The atomic cluster C with high correlation t , that is, select all The cluster C is composed of consecutive columns of t , ensuring that the cluster size does not exceed
[0055]
[0056] Step 4.4: Support set Ω t Update: Cluster C t Add to the current support set Ω t-1 In the process, a new support set Ω is formed. t :
[0057] Ω t =Ω t-1 ∪C t (12)
[0058] Step 4.5: Channel Estimation Update: In the new support set Ω t On the other hand, considering the weak orthogonality of the atomic clusters, the channel estimation is performed after optimizing the least squares method:
[0059]
[0060] Step 4.6: Residual r (t) Update: Compute new residuals:
[0061]
[0062] Furthermore, the step 4.7: Adaptive cluster sparsity and step size adjustment: adjusting the cluster size according to the energy difference between the previous and next two channel estimates
[0063] if So otherwise
[0064] Step 4.8: Determine the iteration termination condition:
[0065] If t reaches the maximum number of iterations T or the residual energy If it is less than the noise power ε, stop the iteration and proceed to step 4.9;
[0066] Otherwise, t=t+1, return to step 4.2;
[0067] Step 4.9: Output the final channel impulse response estimate as:
[0068]
[0069] Here, t is the index of the last iteration.
[0070] A low-frequency underwater acoustic channel estimation system based on compressed sensing, the system uses the low-frequency underwater acoustic channel estimation method based on compressed sensing as described above, the system comprises:
[0071] A signal generation module generates an OFDM signal;
[0072] Pilot signal module: OFDM signal passes through the low-frequency underwater acoustic channel to obtain the pilot signal;
[0073] A cluster sparse channel estimation module estimates the cluster sparse channel based on the pilot signal and the constructed measurement matrix;
[0074] The cluster sparse low-frequency underwater acoustic channel estimation module is based on the estimation of cluster sparse channels and realizes the estimation of cluster sparse low-frequency underwater acoustic channels through cluster sparsity adaptive piecewise weak orthogonal matching pursuit algorithm.
[0075] A computer device comprises a memory, a processor and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the above method is implemented.
[0076] A computer-readable storage medium stores a computer program, and the computer program implements the above method when executed by a processor.
[0077] The beneficial effects of the present invention are:
[0078] The present invention directly targets the cluster sparseness characteristics of low-frequency underwater acoustic channels, and improves the accuracy and stability of channel estimation by adjusting the atomic selection mechanism through adaptive step size. At the same time, by optimizing the iterative process and reducing redundant calculations, the overall efficiency and performance of the communication system are effectively improved.
[0079] The present invention starts from the cluster sparseness characteristics of the underwater acoustic channel and the fixed optimal atom selection mechanism, improves the traditional OMP algorithm, and improves the accuracy and convergence speed of channel estimation.
[0080] The present invention optimizes the traditional OMP algorithm by combining channel feature analysis with improved atom selection strategy, significantly improves the performance of channel estimation in low-frequency channel environments, and effectively suppresses the interference problem between modes.
[0081] The multimodal phenomenon exhibited by the present invention in the low-frequency channel can be regarded as a cluster-sparse channel model. The present method attempts to utilize the cluster-sparse characteristics of the channel to achieve accurate positioning and optimization of atomic clusters.
[0082] The present invention adaptively adjusts the step length parameter according to energy changes of two previous and subsequent channel estimation values.
[0083] In the specific scenario of cluster sparse channels, the present invention demonstrates faster convergence speed and higher estimation accuracy, effectively improving the data transmission efficiency and reliability in low-frequency underwater acoustic channels. BRIEF DESCRIPTION OF THE DRAWINGS
[0084] Figure 1 It is a flow chart of the method of the present invention.
[0085] Figure 2 It is a schematic diagram of the cluster sparsity adaptive piecewise weak orthogonal matching pursuit algorithm of the present invention. DETAILED DESCRIPTION
[0086] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.
[0087] It should be understood that when used in this specification and the appended claims, the term "comprising" indicates the presence of described features, integers, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or groups thereof.
[0088] It should also be understood that the terms used in this application specification are only for the purpose of describing specific embodiments and are not intended to limit the application. As used in this application specification and the appended claims, the singular forms "a", "an" and "the" are intended to include plural forms unless the context clearly indicates otherwise.
[0089] The following is attached to this application specification Figure 1-2 , the technical solutions in the embodiments of the present application are clearly and completely described. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present application.
[0090] In the following description, many specific details are set forth to facilitate a full understanding of the present application, but the present application may also be implemented in other ways different from those described herein, and those skilled in the art may make similar generalizations without violating the connotation of the present application. Therefore, the present application is not limited to the specific embodiments disclosed below.
[0091] Implementation Method 1
[0092] This embodiment provides a low-frequency underwater acoustic channel estimation method based on compressed sensing, the method comprising the following steps:
[0093] Step 1: Generate OFDM signal;
[0094] Step 2: The OFDM signal in step 1 passes through a low-frequency underwater acoustic channel to obtain a pilot signal;
[0095] Step 3: Based on the pilot signal in step 2 and the constructed measurement matrix, estimate the cluster sparse channel;
[0096] Step 4: Based on the estimation of the cluster sparse channel in step 3, the cluster sparse low-frequency underwater acoustic channel is estimated by cluster sparsity adaptive piecewise weak orthogonal matching pursuit algorithm.
[0097] Furthermore, the step 1 is specifically that, in low-frequency underwater acoustic communication, if the channel coherence time significantly exceeds the duration of a single OFDM symbol, it can be approximately considered that the channel impulse response is time-invariant at this time. Based on this premise, the channel impulse response can be modeled as:
[0098]
[0099] Where h(t) is the low-frequency underwater acoustic channel, L is the total number of tap delays in the discrete-time system model, and h i is the complex gain of the ith path, δ is the unit pulse function, τ i is the delay of the i-th path, t is the delay component, and i is the path component;
[0100] Assume that the OFDM system has N subcarriers. The input bit stream data is mapped by QAM, and then a pilot sequence of length P is inserted, followed by an N-point inverse fast Fourier transform (IFFT). In order to overcome inter-symbol interference, a cyclic prefix (CP) is introduced. The cyclic prefix is a piece of data copied from the end of the OFDM symbol and added to the beginning of the symbol to finally obtain the signal s(k). The length of the cyclic prefix is L. cp must be greater than or equal to the length of the channel L; in this case, an OFDM symbol can be expressed as:
[0101]
[0102] Where x(k) is the OFDM symbol, N is the number of subcarriers, s(k) is the signal after inverse fast Fourier transform, k is the subcarrier index, and l is the index of the signal sample;
[0103] Furthermore, the step 2 is specifically as follows: an OFDM symbol x(k) passes through the low-frequency underwater acoustic channel h(τ)
[0104] After that, we can get the received signal:
[0105] y(k)=x(k)*h(k)+n(k) (3)
[0106] Among them, h(k) is the time domain channel impulse response after discretization of h(τ), which represents the transfer characteristics of the channel to the signal;
[0107] n(k) is a complex Gaussian white noise. First, the received signal y(k) is stripped of the cyclic prefix. Next, an N-point normalized fast Fourier transform (FFT) is performed. At this point, the received signal model can be expressed as
[0108] Shown as:
[0109]
[0110] In order to facilitate processing and calculation, the above signal model (4) can be changed to a matrix-vector form:
[0111] y=XWh+n (5)
[0112] Where X is a diagonal matrix with elements X(k) (0≤k≤N-1) on the main diagonal, X(k) represents the information data and pilot data in each OFDM symbol, W consists of the first L columns of the N×N dimensional normalized FFT matrix, in
[0113] 0≤l≤L-1 is the channel length, h=[h0,h1,…,h L-1 ] T is the time domain channel impulse response sampling value with cluster sparsity K, n is the complex additive Gaussian white noise that is independent and identically distributed in the frequency domain;
[0114] Considering the need to use known pilot symbols for channel estimation, the received pilot signal can be expressed as
[0115] To:
[0116] y P =X P W P h+n P (6)
[0117] Among them, the number of pilots is P, y P =Sy is the P×1-dimensional received pilot vector, the S matrix is composed of P rows corresponding to the pilot positions selected from the N×N-dimensional identity matrix, N is the total number of subcarriers in the system, X P =SXS T is a P×P dimensional diagonal matrix, W P =SW is a P×L dimensional matrix, n P is the frequency domain noise vector.
[0118] Furthermore, the step 3 is specifically that the measurement matrix is:
[0119] Φ=X P W P (7)
[0120] Where Φ is a P×L dimensional measurement matrix;
[0121] For formula (7), the core goal is to use the constructed measurement matrix Φ and the received pilot signal y P To estimate the cluster sparse channel h; this problem can generally be expressed as a minimization l0 norm optimization problem:
[0122]
[0123] Among them, ||h||0 represents the number of non-zero elements in h, is the estimated channel of h;
[0124] However, directly solving the l0-norm minimization problem is a typical non-deterministic polynomial (NP) problem;
[0125] When the measurement matrix Φ satisfies the constrained isometry property (RIP), the above problem can be transformed into a more easily solvable form, that is, it becomes an optimization problem of minimizing the l1 norm:
[0126]
[0127] Here, ||h||1 represents the l1 norm of h.
[0128] In the optimization problem of minimizing the l1 norm, compressed sensing theory provides a greedy iterative algorithm to solve it. Among them, the most typical OMP algorithm has shown significant advantages in the field of underwater acoustic communication due to its high efficiency and practicality. The main idea of this algorithm is to make the best local choice based on the current information in each iteration process to gradually approach the global optimal solution. Although this method cannot guarantee that the global optimal solution can be achieved every time, in many practical cases, the OMP algorithm can usually quickly find a solution that is close enough to the optimal solution, which is particularly suitable for underwater acoustic channel estimation problems with obvious sparse characteristics. The OMP algorithm can significantly reduce the calculation time and complexity while ensuring a certain accuracy, meeting the high standards of underwater acoustic communication systems for real-time and resource efficiency.
[0129] Further, the step 4 includes the following steps:
[0130] Step 4.1: Initialize each parameter, where the number of iterations t = 0 and the initial support set Initial residual r (0) =y P , the step size of the cluster Δk, the size of the initial cluster Threshold δ = 10 -6 , maximum number of iterations T, noise power ε;
[0131] Step 4.2: At the tth iteration, calculate the residual r (t-1) The inner product with all atoms in the measurement matrix Φ and take the absolute value;
[0132] Step 4.3: Selection of atomic clusters;
[0133] Step 4.4: Support set Ω t Updates;
[0134] Step 4.5: Channel Estimation Updates;
[0135] Step 4.6: Residual r (t) Updates;
[0136] Step 4.7: Adaptive cluster sparsity and step size adjustment;
[0137] Step 4.8: Determine the iteration termination condition;
[0138] Step 4.9: Output the final channel impulse response estimate.
[0139] Furthermore, in step 4.2: in the tth iteration, the residual r is calculated (t-1) The inner product with all atoms in the measurement matrix Φ and take the absolute value:
[0140]
[0141] Step 4.3: Cluster selection: selection and residual r (t-1) The atomic cluster C with high correlation t , that is, select all The cluster C is composed of consecutive columns of t , ensuring that the cluster size does not exceed
[0142]
[0143] Step 4.4: Support set Ω t Update: Cluster C t Add to the current support set Ω t-1 In the process, a new support set Ω is formed. t :
[0144] Ω t =Ω t-1 ∪C t (12)
[0145] Step 4.5: Channel Estimation Update: In the new support set Ω t In consideration of the weak orthogonality of atomic clusters, the least squares method can be optimized before channel estimation:
[0146]
[0147] Step 4.6: Residual r (t) Update: Compute new residuals:
[0148]
[0149] Furthermore, the step 4.7: Adaptive cluster sparsity and step size adjustment: adjusting the cluster size according to the energy difference between the previous and next two channel estimates
[0150] if So otherwise
[0151] Step 4.8: Determine the iteration termination condition:
[0152] If t reaches the maximum number of iterations T or the residual energy If it is less than the noise power ε, stop the iteration and proceed to step 4.9;
[0153] Otherwise, t=t+1, return to step 4.2.
[0154] Step 4.9: Output the final channel impulse response estimate as:
[0155]
[0156] Here, t is the index of the last iteration.
[0157] Specifically, the present invention optimizes the traditional OMP algorithm by combining channel feature analysis with improved atom selection strategy, significantly improving the performance of channel estimation in low-frequency channel environments and effectively suppressing the interference problem between modes. The multimodal phenomenon exhibited by low-frequency channels can be regarded as a cluster-sparse channel model. The present invention attempts to use the cluster-sparse characteristics of the channel to achieve accurate positioning and optimization of atomic clusters.
[0158] At the same time, in order to overcome the deviation of fixed step size on atom selection, the step size parameter can be adaptively adjusted according to the energy change of the two channel estimation values. In the specific scenario of cluster sparse channels, the cluster sparsity adaptive piecewise weak orthogonal matching pursuit algorithm proposed in this invention shows faster convergence speed and higher estimation accuracy, effectively improving the data transmission efficiency and reliability in low-frequency underwater acoustic channels.
[0159] Implementation Method 2
[0160] This embodiment provides a low-frequency underwater acoustic channel estimation system based on compressed sensing. The system uses the low-frequency underwater acoustic channel estimation method based on compressed sensing as described in Embodiment 1. The system includes:
[0161] A signal generation module generates an OFDM signal;
[0162] Pilot signal module: OFDM signal passes through the low-frequency underwater acoustic channel to obtain the pilot signal;
[0163] A cluster sparse channel estimation module estimates the cluster sparse channel based on the pilot signal and the constructed measurement matrix;
[0164] Cluster sparse low-frequency underwater acoustic channel estimation module, based on the estimation of cluster sparse channels, through the cluster sparsity adaptive piecewise weak orthogonal matching pursuit algorithm to achieve the estimation of cluster sparse low-frequency underwater acoustic channels
[0165] Implementation Method 3
[0166] An embodiment of the present invention provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the memory is used to store software programs and modules, and the processor executes various functional applications and data processing by running the software programs and modules stored in the memory. The memory and the processor are connected via a bus. Specifically, the processor implements any step in the first embodiment above by running the computer program stored in the memory.
[0167] It should be understood that in the embodiments of the present invention, the processor referred to may be a central processing unit (CPU), and the processor may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.
[0168] The memory may include a read-only memory, a flash memory, and a random access memory, and provides instructions and data to the processor. A part or all of the memory may also include a nonvolatile random access memory.
[0169] It can be seen from the above that the electronic device provided by the embodiment of the present invention can implement the low-frequency underwater acoustic channel estimation method as described in embodiment one by running a computer program. In the specific scenario of cluster sparse channels, it shows faster convergence speed and higher estimation accuracy, which effectively improves the data transmission efficiency and reliability in the low-frequency underwater acoustic channel.
[0170] It should be understood that if the above-mentioned integrated module / unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, the present invention implements all or part of the processes in the above-mentioned implementation method, and can also be completed by instructing the relevant hardware through a computer program. The above-mentioned computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method implementations when executed by the processor. Among them, the above-mentioned computer program includes computer program code, and the above-mentioned computer program code can be in source code form, object code form, executable file or some intermediate form. The above-mentioned computer-readable medium may include: any entity or device capable of carrying the above-mentioned computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal and software distribution medium. It should be noted that the content contained in the above-mentioned computer-readable storage medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction.
[0171] The above description of the disclosed embodiments enables one skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to one skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest range consistent with the principles and novel features disclosed herein.
[0172] Those skilled in the art can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In actual applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the above-mentioned device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the implementation method can be integrated into a processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of the present invention. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method implementation method, which will not be repeated here.
[0173] It should be noted that the methods and detailed examples provided in the above embodiments can be combined with the devices and equipment provided in the embodiments, and references can be made to each other, and no further details will be given.
[0174] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.
[0175] In the embodiments provided by the present invention, it should be understood that the disclosed device / terminal equipment and method can be implemented in other ways. For example, the device / equipment implementation described above is only illustrative, for example, the division of the above modules or units is only a logical function division, and in actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed.
[0176] The above-mentioned embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit them. Although the present invention has been described in detail with reference to the above-mentioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the above-mentioned embodiments, or replace some of the technical features therein by equivalents. These modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the various embodiments of the present invention, and should all be included in the protection scope of the present invention.
Claims
1. A low-frequency underwater acoustic channel estimation method based on compressed sensing, It is characterized in that The method comprises the following steps, Step 1: Generate OFDM signal; Step 2: The OFDM signal in step 1 passes through a low-frequency underwater acoustic channel to obtain a pilot signal; Step 3: Based on the pilot signal in step 2 and the constructed measurement matrix, estimate the cluster sparse channel; Step 4: Based on the estimation of the cluster sparse channel in step 3, the cluster sparse low-frequency underwater acoustic channel is estimated by cluster sparsity adaptive piecewise weak orthogonal matching pursuit algorithm.
2. The low-frequency underwater acoustic channel estimation method according to claim 1, It is characterized in that Step 1 Specifically, the channel impulse response is modeled as: Where h(t) is the low-frequency underwater acoustic channel, L is the total number of tap delays in the discrete-time system model, and h i is the complex gain of the ith path, δ is the unit pulse function, τ i is the delay of the i-th path, t is the delay component, and i is the path component; Assuming that the OFDM system has N subcarriers, the input bit stream data is QAM mapped, then a pilot sequence of length P is inserted, and then an N-point inverse fast Fourier transform is performed; at this time, an OFDM symbol is represented as: Among them, x(k) is the OFDM symbol, N is the number of subcarriers, s(k) is the signal after inverse fast Fourier transform, k is the subcarrier index, and l is the index of the signal sample.
3. The low-frequency underwater acoustic channel estimation method according to claim 1, It is characterized in that Step 2 Specifically, after an OFDM symbol x(k) passes through the low-frequency underwater acoustic channel h(τ), the received signal is obtained: y(k)=x(k)*h(k)+n(k) (3) Where h(k) is the time domain channel impulse response after discretization of h(τ); n(k) is complex additive Gaussian white noise; The received signal model is expressed as: The signal model (4) is changed to a matrix-vector form: y=XWh+n (5) Where X is a diagonal matrix with elements X(k) (0≤k≤N-1) on the main diagonal, X(k) represents the information data and pilot data in each OFDM symbol, W consists of the first L columns of the N×N dimensional normalized FFT matrix, in 0≤k≤N-1, 0≤l≤L-1 is the channel length, h=[h 0 ,h 1 ,…,h L-1 ] T is the time domain channel impulse response sampling value with cluster sparsity K, n is the complex additive Gaussian white noise that is independent and identically distributed in the frequency domain; It is necessary to use known pilot symbols for channel estimation, and the received pilot signal is expressed as: y P =X P W P h+n P (6) Among them, the number of pilots is P, y P =Sy is the P×1-dimensional received pilot vector, the S matrix is composed of P rows corresponding to the pilot positions selected from the N×N-dimensional identity matrix, N is the total number of subcarriers in the system, X P =SXS T is a P×P dimensional diagonal matrix, W P =SW is a P×L dimensional matrix, n P is the frequency domain noise vector.
4. The low-frequency underwater acoustic channel estimation method according to claim 3, It is characterized in that Step 3 Specifically, the measurement matrix is: Φ=X P W P (7) Where Φ is a P×L dimensional measurement matrix; For formula (7), it is expressed as minimizing l 0 Norm optimization problem: Among them, ||h|| 0 represents the number of non-zero elements in h, is the estimated channel of h; becomes minimized 1 Norm optimization problem: Among them, ||h|| 1 l represents h 1 Norm.
5. The low-frequency underwater acoustic channel estimation method according to claim 1, It is characterized in that The step 4 comprises the following steps, Step 4.1: Initialize each parameter, where the number of iterations t = 0 and the initial support set Initial residual r (0) =y P , the step size of the cluster Δk, the size of the initial cluster Threshold δ = 10 -6 , maximum number of iterations T, noise power ε; Step 4.2: At the tth iteration, calculate the residual r (t-1) The inner product with all atoms in the measurement matrix Φ and take the absolute value; Step 4.3: Selection of atomic clusters; Step 4.4: Support set Ω t Updates; Step 4.5: Channel Estimation Updates; Step 4.6: Residual r (t) Updates; Step 4.7: Adaptive cluster sparsity and step size adjustment; Step 4.8: Determine the iteration termination condition; Step 4.9: Output the final channel impulse response estimate.
6. The low-frequency underwater acoustic channel estimation method according to claim 5, It is characterized in that Step 4.2: In the tth iteration, calculate the residual r (t-1) The inner product with all atoms in the measurement matrix Φ and take the absolute value: Step 4.3: Cluster selection: selection and residual r (t-1) The atomic cluster C with high correlation t , that is, select all The cluster C is composed of consecutive columns of t , ensuring that the cluster size does not exceed Step 4.4: Support set Ω t Update: Cluster C t Add to the current support set Ω t-1 In the process, a new support set Ω is formed. t : Oh t =Oh t-1 ∪C t (12) Step 4.5: Channel Estimation Update: In the new support set Ω t On the other hand, considering the weak orthogonality of the atomic clusters, the channel estimation is performed after optimizing the least squares method: Step 4.6: Residual r (t) Update: Compute new residuals:
7. The low-frequency underwater acoustic channel estimation method according to claim 6, It is characterized in that Step 4.7: Adaptive cluster sparsity and step size adjustment: The cluster size is adjusted according to the energy difference between the previous and next channel estimates if So otherwise Step 4.8: Determine the iteration termination condition: If t reaches the maximum number of iterations T or the residual energy If it is less than the noise power ε, stop the iteration and proceed to step 4.9; Otherwise, t=t+1, return to step 4.2; Step 4.9: Output the final channel impulse response estimate as: Here, t is the index of the last iteration.
8. A low-frequency underwater acoustic channel estimation system based on compressed sensing, It is characterized in that The system uses the low-frequency underwater acoustic channel estimation method based on compressed sensing as described in any one of claims 1 to 7, and the system includes: A signal generation module generates an OFDM signal; Pilot signal module: OFDM signal passes through the low-frequency underwater acoustic channel to obtain the pilot signal; A cluster sparse channel estimation module estimates the cluster sparse channel based on the pilot signal and the constructed measurement matrix; The cluster sparse low-frequency underwater acoustic channel estimation module is based on the estimation of cluster sparse channels and realizes the estimation of cluster sparse low-frequency underwater acoustic channels through cluster sparsity adaptive piecewise weak orthogonal matching pursuit algorithm.
9. A computer device, It is characterized in that The method comprises a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the method according to any one of claims 1 to 7 is implemented.
10. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.
Citation Information
Patent Citations
An underwater acoustic channel estimation method and system based on an MSASWOMP algorithm
CN109861937A
Orthogonal matching pursuit channel estimation method for underwater acoustic OFDM system
CN113055317A
Compressed sensing shallow sea underwater acoustic channel estimation method based on atom threshold and backtracking
CN116155658A
Underwater acoustic channel sparse estimation method adopting convolutional neural network channel cluster detection
CN116346549A
Adaptive sparseness orthogonal matching pursuit underwater acoustic channel estimation method
CN118432982A
