Multiuser power and bit allocation over power line channels
Assimakopoulos, Costas/ Pavlidou, Fotini-Niovi/ Παυλίδου, Φωτεινή-Νιόβη/ Ασημακόπουλος, Κώστας
Institution and School/Department of submitter: | ΤΕΙ Θεσσαλονίκης |
Keywords: | Acceleration;Aggregates;Analytical models;Bit error rate;Bit rate;Computational modeling;Constraint optimization;Frequency division multiaccess;Delay;Data communication |
Issue Date: | 6-Apr-2005 |
Publisher: | IEEE |
Citation: | International Symposium on Power Line Communications and its Applications (ISPLC), Vancouver, 2005 Assimakopoulos, C. (2005). Multiuser power and bit allocation over power line channels. Πρακτικά συνεδρίου από 1ο IEEE Proc. of the 9th International Symposium on Power-Line Communications and its Applications (ISPLC) 2005 που διεξήχθη σε Vancouver. Φορέας διεξαγωγής Canada. [χ.τ.]: IEEE. |
Abstract: | In this paper the power lines are studied as a multi-user environment for data transmission. The aim of the multi-user optimization problem is the minimization of the aggregate transmitting power when several constraints are fulfilled. The optimum but computationally not efficient system is simulated and analyzed. A FDMA system, which is a typical multiuser system, is also applied over the same power line channels. Then several suboptimal schemes but with reduced complexity are simulated and analyzed in detail. |
Description: | Δημοσιεύσεις μελών--ΣΔΟ--Τμήμα Εμπορίας και Διαφήμισης,2005 |
URI: | http://195.251.240.227/jspui/handle/123456789/4652 |
Other Identifiers: | 10.1109/ISPLC.2005.1430509 http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=1430509&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D1430509 |
Appears in Collections: | Δημοσιεύσεις σε Περιοδικά |
Files in This Item:
There are no files associated with this item.
Please use this identifier to cite or link to this item:
This item is a favorite for 0 people.
http://195.251.240.227/jspui/handle/123456789/4652
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.