CN102497337B - Compressed sensing wireless communication channel estimation method based on sparsity self-adapting - Google Patents

Compressed sensing wireless communication channel estimation method based on sparsity self-adapting Download PDF

Info

Publication number
CN102497337B
CN102497337B CN201110409342.5A CN201110409342A CN102497337B CN 102497337 B CN102497337 B CN 102497337B CN 201110409342 A CN201110409342 A CN 201110409342A CN 102497337 B CN102497337 B CN 102497337B
Authority
CN
China
Prior art keywords
vector
degree
channel
rarefication
matrix
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.)
Expired - Fee Related
Application number
CN201110409342.5A
Other languages
Chinese (zh)
Other versions
CN102497337A (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.)
Tianjin University
Original Assignee
Tianjin 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 Tianjin University filed Critical Tianjin University
Priority to CN201110409342.5A priority Critical patent/CN102497337B/en
Publication of CN102497337A publication Critical patent/CN102497337A/en
Application granted granted Critical
Publication of CN102497337B publication Critical patent/CN102497337B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention belongs to the field of wireless communication channel estimation, particularly relates to a compressed sensing wireless communication channel estimation method based on sparsity self-adapting, which includes the ssteps: (1) collecting demodulated receiving signals and calculating channel response of a pilot frequency position; (2) constructing a measurement matrix phi required by signal reconstruction; (3) calculating an association degree vector and sequencing elements of the vector; (4) calculating second difference vector of a novel association degree vector after sequencing and setting a threshold value I for judging sparsity of signals; (5) estimating sparsity S of channel impulse response; (6) comparing the threshold value I with the last element of a vector D sequentially, and a coefficient value corresponding to the first element larger than the threshold value is the estimated sparsity S of the signals; and (7) reconstructing the signals. The channel estimation method breaks a bottleneck of a traditional compressed sensing algorithm that the sparsity of the signals must be known, and signal reconstruction of sparsity self-adapting is achieved.

Description

