Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYadav, Satyendra Singh-
dc.contributor.authorLopes, Paulo A C-
dc.contributor.authorPatra, Sarat Kumar-
dc.identifier.citationInternational Conference on Recent Innovations in Signal - Processing and Embedded - Systems - RISE-2017, MANIT Bhopal, Madhya Pradesh, India, 27 - 29 October 2017en_US
dc.descriptionCopyright of this paper belongs to proceedings publisheren_US
dc.description.abstractMultiuser orthogonal frequency division multiple access (MU-OFDMA) technique has attracted much attention for broadband wireless access in future generation wireless communication systems. To achieve high data rate under constraint conditions, systems require proper resource allocation. This demands, sophisticated signal processing algorithms, which are computationally complex. This paper proposed a lowcomplexity suboptimal joint algorithm for resource allocation (task-1) and subcarrier assignment (task-2). The power allocation is carried out using the water-filling algorithm. The proposed algorithm is compared with existing Hungarian algorithm (HA) and amplitude craving greedy (ACG) algorithm for spectral efficiency, fairness among the users and computational complexity. The simulations results show that the proposed algorithm performs close to the HA. It maintains high fairness among the users and has reduced computational complexity compare to the existing algorithms.en_US
dc.subjectResource allocationen_US
dc.subjectSubcarrier assignmenten_US
dc.subjectWater-filling algorithmen_US
dc.subjectHungarian algorithmen_US
dc.subjectFairness ratioen_US
dc.titleA Low-Complexity Suboptimal Algorithm for Joint Resource and Subcarrier Assignment in Downlink OFDMA Systemen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2017_RISE_SSYadav_Low-complexity.pdf282.58 kBAdobe PDFView/Open

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