A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
We consider in this paper the design of a cooperative relay strategy by exploiting the £nite-alphabet property of the source. Assuming a single source-sink pair with L relay nodes all communicating in orthogonal channels, we derive necessary conditions for optimal relay signaling that minimizes the error probability at the sink node. The derived conditions allow us to construct an iterative algorithm to £nd the distributed relay signaling that is at least locally optimal. As a byproduct, onedoi:10.1109/icassp.2005.1415720 dblp:conf/icassp/0016CB05 fatcat:fcquupvklvb6jg3ympqdf6dkf4