A kind of based on the adaptive compressed sensing radio communication channel of degree of rarefication method of estimation
Affiliated technical field
The invention belongs to radio communication channel and estimate field, particularly for the multicarrier condition of sparse channel under dual-selection channel condition, estimate.
Background technology
Compressed sensing (Compressive Sensing, CS) theory is a quantum jump of applied mathematics and signal process field, its represent when signal be compressible or when certain transform domain has sparse property, by gathering a small amount of signal projection, just can realize the accurate or approximate reconstruct of signal.Under this theoretical frame, sampling rate is no longer decided by the bandwidth of signal, but is decided by structure and the content of information in signal, thereby has broken the Bottleneck Restrictions of traditional nyquist sampling theorem to sample rate.Compressive sensing theory, sampling and the compression of signal can be carried out with low rate simultaneously, sample frequency and data storage and the transmission cost of signal have greatly been reduced, reduced significantly signal processing time and assessed the cost, thereby the proposition of compressed sensing is a major transformation of signal process field.
Multi-transceiver technology utilizes a series of orthogonal sub-carriers to realize the high-speed transfer of data, it is a kind of efficient parallel data transmission plan, wherein OFDM (OFDM, Orthogonal Frequency Division Multiplexing) technology is most widely used multi-transceiver technology.The main feature of OFDM is that high-speed serial data is divided into the parallel transmission that carries out relative low speed in a plurality of orthogonal sub-carriers.Owing to having orthogonality between each subcarrier, allow the frequency spectrum of subchannel overlapped, thereby the OFDM availability of frequency spectrum is higher.In addition, the anti-frequency selective fading performance of OFDM technology is strong, realizes simply, easily eliminates intersymbol interference.Quadrature modulation in each sub-channels of OFDM and demodulation can adopt IFFT and FFT method to realize, and greatly reduce the complexity of calculating.Yet ofdm system is very responsive to phase noise and carrier wave frequency deviation, and because the frequency spectrum of subchannel covers mutually, this has just proposed strict requirement to the orthogonality between subcarrier.Because wireless transmission channel characteristic is undesirable, conventionally present time domain and the decline of frequency domain double selectivity, very easily cause system frequency difference.The existence of system frequency difference, by destroying the orthogonality of ofdm system sub-carriers, produces inter-carrier interference (ICI), severe exacerbation systematic function.Thereby, to the accurate estimation of channel, be to guarantee that ofdm system possesses the key of premium properties.
In wireless OFDM communication system, the channel estimation method based on pilot tone is topmost channel estimating means.For multicarrier system, pilot tone generally has time-frequency two-dimensional characteristic, therefore need to apply two-dimension pilot frequency method of estimation.Two-dimension pilot frequency method of estimation generally comprises two steps: (1) estimating pilot frequency time of living in or frequency location place channel response, its mathematical optimization criterion used comprises least square (LS) algorithm, the least mean-square error estimation technique (Minimum Mean Square Error, MMSE), maximum likelihood estimate (Maximum Likehood, ML).(2), on the basis of channel response that obtains pilot tone position, by certain two-dimentional interpolation method, obtain the estimation to complete channel response.Two-dimensional interpolation can be decomposed into the one dimension interpolation of two cascades conventionally, and main one dimension interpolation method comprises: linear (Linear) interpolation, Gauss interpolation, Cubic interpolation, Lagrange's interpolation and DFT interpolation etc.The compound mode of conventional two-dimensional interpolation mainly comprises Linear-DFT two-dimensional interpolation and DFT-DFT two-dimensional interpolation.
Yet there is following defect in traditional two-dimensional interpolation technology: in actual transmission of wireless signals, the multipath channel of double selectivity is conventionally only dominated by a predominating path bunch institute for minority, so the physical channel presenting often has sparse characteristic.And when the transmission bandwidth of signal is large or antenna number is more, the sparse characteristic of channel is particularly evident.Because condition of sparse channel only has minority non-zero tap, traditional method based on pilot frequency sequence very likely samples the zero tap of channel, and interpolation goes out channel response exactly.And compressed sensing technology can fully be excavated the sparse characteristic of channel, can utilize very limited pilot tone effectively to recover sparse channel impulse response.At present, existing scholar both domestic and external is applied to existing CS classic algorithm to going in the estimation of condition of sparse channel, but because existing most of CS algorithm all needs the degree of rarefication of known signal as the prerequisite of signal reconstruction, this is difficult to realize in actual applications, therefore, need to there is novel degree of rarefication self-adapting reconstruction algorithm, can be the in the situation that of the unknown of signal degree of rarefication, still can accurately recover signal, realize the accurate estimation to condition of sparse channel.
Summary of the invention
Under doubly-selective fading channel condition, conventional channel estimation technique cannot accurately be estimated the problem of condition of sparse channel, the present invention proposes a kind of multicarrier system channel estimation methods that can reduce pilot number, improve the availability of frequency spectrum of wireless communication system.The channel estimation methods that the present invention proposes, without the degree of rarefication of known channel impulse response, has been broken through the bottleneck of the necessary known signal degree of rarefication of conventional compression perception algorithm, has realized the adaptive signal reconstruction of degree of rarefication.Technical scheme of the present invention is as follows:
Based on the adaptive compressed sensing radio communication channel of a degree of rarefication method of estimation, comprise the following steps:
1) at receiving terminal, gather the reception signal after demodulation, by it divided by pilot tone amplitude, to calculate the channel response H at pilot tone place p, and using it as recovering the required measurement vector of whole channel response;
2) the required measurement matrix Φ of structure signal reconstruction;
3) compute associations degree vector Φ *h p, and all elements in this vector is pressed to the descending sequence of amplitude, the new degree of association vector after being sorted;
4) calculate the second differnce vector D of the new degree of association vector after sequence, and according to the average amplitude of rear 50% element of vectorial D, be provided for the threshold value I of decision signal degree of rarefication;
5) estimate the degree of rarefication S of channel impulse response: from last element of vectorial D, compare successively with set threshold value I, first corresponding coefficient value of element that is greater than threshold value is estimated signal degree of rarefication S;
6) carry out signal reconstruction: to measure vectorial H pas residual error r tinitial value r 0, select interconnection vector Φ *r tthe S of a middle amplitude maximum element, and the corresponding coefficient of this S element is saved in to a minute quantity set Γ tin, wherein t is iteration pointer, is used to indicate iterations, initial value is 0;
7) by the up-to-date minute quantity set Γ identifying twith the current minute quantity set F approaching t-1merge, obtain intersection U t, current approximation component collection F wherein tinitial condition be empty;
8) according to the intersection U after upgrading tspecified coefficient is selected measures corresponding row in matrix Φ, and compute associations vector Φ again *r, selects the wherein element of S amplitude maximum, by the current collection F that approaches tbe updated to the corresponding coefficient of this S element;
9) calculate new residual values: wherein, for row coefficient belongs to a minute quantity set F tthe submatrix of measurement matrix Φ, for pseudo inverse matrix;
10) judge whether residual values is less than preset value, if can not meet, iteration pointer t adds 1, and returns to the 6th step and repeat above step, until meet stopping criterion for iteration;
11) if iterations reaches, still cannot to make residual values meet after the upper limit pre-conditioned, according to formula the estimated value of revision degree of rarefication, and make the zero clearing of iteration pointer, return to the 6th step, until that residual values meets is pre-conditioned, accurately reconstruct channel impulse response, wherein, bracket function in ceil () expression, the span of η is (1,2], n is used to refer to generation revision number of times, often once revises, and n value adds 1.
The present invention can be according to the equidistant condition of following satisfied constraint, the required measurement matrix Φ of structure signal reconstruction: for any c and constant δ k∈ (0,1), measuring matrix Φ need meet ( 1 - δ K ) | | c | | 2 2 ≤ | | Φ T c | | 2 2 ≤ ( 1 + δ K ) | | c | | 2 2 , Wherein, index for the set of index number, c is sparse signal, is an one-dimensional vector that length is identical with the dimension of T, and the degree of rarefication of establishing sparse signal c is S, Φ tfor measuring the submatrix of the M * T consisting of the indicated related column of index T in matrix Φ, integer M and N are respectively line number and the columns of measuring matrix Φ
Conventional channel estimation technique, owing to cannot excavating the sparse characteristic of channel, in channel life period and frequency double selectivity decline situation, cannot estimate channel response exactly.Compressed sensing technology of the present invention can make full use of the sparse characteristic of double selectivity fade condition lower channel, and the sampled point (being the channel response at pilot tone place) of utilization minute quantity just can recover the impulse response of channel integral body.Due to the minimizing of required sampled point, the required pilot-frequency expense of system also will significantly reduce, and therefore, the present invention will contribute to improve wireless communication system, especially the availability of frequency spectrum of broad band multicarrier system.Meanwhile, what the present invention adopted is novel degree of rarefication self-adapting compressing perception algorithm, and with respect to traditional compressed sensing algorithm that signal degree of rarefication is known that requires, the method just can accurately be recovered original signal without known signal degree of rarefication.This characteristic makes the present invention possess stronger practical value.
Accompanying drawing explanation
Fig. 1 is FB(flow block) of the present invention.
Fig. 2 is for estimating the flow chart of channel degree of rarefication.
Fig. 3 is channel impulse response reconstruct flow chart.
Embodiment
As shown in Figure 1, the present invention is mainly divided into three steps: obtain pilot tone place channel response, estimate channel impulse response degree of rarefication and reconstruct channel impulse response.
Concrete scheme is as follows:
One, pilot tone place channel impulse response obtains
If the time-domain and frequency-domain discrete representation of channel transfer function H (f, t) is H l, k, l=0 ..., L-1, k=0 ..., K-1, the subcarrier number that wherein L is each multicarrier symbol, K is the symbol numbers that every frame comprises.Frequency pilot sign is expressed as N in the spacing of frequency direction f, in the spacing of time orientation, be expressed as N t.
The reception signal of a multicarrier frame is so:
R l,k=H l,kS l,k+Z l,k(l=0,...,L-1,k=0,...,K-1) (1)
R wherein l, kfor the receiving symbol after demodulation, S l, kfor sending symbol, Z l, kfor Gaussian noise, and time-frequency discrete channel coefficient H l, kportrayed an equivalent system channel, comprising multi-carrier modulator, interpolation filter, physical channel and frequency overlapped-resistable filter.Therefore, H l, kcan be expressed as:
H l . k = Σ m = 0 K - 1 Σ i = - L / 2 L / 2 - 1 F [ m , i ] e - j 2 π ( km K - li L ) - - - ( 2 )
Wherein,
F [ m , i ] = Σ q = 0 T - 1 S h [ m , i + qL ] A γ , g * ( m , i + qL LT ) - - - ( 3 )
And represent Discrete Time-Delay-Doppler distribution function, T is-symbol duration, h[n, m] become impulse response while being discrete; for mutual ambiguity function.
All frequency pilot signs in one frame can be expressed as set P, and the number of frequency pilot sign is:
N frid = [ L N f ] [ K N t ] = | | P | | - - - ( 4 )
Therefore, the channel coefficients of insertion frequency pilot sign is:
H P = H ^ l ′ , k ′ = R l ′ , k ′ S l ′ , k ′ = H n ′ , i ′ + Z l ′ , k ′ S l ′ , k ′ , ∀ ( l ′ , k ′ ) ∈ P - - - ( 5 )
Two, the estimation of channel degree of rarefication
(1) Wireless Channel Modeling based on compressed sensing
In actual wireless communication transmissions process, because communication environments is comparatively complicated, multipath phenomenon is obvious, and most wireless channel is actually only dominated by a few path cluster, and therefore, physical channel often presents sparse property.This characteristic can be embodied by Discrete Time-Delay-Doppler distribution function, i.e. S h[m, i] is that S is sparse or " compressible ".In condition of sparse channel, S h[m, i] only has S coefficient to keep off in zero, and this provides prerequisite for applied compression cognition technology.
If compressive sensing theory thinks that the one-dimensional signal x that a length is N is that S is sparse, and meets S much smaller than N, as long as known some M * N (M < N) dimension is measured matrix Φ, and the linear measurement value y of x under this matrix,
y=Φx (6)
Just can from measured value y, recover original signal x.Because M is much smaller than N, so compressed sensing technology only need utilize the sampled value of minute quantity can reconstruct signal.Yet measure matrix, the equidistant condition of constraint must be met, Accurate Reconstruction could be realized, for any S sparse signal c and constant δ k∈ (0,1), measures matrix Φ and meets
( 1 - &delta; K ) | | c | | 2 2 &le; | | &Phi; T c | | 2 2 &le; ( 1 + &delta; K ) | | c | | 2 2 , &ForAll; c &Element; R | | T | | - - - ( 7 )
Wherein, || T|| represents the dimension of T, and the dimension of T is less than S, and c is the one-dimensional vector that any one length is identical with T dimension, Φ tsubmatrix for M * T of being formed by the indicated related column of index T in Φ.
Due to S h[m, i] possesses sparse property, thereby the F[m in (3) formula, i] possess too sparse property.Discrete channel model can be converted into the compressed sensing reconstruction model shown in (6) formula.(2) formula is reduced to:
H &lambda; , &kappa; = &Sigma; m = 0 K - 1 &Sigma; i = - L / 2 L / 2 - 1 &alpha; m , i u m , i [ &lambda; , &kappa; ] - - - ( 8 )
Wherein,
&alpha; m , i = LK F [ m , i ] - - - ( 9 )
u m , i [ &lambda; , &kappa; ] = ( 1 / LK ) e - j 2 &pi; ( &kappa;m / D - &lambda;i / j ) - - - ( 10 )
Variable λ ∈ in above formula (0, L-1), κ ∈ (0, K-1), H λ, κand u m, i[λ, κ] is L * K matrix.The dimensional vector h=vec{H that definition length is LK λ, κ, the element in h is by H λ, κin column vector be connected and form successively.In like manner can define,
u m,i=vec{u m,i[λ,κ]} (11)
So, (8) formula can be rewritten as
h = &Sigma; m = 0 K - 1 &Sigma; i = - L / 2 L / 2 - 1 &alpha; m , i u m , i = &Psi;&alpha; - - - ( 12 )
Wherein, α=vec{ α m, i, Ψ is LK * LK matrix, its ((i+L/2) K+m+1) row are vectorial u m, i.Due to vectorial u m, ifor orthogonal vectors, so matrix Ψ meets constraint isometry.
If H pfor discrete channel coefficient H l, kat (l, k), belong to the corresponding channel response in pilot set P place, Φ is in the specified Ψ of set P || P|| row form || and P|| * LK matrix.(12) formula can be converted into the compressed sensing model in (6) formula so:
H p=Φα (13)
Wherein, we have obtained the channel impulse response H at pilot tone place p, Φ is the measurement matrix in this model, just can recover α by (13) formula, thereby obtain the impulse response of overall channel.
(2) the channel degree of rarefication estimation technique based on second differnce
The first step of reconstruction signal α is to identify in α to have which " atom " (being the element in α) to participate in the measurement of signal.Atom is higher with the degree of association of measuring matrix, more likely participates in measuring.The degree of association of atom characterizes as it is at vectorial Φ *h pthe amplitude of middle corresponding element, therefore vectorial Φ *h palso referred to as degree of association vector.Atom and the degree of association of measuring matrix also can be described as the energy of atom, and due to the energy of the atom that participates in the measuring energy much larger than other atoms, thereby the scope of its energy hunting is also larger.And the atom that has neither part nor lot in measurement is because energy own is less, its energy hunting scope is also less.Therefore, by observing the speed of nuclear energy decline, just can distinguish total which atom participation measurement, i.e. degree of rarefication of signal.
As shown in Figure 2, the channel degree of rarefication estimation technique based on second differnce, needs first compute associations vector Φ *h p, and its element is pressed to the descending sequence of amplitude, the speed that nuclear energy declines can be by Φ *h psecond differnce characterize,
D=diff 2*H p) (14)
Choose Φ *h pthe average amplitude of rear 50% element is as with reference to threshold value, and is multiplied by coefficient δ and obtains threshold value I,
I=δ·ave(|D(0.5*(LK-2):LK-2)|) (15)
Wherein, ave (| the average amplitude (length of D is LK-2) of 50% element after D (0.5* (LK-2): LK-2) |) representation vector D.
From last element of D, compare successively with threshold value I, first corresponding coefficient of element that is greater than I is the degree of rarefication of channel.
Three, reconstruct channel impulse response
After estimating channel degree of rarefication, the iterative algorithm that returns order renewal by utilization can reconstruct original signal (as shown in Figure 3).Specific algorithm is as follows:
1. initialization residual error r t, minute quantity set Γ t, maximum tolerance residual values ε, iterations upper limit t maxand the current collection F that approaches t.Wherein t is iteration pointer, often carry out an iteration t value and increase 1; Residual error r tinitial value for measuring vectorial H p; Divide quantity set Γ t and the current collection F that approaches tinitial value be all empty set.
2. calculate a minute quantity set Γ t.The new residual error r that utilizes last iteration to produce t-1, and calculate new degree of association vector Φ *rt-1, and therefrom identify the element of S amplitude maximum, and by it at Φ *in rt-1, corresponding position deposits in minute quantity set Γ t.
3. merge minute quantity set Γ t and the resulting current collection F that approaches in last iteration t-1, obtain intersection U t.
4. according to intersection U tthe indicated row structure of middle element is measured the submatrix Φ of matrix Φ ut, and again differentiate the element of middle S amplitude maximum ( for matrix pseudo inverse matrix), and F tin content update be the corresponding position parameter of this S element.
5. according to the current collection F that approaches tindicated row structure is measured the submatrix Φ of matrix Φ ut, and recalculate residual error
6. if residual error is less than maximum tolerance residual values ε, iteration finishes, and reconstruct completes; Otherwise, return to the 2nd step and continue iteration.
7. if iterations reaches the upper limit, and residual error do not meet pre-conditionedly yet, revises estimated channel degree of rarefication, and revisal formulas is S n = ceil ( &eta; ( - 1 ) n + ceil ( n / 2 ) &times; S ) . Wherein, bracket function in ceil () expression, the span of η be (1,2], n is used to refer to revision number of times.Along with the increase of n, due to continuous the increase and positive-negative polarity checker of index amplitude of η, so correction value S nto constantly depart from S to both direction.The large young pathbreaker of η determines the size of the each skew of correction value.Simulation result shows, because estimated value extremely approaches actual value, therefore, only needs to revise several times and can realize Accurate Reconstruction through minority.
Complete after above-mentioned steps, can reconstruct vectorial α, and then recover F[m, i].According to formula (2), just can calculate again the time-domain and frequency-domain discrete representation H of whole channel l, kthereby, realize condition of sparse channel and estimate.
A specific embodiment of the present invention below:
1. adopt OFDM modulation system, and with Rayleigh 5 footpath channels for channel to be estimated, its degree of rarefication is 30.Sub-carrier number is 128, and the symbolic number of each subcarrier carrying is 12.Time domain direction pilot interval is 4, and frequency domain direction pilot interval is 4, so pilot tone number is 96, and pilot-frequency expense is only 6.25%.
2. use (8) to (12) formula to calculate measurement matrix, and set up the channel estimation model based on compressed sensing.The channel degree of rarefication estimation technique of employing based on second differnce estimated channel degree of rarefication, and coefficient δ is made as 7, and the estimated value calculating is 32.
3. by the restructing algorithm in the estimated channel degree of rarefication substitution three going out in 2, wherein maximum tolerance residual values ε is made as 10 -4, maximum iteration time is made as 25, η value and is made as 1.2.Through 18 iteration, realize signal reconstruction.

Claims (2)

1. based on the adaptive compressed sensing radio communication channel of a degree of rarefication method of estimation, comprise the following steps:
1) at receiving terminal, gather the reception signal after demodulation, by it divided by pilot tone amplitude, to calculate the channel response H at pilot tone place p, and using it as recovering the required measurement vector of whole channel response;
2) the required measurement matrix Φ of structure signal reconstruction;
3) compute associations degree vector Φ * H p, and all elements in this vector is pressed to the descending sequence of amplitude, the new degree of association vector after being sorted;
4) calculate the second differnce vector D of the new degree of association vector after sequence, and according to the average amplitude of rear 50% element of vectorial D, be provided for the threshold value I of decision signal degree of rarefication;
5) estimate the degree of rarefication S of channel impulse response: from last element of vectorial D, compare successively with set threshold value I, first corresponding coefficient value of element that is greater than threshold value is estimated signal degree of rarefication S;
6) carry out signal reconstruction: to measure vectorial H pas residual error r tinitial value r 0, select interconnection vector Φ * r tthe S of a middle amplitude maximum element, and the corresponding coefficient of this S element is saved in to a minute quantity set Γ tin, wherein t is iteration pointer, is used to indicate iterations, initial value is 0;
7) by the up-to-date minute quantity set Γ identifying twith the current minute quantity set F approaching t-1merge, obtain intersection U t, the current minute quantity set F approaching wherein tinitial condition be empty;
8) according to the intersection U after upgrading tspecified coefficient is selected measures corresponding row in matrix Φ, and compute associations vector Φ * r again t, select the wherein element of S amplitude maximum, by the current minute quantity set F approaching tbe updated to the corresponding coefficient of this S element;
9) calculate new residual values: wherein, for row coefficient belongs to a minute quantity set F tthe submatrix of measurement matrix Φ, for pseudo inverse matrix;
10) judge whether residual values is less than preset value, if can not meet, iteration pointer t adds 1, and returns to the 6th step and repeat above step, until meet stopping criterion for iteration;
11) if iterations reaches, still cannot to make residual values meet after the upper limit pre-conditioned, according to formula the estimated value of revision degree of rarefication, and make the zero clearing of iteration pointer, return to the 6th step, until that residual values meets is pre-conditioned, accurately reconstruct channel impulse response, wherein, bracket function in ceil () expression, the span of η is (1,2], n is used to refer to generation revision number of times, often once revises, and n value adds 1.
2. according to claim 1 based on the adaptive compressed sensing radio communication channel of degree of rarefication method of estimation, it is characterized in that, step 2) in, according to the equidistant condition of following satisfied constraint, the required measurement matrix Φ of structure signal reconstruction: for any c and constant δ k∈ (0,1), measuring matrix Φ need meet wherein, index for the set of index number, c is sparse signal, is an one-dimensional vector that length is identical with the dimension of T, and the degree of rarefication of establishing sparse signal c is S, Φ tfor measuring the submatrix of the M * T consisting of the indicated related column of index T in matrix Φ, integer M and N are respectively line number and the columns of measuring matrix Φ.
CN201110409342.5A 2011-12-11 2011-12-11 Compressed sensing wireless communication channel estimation method based on sparsity self-adapting Expired - Fee Related CN102497337B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110409342.5A CN102497337B (en) 2011-12-11 2011-12-11 Compressed sensing wireless communication channel estimation method based on sparsity self-adapting

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110409342.5A CN102497337B (en) 2011-12-11 2011-12-11 Compressed sensing wireless communication channel estimation method based on sparsity self-adapting

