Greedy Data-Aided Active User Detection for Massive Machine Type Communications
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Irtaza, Syed Ali | - |
dc.contributor.author | Lim, Sun Hong | - |
dc.contributor.author | Choi, Jun Won | - |
dc.date.accessioned | 2022-07-09T10:22:45Z | - |
dc.date.available | 2022-07-09T10:22:45Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2019-08 | - |
dc.identifier.issn | 2162-2337 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/147358 | - |
dc.description.abstract | A grant-free access (GFA) is considered as a promising solution for realizing massive connectivity with reduced signal overhead and latency in massive machine type communications (MMTC). In GFA, users autonomously send the data packet without prior resource assignment and the system identifies the active users that have sent the data based on the received data. Compressed sensing (CS) techniques have been employed to perform active user detection (AUD) leveraging the sparse nature of traffic in MMTC. In this letter, we propose an enhanced CS-based AUD technique, which bases the detection of active users on both pilot and data symbols received. The proposed AUD algorithm successively detects the active users in a greedy manner. For the user candidates detected up to the current iteration, our method finds the joint estimate of the channel and the data symbols, which are in turn utilized in detecting new users in the next iterations. Our numerical evaluation shows that the proposed method achieves better AUD, channel estimation, and data detection performance than the existing methods. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Greedy Data-Aided Active User Detection for Massive Machine Type Communications | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Choi, Jun Won | - |
dc.identifier.doi | 10.1109/LWC.2019.2912372 | - |
dc.identifier.scopusid | 2-s2.0-85071177213 | - |
dc.identifier.wosid | 000482588700061 | - |
dc.identifier.bibliographicCitation | IEEE WIRELESS COMMUNICATIONS LETTERS, v.8, no.4, pp.1224 - 1227 | - |
dc.relation.isPartOf | IEEE WIRELESS COMMUNICATIONS LETTERS | - |
dc.citation.title | IEEE WIRELESS COMMUNICATIONS LETTERS | - |
dc.citation.volume | 8 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 1224 | - |
dc.citation.endPage | 1227 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | Channel estimation | - |
dc.subject.keywordPlus | Compressed sensing | - |
dc.subject.keywordPlus | Glass forming machines | - |
dc.subject.keywordPlus | Maximum likelihood estimation | - |
dc.subject.keywordPlus | Numerical methods | - |
dc.subject.keywordPlus | Compressive sensing | - |
dc.subject.keywordPlus | Coordinate decent | - |
dc.subject.keywordPlus | Free access | - |
dc.subject.keywordPlus | Joint estimates | - |
dc.subject.keywordPlus | Machine type communications | - |
dc.subject.keywordPlus | MMTC | - |
dc.subject.keywordPlus | Resource assignment | - |
dc.subject.keywordPlus | User detection | - |
dc.subject.keywordPlus | terative methods | - |
dc.subject.keywordAuthor | MMTC | - |
dc.subject.keywordAuthor | AUD | - |
dc.subject.keywordAuthor | grant-free access | - |
dc.subject.keywordAuthor | block coordinate decent (BCD) optimization | - |
dc.subject.keywordAuthor | maximum likelihood estimation | - |
dc.identifier.url | https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8693963 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.