By Topic

Iterative channel estimation for time-varying relay networks with optimal energy allocation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

Estimation of time-varying relay channels together with optimal energy allocation is considered. In the proposed frame structure, a priori known pilot symbols multiplexed with the data symbols are employed together with the decisions on the data symbols in an iterative fashion. This scheme is shown to a achieve bit error rate (BER) off the known channel bound by 1.5 dB in signal-to-noise ratio (SNR) and the advantage over the conventional pilot only case can be as large as 3 dB. This attractive performance is shown to be achieved by a single-tap bidirectional least-mean-squares (BiLMS) algorithm at a very low complexity as compared to the minimum mean-square error (MMSE) filter with multiple taps. Under a fixed energy budget, the optimal energy allocation is also shown through an allocation factor for which a closed form expression under a suboptimal operation is computed and evaluated in various realistic scenarios to have a satisfactory performance.

Published in:

MILCOM 2012 - 2012 IEEE Military Communications Conference

Date of Conference:

Oct. 29 2012-Nov. 1 2012