Comparative study of loading algorithms for PLC applications

Assimakopoulos, Costas/ Pavlidou, Fotini-Niovi/ Ασημακόπουλος, Κώστας/ Παυλίδου, Φωτεινή-Νιόβη


Institution and School/Department of submitter: ΤΕΙ Θεσσαλονίκης
Keywords: Φορέας μετάδοσης σε ηλεκτρικές γραμμές;Carrier transmission on electric lines;OFDM (Τηλεπικοινωνία);OFDM (Telecommunication)
Issue Date: 27-Mar-2002
Publisher: Aristotle University of Thessaloniki
Citation: International Symposium on Power line Communications and Its Applications, Athens, 2002
Assimakopoulos, C. (2002). Comparative Study of Loading Algorithms for PLC Applications. Πρακτικά συνεδρίου από 1ο Proc. of the 6th ISPLC 2002 AthensGreece. Greece:
Abstract: In this study a trial is made for an in depth investigation of the criteria and mechanisms of loading algorithms proposed so far in the literature. There are three basic categories of them based on the type of the optimization problem they solve. As optimization problems we can consider: to minimize or maximize a specific parameter and thus result to an equation to be used for bits and power assignment on the OFDM carriers. There are three categories of practical interest. In this paper one algorithm of each category was chosen and compared to the others in a real PLC environment.
Description: Δημοσιεύσεις μελών--ΣΔΟ--Τμήμα Εμπορίας και Διαφήμισης, 2002
URI: http://195.251.240.227/jspui/handle/123456789/4414
Other Identifiers: http://www.isplc.org/docsearch/Proceedings/2002/pdf/14110241.pdf
Item type: other
Submission Date: 2018-02-27T18:19:08Z
Item language: el
Item access scheme: free
Institution and School/Department of submitter: ΤΕΙ Θεσσαλονίκης
Appears in Collections:Δημοσιεύσεις σε Περιοδικά

Files in This Item:
File Description SizeFormat 
Pavlidou_Assimakopoulos_Comparative_Study_of.pdf98.06 kBAdobe PDFView/Open



 Please use this identifier to cite or link to this item:
http://195.251.240.227/jspui/handle/123456789/4414
  This item is a favorite for 0 people.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.