Publications (2)

Publication Number Publication Date
CN102497337A CN102497337A (en) 2012-06-13
CN102497337B true CN102497337B (en) 2014-08-20

Family

ID=46189124

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110409342.5A Expired - Fee Related CN102497337B (en) 2011-12-11 2011-12-11 Compressed sensing wireless communication channel estimation method based on sparsity self-adapting

Country Status (1)

Country Link
CN (1) CN102497337B (en)

Families Citing this family (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102821071B (en) * 2012-08-24 2014-12-03 电子科技大学 Signal channel and noise variance joint estimation method of OFDM (orthogonal frequency division multiplexing) system
US9031169B2 (en) * 2013-02-15 2015-05-12 Xiao-an Wang Sparse channel detection, estimation, and feedback
CN103346984B (en) * 2013-06-28 2017-02-15 南京信息工程大学 Method for estimating local clustering sparse channel based on BSL0
CN105027519B (en) * 2013-12-30 2018-11-13 华为技术有限公司 A kind of signal processing method and device
CN104768186B (en) * 2014-01-02 2018-05-04 上海交通大学 Method of data capture based on sequential compressed sensing in wireless sensor network
CN103780521B (en) * 2014-02-28 2017-10-17 重庆邮电大学 A kind of adaptive ofdm system channel estimation methods of degree of rarefication
CN103997347B (en) * 2014-05-14 2017-02-15 宁波大学 Fast estimation method for sparseness of signals during signal reconstruction
CN104283825B (en) * 2014-09-24 2017-11-03 北京邮电大学 A kind of channel estimation methods perceived based on dynamic compression
CN104485964B (en) * 2014-11-14 2018-01-09 山东师范大学 Signal degree of rarefication method of estimation based on relative threshold in Signal Compression transmitting procedure
LU92709B1 (en) * 2015-05-06 2016-11-07
CN105847192B (en) * 2016-03-17 2019-02-26 上海交通大学 A kind of combined estimation method of dynamic condition of sparse channel
CN107306236B (en) * 2016-04-19 2020-02-14 北京信威通信技术股份有限公司 High-frequency wireless channel estimation method and system
CN106059971A (en) * 2016-07-07 2016-10-26 西北工业大学 Sparse reconstruction based correlation detection method under signal correlation attenuation condition
CN107171985B (en) * 2017-06-07 2020-01-10 深圳先进技术研究院 Channel estimation method and system
CN107395536B (en) * 2017-07-20 2020-09-08 西北工业大学 Method for estimating underwater sound channel impulse response function in multi-path environment
CN107248902B (en) * 2017-07-21 2019-08-02 电子科技大学 A kind of piece of compressed sensing non-orthogonal multiple system multi-user detection method
CN107294659B (en) * 2017-07-21 2019-08-09 电子科技大学 One kind being based on cross validation non-orthogonal multiple system multi-user detection method
CN107835058B (en) * 2017-11-13 2021-01-22 西安电子科技大学 Cognitive radio frequency spectrum compressed sensing method based on secondary differential sparsification preprocessing
CN108449290A (en) * 2018-02-07 2018-08-24 深圳清华大学研究院 Time-frequency double selection channels method of estimation and device based on structuring compressed sensing
CN108924069B (en) * 2018-08-01 2020-09-29 电子科技大学 OFDM channel estimation method based on dimension reduction DFT
US11080726B2 (en) * 2018-08-30 2021-08-03 Oracle International Corporation Optimization of demand forecast parameters
CN109257129A (en) * 2018-09-25 2019-01-22 桂林电子科技大学 A kind of wireless sensor network
CN109347770B (en) * 2018-12-10 2021-06-25 中南大学 Channel estimation method and device based on compressed sensing theory
CN110568428B (en) * 2019-09-06 2021-08-17 电子科技大学 Method and device for estimating reference channel coefficient of external radiation source radar
CN111010355B (en) 2019-11-29 2020-10-20 北京科技大学 Channel estimation method of steel penetrating system
US20210209461A1 (en) * 2020-01-03 2021-07-08 Baidu Usa Llc Methods for neural network sparsity channel generation and inference
CN111555994B (en) * 2020-05-22 2021-04-02 西北工业大学 Cluster sparse channel estimation method based on maximum skip rule algorithm
CN112565120B (en) * 2020-12-04 2023-03-10 东南大学 Second-order difference-based channel estimation method for visible light communication system
CN115118556B (en) * 2022-06-21 2023-10-17 厦门大学 Sparse channel estimation method, device and medium for OFDM (orthogonal frequency division multiplexing) underwater acoustic communication system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101908889A (en) * 2010-07-30 2010-12-08 哈尔滨工业大学 Compressed sensing reconstructing method of sparse signal with unknown block sparsity
CN102255616A (en) * 2011-06-02 2011-11-23 哈尔滨工业大学 Sparse estimation-oriented synchronous subspace tracking method

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101908889A (en) * 2010-07-30 2010-12-08 哈尔滨工业大学 Compressed sensing reconstructing method of sparse signal with unknown block sparsity
CN102255616A (en) * 2011-06-02 2011-11-23 哈尔滨工业大学 Sparse estimation-oriented synchronous subspace tracking method

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
OFDM系统稀疏信道估计研究;石慧等;《计算机工程与应用》;20111130;第47卷(第33期);第2章 *
一种压缩采样中的稀疏度自适应子空间追踪算法;杨成等;《电子学报》;20100831;第38卷(第8期);第2章 *
杨成等.一种压缩采样中的稀疏度自适应子空间追踪算法.《电子学报》.2010,第38卷(第8期),
石慧等.OFDM系统稀疏信道估计研究.《计算机工程与应用》.2011,第47卷(第33期),

Also Published As

Publication number Publication date
CN102497337A (en) 2012-06-13

Similar Documents

Publication Publication Date Title
CN102497337B (en) Compressed sensing wireless communication channel estimation method based on sparsity self-adapting
CN108322409B (en) Sparse OFDM channel estimation method based on generalized orthogonal matching pursuit algorithm
CN103780521B (en) A kind of adaptive ofdm system channel estimation methods of degree of rarefication
CN109617850A (en) OFDM condition of sparse channel estimation method based on self-adapting compressing perception
CN102387115B (en) OFDM pilot scheme design and channel estimation method
CN103107969B (en) Incremental iterative time-varying channel evaluation and inter carrier interference (ICI) elimination method of fast orthogonal frequency division multiplexing (OFDM) system
CN102724147B (en) A kind of channel estimation methods of underwater sound OFDM
CN102244624B (en) Orthogonal-matching-pursuit-based sparse channel estimation method
CN104410590A (en) Short-wave OFDM (Orthogonal Frequency Division Multiplexing) interference suppression joint channel estimation method based on compressed sensing
CN108833311A (en) Joint time domain cluster denoises and the transform domain quadratic estimate method of balanced judgement
CN101951353B (en) Channel estimation method for orthogonal frequency division multiplexing (OFDM) system under interference environment
CN104767587B (en) Based on the compressed sensing channel estimation methods for combining channel decoding under ofdm system
CN111147407B (en) TMSBL underwater acoustic OFDM time-varying channel estimation method based on channel prediction
CN106027445A (en) Channel estimation method for sparse property of underwater acoustic block structure
CN1988520B (en) Channel evaluation method for orthogonal frequency division multiplex system
CN107634922B (en) Compressed sensing time domain channel estimation method based on wavelet transform modulation system
CN101166171A (en) A time change channel estimating method for OFDM system
CN109688074A (en) A kind of channel estimation methods of compressed sensing based ofdm system
CN111884761B (en) Data transmission method for transmitting end of single carrier frequency domain equalization system
CN103346983A (en) OFDM self-adaption complex interpolation channel estimation method based on comb-type pilot frequency
CN106027431A (en) Channel estimation method
CN107124194B (en) Marine digital intermediate frequency emits equipment
CN103281272B (en) Based on the ofdm system signal detecting method of BEM under Cyclic Prefix disappearance
CN101667982A (en) Removing method of WiMAX fast fading ICI based on plane spreading kalman filtering wave
CN103152294B (en) The method and system carrying out noise estimation are eliminated based on signal

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20140820

Termination date: 20201211