Skip to content
naulon

Not checkedNot checked for notices yet.

An Improved Compression Sampling Matching Pursuit Algorithm

Fang LEI, Ze-sheng FANG, Yong-jun XU and 2 more

Guangtongxin yanjiu · 2021

doi:10.13756/j.gtxyj.2021.06.013 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Least Square (LS) estimation method in Orthogonal Frequency Division Multiplexing (OFDM) system ignores the noise effect in the process of choosing the residual of atom update. In order to solve this issue, an improved Compressed Sampling Matching Pursuit (CoSaMP) algorithm is proposed by using the sparsity of the time-domain channel. Firstly, the initial channel estimation is performed by CoSaMP algorithm. Then, the Linear Minimum Mean Square Error (LMMSE) is used to reduce the noise, which improves the estimation accuracy. The simulation results show that the improved CoSaMP algorithm has better performance in mean square error and Bit Error Ratio (BER) estimation than traditional CoSaMP algorithm.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.