Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/90108
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineeringen_US
dc.creatorJiang, Yen_US
dc.creatorLau, FCMen_US
dc.creatorChen, Hen_US
dc.creatorZhao, Fen_US
dc.date.accessioned2021-05-18T08:20:57Z-
dc.date.available2021-05-18T08:20:57Z-
dc.identifier.urihttp://hdl.handle.net/10397/90108-
dc.language.isoenen_US
dc.publisherJohn Wiley & Sonsen_US
dc.rightsCopyright © 2015 John Wiley & Sons, Ltd.en_US
dc.rightsThis is the peer reviewed version of the following article: Jiang, Yunxiang, Lau, Francis C. M., Chen, Hongbin, and Zhao, Feng (2017), Energy efficiency optimisation in full-duplex relay systems, Trans. Emerging Tel. Tech., 28: e2926, which has been published in final form at https://doi.org/10.1002/ett.2926. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.en_US
dc.titleEnergy efficiency optimisation in full-duplex relay systemsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume28en_US
dc.identifier.issue1en_US
dc.identifier.doi10.1002/ett.2926en_US
dcterms.abstractEnergy efficiency of relay communications has attracted much interest recently. Most research efforts have focused on half-duplex systems. As there has been significant progress in practical implementation of self-interference cancellation, full-duplex systems will have a promising potential in the near future. In this letter, energy efficiency of a full-duplex relay system under the total power constraint and fixed circuitry power consumption is studied. An optimisation problem is formulated towards maximising the system energy efficiency. Unfortunately, this problem is non-trivial and cannot be solved by conventional fractional programming methods, such as the Dinkelbach's method. To resolve this issue, an algorithm called sequential parametric convex approximation-Dinkelbach is proposed in this letter. Simulation results show that the proposed algorithm can converge to the global optimum very quickly. Copyrighten_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationTransactions on emerging telecommunications technologies, Jan. 2017, v. 28, no. 1, e2926en_US
dcterms.isPartOfTransactions on emerging telecommunications technologiesen_US
dcterms.issued2017-01-
dc.identifier.scopus2-s2.0-85009165736-
dc.identifier.eissn2161-3915en_US
dc.identifier.artne2926en_US
dc.description.validate202105 bchyen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera0721-n12-
dc.description.fundingSourceRGCen_US
dc.description.fundingTextRGC: 519011Een_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
a0721-n12_2017_TETT.pdfPre-Published version181.79 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

62
Last Week
0
Last month
Citations as of Apr 14, 2025

Downloads

21
Citations as of Apr 14, 2025

SCOPUSTM   
Citations

3
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

2
Citations as of Oct 10, 2024

Google ScholarTM

Check

Altmetric


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