By Topic

A parallel systems approach to universal receivers

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)
Madhow, U. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Pursley, M.B.

The problem of communication over a channel with unknown characteristics is addressed. The true channel is from a known set of channels, but the transmitter and receiver do not know which of these channels is actually in effect. The goal of a universal receiver is to provide nearly optimal demodulation regardless of the channel that is actually in effect. A parallel receiver implementation is proposed for a universal scheme to cope with such uncertainty. The parallel system consists of a finite number of receivers with the property that, for each channel in the set, the performance of at least one of the receivers will be within a specified performance range. Data verification is accomplished by an appropriate coding system. Sufficient conditions for the existence of such a universal receiver for a prescribed set of channels are established, procedures are outlined for the receiver design, and an example is given to illustrate the applicability of the theory. For M-ary signaling it is shown that, from an information-theoretic viewpoint, the data verification can be achieved at no extra cost by use of the intrinsic side information that is provided by an appropriate coding scheme that also provides error correction

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 2 )