A Low-Complexity Path Delay Searching Method in Sparse Channel Estimation for OFDM Systems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Kee-Hoon | - |
dc.date.accessioned | 2021-08-11T11:43:30Z | - |
dc.date.available | 2021-08-11T11:43:30Z | - |
dc.date.issued | 2018-11 | - |
dc.identifier.issn | 0916-8516 | - |
dc.identifier.issn | 1745-1345 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/5549 | - |
dc.description.abstract | By exploiting the inherent sparsity of wireless channels, the channel estimation in an orthogonal frequency division multiplexing (OFDM) system can be cast as a compressed sensing (CS) problem to estimate the channel more accurately. Practically, matching pursuit algorithms such as orthogonal matching pursuit (OMP) are used, where path delays of the channel is guessed based on correlation values for every quantized delay with residual. This full search approach requires a predefined grid of delays with high resolution, which induces the high computational complexity because correlation values with residual at a huge number of grid points should be calculated. Meanwhile, the correlation values with high resolution can be obtained by interpolation between the correlation values at a low resolution grid. Also, the interpolation can be implemented with a low pass filter (LPF). By using this fact, in this paper we substantially reduce the computational complexity to calculate the correlation values in channel estimation using CS. | - |
dc.format.extent | 7 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Oxford University Press | - |
dc.title | A Low-Complexity Path Delay Searching Method in Sparse Channel Estimation for OFDM Systems | - |
dc.type | Article | - |
dc.publisher.location | 일본 | - |
dc.identifier.doi | 10.1587/transcom.2018EBP3026 | - |
dc.identifier.scopusid | 2-s2.0-85056109232 | - |
dc.identifier.wosid | 000451761700006 | - |
dc.identifier.bibliographicCitation | IEICE Transactions on Communications, v.E101B, no.11, pp 2297 - 2303 | - |
dc.citation.title | IEICE Transactions on Communications | - |
dc.citation.volume | E101B | - |
dc.citation.number | 11 | - |
dc.citation.startPage | 2297 | - |
dc.citation.endPage | 2303 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | MATCHING PURSUIT | - |
dc.subject.keywordPlus | SIGNAL RECOVERY | - |
dc.subject.keywordPlus | DESIGN | - |
dc.subject.keywordAuthor | channel estimation | - |
dc.subject.keywordAuthor | compressed sensing (CS) | - |
dc.subject.keywordAuthor | low-complexity | - |
dc.subject.keywordAuthor | low pass filter (LPF) | - |
dc.subject.keywordAuthor | orthogonal frequency division multiplexing (OFDM) | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(31538) 22, Soonchunhyang-ro, Asan-si, Chungcheongnam-do, Republic of Korea+82-41-530-1114
COPYRIGHT 2021 by SOONCHUNHYANG UNIVERSITY ALL RIGHTS RESERVED.
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.