CN107592115A - A kind of sparse signal restoration methods based on non-homogeneous norm constraint - Google Patents

A kind of sparse signal restoration methods based on non-homogeneous norm constraint Download PDF

Info

Publication number
CN107592115A
CN107592115A CN201710816788.7A CN201710816788A CN107592115A CN 107592115 A CN107592115 A CN 107592115A CN 201710816788 A CN201710816788 A CN 201710816788A CN 107592115 A CN107592115 A CN 107592115A
Authority
CN
China
Prior art keywords
mrow
sparse signal
msub
norm
sparse
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201710816788.7A
Other languages
Chinese (zh)
Other versions
CN107592115B (en
Inventor
伍飞云
杨坤德
段睿
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Northwestern Polytechnical University
Original Assignee
Northwestern Polytechnical University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Northwestern Polytechnical University filed Critical Northwestern Polytechnical University
Priority to CN201710816788.7A priority Critical patent/CN107592115B/en
Publication of CN107592115A publication Critical patent/CN107592115A/en
Application granted granted Critical
Publication of CN107592115B publication Critical patent/CN107592115B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Measurement Of Velocity Or Position Using Acoustic Or Ultrasonic Waves (AREA)

Abstract

The present invention relates to a kind of sparse signal restoration methods based on non-homogeneous norm constraint, L1 norm minimum strategies are improved using NNC norm constraints strategy, so as to realize that innovatory algorithm better adapts to degree of rarefication situation of change.Different from MP algorithms, the present invention need not pre-set the prioris such as the degree of rarefication of sparse signal, only need to set iteration step length, with reference to method of Lagrange multipliers, sparse signal is estimated by adjusting thresholds.So as to obtain the parameters such as the position of sparse signal and amplitude.Have the beneficial effect that:The present invention is based on NNC norm constraints, under method of Lagrange multipliers optimizing strategy, to being improved on the basis of the classical method for minimizing L1 norm constraints, and then obtains sparse solution.Due to the use of NNC norms so that the present invention is calculated Optimized Iterative and sparse signal recovers have very big advantage.

Description

A kind of sparse signal restoration methods based on non-homogeneous norm constraint
Technical field
The invention belongs to marine acoustics and field of underwater acoustic signal processing, is related to a kind of sparse letter based on non-homogeneous norm constraint Number restoration methods, estimate it for the sparse signal of time domain or transform domain, suitable for the estimation of ocean underwater acoustic channel, water The content such as sound data compression and recovery.
Background technology
The problems such as underwater sound data compression and underwater acoustic channel are estimated can all be attributed to be recovered to sparse signal, to random point The sparse signal position of cloth and amplitude are estimated.Use at present mainly have matching pursuit algorithm (Matching pursuit, ) and the base method for tracing based on L1 norm minimums (Basis pursuit, BP) MP.Wherein, matching pursuit algorithm referring to 《Sparse channel estimation via matching pursuit with application to equalization》, this article is published in for 2002《IEEE Transactions on Communications》50th phase, rise The beginning page number is 374.Based on the base method for tracing of L1 norm minimums referring to《Proportionate adaptive filters from a basis pursuit perspective》This article is published in for 2010《IEEE Signal Processing Letters》17th phase, first page number 985.
Because the essence for seeking most sparse solution is to seek zero Norm minimum solution, and zero norm minimum can not engineering reality in practice It is existing, therefore switch to L1 norm minimums and carry out approximation, therefore, although its solution procedure can obtain sparse solution, and algorithm is simple, but Precision is inadequate, and the match tracing rule based on greedy strategy is based on matching primitives, and its core is also to apply L1 norm constraint items, However, the intrinsic redundant computation of matching pursuit algorithm and the redundancy to dictionary select characteristic, the algorithm estimated result is caused to improve journey Spend limited.
The content of the invention
Technical problems to be solved
In order to avoid the shortcomings of the prior art, the present invention proposes a kind of sparse signal based on non-homogeneous norm constraint Restoration methods, the problems such as overcoming existing sparse signal recovery algorithms estimated accuracy not high.
Technical scheme
A kind of sparse signal restoration methods based on non-homogeneous norm constraint, it is characterised in that step is as follows:
Step 1:If A is sensing matrix, y is measurement signal, and x is sparse signal to be estimated, wherein A dimension be M × N, and M < N, measurement process are:
Y=Ax;
Step 2:Constructing object function is:
Wherein,0≤pi≤1.i,pi, n represents element position respectively, element equivalency index at i-th Variable and vector dimension;
Step 3:Setting iterations is L, threshold value t=σ | | x | |, the setting of threshold value control parameter and signal noise are horizontal Relevant, span is in 0 < σ < 1;
Step 4:Initial estimate isPrimary iteration number i=0
Step 5:It is iterated according to iterative as follows
I=i+1
G=diag (| x1|,…,|xn|)+δI
X=F-1GATλ=F-1GAT(AF-1GAT)-1y
Wherein diag is that diagonalization is carried out to vector to obtain diagonal matrix, and I is unit matrix, and δ is to prevent algorithm from entering The small positive number set during ill computing;TTo carry out transposition computing, λ=(AGA to matrixT)-1Y is Lagrange multiplier;
Step 6:Stop iteration as i > L, obtain sparse signal estimate x;Otherwise 5~step 6 of repeat step.
Beneficial effect
A kind of sparse signal restoration methods based on non-homogeneous norm constraint proposed by the present invention are a kind of based on non-homogeneous (Non-uniform norm constraint, NNC) method of estimation of norm constraint, the invention utilize NNC norm constraint strategies L1 norm minimum strategies are improved, so as to realize that innovatory algorithm better adapts to degree of rarefication situation of change.With MP algorithms Difference, the present invention need not pre-set the prioris such as the degree of rarefication of sparse signal, only need to set iteration step length, bright with reference to glug Day multiplier method, estimates sparse signal by adjusting thresholds.So as to obtain the parameters such as the position of sparse signal and amplitude.
Have the beneficial effect that:The present invention is based on NNC norm constraints, under method of Lagrange multipliers optimizing strategy, to warp Allusion quotation is improved on the basis of minimizing the method for L1 norm constraints, and then obtains sparse solution.Due to the use of NNC norms so that The present invention is calculated Optimized Iterative and sparse signal recovers have very big advantage.
Brief description of the drawings
Fig. 1 is that the inventive method estimates performance comparison figure from classical way under different degree of rarefications.
Fig. 2 is estimation performance comparison figure of the inventive method from classical way in different pendulous frequencies.
Fig. 3 is the inventive method and the sparse signal restoration result and primary signal comparison diagram of classical way estimation.
Fig. 4 is estimation performance comparison figure of the inventive method from classical way in the case of different snr of received signal.
Embodiment
In conjunction with embodiment, accompanying drawing, the invention will be further described:
Technical scheme
1. sparse signal estimation problem, is concretely comprised the following steps:
(1) A is set as sensing matrix, and y is measurement signal, and x is sparse signal to be estimated, and wherein A dimension is M × N, M < N, specific measurement process are:
Y=Ax (1)
(2) it was complete system to measure process, there is infinite multiresolution in theory, and most sparse it is an object of the present invention to search out One group of solution, meet formula (1), therefore, the object function of optimization problem is:
Wherein | | x | |0The number of nonzero element is represented, the direct solution of formula (2) is extremely complex, therefore traditional algorithm converts For
Wherein | | x | |1Represent the absolute value sum of each element.
(3) limited precision of traditional algorithm is considered, new object function proposed by the present invention is
Wherein0≤pi≤1.
(4) specific method of sparse signal x estimations is:
1. given sensing matrix A and measurement signal y, sets algorithm iteration number L and threshold value σ.
2. output information:Sparse signal estimate x
3. initialize:Initial estimate isThreshold value t=σ | | x | |:Iterations i=0.
4. whether evaluation algorithm end condition meets, i.e., whether i > L, if so, then stopping iteration, if it is not, then according to as follows Iterative iteration:
I=i+1 (5)
Wherein diag is that diagonalization is carried out to vector to obtain diagonal matrix, and I is unit matrix, and δ is to prevent algorithm computing There is the small positive number set when morbid state calculates.
G=diag (| x1|,…,|xn|)+δI (7)
X=F-1GATλ=F-1GAT(AF-1GAT)-1y (8)
WhereinTTo carry out transposition computing to matrix.
Specific embodiment:
Reference picture 1, using Gaussian Profile matrix as sensing matrix, it is 100 to set sparse signal length, position and size Meet the Gauss rule change of zero mean unit variance.The signal to noise ratio OSNR of reception signal is defined as
Wherein v is Complex-valued additive random noise.
Fig. 1 parameter settings are as follows:OSNR=20dB, M=50, N=100, degree of rarefication increase to 30 from 3, and iterations is set Be set to 50, σ=0.08, it will be seen from figure 1 that when degree of rarefication is more than 6, NNC SNR is more than MP and L1 algorithms, this be because There is certain adaptability for degree of rarefication increase for NNC algorithms.
In data compression, it is desirable to which compression ratio is bigger, but compression ratio means that greatly recovering difficulty increases.Fig. 2 is used for testing The performance of each algorithm during different pendulous frequencies.Parameter is arranged to N=100, OSNR=15dB, degree of rarefication 15, pendulous frequency 60 are changed to from 30, change step 5, mode caused by sparse signal is as before, the result such as figure that 100 averagings of emulation obtain Shown in 2, it can be seen that in this case, NNC algorithms are high compared to the SNR of MP and L1 algorithms, this, which has benefited from NNC norms, suitably to adjust Whole degree of rarefication match condition, so as to improve recovery precision.
Further to investigate the present invention under different signal to noise ratio to the restorability of sparse signal.Channel impulse response is set Function such as Fig. 3 (a) so, it is all 100 that involved parameter, which is arranged to pendulous frequency and channel exponent number, degree of rarefication 15, when connecing Signal-to-Noise is received when be 15dB, the result that three kinds of methods obtain respectively such as Fig. 3 (b) (c) (d) so, as can be seen from the figure There is false multipath in L1 and MP algorithms, and result and simulated channel that NNC algorithms obtain are close.Further to quantify these calculations Difference between method, the signal to noise ratio of reception signal is arranged to changing value, from 3 to 30dB, change step 3dB.Other specification As before, obtained result is as shown in Figure 4.It can be seen that the present invention after snr of received signal is higher than 9dB, recovers ratio of precision MP and L1 algorithms have very big lifting.
The present invention recovers to achieve obvious implementation result in emulation in sparse signal, and sparse signal is recovered, And sparse underwater acoustic channel is have estimated, the estimated accuracy of such current algorithm is improved under certain condition.

Claims (1)

1. a kind of sparse signal restoration methods based on non-homogeneous norm constraint, it is characterised in that step is as follows:
Step 1:If A is sensing matrix, y is measurement signal, and x is sparse signal to be estimated, and wherein A dimension is M × N, and M < N, measurement process are:
Y=Ax;
Step 2:Constructing object function is:
<mfenced open = "" close = ""> <mtable> <mtr> <mtd> <mrow> <munder> <mi>min</mi> <mi>x</mi> </munder> <mo>|</mo> <mo>|</mo> <mi>x</mi> <mo>|</mo> <msub> <mo>|</mo> <mrow> <mi>N</mi> <mi>N</mi> <mi>C</mi> </mrow> </msub> </mrow> </mtd> <mtd> <mrow> <mi>s</mi> <mi>u</mi> <mi>b</mi> <mi>j</mi> <mi>e</mi> <mi>c</mi> <mi>t</mi> <mi> </mi> <mi>t</mi> <mi>o</mi> <mi> </mi> <mi>y</mi> <mo>=</mo> <mi>A</mi> <mi>x</mi> </mrow> </mtd> </mtr> </mtable> </mfenced>
Wherein,0≤pi≤1.i,pi, n represents element position respectively, element equivalency index variable at i-th And vector dimension;
Step 3:Setting iterations is L, threshold value t=σ | | x | |, the setting of threshold value control parameter is relevant with signal noise level, Span is in 0 < σ < 1;
Step 4:Initial estimate isPrimary iteration number i=0
Step 5:It is iterated according to iterative as follows
I=i+1
<mrow> <msup> <mi>F</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>=</mo> <msup> <mrow> <mo>&amp;lsqb;</mo> <mi>d</mi> <mi>i</mi> <mi>a</mi> <mi>g</mi> <mrow> <mo>(</mo> <mfrac> <mrow> <mi>s</mi> <mi>g</mi> <mi>n</mi> <mo>&amp;lsqb;</mo> <mi>t</mi> <mo>-</mo> <mo>|</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>|</mo> <mo>&amp;rsqb;</mo> <mo>+</mo> <mn>1</mn> </mrow> <mn>2</mn> </mfrac> <mo>,</mo> <mo>...</mo> <mo>,</mo> <mfrac> <mrow> <mi>s</mi> <mi>g</mi> <mi>n</mi> <mo>&amp;lsqb;</mo> <mi>t</mi> <mo>-</mo> <mo>|</mo> <msub> <mi>x</mi> <mi>n</mi> </msub> <mo>|</mo> <mo>&amp;rsqb;</mo> <mo>+</mo> <mn>1</mn> </mrow> <mn>2</mn> </mfrac> <mo>)</mo> </mrow> <mo>+</mo> <mi>&amp;delta;</mi> <mi>I</mi> <mo>&amp;rsqb;</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> </mrow>
G=diag (| x1|,…,|xn|)+δI
X=F-1GATλ=F-1GAT(AF-1GAT)-1y
Wherein diag is that diagonalization is carried out to vector to obtain diagonal matrix, and I is unit matrix, and δ is to prevent algorithm from entering morbid state The small positive number set during computing;T is to carry out transposition computing, λ=(AGA to matrixT)-1Y is Lagrange multiplier;
Step 6:Stop iteration as i > L, obtain sparse signal estimate x;Otherwise 5~step 6 of repeat step.
CN201710816788.7A 2017-09-12 2017-09-12 Sparse signal recovery method based on non-uniform norm constraint Active CN107592115B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710816788.7A CN107592115B (en) 2017-09-12 2017-09-12 Sparse signal recovery method based on non-uniform norm constraint

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710816788.7A CN107592115B (en) 2017-09-12 2017-09-12 Sparse signal recovery method based on non-uniform norm constraint

Publications (2)

Publication Number Publication Date
CN107592115A true CN107592115A (en) 2018-01-16
CN107592115B CN107592115B (en) 2020-09-08

Family

ID=61051969

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710816788.7A Active CN107592115B (en) 2017-09-12 2017-09-12 Sparse signal recovery method based on non-uniform norm constraint

Country Status (1)

Country Link
CN (1) CN107592115B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108880558A (en) * 2018-06-08 2018-11-23 西北工业大学 A kind of underwater sound signal condensation matrix optimization method based on discrete cosine transform
CN110048723A (en) * 2019-04-10 2019-07-23 深圳大学 Robust sparse signal restoration methods
CN111711584A (en) * 2020-05-22 2020-09-25 西北工业大学 Sparse underwater acoustic channel estimation method based on proportional normalization minimum mean square error

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102750262A (en) * 2012-06-26 2012-10-24 清华大学 Method for realizing sparse signal recovery on CPU (Central Processing Unit) based on OMP (Orthogonal Matching Pursuit) algorithm
CN103250352A (en) * 2011-01-10 2013-08-14 上海贝尔股份有限公司 Method and apparatus for measuring and recovering sparse signals
JP2015519027A (en) * 2012-06-05 2015-07-06 クヮンジュ・インスティテュート・オブ・サイエンス・アンド・テクノロジー Finite field sparse signal restoration method, finite field sparse signal restoration device, and recording medium on which this method is recorded

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103250352A (en) * 2011-01-10 2013-08-14 上海贝尔股份有限公司 Method and apparatus for measuring and recovering sparse signals
JP2015519027A (en) * 2012-06-05 2015-07-06 クヮンジュ・インスティテュート・オブ・サイエンス・アンド・テクノロジー Finite field sparse signal restoration method, finite field sparse signal restoration device, and recording medium on which this method is recorded
CN102750262A (en) * 2012-06-26 2012-10-24 清华大学 Method for realizing sparse signal recovery on CPU (Central Processing Unit) based on OMP (Orthogonal Matching Pursuit) algorithm

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
伍飞云 等: "可适应稀疏度变化的非均匀范数约束水声信道估计算法", 《兵工学报》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108880558A (en) * 2018-06-08 2018-11-23 西北工业大学 A kind of underwater sound signal condensation matrix optimization method based on discrete cosine transform
CN110048723A (en) * 2019-04-10 2019-07-23 深圳大学 Robust sparse signal restoration methods
CN111711584A (en) * 2020-05-22 2020-09-25 西北工业大学 Sparse underwater acoustic channel estimation method based on proportional normalization minimum mean square error
CN111711584B (en) * 2020-05-22 2022-06-07 西北工业大学 Sparse underwater acoustic channel estimation method based on proportional normalization minimum mean square error

Also Published As

Publication number Publication date
CN107592115B (en) 2020-09-08

Similar Documents

Publication Publication Date Title
CN109995449B (en) Millimeter wave signal detection method based on deep learning
CN108512787B (en) Hyperfine channel estimation method of large-scale MIMO system
CN107592115A (en) A kind of sparse signal restoration methods based on non-homogeneous norm constraint
CN108566257A (en) A kind of signal recovery method based on reverse transmittance nerve network
CN106068619B (en) Method and apparatus for carrying out cross polarization interference inhibition
CN102821071B (en) Signal channel and noise variance joint estimation method of OFDM (orthogonal frequency division multiplexing) system
CN110048972B (en) Underwater sound orthogonal frequency division multiplexing channel estimation method and system
CN107395536B (en) Method for estimating underwater sound channel impulse response function in multi-path environment
CN106789766A (en) Sparse OFDM channel estimation method based on homotopy method
CN111478749A (en) MIMO iterative detection method, system and application based on optimization initial value fast convergence
CN111711584A (en) Sparse underwater acoustic channel estimation method based on proportional normalization minimum mean square error
CN105634568A (en) LLR calculation method based on large-scale MIMO system signal detection
CN109150236A (en) A kind of direct sequence signal PN sequence estimation method based on variable step LEAP neural network
CN107018103B (en) Wavelet constant modulus blind equalization method based on adaptive step size monkey swarm optimization
Zhang et al. Efficient residual shrinkage CNN denoiser design for intelligent signal processing: Modulation recognition, detection, and decoding
JP6507320B2 (en) Method of recovering original signal in DS-CDMA system based on complexity reduction
CN107181705A (en) A kind of half-blind channel estimating method and system
CN110784423A (en) Underwater acoustic channel estimation method based on sparse constraint
CN104683006A (en) Beam forming method based on Landweber iteration method
CN113037409B (en) Large-scale MIMO system signal detection method based on deep learning
CN114611550A (en) Multi-feature automatic modulation identification method based on complex convolution module
Zhang et al. Analysis and estimation of the underwater acoustic millimeter-wave communication channel
CN108282200B (en) Factor graph-based confidence propagation signal detection method in large-scale MIMO system
CN101989864B (en) Blind multi-access interference suppression method for DS/CDMA system
Li et al. DCSaNet: Dilated convolution and self-attention based neural network for channel estimation in IRS-aided multi-user communication system

Legal Events

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