Not checkedNot checked for notices yet.
Improving MIMO relay compressed sensing-based channel estimation and pilot allocation
Abbas Akbarpour-Kasgari, Mehrdad Ardebilipour
EURASIP Journal on Wireless Communications and Networking · 2019
doi:10.1186/s13638-019-1384-6 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Abstract Increasing the data rate of communication systems together with the performance are main goals of the communication networks in the future. Multiple-input multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) relay networks as a key technology is one the main techniques to maintain the performance and data rate. Being influenced by fading channels, the MIMO-OFDM relay networks need some reliable approaches to estimate the channel response. Compressed sensing (CS) is one of the critical approaches to maintain the accuracy together with the spectral efficiency. In this paper, we have utilized CS-based approaches to estimate the MIMO-OFDM relay channel. Specifically, forward backward prediction (FBP) is used to estimate the fading channels. This approach benefits from backward correction which distinguishes it from other iterative approaches and helps interestingly in channel estimation accuracy. Moreover, in order to improve the channel estimation, pilot allocation approaches are proposed based on the system model and probability function. Furthermore, a cross entropy-based approach is utilized to propose two different approaches called sequential cross entropy self-coherence (SCE-SC) and parallel cross entropy self-coherence. Actually, mutual coherence is divided into two parts namely cross coherence and self coherence. It is demonstrated that in FBP-based approach self-coherence is important in mutual coherence. Consequently, the computations are interestingly decreased. The superiority of the method is represented using comparing simulations with other well-known approaches.
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.