Abstract

In Mars exploration the effective time of communication between orbiters is short, and the relative distance and gesture between them change fast. The signal to noise ratio (SNR) estimation is required in receiver to change adaptively the data rate in the communication system. Therefore, SNR estimation is a key technique in adaptive data transmission. We propose a blind SNR estimation for communication between orbiters in Mars exploration via subspace method. The subspace method has better SNR estimation than some conventional SNR estimation algorithms. Numerical simulations demonstrate the effectiveness and improvement of the proposed algorithm.

Highlights

  • The long distance between Mars and Earth causes long transmission time delay and signal attenuation

  • signal to noise ratio (SNR) estimation algorithms based on data aided (DA) contain maximum likelihood (ML), minimum mean square error (MMSE) [5, 6], split symbol moments estimator (SSME) [7, 8], and the separation of signal and noise using higher-order cumulants [9]

  • SNR estimation algorithms based on non-data aided (NDA) are second- and fourth-order moments (M2M4) [10, 11], signal-to-variation ratio (SVR) [12], squared signal-to-noise variance (SNV) [13], and data fitting (DF) [14]

Read more

Summary

Introduction

The long distance between Mars and Earth causes long transmission time delay and signal attenuation. SNR estimation algorithms based on DA contain maximum likelihood (ML), minimum mean square error (MMSE) [5, 6], split symbol moments estimator (SSME) [7, 8], and the separation of signal and noise using higher-order cumulants [9]. SNR estimation algorithms based on NDA are second- and fourth-order moments (M2M4) [10, 11], signal-to-variation ratio (SVR) [12], squared signal-to-noise variance (SNV) [13], and data fitting (DF) [14]. This paper intends to develop a blind SNR estimation for communication between orbiters in Mars exploration via subspace method, which achieves accurate estimate result.

Data model
Blind SNR estimation algorithm via subspace method
Simulation results

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.