Name
Abstract | ||
|---|---|---|
Compressive sensing (CS) based channel estimation (CE) improves the utilization of spectrum resources effectively in orthogonal frequency division multiplexing (OFDM) system. Generally, the channel sparsity is assumed to be known in sparse reconstruction algorithms such as Basis Pursuit (BP) and Orthogonal Matching Pursuit (OMP). However, since the uncertainty of the environment, the channel sparsity is usually tricky to obtain. This paper proposes an improved OMP algorithm based on intersect operation (IOMP), which does not need a priori knowledge of channel sparsity. Initially, we use the OMP algorithm twice to estimate two different partial sparse delay path supports at partially different pilot positions, respectively. Then introduce the intersect operation to process these two partial supports. Besides, we discussed an optimized pilot allocation scheme based on discrete stochastic approximation and Iterative Exhaustive Search, both of which are employed to build the framework of CS-based channel estimation. Simulation results demonstrate that the proposed IOMP algorithm provides a better bit error ratio (BER) performance than the traditional OMP algorithm under unknown channel sparsity. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s11276-021-02788-8 | WIRELESS NETWORKS |
Keywords | DocType | Volume |
Compressive sensing, Sparse recovery, Orthogonal matching pursuit, Orthogonal frequency division multiplexing | Journal | 27 |
Issue | ISSN | Citations |
7 | 1022-0038 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhian Zheng | 1 | 0 | 0.34 |
| Jianjian Liu | 2 | 0 | 0.34 |
| Junjie Zhu | 3 | 6 | 5.29 |
| Haiyan Huang | 4 | 0 | 0.34 |