| Paper: | SPCOM-P11.5 | ||
| Session: | Co-operative Communications | ||
| Time: | Friday, May 19, 10:00 - 12:00 | ||
| Presentation: | Poster | ||
| Topic: | Signal Processing for Communication: Distributed and collaborative signal processing | ||
| Title: | An Efficient Algorithm for Optimum Power Allocation in a Decode-and-Forward Cooperative System with Orthogonal Transmissions | ||
| Authors: | Paul Anghel, Mostafa Kaveh, Zhi-Quan Luo, University of Minnesota, United States | ||
| Abstract: | We propose an efficient algorithm that computes the maximum achievable rate of a decode-and-forward multi-relay cooperative system with orthogonal transmissions under total power constraint. In a previous work we have argued that in a system with Q relays the optimum rate can be found by solving Q convex problem despite the fact that the optimization problem is not convex and it belongs to a class of problems with variational inequality constraints. In this paper we show that the number of computations can be reduced from solving Q convex problem to solving only log(Q)+1 convex problems. The proposed algorithm facilitates comparisons with competing alternatives in cooperative systems such as the amplify-and-forward or the compress-and-forward strategies. | ||
©2018 Conference Management Services, Inc. -||- email: webmaster@icassp2006.org -||- Last updated Friday, August 17, 2012