Abstract
A subspace blind channel estimation algorithm based on repetition index is proposed in this paper. Compared with the original blind channel estimation algorithm, the number of received symbols needed for achieving the desired estimation is reduced greatly, which relaxes the requirement that the unknown channel must remain time invariant during estimation. Simulation results show that the proposed scheme has similar or even better performance with fewer received symbols over the referenced subspace-based methods.
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 callDisclaimer: 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.
