By Topic

A Transmitted Reference System for Communication in Random of Unknown Channels

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
$31 $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

2 Author(s)
Hingorani, G.D. ; Sylvania Electronic Systems, Waltham, MA, USA ; Hancock, J.C.

When communicating through an unknown or random channel, it often becomes advisable to utilize some of the transmitted energy to allow the receiver to measure certain channel parameters. In this paper, a set of transmitted signals are chosen of the form{x_{m}^{(i)}(t), x_{r}(t)}, tepsilon(0,T), wherei = 1, 2,...,l. Herex_{m}^{(i)}(t)represents the message or information portion of the signal andx_{r}(t)represents that portion which is transmitted for the purpose of identifying the channel. The random multipath channel model is assumed, and an optimum "one-shot" Bayesian receiver is derived under the Gaussian assumption for channel filter and additive noise. An expression for error probability is derived for a special case of binary phase reversal keying, assuming that the additive noise in the channel is white. Probability of error curves are plotted as a function of various system parameters for both the optimal and a simpler suboptimal receiver. The energy sharing problem between the message and reference portion of transmitted signal is also considered. The divergence criterion is utilized and shown to be an effective method for deriving the optimum trade-off.

Published in:

Communication Technology, IEEE Transactions on  (Volume:13 ,  Issue: 3 )