Abstract
In this paper, we consider a two-hop multi-input-multi-output (MIMO) amplify-and-forward (AF) relay system consisting of a source node (SN), a destination node (DN), and a relay node (RN) that simply amplifies and forwards its received signal to the DN without any further processing. In this system, the overall channel from the SN to the DN is a cascade of the backward relay channel over the SN-RN hop, the amplifying matrix at the RN, and the forward relay channel over the RN-DN hop. We investigate the estimation of the two cascaded relay channels at the DN based on the predefined amplifying matrix applied at the RN and the corresponding overall channel obtained through the conventional channel estimation algorithms with the help of pilots transmitted by the SN. In particular, we find necessary and sufficient conditions on the pilot amplifying matrix sequence at the RN to ensure feasible relay channel estimation at the DN. Based on these conditions, we present rules to design diagonal or quasi-diagonal pilot amplifying matrices so that the cascaded relay channels can be estimated with minimum complexity at the RN. In the presence of imperfect overall channel state information at the DN, we further develop the approximate linear least-square estimation of the relay channels based on the designed pilot matrix sequence and demonstrate its performance by simulation results.
Sign-in/Register to access full text options 
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.
