Download Now Free registration required
The authors look at the three-node relay channel and the transmission of an information symbol from the source node to the destination node. They let the relay be a memoryless function and formulate necessary conditions for the optimality of the relay mapping and the detector. Based on these, they propose a design algorithm to find relay mappings such that the symbol error rate at the destination is minimized. The optimized relay mappings are illustrated for different scenarios and the dependency between the relay mapping and the link qualities is discussed in detail.
- Format: PDF
- Size: 188.22 KB